Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
shivani2010
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by shivani2010
2
votes
1
answer
1
Digital Logic
The most suitable gate for comparing two bits AND OR NAND XOR
The most suitable gate for comparing two bitsANDORNANDXOR
3.8k
views
asked
Apr 7, 2017
Digital Logic
digital-logic
+
–
0
votes
2
answers
2
Which of the following gates is known as coincidence detector?
AND NAND XOR X-NOR
ANDNANDXORX-NOR
12.9k
views
asked
Apr 7, 2017
Digital Logic
digital-logic
+
–
0
votes
1
answer
3
Digital Logic
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 respectively OR AND XOR XNOR
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
2.9k
views
asked
Apr 7, 2017
Digital Logic
digital-logic
+
–
0
votes
1
answer
4
Digital Logic
A Combinational Circuit can be designed only AND gates OR Gates OR and XOR Gates NOR Gates
A Combinational Circuit can be designed onlyAND gatesOR GatesOR and XOR GatesNOR Gates
384
views
asked
Apr 7, 2017
Digital Logic
digital-logic
+
–
0
votes
3
answers
5
How to check if a function follows identity?
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?
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?
432
views
asked
Mar 29, 2017
Digital Logic
digital-logic
+
–
1
votes
1
answer
6
Digital Logic Doubt
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 they have the name otherwise?
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...
481
views
asked
Mar 25, 2017
Digital Logic
digital-logic
k-map
+
–
3
votes
2
answers
7
Digital Logic
F is a function which have three variable A,B and C. How many Universal Gates will be needed to implement this function.
F is a function which have three variable A,B and C. How many Universal Gates will be needed to implement this function.
2.0k
views
asked
Mar 24, 2017
Digital Logic
digital-logic
+
–
0
votes
1
answer
8
Advice to start Difital Logic
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 is the best books and resources which can I use for the same?
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...
386
views
asked
Mar 22, 2017
Mathematical Logic
digital-logic
preparation
+
–
1
votes
1
answer
9
UGC NET CSE | December 2012 | Part 3 | Question: 45
Which of the following regular expression identifies are true? (r+s)*=r*s* (r+s)*=r*+s* (r+s)*=(r*s*)* r*s*=r*+s*
Which of the following regular expression identifies are true?(r+s)*=r*s*(r+s)*=r*+s*(r+s)*=(r*s*)*r*s*=r*+s*
829
views
asked
Jun 18, 2016
Theory of Computation
theory-of-computation
ugcnetcse-dec2012-paper3
+
–
1
votes
2
answers
10
UGC NET CSE | December 2012 | Part 3 | Question: 57
Given the following statements: Recursive enumerable sets are closed under complementation. Recursive sets are closed under complementation. Which is/are the correct statement? only I only II both I and II neither I nor II
Given the following statements:Recursive enumerable sets are closed under complementation.Recursive sets are closed under complementation.Which is/are the correct stateme...
2.1k
views
asked
Jun 17, 2016
Theory of Computation
theory-of-computation
ugcnetcse-dec2012-paper3
+
–
1
votes
1
answer
11
Minimum number of states in DFA
What is the minimum number of states in string ${(ab)}^{*}$? How to approach this kind of problem?
What is the minimum number of states in string ${(ab)}^{*}$?How to approach this kind of problem?
5.1k
views
asked
Jun 17, 2016
1
votes
2
answers
12
UGC NET CSE | June 2013 | Part 2 | Question: 30
Consider the following statements for priority queue: S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations. S2: The elements of a priority queue may be complex structures ... incorrect S1 is correct and S2 is incorrect S1 is incorrect and S2 is correct Both S1 and S2 are correct
Consider the following statements for priority queue:S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic ope...
4.4k
views
asked
Jun 15, 2016
DS
data-structures
priority
ugcnetcse-june2013-paper2
+
–
2
votes
1
answer
13
UGC NET CSE | June 2013 | Part 2 | Question: 28
The time complexity to build a heap with a list of n numbers is O(log n) O(n) O(n logn) O(n$^2$)
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.9k
views
asked
Jun 15, 2016
DS
heap-sort
ugcnetcse-june2013-paper2
+
–
0
votes
2
answers
14
Advice for a Third year going student
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.
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.
571
views
asked
Jun 15, 2016
Others
preparation
+
–
0
votes
1
answer
15
UGC NET CSE | June 2012 | Part 2 | Question: 13
Leaves of which of the following trees are at the same level? A. Binary tree B. B-tree C. AVL-tree D. Expression tree
Leaves of which of the following trees are at the same level?A. Binary treeB. B-treeC. AVL-treeD. Expression tree
3.4k
views
asked
Jun 15, 2016
DS
ugcnetcse-june2012-paper2
programming
tree
+
–
1
votes
1
answer
16
Time Complexity of Binary tree and BST
If an array with n-element is given then what will be the time complexity of creating Binary tree and Binary Search tree?
If an array with n-element is given then what will be the time complexity of creating Binary tree and Binary Search tree?
14.6k
views
asked
Jun 15, 2016
DS
data-structures
+
–
2
votes
3
answers
17
If Inorder and Preorder is given then what will be the time complexity of creating binary tree?
2.4k
views
asked
Jun 15, 2016
2
votes
1
answer
18
Binary search algorithm employs the strategy of
Binary search algorithm employs the strategy of Divide and Conquer technique Dynamic Programming Branch & Bound technique Greedy Strategy
Binary search algorithm employs the strategy ofDivide and Conquer techniqueDynamic ProgrammingBranch & Bound techniqueGreedy Strategy
1.1k
views
asked
Jun 12, 2016
Algorithms
algorithms
binary-search
+
–
3
votes
3
answers
19
UGC NET CSE | June 2013 | Part 2 | Question: 37
Which of the following connected graph has exactly one spanning tree? Complete graph Hamiltonian graph Euler graph None of the above
Which of the following connected graph has exactly one spanning tree? Complete graph Hamiltonian graph Euler graph None of the above
4.6k
views
asked
Jun 12, 2016
Graph Theory
graph-theory
ugcnetcse-june2013-paper2
+
–
0
votes
1
answer
20
n elements of a queue are to be reversed using another queue. The number of ADD and REMOVE required to do so is,
A. 2*nB. 4*nC. nD. the task cannot be done
13.1k
views
asked
Jun 12, 2016
DS
engineering-mathematics
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register