Register
Filter

Answers by HeartBleed

0 votes
1
UGC NET CSE | June 2006 | Part 2 | Question: 25
Application of data structure queue is : Levelwise printing of tree Implementation of priority queues Function call implementation Depth first search in a graph
Application of data structure queue is :Levelwise printing of treeImplementation of priority queuesFunction call implementationDepth first search in a graph
1 votes
2
ISRO2014-5
What is the number of steps required to derive the string $((()\; ())\; ())$ for the following grammar? $S \to SS$ $S \to (S)$ $S \to \varepsilon$ $10$ $12$ $15$ $16$
What is the number of steps required to derive the string $((()\; ())\; ())$ for the following grammar?$S \to SS$$S \to (S)$$S \to \varepsilon$ $10$ $12$ ...
1 votes
3
NIELIT 2018-54
______ to evaluate an expression without any embedded function calls. Two stacks are required one stack is needed Three stacks are required More than three stacks are required
______ to evaluate an expression without any embedded function calls.Two stacks are requiredone stack is neededThree stacks are requiredMore than three stacks are require...
3 votes
4
UGC NET CSE | December 2013 | Part 2 | Question: 49
How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size? 332.8 KB 83.6 KB 266.2 KB 256.6 KB
How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size?332.8 KB83.6 KB266.2 KB256.6 KB
0 votes
7
Multiple Stacks in Single Array
Consider the implementation of multiple stacks in single array S of size P from index 0 to P – 1. Number of stack Q each of size P/Q. Now, how push() and pop() implemented in it. Can somebody give some insight on this implementation
Consider the implementation of multiple stacks in single array S of size P from index 0 to P – 1. Number of stack Q each of size P/Q. Now, how push() and pop() implemen...
7 votes
8
GATE CSE 2001 | Question: 2.15
How many undirected graphs (not necessarily connected) can be constructed out of a given set $V=\{v_1, v_2, \dots v_n\}$ of $n$ vertices? $\frac{n(n-1)} {2}$ $2^n$ $n!$ $2^\frac{n(n-1)} {2} $
How many undirected graphs (not necessarily connected) can be constructed out of a given set $V=\{v_1, v_2, \dots v_n\}$ of $n$ vertices?$\frac{n(n-1)} {2}$$2^n$$n!$$2^\f...
1 votes
9
GATE CSE 2014 Set 3 | Question: 51
If $G$ is the forest with $n$ vertices and $k$ connected components, how many edges does $G$ have? $\left\lfloor\frac {n}{k}\right\rfloor$ $\left\lceil \frac{n}{k} \right\rceil$ $n-k$ $n-k+1$
If $G$ is the forest with $n$ vertices and $k$ connected components, how many edges does $G$ have?$\left\lfloor\frac {n}{k}\right\rfloor$$\left\lceil \frac{n}{k} \right\r...
1 votes
11
OS IPC
Why not deadlock.... ans is B)
Why not deadlock.... ans is B)
1 votes
13
test series
GIVEN ANSWER IS 20 30 BUT AM GETTING 30 20
GIVEN ANSWER IS 20 30BUT AM GETTING 30 20
0 votes
14
#madenotes
A B C 1 1 1 1 1 0 2 3 2 2 3 2 FIND NON-TRIVIAL DEPENDENCY
ABC111110232232 FIND NON-TRIVIAL DEPENDENCY