1 answer
2
Hello everyone, I am a third year student. I want to prepare self for GATE 2019. The first subject which I am going to prepare is Digital Logic. Can anyone tell me what i...
1 answer
3
A Combinational Circuit can be designed onlyAND gatesOR GatesOR and XOR GatesNOR Gates
1 answer
4
What is the Logic which controls a stair case light associated with two switches A and B, located at bottom and top of the stair case respectivelyORANDXORXNOR
1 answer
6
The most suitable gate for comparing two bitsANDORNANDXOR
3 answers
7
For example, if we want to check if a function follow commutativity then we have to check $A * B = B * A $. So what is it for identity?
1 answer
8
In the min term we select (1), in the max term we select (0).But 1 is greater than 0. Selecting 1 should be called max-term and selecting 0 should be called Min-term. Why...
2 answers
9
F is a function which have three variable A,B and C. How many Universal Gates will be needed to implement this function.
1 answer
13
What is the minimum number of states in string ${(ab)}^{*}$?How to approach this kind of problem?
2 answers
14
I have just completed my second year, I am now going in the third year. What advice can you give me, if i am targeting IISc?Thanks in Advance.
1 answer
15
The time complexity to build a heap with a list of n numbers isO(log n)O(n)O(n logn)O(n$^2$)
1 answer
17
Leaves of which of the following trees are at the same level?A. Binary treeB. B-treeC. AVL-treeD. Expression tree
1 answer
18
If an array with n-element is given then what will be the time complexity of creating Binary tree and Binary Search tree?
2 answers
19
An undirected graph is Eulerian if and only if all vertices of G are of the sum of the degrees of all nodes isA. Same degreeB. ODD degreeC. Need not be ODDD. ...
1 answer
21
Graph having every pair of vertices connected is calledCycle graphComplete graphPeterson graphIs a Tree
3 answers
22
Which of the following connected graph has exactly one spanning tree? Complete graph Hamiltonian graph Euler graph None of the above
1 answer
23
Binary search algorithm employs the strategy ofDivide and Conquer techniqueDynamic ProgrammingBranch & Bound techniqueGreedy Strategy
2 answers
24
An undirected graph G has n vertices and n-1 edges then G isA. CyclicB. Addition of edge will make it cyclicC. EulerianD. Is a Tree
2 answers
25
If a tree is having only two nodes ( May be A and B). and its preorder and postorder is given, then is it possible to construct unique tree?
1 answer
27
1 answer
28
The amortized time complexity to perform ______ operation(s) in Splay trees is $O(\log n)$.SearchSearch and Insert Search and DeleteSearch, insert and delete