Implement the following circuits using:
i. A decoder
ii. A multiplexer
(a) F(A, B, C, D) = ∑m (0, 1, 2, 3, 6, 10, 11, 14)
(b) A full subtractor
(c) A combinational circuit with 2 inputs: x, y, z; and 3 outputs A, B, C. When the binary input is 0,
1, 2 and 3, the binary output is one greater than the input. When the binary input is 4, 5, 6, and
7, the binary output is two less than the input.
NB: You may use a decoder or multiplexer of your choice, however, justify your choice clearly
and in writing
Implement a combinational circuit for a Gray-to-Binary converter using 4-to-1 multiplexers and
external gates
create a program that has a dictionary:
studentgrade={
"john" :90,
"doe" :70,
"jane":83,
"marie":67,
"robert":59,
}
change the value into its equivalent:
91-100-oustanding
81-90-verygood
71-80-good
61-70-poor
51-60-failed
sample output:
{'john' : 'verygood', 'doe':'poor','jane':'verygood','marie':'poor',
'robert':'failed'}
INPUT:
You will receive exactly one word on a single line
OUTPUT:
Print the following sentence to the screen, substituting the word read in from your dataset in place of the
placeholder NAME: NAME, the needs of the many outweigh the needs of the few, or the one; live long and
prosper
Concatenate Word Pairs
Given a sentence and an integer L, write a program to concatenate word pairs so that the concatenated word has the length L.
The first line of input will be a sentence.
The second line of input will be an integer L.
The output should be containing the unique concatenated word pairs each in a line in the lexicographical order.
For example, if the given sentence and L are
Welcome to your exam
6
The words which can be paired so that they make concatenated word with length 6 are
Word1Word2toyourtoexamexamtoyourto
So the output should be printing each concatenated word in a line in the lexicographical order
examto
toexam
toyour
yourto
Sample Input 1
Welcome to your exam
6
Sample Output 1
examto
toexam
toyour
yourto
Sample Input 2
My parents and I went to a movie
9
Sample Output 2
Myparents
moviewent
parentsMy
parentsto
toparents
wentmovie
Input
You will not receive any input for this (and only this) problem
Output
Print a welcome message to the screen as follows:
We bid welcome to the ladies of Beauxbaton and our friends from the north, the sons of DurmstrangCalculate the time complexity of the following program fragments.
(a) 𝑓𝑜𝑟 (𝑖 = 1; 𝑖 ≤ 𝑛; 𝑖 ∗ = 2)
{
𝑥 = 𝑥 + 1
}
(b) 𝑓𝑜𝑟 (𝑖 = 1; 𝑖 ≤ 𝑛; 𝑖 + +)
𝑓𝑜𝑟 (𝑗 = 1; 𝑗 ≤ 𝑛; 𝑗 = 𝑗 ∗ 2)
{
… .
… .
}
Sample Input
[ 12, 2, 2, 4, 1 ]
Sample Output
616 -14 -14 112 -77
"use strict";
process.stdin.resume();
process.stdin.setEncoding("utf-8");
let inputString = "";
let currentLine = 0;
process.stdin.on("data", (inputStdin) => {
inputString += inputStdin;
});
process.stdin.on("end", (_) => {
inputString = inputString.trim().split("\n").map((str) => str.trim());
main();
});
function readLine() {
return inputString[currentLine++];
}
/* Please do not modify anything above this line */
function main() {
const myArray = JSON.parse(readLine());
/* Write your code here */
}
Sample Input 1
[ 1, 2, 3, 4, 5 ]
Sample Output 1
[ 1, 2, 9, 4, 25 ]
Sample Input 2
[ 2, 4 ]
Sample Output 2
[ 4, 4 ]"use strict";
process.stdin.resume();
process.stdin.setEncoding("utf-8");
let inputString = "";
let currentLine = 0;
process.stdin.on("data", (inputStdin) => {
inputString += inputStdin;
});
process.stdin.on("end", (_) => {
inputString = inputString.trim().split("\n").map((str) => str.trim());
main();
});
function readLine() {
return inputString[currentLine++];
}
/* Please do not modify anything above this line */
function main() {
const myArray = JSON.parse(readLine());
/* Write your code here */
}