Skip to main content

CS302 Quiz No.3 Shared by Iram

Question # 1 of 10 ( Start time: 07:50:01 PM )  Total Marks: 1
A counter is implemented using three (3) flip-flops, possibly it will have ________ maximum output status.
Select correct option:
 3
 7
 8  ok
 15


Question # 2 of 10 ( Start time: 07:50:36 PM )  Total Marks: 1
If a circuit suffers “Clock Skew “ problem, the output of circuit can’t be guarantied.
Select correct option:
 True  ok
 False


Question # 3 of 10 ( Start time: 07:50:46 PM )  Total Marks: 1
When the both inputs of edge-triggered J-K flop-flop are set to logic zero _________
Select correct option:
 The flop-flop is triggered
 Q=0 and Q’=1
 Q=1 and Q’=0  ok
 The output of flip-flop remains unchanged


Question # 4 of 10 ( Start time: 07:52:11 PM )  Total Marks: 1
A positive edge-triggered flip-flop changes its state when ________________
Select correct option:
 Enable input (EN) is set
 Preset input (PRE) is set
 Low-to-high transition of clock  ok
 High-to-low transition of clock


Question # 5 of 10 ( Start time: 07:52:36 PM )  Total Marks: 1
We have a digital circuit. Different parts of circuit operate at different clock frequencies (4MHZ, 2MHZ and 1MHZ), but we have a single clock source having a fix clock frequency (4MHZ), to supply the required frequency to each part of circuit, we can get help by using ___________
Select correct option:
 Using S-R Flop-Flop
 D-flipflop
 J-K flip-flop  ok
 T-Flip-Flop


Question # 6 of 10 ( Start time: 07:53:36 PM )  Total Marks: 1
A modulus-14 counter has fourteen states requiring_____________
Select correct option:
 14 Flip Flops
 14 Registers
 4 Flip Flops
 4 Registers


Question # 7 of 10 ( Start time: 07:54:59 PM )  Total Marks: 1
The minimum time required for the input logic levels to remain stable before the clock transition occurs is known as the ___________
Select correct option:
 Set-up time  ok
 Hold time
 Pulse Interval time
 Pulse Stability time (PST)


Question # 8 of 10 ( Start time: 07:55:21 PM )  Total Marks: 1
In a 4-bit binary counter, the next state after the terminal count in the DOWN mode is ____________
Select correct option:
 0000
 1111  ok
 0001
 10000


Question # 9 of 10 ( Start time: 07:55:48 PM )  Total Marks: 1
________ flip-flops are obsolete now.
Select correct option:
 Edge-triggered
 Master-Slave  ok
 T-Flipflop
 D-Flipflop


Question # 10 of 10 ( Start time: 07:56:23 PM )  Total Marks: 1
A mono-stable device only has a single stable state
Select correct option:
 True  ok
 False

Comments

Popular posts from this blog

CS614 Quiz No.4 Shared by Princess (solved), Spring 2014

  “What means What”. The phrase refers to: Select correct option:  Meta data  External data Transformed data Internal representations Question # 2 of 10 Which of the following is NOT one of the activities of “Maintenance and Growth” phase in Kimball’s DWH development approach? Select correct option: Education Technical Education Program Support  Interface Deployment                 Question # 3 of 10 Horizontally wide data means: Select correct option: Dataset has large no. of attributes Dataset has large no. of records Dataset has attribute skews Dataset has partitioning skews                 Question # 4 of 10 Which of the following is NOT one of the top-10 mistakes that should be avoided during DWH development? Select correct option: Not interacting directly with end user Not being an accommodating person Isolating IT support people from business users Training the users with dummy data and considering it success             

CS502 Quiz No.4 File 3

There is relationship between number of back edges and number of cycles in DFS Select correct option: Both are equal. Cycles are half of back edges.   Cycles are one fourth of back edges. There is no relationship between back edges and number of cycles .         (Correct) In strong components algorithm, the form of graph is used in which all the vertices of original graph G have been reversed in direction. Select correct option: True                 (Correct)   False In Kruskal's algorithm, the next edge is added to viable set A, if its adding does not induce a/an __________ . Select correct option: Vertex Edge   Cycle               (Correct)   Tree For undirected graph, there is no distinction between forward and back edges. Select correct option: True                 (Correct)   False You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ? Select correct option: (V+E)             (Corre

CS301 Quiz No.2 Shared by Tayyeba

Binary search algorithm can not be applied to ____ Select correct option: sorted linked list sorted binary trees        ok sorted linear array pointer array During in-order traversal using recursive calls, if we found a node is NULL. It means this node will satisfy following condition. Select correct option: It will not have left child        ok It will not have right child It will not have both left and right children None of given options Identify the data structure which allows deletions at both ends of the list but insertion at only one end. Select correct option: Input-restricted deque Output-restricted deque Priority queues        ok A BST generated from the data in ascending order is ____________. Select correct option: Linear Nonlinear Balanced        ok Un sorted In a program a reference variable, say x, can be declared as Select correct option: int &x ;        ok int *x ; int x ; None of the given options he depth of a complete bina