Skip to main content

CS302 Quiz No. 3 File 5

Question # 1 of 10 ( Start time: 03:03:55 PM )  Total Marks: 1  
Divide-by-32 counter can be acheived by using
Select correct option:
Flip-Flop and DIV 10 
Flip-Flop and DIV 16 
Flip-Flop and DIV 32 
DIV 16 and DIV 32

Question # 2 of 10 ( Start time: 03:05:20 PM )  Total Marks: 1  
The counter states or the range of numbers of a counter is determined by the formula. (“n” represents the total number of flip-flops)
Select correct option:
(n raise to power 2) 
(n raise to power 2 and then minus 1) 
(2 raise to power n)
(2 raise to power n and then minus 1)

Question # 3 of 10 ( Start time: 03:06:36 PM )  Total Marks: 1  
A 4- bit UP/DOWN counter is in DOWN mode and in the 1010 state. on the next clock pulse, to what state does the counter go?
Select correct option:
1001 
1011 
0011 
1100
Question # 4 of 10 ( Start time: 03:07:37 PM )  Total Marks: 1  
A 4-bit binary UP/DOWN counter is in the binary state zero. the next state in the DOWN mode is___________ 
Select correct option:
0001 
1111 
1000 
1110

Question # 5 of 10 ( Start time: 03:09:04 PM )  Total Marks: 1  
Divide-by-160 counter is acheived by using
Select correct option:
Flip-Flop and DIV 10 
Flip-Flop and DIV 16 
DIV 16 and DIV 32 
DIV 16 and DIV 10

Question # 6 of 10 ( Start time: 03:10: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 
15

Question # 7 of 10 ( Start time: 03:10:49 PM )  Total Marks: 1  
RCO stands for ________ 
Select correct option:
Reconfiguration Counter Output 
Ripple Counter Output 
Reconfiguration Clock Output 
Ripple Clock Output

Question # 8 of 10 ( Start time: 03:11:38 PM )  Total Marks: 1  
__________occurs when the same clock signal arrives at different times at different clock inputs due to propagation delay.
Select correct option:
Race condition 
Clock Skew 
Ripple Effect 
None of given options

Question # 9 of 10 ( Start time: 03:12:20 PM )  Total Marks: 1  
For a down counter that counts from (111 to 000), if current state is "101" the next state will be _______ 
Select correct option:
111 
110 
010 
none of given options

Question # 10 of 10 ( Start time: 03:13:03 PM )  Total Marks: 1  
A Divide-by-20 counter can be acheived by using
Select correct option:
Flip-Flop and DIV 10 
Flip-Flop and DIV 16 
Flip-Flop and DIV 32 
Div 10 and DIV 16
Labels:

Comments

Post a Comment

Please give us your feedback & help us to improve this site.

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             
1 comment
Read more

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
Post a Comment
Read more

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
Post a Comment
Read more