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

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...

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 __...

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...