Skip to main content

CS302 Quiz No.4 Shared by Haris

Question # 1 of 10 ( Start time: 09:29:25 PM ) Total Marks: 1
A stage in the shift register consists of
Select correct option:
a latch
a flip flop a byte of storage
four bits of storage


Question # 2 of 10 ( Start time: 09:30:51 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 # 3 of 10 ( Start time: 09:33:12 PM ) Total Marks: 1
Asynchronous mean that_____________
Select correct option:
Each flip-flop after the first one is enabled by the output of the preceding flip-flop
Each flip-flop is enabled by the output of the preceding flip-flop
Each flip-flop except the last one is enabled by the output of the preceding flip-flop
Each alternative flip-flop after the first one is enabled by the output of t


Question # 4 of 10 ( Start time: 09:35:07 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 # 5 of 10 ( Start time: 09:36:08 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 # 6 of 10 ( Start time: 09:36:46 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 # 7 of 10 ( Start time: 09:37:50 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 # 8 of 10 ( Start time: 09:38:56 PM ) Total Marks: 1
Three cascaded modulus-10 counters have an overall modulus of
Select correct option:
30
100
1000
10000


Question # 9 of 10 ( Start time: 09:39:24 PM ) Total Marks: 1
A divide-by-10 ring counter requires a minimum of
Select correct option:
ten flip-flops
five flip-flops
four flip-flops
twelve flip-flops


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


Comments

Post a Comment

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

Popular posts from this blog

CS301 Current Finalterm Paper Spring 2014 Shared By M. Waleed

My Tday's Cs301 Paper: Mcq's Are From Moaz And Some Are From Handouts. Subjective Is From Moaz Majority One. 1- The Image Segmentation Define? 2- The Maximum Number Level Of Nodes In Binary Tree 3-The Iteration Array Have To Sort. 4- The Hapified Array Have To Solved 5- The Algorithm Of Binary Seaoh Tree 6-Sara Arrays Wala He Tha Ya Heap Wala. 7-....Wala Wala Wala...
1 comment
Read more

CS614 Quiz No.3 Shared by Students (Solved), Spring 2014

______ index stores first value in each block in the sequential file and a pointer to the block.  Select correct option:   Dense  Sparse  B-Tree  Hash In context of data parallelism, the work done by query processor should be:  Select correct option:  Almost zero  Maximum  Pipelined  Filtered across partitions The optimizer uses a hash join to join two tables if they are joined using an equijoin and  Select correct option:   Outer table has less number of rows  Inner table has less number of rows  Cardinality of tables is equal  Large amount of data needs to be joined Bitmap index is appropriate for:  Select correct option:  Low cardinality data  High cardinality data  Clustered data  Aggregated data If a task takes “T” time units to execute on a single data item, then execution of this task on “N” data items will take __...
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 Sele...
1 comment
Read more