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
Recent activity by shivani2010
2
answers
1
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
answer selected
Apr 7, 2017
DS
data-structures
priority
ugcnetcse-june2013-paper2
+
–
1
answer
2
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...
385
views
commented
Apr 7, 2017
Mathematical Logic
digital-logic
preparation
+
–
1
answer
3
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
382
views
answer selected
Apr 7, 2017
Digital Logic
digital-logic
+
–
1
answer
4
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
answer selected
Apr 7, 2017
Digital Logic
digital-logic
+
–
2
answers
5
Which of the following gates is known as coincidence detector?
AND NAND XOR X-NOR
ANDNANDXORX-NOR
12.9k
views
answer selected
Apr 7, 2017
Digital Logic
digital-logic
+
–
1
answer
6
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
answer selected
Apr 7, 2017
Digital Logic
digital-logic
+
–
3
answers
7
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?
430
views
answer selected
Mar 30, 2017
Digital Logic
digital-logic
+
–
1
answer
8
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...
480
views
commented
Mar 25, 2017
Digital Logic
digital-logic
k-map
+
–
2
answers
9
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
commented
Mar 24, 2017
Digital Logic
digital-logic
+
–
6
answers
10
UGC NET CSE | December 2014 | Part 2 | Question: 35
The following Context-Free Grammar (CFG) : $S \rightarrow aB | bA$ $A \rightarrow a | as | bAA$ $B \rightarrow b | bs | aBB$ will generate Odd numbers of $a's$ and odd numbers of $b's$ Even numbers of $a's$ and even numbers of $b's$ Equal numbers of $a's$ and $b's$ Different numbers of $a's$ and $b's$
The following Context-Free Grammar (CFG) :$S \rightarrow aB | bA$$A \rightarrow a | as | bAA$$B \rightarrow b | bs | aBB$ will generateOdd numbers of $a's$ and odd number...
8.6k
views
answer selected
Aug 22, 2016
Theory of Computation
ugcnetcse-dec2014-paper2
theory-of-computation
context-free-grammar
+
–
2
answers
11
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
answer selected
Aug 22, 2016
Theory of Computation
theory-of-computation
ugcnetcse-dec2012-paper3
+
–
1
answer
12
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*
824
views
answer selected
Jun 18, 2016
Theory of Computation
theory-of-computation
ugcnetcse-dec2012-paper3
+
–
1
answer
13
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
commented
Jun 17, 2016
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.
564
views
commented
Jun 16, 2016
Others
preparation
+
–
1
answer
15
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
+
–
3
answers
16
If Inorder and Preorder is given then what will be the time complexity of creating binary tree?
2.4k
views
answer selected
Jun 15, 2016
1
answer
17
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
answer selected
Jun 15, 2016
DS
ugcnetcse-june2012-paper2
programming
tree
+
–
1
answer
18
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
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 is
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. ...
4.3k
views
answer selected
Jun 15, 2016
Graph Theory
graph-theory
+
–
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
answer selected
Jun 12, 2016
DS
engineering-mathematics
+
–
1
answer
21
Graph having every pair of vertices connected is called
Graph having every pair of vertices connected is called Cycle graph Complete graph Peterson graph Is a Tree
Graph having every pair of vertices connected is calledCycle graphComplete graphPeterson graphIs a Tree
1.5k
views
answer selected
Jun 12, 2016
Graph Theory
graph-theory
+
–
3
answers
22
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
answer selected
Jun 12, 2016
Graph Theory
graph-theory
ugcnetcse-june2013-paper2
+
–
1
answer
23
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
answer selected
Jun 12, 2016
Algorithms
algorithms
binary-search
+
–
2
answers
24
An undirected graph G has n vertices and n-1 edges then G is
An undirected graph G has n vertices and n-1 edges then G is A. Cyclic B. Addition of edge will make it cyclic C. Eulerian D. Is a Tree
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
4.4k
views
asked
Jun 12, 2016
Graph Theory
graph-theory
+
–
2
answers
25
Tree
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?
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?
470
views
commented
Jun 9, 2016
1
answer
26
UGC NET CSE | September 2013 | Part 2 | Question: 20
Consider the following statements: A graph in which there is a unique path between every pair of vertices is a tree. A connected graph with e=v-1 is a tree A connected graph with e=v-1 that has no circuit is a tree Which one of the above statements is/are true? I and III II and III I and II All of the above
Consider the following statements:A graph in which there is a unique path between every pair of vertices is a tree.A connected graph with e=v-1 is a treeA connected graph...
3.4k
views
commented
Jun 9, 2016
DS
graph-connectivity
ugcnetsep2013ii
+
–
1
answer
27
UGC NET CSE | September 2013 | Part 2 | Question: 11
The min. number of nodes in a binary tree of depth d (root at level 0) is $(2^d + 1)$ $(2^{(d+1)} - 1)$ $d$ $d + 1$
The min. number of nodes in a binary tree of depth d (root at level 0) is$(2^d + 1)$$(2^{(d+1)} - 1)$$d$$d + 1$
4.1k
views
answer selected
Jun 9, 2016
DS
binary-tree
data-structures
ugcnetsep2013ii
+
–
1
answer
28
Splay Tree
The amortized time complexity to perform ______ operation(s) in Splay trees is $O(\log n)$. Search Search and Insert Search and Delete Search, insert and delete
The amortized time complexity to perform ______ operation(s) in Splay trees is $O(\log n)$.SearchSearch and Insert Search and DeleteSearch, insert and delete
1.1k
views
commented
Jun 9, 2016
DS
tree
+
–
1
answer
29
ER Diagram is a conceptual Design or Logical design? Give the reasons.
360
views
answer selected
Jun 9, 2016
Databases
databases
er-diagram
+
–
2
answers
30
Cardinality Ratio
A project consists of minimum of two employee and maximum of 30 employee. Every employee need not participate into some projects, but if it does then it can be maximum of 4 projects. Represent the above information in ER diagram, and show the following 1) Which entity in Partial participation and which is in total participation? 2) Represent the cardinality ratio of each entity.
A project consists of minimum of two employee and maximum of 30 employee. Every employee need not participate into some projects, but if it does then it can be maximum of...
1.5k
views
answer selected
Jun 9, 2016
Databases
databases
er-diagram
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register