EC > GATE 2014 SET-3 > Sequential Circuits

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

The circuit shown in the figure is a

A

Toggle Flip Flop

B

JK Flip Flop

C

SR Latch

D

Master-Slave D Flip Flop

Check Answer

Explanation

Correct : d

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science