Question
stringlengths 39
1.33k
| Tag
stringlengths 3
46
| label
int64 0
206
|
|---|---|---|
Consider the following program fragment for reversing the digits in a given integer to obtain a new integer Let n d_1 d_2 ldots d_m int n rev rev 0 while n gt 0 rev rev 10 n 10 n n 10 The loop invariant condition at the end of the i th iteration is n d_1 d_2 ldots d_ m i qquad mathbf and qquad ext rev d_m d_ m 1 ldots d_ m i 1 n d_ m i 1 ldots d_ m 1 d_m qquad mathbf or qquad ext rev d_ m i ldots d_2 d_1 n eq ext rev n d_1 d_2 ldots d_m qquad mathbf or qquad ext rev d_m ldots d_2 d_1 | Loop Invariants | 96 |
Consider the following pseudo code where x and y are positive integers begin q 0 r x while r u2265 y do begin r r y q q 1 end end The post condition that needs to be satisfied after the program terminates is r qx y wedge r lt y x qy r wedge r lt y y qx r wedge 0 lt r lt y q 1 lt r y wedge y gt 0 | Loop Invariants | 96 |
Consider the following program fragment for reversing the digits in a given integer to obtain a new integer Let n d_1 d_2 ldots d_m int n rev rev 0 while n gt 0 rev rev 10 n 10 n n 10 The loop invariant condition at the end of the i th iteration is n d_1 d_2 ldots d_ m i qquad mathbf and qquad ext rev d_m d_ m 1 ldots d_ m i 1 n d_ m i 1 ldots d_ m 1 d_m qquad mathbf or qquad ext rev d_ m i ldots d_2 d_1 n eq ext rev n d_1 d_2 ldots d_m qquad mathbf or qquad ext rev d_m ldots d_2 d_1 | Loop Invariants | 96 |
Consider the program where a b are integers with b gt 0 x a y b z 0 while y gt 0 do if odd x then z z x y y 1 else y y 2 x 2 x fi Invariant of the loop is a condition which is true before and after every iteration of the loop In the above program the loop invariant is given by 0 leq y and z x y a b Which of the following is true of the program The program will not terminate for some values of a b The program will terminate with z 2 b The program will terminate with z a b The program will not terminate for some values of a b but when it does terminate the condition z a b will hold The program will terminate with z a b | Loop Invariants | 96 |
Consider the C program fragment below which is meant to divide x by y using repeated subtractions The variables x y q and r are all unsigned int while r gt y r r y q q 1 Which of the following conditions on the variables x y q and r before the execution of the fragment will ensure that the loop terminated in a state satisfying the condition x y q r q r amp amp r 0 x gt 0 amp amp r x amp amp y gt 0 q 0 amp amp r x amp amp y gt 0 q 0 amp amp y gt 0 | Loop Invariants | 96 |
Consider the following pseudo code where x and y are positive integers begin q 0 r x while r u2265 y do begin r r y q q 1 end end The post condition that needs to be satisfied after the program terminates is r qx y wedge r lt y x qy r wedge r lt y y qx r wedge 0 lt r lt y q 1 lt r y wedge y gt 0 | Loop Invariants | 96 |
Solve min x 2 y 2 subject to x y geq 10 2x 3y geq 20 x geq 4 y geq 4 32 50 52 100 None of the above | Maxima Minima | 98 |
Find the minimum value of 3 4x 2x 2 Determine the number of positive integers amp le 720 which are not divisible by any of 2 3 or 5 | Maxima Minima | 98 |
Consider the function f x sin x in the interval x left frac pi 4 frac 7 pi 4 right The number and location s of the local minima of this function are A One at dfrac pi 2 B One at dfrac 3 pi 2 C Two at dfrac pi 2 and dfrac 3 pi 2 D Two at dfrac pi 4 and dfrac 3 pi 2 | Maxima Minima | 98 |
A point on a curve is said to be an extremum if it is a local minimum or a local maximum The number of distinct extrema for the curve 3x 4 16x 3 24x 2 37 is 0 1 2 3 | Maxima Minima | 98 |
Find the minimum value of 3 4x 2x 2 Determine the number of positive integers amp le 720 which are not divisible by any of 2 3 or 5 | Maxima Minima | 98 |
A point on a curve is said to be an extremum if it is a local minimum or a local maximum The number of distinct extrema for the curve 3x 4 16x 3 24x 2 37 is 0 1 2 3 | Maxima Minima | 98 |
Solve min x 2 y 2 subject to x y geq 10 2x 3y geq 20 x geq 4 y geq 4 32 50 52 100 None of the above | Maxima Minima | 98 |
Consider the function f x sin x in the interval x left frac pi 4 frac 7 pi 4 right The number and location s of the local minima of this function are A One at dfrac pi 2 B One at dfrac 3 pi 2 C Two at dfrac pi 2 and dfrac 3 pi 2 D Two at dfrac pi 4 and dfrac 3 pi 2 | Maxima Minima | 98 |
Solve min x 2 y 2 subject to x y geq 10 2x 3y geq 20 x geq 4 y geq 4 32 50 52 100 None of the above | Maxima Minima | 98 |
Consider the function f x sin x in the interval x left frac pi 4 frac 7 pi 4 right The number and location s of the local minima of this function are A One at dfrac pi 2 B One at dfrac 3 pi 2 C Two at dfrac pi 2 and dfrac 3 pi 2 D Two at dfrac pi 4 and dfrac 3 pi 2 | Maxima Minima | 98 |
Consider 6 memory partitions of sizes 200 KB 400 KB 600 KB 500 KB 300 KB and 250 KB where KB refers to kilobyte These partitions need to be allotted to four processes of sizes 357 KB 210 KB 468 KB 491 KB in that order If the best fit algorithm is used which partitions are NOT allotted to any process 200 KB and 300 KB 200 KB and 250 KB 250 KB and 300 KB 300 KB and 400 KB | Memory Allocation | 99 |
Consider 6 memory partitions of sizes 200 KB 400 KB 600 KB 500 KB 300 KB and 250 KB where KB refers to kilobyte These partitions need to be allotted to four processes of sizes 357 KB 210 KB 468 KB 491 KB in that order If the best fit algorithm is used which partitions are NOT allotted to any process 200 KB and 300 KB 200 KB and 250 KB 250 KB and 300 KB 300 KB and 400 KB | Memory Allocation | 99 |
Consider 6 memory partitions of sizes 200 KB 400 KB 600 KB 500 KB 300 KB and 250 KB where KB refers to kilobyte These partitions need to be allotted to four processes of sizes 357 KB 210 KB 468 KB 491 KB in that order If the best fit algorithm is used which partitions are NOT allotted to any process 200 KB and 300 KB 200 KB and 250 KB 250 KB and 300 KB 300 KB and 400 KB | Memory Allocation | 99 |
Consider 6 memory partitions of sizes 200 KB 400 KB 600 KB 500 KB 300 KB and 250 KB where KB refers to kilobyte These partitions need to be allotted to four processes of sizes 357 KB 210 KB 468 KB 491 KB in that order If the best fit algorithm is used which partitions are NOT allotted to any process 200 KB and 300 KB 200 KB and 250 KB 250 KB and 300 KB 300 KB and 400 KB | Memory Allocation | 99 |
Consider 6 memory partitions of sizes 200 KB 400 KB 600 KB 500 KB 300 KB and 250 KB where KB refers to kilobyte These partitions need to be allotted to four processes of sizes 357 KB 210 KB 468 KB 491 KB in that order If the best fit algorithm is used which partitions are NOT allotted to any process 200 KB and 300 KB 200 KB and 250 KB 250 KB and 300 KB 300 KB and 400 KB | Memory Allocation | 99 |
Consider 6 memory partitions of sizes 200 KB 400 KB 600 KB 500 KB 300 KB and 250 KB where KB refers to kilobyte These partitions need to be allotted to four processes of sizes 357 KB 210 KB 468 KB 491 KB in that order If the best fit algorithm is used which partitions are NOT allotted to any process 200 KB and 300 KB 200 KB and 250 KB 250 KB and 300 KB 300 KB and 400 KB | Memory Allocation | 99 |
Consider 6 memory partitions of sizes 200 KB 400 KB 600 KB 500 KB 300 KB and 250 KB where KB refers to kilobyte These partitions need to be allotted to four processes of sizes 357 KB 210 KB 468 KB 491 KB in that order If the best fit algorithm is used which partitions are NOT allotted to any process 200 KB and 300 KB 200 KB and 250 KB 250 KB and 300 KB 300 KB and 400 KB | Memory Allocation | 99 |
Consider 6 memory partitions of sizes 200 KB 400 KB 600 KB 500 KB 300 KB and 250 KB where KB refers to kilobyte These partitions need to be allotted to four processes of sizes 357 KB 210 KB 468 KB 491 KB in that order If the best fit algorithm is used which partitions are NOT allotted to any process 200 KB and 300 KB 200 KB and 250 KB 250 KB and 300 KB 300 KB and 400 KB | Memory Allocation | 99 |
Consider 6 memory partitions of sizes 200 KB 400 KB 600 KB 500 KB 300 KB and 250 KB where KB refers to kilobyte These partitions need to be allotted to four processes of sizes 357 KB 210 KB 468 KB 491 KB in that order If the best fit algorithm is used which partitions are NOT allotted to any process 200 KB and 300 KB 200 KB and 250 KB 250 KB and 300 KB 300 KB and 400 KB | Memory Allocation | 99 |
Consider 6 memory partitions of sizes 200 KB 400 KB 600 KB 500 KB 300 KB and 250 KB where KB refers to kilobyte These partitions need to be allotted to four processes of sizes 357 KB 210 KB 468 KB 491 KB in that order If the best fit algorithm is used which partitions are NOT allotted to any process 200 KB and 300 KB 200 KB and 250 KB 250 KB and 300 KB 300 KB and 400 KB | Memory Allocation | 99 |
Consider 6 memory partitions of sizes 200 KB 400 KB 600 KB 500 KB 300 KB and 250 KB where KB refers to kilobyte These partitions need to be allotted to four processes of sizes 357 KB 210 KB 468 KB 491 KB in that order If the best fit algorithm is used which partitions are NOT allotted to any process 200 KB and 300 KB 200 KB and 250 KB 250 KB and 300 KB 300 KB and 400 KB | Memory Allocation | 99 |
Consider 6 memory partitions of sizes 200 KB 400 KB 600 KB 500 KB 300 KB and 250 KB where KB refers to kilobyte These partitions need to be allotted to four processes of sizes 357 KB 210 KB 468 KB 491 KB in that order If the best fit algorithm is used which partitions are NOT allotted to any process 200 KB and 300 KB 200 KB and 250 KB 250 KB and 300 KB 300 KB and 400 KB | Memory Allocation | 99 |
Consider 6 memory partitions of sizes 200 KB 400 KB 600 KB 500 KB 300 KB and 250 KB where KB refers to kilobyte These partitions need to be allotted to four processes of sizes 357 KB 210 KB 468 KB 491 KB in that order If the best fit algorithm is used which partitions are NOT allotted to any process 200 KB and 300 KB 200 KB and 250 KB 250 KB and 300 KB 300 KB and 400 KB | Memory Allocation | 99 |
Consider 6 memory partitions of sizes 200 KB 400 KB 600 KB 500 KB 300 KB and 250 KB where KB refers to kilobyte These partitions need to be allotted to four processes of sizes 357 KB 210 KB 468 KB 491 KB in that order If the best fit algorithm is used which partitions are NOT allotted to any process 200 KB and 300 KB 200 KB and 250 KB 250 KB and 300 KB 300 KB and 400 KB | Memory Allocation | 99 |
Let the page reference and the working set window be c c d b c e c e a d and 4 respectively The initial working set at time t 0 contains the pages a d e where a was referenced at time t 0 d was referenced at time t 1 and e was referenced at time t 2 Determine the total number of page faults and the average number of page frames used by computing the working set at each reference | Memory Management | 100 |
Let a memory have four free blocks of sizes 4k 8k 20k 2k These blocks are allocated following the best fit strategy The allocation requests are stored in a queue as shown below Request No J1 J2 J3 J4 J5 J6 J7 J8 Request Sizes 2k 14k 3k 6k 6k 10k 7k 20k Usage Time 4 10 2 8 4 1 8 6 The time at which the request for J7 will be completed will be 16 19 20 37 | Memory Management | 100 |
A 1000 Kbyte memory is managed using variable partitions but no compaction It currently has two partitions of sizes 200 Kbytes and 260 Kbytes respectively The smallest allocation request in Kbytes that could be denied is for 151 181 231 541 | Memory Management | 100 |
Consider a main memory system that consists of 8 memory modules attached to the system bus which is one word wide When a write request is made the bus is occupied for 100 nanoseconds ns by the data address and control signals During the same 100 ns and for 500 ns thereafter the addressed memory module executes one cycle accepting and storing the data The internal operation of different memory modules may overlap in time but only one request can be on the bus at any time The maximum number of stores of one word each that can be initiated in 1 millisecond is ________ | Memory Management | 100 |
Let a memory have four free blocks of sizes 4k 8k 20k 2k These blocks are allocated following the best fit strategy The allocation requests are stored in a queue as shown below Request No J1 J2 J3 J4 J5 J6 J7 J8 Request Sizes 2k 14k 3k 6k 6k 10k 7k 20k Usage Time 4 10 2 8 4 1 8 6 The time at which the request for J7 will be completed will be 16 19 20 37 | Memory Management | 100 |
Let a memory have four free blocks of sizes 4k 8k 20k 2k These blocks are allocated following the best fit strategy The allocation requests are stored in a queue as shown below Request No J1 J2 J3 J4 J5 J6 J7 J8 Request Sizes 2k 14k 3k 6k 6k 10k 7k 20k Usage Time 4 10 2 8 4 1 8 6 The time at which the request for J7 will be completed will be 16 19 20 37 | Memory Management | 100 |
Let a memory have four free blocks of sizes 4k 8k 20k 2k These blocks are allocated following the best fit strategy The allocation requests are stored in a queue as shown below Request No J1 J2 J3 J4 J5 J6 J7 J8 Request Sizes 2k 14k 3k 6k 6k 10k 7k 20k Usage Time 4 10 2 8 4 1 8 6 The time at which the request for J7 will be completed will be 16 19 20 37 | Memory Management | 100 |
Let the page reference and the working set window be c c d b c e c e a d and 4 respectively The initial working set at time t 0 contains the pages a d e where a was referenced at time t 0 d was referenced at time t 1 and e was referenced at time t 2 Determine the total number of page faults and the average number of page frames used by computing the working set at each reference | Memory Management | 100 |
Let a memory have four free blocks of sizes 4k 8k 20k 2k These blocks are allocated following the best fit strategy The allocation requests are stored in a queue as shown below Request No J1 J2 J3 J4 J5 J6 J7 J8 Request Sizes 2k 14k 3k 6k 6k 10k 7k 20k Usage Time 4 10 2 8 4 1 8 6 The time at which the request for J7 will be completed will be 16 19 20 37 | Memory Management | 100 |
What is the minimum number of NAND gates required to implement a 2 input EXCLUSIVE OR function without using any other logic gate 2 4 5 6 | Min No Gates | 101 |
Design a logic circuit to convert a single digit BCD number to the number modulo six as follows Do not detect illegal input Write the truth table for all bits Label the input bits I1 I2 with I1 as the least significant bit Label the output bits R1 R2 with R1 as the least significant bit Use 1 to signify truth Draw one circuit for each output bit using altogether two two input AND gates one two input OR gate and two NOT gates | Min No Gates | 101 |
A circuit outputs a digit in the form of 4 bits 0 is represented by 0000 1 by 0001 u2026 9 by 1001 A combinational circuit is to be designed which takes these 4 bits as input and outputs 1 if the digit geq 5 and 0 otherwise If only AND OR and NOT gates may be used what is the minimum number of gates required 2 3 4 5 | Min No Gates | 101 |
A circuit outputs a digit in the form of 4 bits 0 is represented by 0000 1 by 0001 u2026 9 by 1001 A combinational circuit is to be designed which takes these 4 bits as input and outputs 1 if the digit geq 5 and 0 otherwise If only AND OR and NOT gates may be used what is the minimum number of gates required 2 3 4 5 | Min No Gates | 101 |
A circuit outputs a digit in the form of 4 bits 0 is represented by 0000 1 by 0001 u2026 9 by 1001 A combinational circuit is to be designed which takes these 4 bits as input and outputs 1 if the digit geq 5 and 0 otherwise If only AND OR and NOT gates may be used what is the minimum number of gates required 2 3 4 5 | Min No Gates | 101 |
What is the minimum number of gates required to implement the Boolean function AB C if we have to use only 2 input NOR gates 2 3 4 5 | Min No Gates | 101 |
What is the minimum number of NAND gates required to implement a 2 input EXCLUSIVE OR function without using any other logic gate 2 4 5 6 | Min No Gates | 101 |
Design a logic circuit to convert a single digit BCD number to the number modulo six as follows Do not detect illegal input Write the truth table for all bits Label the input bits I1 I2 with I1 as the least significant bit Label the output bits R1 R2 with R1 as the least significant bit Use 1 to signify truth Draw one circuit for each output bit using altogether two two input AND gates one two input OR gate and two NOT gates | Min No Gates | 101 |
What is the minimum number of gates required to implement the Boolean function AB C if we have to use only 2 input NOR gates 2 3 4 5 | Min No Gates | 101 |
What is the minimum number of NAND gates required to implement a 2 input EXCLUSIVE OR function without using any other logic gate 2 4 5 6 | Min No Gates | 101 |
What is the minimum number of gates required to implement the Boolean function AB C if we have to use only 2 input NOR gates 2 3 4 5 | Min No Gates | 101 |
Given f w x y z Sigma_m 0 1 2 3 7 8 10 Sigma_d 5 6 11 15 where d represents the don t care condition in Karnaugh maps Which of the following is a minimum product of sums POS form of f w x y z f bar w bar z bar x z f bar w z x z f w z bar x z f w bar z bar x z | Min Product Of Sums | 102 |
Given f w x y z Sigma_m 0 1 2 3 7 8 10 Sigma_d 5 6 11 15 where d represents the don t care condition in Karnaugh maps Which of the following is a minimum product of sums POS form of f w x y z f bar w bar z bar x z f bar w z x z f w z bar x z f w bar z bar x z | Min Product Of Sums | 102 |
Given f w x y z Sigma_m 0 1 2 3 7 8 10 Sigma_d 5 6 11 15 where d represents the don t care condition in Karnaugh maps Which of the following is a minimum product of sums POS form of f w x y z f bar w bar z bar x z f bar w z x z f w z bar x z f w bar z bar x z | Min Product Of Sums | 102 |
Given f w x y z Sigma_m 0 1 2 3 7 8 10 Sigma_d 5 6 11 15 where d represents the don t care condition in Karnaugh maps Which of the following is a minimum product of sums POS form of f w x y z f bar w bar z bar x z f bar w z x z f w z bar x z f w bar z bar x z | Min Product Of Sums | 102 |
Given f w x y z Sigma_m 0 1 2 3 7 8 10 Sigma_d 5 6 11 15 where d represents the don t care condition in Karnaugh maps Which of the following is a minimum product of sums POS form of f w x y z f bar w bar z bar x z f bar w z x z f w z bar x z f w bar z bar x z | Min Product Of Sums | 102 |
Given f w x y z Sigma_m 0 1 2 3 7 8 10 Sigma_d 5 6 11 15 where d represents the don t care condition in Karnaugh maps Which of the following is a minimum product of sums POS form of f w x y z f bar w bar z bar x z f bar w z x z f w z bar x z f w bar z bar x z | Min Product Of Sums | 102 |
Given f w x y z Sigma_m 0 1 2 3 7 8 10 Sigma_d 5 6 11 15 where d represents the don t care condition in Karnaugh maps Which of the following is a minimum product of sums POS form of f w x y z f bar w bar z bar x z f bar w z x z f w z bar x z f w bar z bar x z | Min Product Of Sums | 102 |
Given f w x y z Sigma_m 0 1 2 3 7 8 10 Sigma_d 5 6 11 15 where d represents the don t care condition in Karnaugh maps Which of the following is a minimum product of sums POS form of f w x y z f bar w bar z bar x z f bar w z x z f w z bar x z f w bar z bar x z | Min Product Of Sums | 102 |
Given f w x y z Sigma_m 0 1 2 3 7 8 10 Sigma_d 5 6 11 15 where d represents the don t care condition in Karnaugh maps Which of the following is a minimum product of sums POS form of f w x y z f bar w bar z bar x z f bar w z x z f w z bar x z f w bar z bar x z | Min Product Of Sums | 102 |
Given f w x y z Sigma_m 0 1 2 3 7 8 10 Sigma_d 5 6 11 15 where d represents the don t care condition in Karnaugh maps Which of the following is a minimum product of sums POS form of f w x y z f bar w bar z bar x z f bar w z x z f w z bar x z f w bar z bar x z | Min Product Of Sums | 102 |
Given f w x y z Sigma_m 0 1 2 3 7 8 10 Sigma_d 5 6 11 15 where d represents the don t care condition in Karnaugh maps Which of the following is a minimum product of sums POS form of f w x y z f bar w bar z bar x z f bar w z x z f w z bar x z f w bar z bar x z | Min Product Of Sums | 102 |
Given f w x y z Sigma_m 0 1 2 3 7 8 10 Sigma_d 5 6 11 15 where d represents the don t care condition in Karnaugh maps Which of the following is a minimum product of sums POS form of f w x y z f bar w bar z bar x z f bar w z x z f w z bar x z f w bar z bar x z | Min Product Of Sums | 102 |
Given f w x y z Sigma_m 0 1 2 3 7 8 10 Sigma_d 5 6 11 15 where d represents the don t care condition in Karnaugh maps Which of the following is a minimum product of sums POS form of f w x y z f bar w bar z bar x z f bar w z x z f w z bar x z f w bar z bar x z | Min Product Of Sums | 102 |
Given f w x y z Sigma_m 0 1 2 3 7 8 10 Sigma_d 5 6 11 15 where d represents the don t care condition in Karnaugh maps Which of the following is a minimum product of sums POS form of f w x y z f bar w bar z bar x z f bar w z x z f w z bar x z f w bar z bar x z | Min Product Of Sums | 102 |
Consider the following minterm expression for F F P Q R S sum 0 2 5 7 8 10 13 15 The minterms 2 7 8 and 13 are do not care terms The minimal sum of products form for F is Q bar S bar QS bar Q bar S QS bar Q bar R bar S bar QR bar S Q bar R S QRS bar P bar Q bar S bar P QS PQS P bar Q bar S | Min Sum Of Products Form | 103 |
Consider the following Boolean function of four variables f w x y z Sigma 1 3 4 6 9 11 12 14 The function is independent of one variables independent of two variables independent of three variables dependent on all variables | Min Sum Of Products Form | 103 |
Consider the 4 to 1 multiplexer with two select lines S_1 and S_0 given below The minimal sum of products form of the Boolean expression for the output F of the multiplexer is bar P Q Q bar R P bar Q R bar P Q bar P Q bar R PQ bar R P bar Q R bar P QR bar P Q bar R Q bar R P bar Q R PQ bar R | Min Sum Of Products Form | 103 |
Consider the following Boolean expression for F F P Q R S PQ bar P QR bar P Q bar R S The minimal sum of products form of F is PQ QR QS P Q R S bar P bar Q bar R bar S bar P R bar R bar P S P | Min Sum Of Products Form | 103 |
Following is a state table for time finite state machine Present State Next State Output Input 0 Input 1 A B C D E F G H B 1 F 1 D 0 C 0 D 1 C 1 C 1 C 0 H 1 D 1 E 1 F 1 C 1 C 1 D 1 A 1 Find the equivalence partition on the states of the machine Give the state table for the minimal machine Use appropriate names for the equivalent states For example if states X and Y are equivalent then use XY as the name for the equivalent state in the minimal machine | Minimal State Automata | 104 |
Following is a state table for time finite state machine Present State Next State Output Input 0 Input 1 A B C D E F G H B 1 F 1 D 0 C 0 D 1 C 1 C 1 C 0 H 1 D 1 E 1 F 1 C 1 C 1 D 1 A 1 Find the equivalence partition on the states of the machine Give the state table for the minimal machine Use appropriate names for the equivalent states For example if states X and Y are equivalent then use XY as the name for the equivalent state in the minimal machine | Minimal State Automata | 104 |
A 1 input 2 output synchronous sequential circuit behaves as follows Let z_k n_k denote the number of 0 u2019s and 1 u2019s respectively in initial k bits of the input z_k n_k k The circuit outputs 00 until one of the following conditions holds z_k n_k 2 In this case the output at the k th and all subsequent clock ticks is 10 n_k z_k 2 In this case the output at the k th and all subsequent clock ticks is 01 What is the minimum number of states required in the state transition graph of the above circuit 5 6 7 8 | Minimal State Automata | 104 |
Following is a state table for time finite state machine Present State Next State Output Input 0 Input 1 A B C D E F G H B 1 F 1 D 0 C 0 D 1 C 1 C 1 C 0 H 1 D 1 E 1 F 1 C 1 C 1 D 1 A 1 Find the equivalence partition on the states of the machine Give the state table for the minimal machine Use appropriate names for the equivalent states For example if states X and Y are equivalent then use XY as the name for the equivalent state in the minimal machine | Minimal State Automata | 104 |
A 1 input 2 output synchronous sequential circuit behaves as follows Let z_k n_k denote the number of 0 u2019s and 1 u2019s respectively in initial k bits of the input z_k n_k k The circuit outputs 00 until one of the following conditions holds z_k n_k 2 In this case the output at the k th and all subsequent clock ticks is 10 n_k z_k 2 In this case the output at the k th and all subsequent clock ticks is 01 What is the minimum number of states required in the state transition graph of the above circuit 5 6 7 8 | Minimal State Automata | 104 |
A 1 input 2 output synchronous sequential circuit behaves as follows Let z_k n_k denote the number of 0 u2019s and 1 u2019s respectively in initial k bits of the input z_k n_k k The circuit outputs 00 until one of the following conditions holds z_k n_k 2 In this case the output at the k th and all subsequent clock ticks is 10 n_k z_k 2 In this case the output at the k th and all subsequent clock ticks is 01 What is the minimum number of states required in the state transition graph of the above circuit 5 6 7 8 | Minimal State Automata | 104 |
Following is a state table for time finite state machine Present State Next State Output Input 0 Input 1 A B C D E F G H B 1 F 1 D 0 C 0 D 1 C 1 C 1 C 0 H 1 D 1 E 1 F 1 C 1 C 1 D 1 A 1 Find the equivalence partition on the states of the machine Give the state table for the minimal machine Use appropriate names for the equivalent states For example if states X and Y are equivalent then use XY as the name for the equivalent state in the minimal machine | Minimal State Automata | 104 |
A 1 input 2 output synchronous sequential circuit behaves as follows Let z_k n_k denote the number of 0 u2019s and 1 u2019s respectively in initial k bits of the input z_k n_k k The circuit outputs 00 until one of the following conditions holds z_k n_k 2 In this case the output at the k th and all subsequent clock ticks is 10 n_k z_k 2 In this case the output at the k th and all subsequent clock ticks is 01 What is the minimum number of states required in the state transition graph of the above circuit 5 6 7 8 | Minimal State Automata | 104 |
A 1 input 2 output synchronous sequential circuit behaves as follows Let z_k n_k denote the number of 0 u2019s and 1 u2019s respectively in initial k bits of the input z_k n_k k The circuit outputs 00 until one of the following conditions holds z_k n_k 2 In this case the output at the k th and all subsequent clock ticks is 10 n_k z_k 2 In this case the output at the k th and all subsequent clock ticks is 01 What is the minimum number of states required in the state transition graph of the above circuit 5 6 7 8 | Minimal State Automata | 104 |
Following is a state table for time finite state machine Present State Next State Output Input 0 Input 1 A B C D E F G H B 1 F 1 D 0 C 0 D 1 C 1 C 1 C 0 H 1 D 1 E 1 F 1 C 1 C 1 D 1 A 1 Find the equivalence partition on the states of the machine Give the state table for the minimal machine Use appropriate names for the equivalent states For example if states X and Y are equivalent then use XY as the name for the equivalent state in the minimal machine | Minimal State Automata | 104 |
A 1 input 2 output synchronous sequential circuit behaves as follows Let z_k n_k denote the number of 0 u2019s and 1 u2019s respectively in initial k bits of the input z_k n_k k The circuit outputs 00 until one of the following conditions holds z_k n_k 2 In this case the output at the k th and all subsequent clock ticks is 10 n_k z_k 2 In this case the output at the k th and all subsequent clock ticks is 01 What is the minimum number of states required in the state transition graph of the above circuit 5 6 7 8 | Minimal State Automata | 104 |
A 1 input 2 output synchronous sequential circuit behaves as follows Let z_k n_k denote the number of 0 u2019s and 1 u2019s respectively in initial k bits of the input z_k n_k k The circuit outputs 00 until one of the following conditions holds z_k n_k 2 In this case the output at the k th and all subsequent clock ticks is 10 n_k z_k 2 In this case the output at the k th and all subsequent clock ticks is 01 What is the minimum number of states required in the state transition graph of the above circuit 5 6 7 8 | Minimal State Automata | 104 |
Following is a state table for time finite state machine Present State Next State Output Input 0 Input 1 A B C D E F G H B 1 F 1 D 0 C 0 D 1 C 1 C 1 C 0 H 1 D 1 E 1 F 1 C 1 C 1 D 1 A 1 Find the equivalence partition on the states of the machine Give the state table for the minimal machine Use appropriate names for the equivalent states For example if states X and Y are equivalent then use XY as the name for the equivalent state in the minimal machine | Minimal State Automata | 104 |
The value of the expression 13 99 pmod 17 in the range 0 to 16 is ________ | Modular Arithmetic | 105 |
The value of the expression 13 99 pmod 17 in the range 0 to 16 is ________ | Modular Arithmetic | 105 |
The value of the expression 13 99 pmod 17 in the range 0 to 16 is ________ | Modular Arithmetic | 105 |
The value of the expression 13 99 pmod 17 in the range 0 to 16 is ________ | Modular Arithmetic | 105 |
The value of the expression 13 99 pmod 17 in the range 0 to 16 is ________ | Modular Arithmetic | 105 |
The value of the expression 13 99 pmod 17 in the range 0 to 16 is ________ | Modular Arithmetic | 105 |
The value of the expression 13 99 pmod 17 in the range 0 to 16 is ________ | Modular Arithmetic | 105 |
The value of the expression 13 99 pmod 17 in the range 0 to 16 is ________ | Modular Arithmetic | 105 |
The value of the expression 13 99 pmod 17 in the range 0 to 16 is ________ | Modular Arithmetic | 105 |
The value of the expression 13 99 pmod 17 in the range 0 to 16 is ________ | Modular Arithmetic | 105 |
The value of the expression 13 99 pmod 17 in the range 0 to 16 is ________ | Modular Arithmetic | 105 |
The value of the expression 13 99 pmod 17 in the range 0 to 16 is ________ | Modular Arithmetic | 105 |
The value of the expression 13 99 pmod 17 in the range 0 to 16 is ________ | Modular Arithmetic | 105 |
The value of the expression 13 99 pmod 17 in the range 0 to 16 is ________ | Modular Arithmetic | 105 |
The following circuit implements a two input AND gate using two 2 1 multiplexers What are the values of X1 X2 X3 X1 b X2 0 X3 a X1 b X2 1 X3 b X1 a X2 b X3 1 X1 a X2 0 X3 b | Multiplexer | 106 |
The following circuit implements a two input AND gate using two 2 1 multiplexers What are the values of X1 X2 X3 X1 b X2 0 X3 a X1 b X2 1 X3 b X1 a X2 b X3 1 X1 a X2 0 X3 b | Multiplexer | 106 |
Consider the two cascade 2 to 1 multiplexers as shown in the figure The minimal sum of products form of the output X is overline P overline Q PQR overline P Q QR PQ overline P overline Q R overline Q overline R PQR | Multiplexer | 106 |
Consider the two cascade 2 to 1 multiplexers as shown in the figure The minimal sum of products form of the output X is overline P overline Q PQR overline P Q QR PQ overline P overline Q R overline Q overline R PQR | Multiplexer | 106 |
Consider a multiplexer with X and Y as data inputs and Z the as control input Z 0 selects input X and Z 1 selects input Y What are the connections required to realize the 2 variable Boolean function f T R without using any additional hardware R to X 1 to Y T to Z T to X R to Y T to Z T to X R to Y 0 to Z R to X 0 to Y T to Z | Multiplexer | 106 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.