Register
Filter

Recent activity by HeartBleed

2 answers
2
GATE Overflow Test Series | Programming | Test 1 | Question: 4
The number of characters (including whitespaces if any) printed by the following C program is #define sum(a, b) #a "+"#b "=%d" #include<stdio.h> int main() { printf(sum(6,9), 6+9); }
The number of characters (including whitespaces if any) printed by the following C program is#define sum(a, b) #a "+"#b "=%d" #include<stdio.h int main() { printf(sum(6,9...
6 answers
12
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...
3 answers
15
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
7 answers
17
GATE IT 2005 | Question: 50
In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most $2$. If the height of the tree is $h > 0$, then the minimum number of nodes in the tree is $2^{h-1}$ $2^{h-1} + 1$ $2^h - 1$ $2^h$
In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most $2$. If the height of the tree is $h 0$, then the m...
4 answers
18
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$ ...
5 answers
19
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...
2 answers
20
Frequency of output signal?
I got the ans as 1/(5*25) = 1/125. None of the, match
I got the ans as 1/(5*25) = 1/125. None of the, match
3 answers
24
fork() system call
How many processes will be spawned after executing this program? #include <stdio.h> #include <unistd.h> int main() { fork(); fork() && fork() || fork(); fork(); printf("forked\n"); return 0; } How to tackle the order of logical operations?
How many processes will be spawned after executing this program?#include <stdio.h>#include <unistd.h>int main(){ fork(); fork() && fork() || fork(); fork(); print...
2 answers
25
Fragmentation of packet
Which of the following statements are True ?
Which of the following statements are True ?
1 answer
26
MADE EASY FREE TEST
a)Mutual exclusion, progress, bounded wait all are satisfied b)Mutual exclusion, progress satisfied but bounded wait not satisfied c)Mutual exclusion satisfied progress, bounded wait not satisfied
a)Mutual exclusion, progress, bounded wait all are satisfiedb)Mutual exclusion, progress satisfied but bounded wait not satisfiedc)Mutual exclusion satisfied progress, bo...
6 answers
27
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
2 answers
28
UGC NET CSE | June 2019 | Part 2 | Question: 75
How many states are there in a minimum state automata equivalent to regular expression given below? Regular expression is $a^*b(a+b)$ $1$ $2$ $3$ $4$
How many states are there in a minimum state automata equivalent to regular expression given below?Regular expression is $a^*b(a+b)$$1$$2$$3$$4$