Skip to main content

CS302 Quiz No.4 Shared by HU

Question # 1 of 10 ( Start time: 09:42:34 PM ) Total Marks: 1
When an eight bit serial in/serial out shift register is used for a 24 micro seconds time delay, the clock frequenct must be
Select correct option:
41.67 KHz
333 KHz  Not Confirm
125 KHz
8 MHz


Question # 2 of 10 ( Start time: 09:43:24 PM ) Total Marks: 1
A 4-bit binary up/down counter is in the binary state of zero. The next state in the DOWN mode is:
Select correct option:
0001
1000
1110
1111


Question # 3 of 10 ( Start time: 09:43:53 PM ) Total Marks: 1
In moore machine the output depends on
Select correct option:
the current state and the output of previous flip flop
only inputs
the current state
the current state and inputs


Question # 4 of 10 ( Start time: 09:44:05 PM ) Total Marks: 1
In designing any counter the transition from a current state to the next sate is determined by
Select correct option:
Current state and inputs
Only inputs
Only current state
current state and outputs


Question # 5 of 10 ( Start time: 09:44:33 PM ) Total Marks: 1
A divide-by-10 Johnson counter requires
Select correct option:
ten flip-flops
four flip-flops
five flip-flops
twelve flip-flops


Question # 6 of 10 ( Start time: 09:44:46 PM ) Total Marks: 1
Number of states in an 8-bit Johnson counter sequence are:
Select correct option:
8
12
14
16


Question # 7 of 10 ( Start time: 09:45:20 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
0001
10000


Question # 8 of 10 ( Start time: 09:45:44 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 # 9 of 10 ( Start time: 09:46:53 PM ) Total Marks: 1
A 4-bit binary up/down counter is in the binary state of zero. The next state in the UP mode is
Select correct option:
0001
1000
1110
1111


Question # 10 of 10 ( Start time: 09:47:16 PM ) Total Marks: 1
Three cascaded modulus-10 counters have an overall modulus of
Select correct option:
30
100
1000
10000

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