Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
`JEET
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by `JEET
8
votes
61
ISRO2018-33
Which of the following is application of Breath First Search on the graph? Finding diameter of the graph Finding bipartite graph Both (a) and (b) None of the above
Which of the following is application of Breath First Search on the graph?Finding diameter of the graphFinding bipartite graphBoth (a) and (b)None of the above
3.8k
views
answered
Jan 3, 2020
Algorithms
isro2018
graph-algorithm
breadth-first-search
algorithms
+
–
1
votes
62
ISRO2018-29
DU-chains(Definition-Use) in compiler design: consist of a definition of a variable and all its uses, reachable from that definition are created using a form static code analysis are prerequisite for many compiler optimization including constant propagation and common sub-expression elimination All of the above
DU-chains(Definition-Use) in compiler design:consist of a definition of a variable and all its uses, reachable from that definitionare created using a form static code an...
2.3k
views
answered
Jan 3, 2020
Compiler Design
isro2018
compiler-design
code-optimization
+
–
2
votes
63
GATE CSE 2015 Set 1 | Question: 38
Consider a non-pipelined processor with a clock rate of $2.5$ gigahertz and average cycles per instruction of four. The same processor is upgraded to a pipelined processor with five stages; but due to the internal pipeline delay, ... $2$ gigahertz. Assume that there are no stalls in the pipeline. The speedup achieved in this pipelined processor is_______________.
Consider a non-pipelined processor with a clock rate of $2.5$ gigahertz and average cycles per instruction of four. The same processor is upgraded to a pipelined processo...
29.7k
views
answered
Jan 2, 2020
CO and Architecture
gatecse-2015-set1
co-and-architecture
pipelining
normal
numerical-answers
+
–
4
votes
64
UGC NET CSE | December 2019 | Part 2 | Question: 66
Consider the following statements: $S_1$: If a group $(G, *)$ is of order $n$, and $a \in G$ is such that $a^m = e$ for some integer $m \leq n$, then $m$ must divide $n$. $S_2$: If a group $(G, *)$ is of even order, then ... $a * a =e$. Which of the statements is (are) correct? Only $S_1$ Only $S_2$ Both $S_1$ and $S_2$ Neither $S_1$ and $S_2$
Consider the following statements:$S_1$: If a group $(G, *)$ is of order $n$, and $a \in G$ is such that $a^m = e$ for some integer $m \leq n$, then $m$ must divide $n$.$...
905
views
answered
Dec 30, 2019
Others
ugcnetcse-dec2019-paper2
+
–
0
votes
65
NTA NET DEC 2019 (DES)
The Data Encryption Standard (DES) has a function consists of four steps. Which of the following is correct order of these four steps? An expansion permutation, S boxes, an XOR operation, a straight permutation An expansion permutation, an XOR ... - boxes, an XOR operation, an expansion permutation A straight permutation, an XOR operation, S boxes, an expansion permutation
The Data Encryption Standard (DES) has a function consists of four steps. Which of the following is correct order of these four steps?An expansion permutation, S b...
2.5k
views
answered
Dec 29, 2019
Computer Networks
cryptography-des
+
–
5
votes
66
UGC NET CSE | December 2019 | Part 2 | Question: 14
What is the output of the following $C$ program? # include <stdio.h> main () { int i, j, x=0; for (i=0; i<5; ++i) for (j=0; j<i; ++j) { x+=(i+j-1); break; } printf(“%d”, x); } $6$ $5$ $4$ $3$
What is the output of the following $C$ program?# include <stdio.h main () { int i, j, x=0; for (i=0; i<5; ++i) for (j=0; j<i; ++j) { x+=(i+j-1); break; } printf(“%d”...
1.4k
views
answered
Dec 29, 2019
Others
ugcnetcse-dec2019-paper2
+
–
4
votes
67
GATE CSE 2001 | Question: 2.11
Consider the circuit shown below. The output of a $2:1$ MUX is given by the function $(ac' + bc)$. Which of the following is true? $f=X_1'+X_2$ $f=X_1'X_2+X_1X_2'$ $f=X_1X_2+X_1'X_2'$ $f=X_1+X_2'$
Consider the circuit shown below. The output of a $2:1$ MUX is given by the function $(ac' + bc)$.Which of the following is true?$f=X_1'+X_2$$f=X_1'X_2+X_1X_2'$$f=X_1X_2+...
11.3k
views
answered
Dec 29, 2019
Digital Logic
gatecse-2001
digital-logic
normal
multiplexer
+
–
1
votes
68
UGC NET CSE | December 2018 | Part 2 | Question: 66
Which of the following statement/s is/are true? Firewalls can screen traffic going into or out of an organization. Virtual private networks can stimulate an old leased network to provide certain desirable properties. Choose the correct answer from the code given below: (i) only (ii) only Both (i) and (ii) Neither (i) nor (ii)
Which of the following statement/s is/are true?Firewalls can screen traffic going into or out of an organization.Virtual private networks can stimulate an old leased netw...
1.7k
views
answered
Dec 28, 2019
Computer Networks
ugcnetcse-dec2018-paper2
network-security
+
–
1
votes
69
UGC NET CSE | December 2018 | Part 2 | Question: 66
Which of the following statement/s is/are true? Firewalls can screen traffic going into or out of an organization. Virtual private networks can stimulate an old leased network to provide certain desirable properties. Choose the correct answer from the code given below: (i) only (ii) only Both (i) and (ii) Neither (i) nor (ii)
Which of the following statement/s is/are true?Firewalls can screen traffic going into or out of an organization.Virtual private networks can stimulate an old leased netw...
1.7k
views
answered
Dec 28, 2019
Computer Networks
ugcnetcse-dec2018-paper2
network-security
+
–
3
votes
70
UGC NET CSE | December 2018 | Part 2 | Question: 100
A full joint distribution for the Toothache, Cavity and Catch is given in the table below. Toothache $\neg$ Toothache Catch $\neg$ Catch Catch $\neg$ Catch Cavity $0.108$ $0.012$ $0.072$ $0.008$ $\neg$ Cavity $0.016$ $0.064$ $0.144$ $0.576$ What is ... $\langle 0.4, 0.8\rangle$ $\langle 0.6, 0.8\rangle$ $\langle 0.6, 0.4\rangle$
A full joint distribution for the Toothache, Cavity and Catch is given in the table below. Toothache$\neg$ ToothacheCatch$\neg$ CatchCatch$\neg$ CatchCavity$0.108$$0.012$...
2.5k
views
answered
Dec 28, 2019
Probability
ugcnetcse-dec2018-paper2
joint-distribution
probability
non-gate
+
–
0
votes
71
UGC NET CSE | December 2019 | Part 2 | Question: 75
The following multithreaded algorithm computes transpose of a matrix in parallel: p Trans $(X,Y,N)$ if $N=1$ then $Y[1,1] \leftarrow X[1,1]$ else partition $X$ into four $(N/2) \times (N/2)$ submatrices $X_{11}, X_{12}, X_{21}, X_{22}$ partition $Y$ ... $T_1 / T_\infty$ or $\theta(\lg N/N^2)$ $T_1 / T_\infty$ or $\theta(\lg N / N)$
The following multithreaded algorithm computes transpose of a matrix in parallel:p Trans $(X,Y,N)$if $N=1$then $Y[1,1] \leftarrow X[1,1]$else partition $X$ into four $(N/...
455
views
answered
Dec 27, 2019
Others
ugcnetcse-dec2019-paper2
+
–
2
votes
72
UGC NET CSE | December 2019 | Part 2 | Question: 35
Let $a^{2c} \text{ mod } n = (a^c)^2 \text{ mod } n$ and $a^{2c+1}\text{ mod } n= a \cdot (a^c)^2\text{ mod }n$. For $a=7$, $b=17$ and $n=561$, What is the value of $a^b( \text{mod } n)$? $160$ $166$ $157$ $67$
Let $a^{2c} \text{ mod } n = (a^c)^2 \text{ mod } n$ and $a^{2c+1}\text{ mod } n= a \cdot (a^c)^2\text{ mod }n$. For $a=7$, $b=17$ and $n=561$, What is the value of $a^b...
1.3k
views
answered
Dec 27, 2019
Others
ugcnetcse-dec2019-paper2
+
–
2
votes
73
UGC NET CSE | December 2019 | Part 2 | Question: 88
Match $\text{List-I}$ with $\text{List-II}$ ... $\text{(a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)}$
Match $\text{List-I}$ with $\text{List-II}$:$$\begin{array}{llll} & \textbf{List I} && \textbf{List II} \\ \text{(a)} & \text{Micro operation} & \text{(i)} & \text{Speci...
894
views
answered
Dec 27, 2019
Others
ugcnetcse-dec2019-paper2
+
–
1
votes
74
UGC NET CSE | December 2019 | Part 2 | Question: 49
Let $G= (V, T, S, P)$ be any context-free grammar without any $\lambda$-productions or unit productions. Let $K$ be the maximum number of symbols on the right of any production in $P$. The maximum number of production rules for any equivalent grammar ... $K \mid P \mid + \mid T \mid$ Where $\mid \cdot \mid$ denotes the cardinality of the set.
Let $G= (V, T, S, P)$ be any context-free grammar without any $\lambda$-productions or unit productions. Let $K$ be the maximum number of symbols on the right of any prod...
1.4k
views
answered
Dec 26, 2019
Others
ugcnetcse-dec2019-paper2
+
–
0
votes
75
UGC NET CSE | December 2019 | Part 2 | Question: 52
Let $A= \{001, 0011, 11, 101\}$ and $B=\{01, 111, 111, 010\}$. Similarly, let $C= \{00, 001, 1000\}$ and $D=\{0, 11, 011\}$. Which of the following pairs have a post-correspondence solution? Only pair $(A, B)$ Only pair $(C, D)$ Both $(A, B)$ and $(C, D)$ Neither $(A, B)$ nor $(C, D)$
Let $A= \{001, 0011, 11, 101\}$ and $B=\{01, 111, 111, 010\}$. Similarly, let $C= \{00, 001, 1000\}$ and $D=\{0, 11, 011\}$.Which of the following pairs have a post-corre...
1.3k
views
answered
Dec 26, 2019
Others
ugcnetcse-dec2019-paper2
+
–
2
votes
76
UGC NET CSE | December 2019 | Part 2 | Question: 21
Given two tables $R1(x,y)$ and $R2(y,z)$ with $50$ and $30$ number of tuples respectively. Find maximum number of tuples in the output of natural join between tables $R1$ and $R2$ i.e. $R1 * R2$? ($*$- Natural Join) $30$ $20$ $50$ $1500$
Given two tables $R1(x,y)$ and $R2(y,z)$ with $50$ and $30$ number of tuples respectively. Find maximum number of tuples in the output of natural join between tables $R1$...
1.6k
views
answered
Dec 26, 2019
Others
ugcnetcse-dec2019-paper2
+
–
5
votes
77
UGC NET CSE | December 2019 | Part 2 | Question: 38
In a B-Tree, each node represents a disk block. Suppose one block holds $8192$ bytes. Each key uses $32$ bytes. In a B-tree of order $M$ there are $M-1$ keys. Since each branch is on another disk block, we assume a branch is of $4$ bytes. The total memory requirement for a non-leaf node is $32 M -32$ $36 M – 32$ $36 M – 36$ $32 M – 36$
In a B-Tree, each node represents a disk block. Suppose one block holds $8192$ bytes. Each key uses $32$ bytes. In a B-tree of order $M$ there are $M-1$ keys. Since each ...
970
views
answered
Dec 26, 2019
Others
ugcnetcse-dec2019-paper2
+
–
2
votes
78
UGC NET CSE | December 2019 | Part 2 | Question: 76
Consider the following statements: The running time of dynamic programming algorithm is always $\theta(\rho)$ where $\rho$ is number of subproblems When a recurrence relation has a cyclic dependency, it is impossible to use that recurrence relation (unmodified) in a ... ) true? Only (ii) and (i) Only (ii) Only (ii) and (iii) Only (ii) and (iv)
Consider the following statements:The running time of dynamic programming algorithm is always $\theta(\rho)$ where $\rho$ is number of subproblemsWhen a recurrence relati...
894
views
answered
Dec 26, 2019
Others
ugcnetcse-dec2019-paper2
+
–
0
votes
79
UGC NET CSE | December 2019 | Part 2 | Question: 40
Consider a weighted directed graph. The current shortest distance from source $S$ to node $x$ is represented by $d[x]$. Let $d[v] =29$, $d[u]=15$, $w[u,v]=12$. What is the updated value of $d[v]$ based on current information? $29$ $27$ $25$ $17$
Consider a weighted directed graph. The current shortest distance from source $S$ to node $x$ is represented by $d[x]$. Let $d[v] =29$, $d[u]=15$, $w[u,v]=12$. What is th...
922
views
answered
Dec 26, 2019
Others
ugcnetcse-dec2019-paper2
+
–
3
votes
80
UGC NET CSE | December 2019 | Part 2 | Question: 79
Consider the following statements with respect to network security: Message confidentiality means that the sender and the receiver expect privacy Message integrity means that the data must arrive at the receiver exactly as they were sent. Message authentication means the receiver ... (ii) Only (i) and (iii) Only (ii) and (iii) (i), (ii) and (iii)
Consider the following statements with respect to network security:Message confidentiality means that the sender and the receiver expect privacyMessage integrity means th...
895
views
answered
Dec 26, 2019
Others
ugcnetcse-dec2019-paper2
+
–
1
votes
81
UGC NET CSE | December 2019 | Part 2 | Question: 37
What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsorted array? Assume that all the insertions can be accomodated. $\theta(1), \theta(n)$ $\theta(n), \theta(1)$ $\theta(1), \theta(1)$ $\theta(n), \theta(n)$
What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsorted array? Assume that all the insertions can be acc...
749
views
answered
Dec 26, 2019
Others
ugcnetcse-dec2019-paper2
+
–
9
votes
82
UGC NET CSE | December 2019 | Part 2 | Question: 39
Give asymptotic upper and lower bound for $T(n)$ given below. Assume $T(n)$ is constant for $n \leq 2$. $T(n) = 4T( \sqrt{n} ) + \lg^2n$ $T(n) = \theta (\lg ( \lg ^2 n) \lg n )$ $T(n) = \theta ( \lg ^2 n \lg n )$ $T(n) = \theta (\lg ^2 n \lg \lg n )$ $T(n) = \theta (\lg ( \lg n) \lg n )$
Give asymptotic upper and lower bound for $T(n)$ given below. Assume $T(n)$ is constant for $n \leq 2$. $T(n) = 4T( \sqrt{n} ) + \lg^2n$$T(n) = \theta (\lg ( \lg ^2 n) \l...
2.2k
views
answered
Dec 26, 2019
Others
ugcnetcse-dec2019-paper2
+
–
4
votes
83
GATE CSE 2006 | Question: 11
Consider a weighted complete graph $G$ on the vertex set $\{v_1,v_2,.....v_n\}$ such that the weight of the edge $(v_i, v_j)$ is $2|i-j|$. The weight of a minimum spanning tree of $G$ is: $n-1$ $2n-2$ $\begin{pmatrix} n \\ 2 \end{pmatrix}$ $n^2$
Consider a weighted complete graph $G$ on the vertex set $\{v_1,v_2,.....v_n\}$ such that the weight of the edge $(v_i, v_j)$ is $2|i-j|$. The weight of a minimum spanni...
14.6k
views
answered
Dec 24, 2019
Algorithms
gatecse-2006
algorithms
spanning-tree
normal
+
–
8
votes
84
GATE CSE 1998 | Question: 2.14
Let $A$ be a two dimensional array declared as follows: A: array [1 …. 10] [1 ….. 15] of integer; Assuming that each integer takes one memory location, the array is stored in row-major order and the first element of the array is stored at location $100$, what is the address of the element $A[i][j]$? $15i+j+84$ $15j+i+84$ $10i+j+89$ $10j+i+89$
Let $A$ be a two dimensional array declared as follows:A: array [1 …. 10] [1 ….. 15] of integer;Assuming that each integer takes one memory location, the array is sto...
29.6k
views
answered
Dec 19, 2019
DS
gate1998
data-structures
array
easy
+
–
0
votes
85
ARRAY
373
views
answered
Dec 19, 2019
0
votes
86
ARRAY
483
views
answered
Dec 19, 2019
17
votes
87
GATE CSE 2018 | Question: 43
Let $G$ be a graph with $100!$ vertices, with each vertex labelled by a distinct permutation of the numbers $1, 2,\ldots, 100.$ There is an edge between vertices $u$ and $v$ if and only if the label of $u$ can be obtained by swapping two adjacent ... denote the degree of a vertex in $G$, and $z$ denote the number of connected components in $G$. Then, $y+10z=$ ______.
Let $G$ be a graph with $100!$ vertices, with each vertex labelled by a distinct permutation of the numbers $1, 2,\ldots, 100.$ There is an edge between vertices $u$ and ...
19.7k
views
answered
Dec 13, 2019
Algorithms
gatecse-2018
algorithms
graph-algorithm
numerical-answers
2-marks
+
–
26
votes
88
GATE CSE 2019 | Question: 22
Two numbers are chosen independently and uniformly at random from the set $\{1,2,\ldots,13\}.$ The probability (rounded off to $3$ decimal places) that their $4\text{-bit}$ (unsigned) binary representations have the same most significant bit is ___________.
Two numbers are chosen independently and uniformly at random from the set $\{1,2,\ldots,13\}.$The probability (rounded off to $3$ decimal places) that their $4\text{-bit}...
19.8k
views
answered
Dec 12, 2019
Digital Logic
gatecse-2019
numerical-answers
digital-logic
number-representation
probability
1-mark
+
–
4
votes
89
TIFR CSE 2014 | Part B | Question: 6
Consider the problem of computing the minimum of a set of $n$ distinct numbers. We choose a permutation uniformly at random (i.e., each of the n! permutations of $\left \langle 1,....,n \right \rangle$ is chosen with probability $(1/n!)$ and we inspect the numbers in the order ... of times MIN is updated? $O (1)$ $H_{n}=\sum ^{n}_{i=1} 1/i$ $\sqrt{n}$ $n/2$ $n$
Consider the problem of computing the minimum of a set of $n$ distinct numbers. We choose a permutation uniformly at random (i.e., each of the n! permutations of $\left \...
2.6k
views
answered
Dec 6, 2019
Algorithms
tifr2014
algorithms
maximum-minimum
+
–
1
votes
90
TIFR CSE 2016 | Part B | Question: 1
A Boolean formula is said to be a $tautology$ if it evaluates to TRUE for all assignments to its variables. Which one of the following is NOT a tautology? $(( p \vee q) \wedge (r \vee s)) \Rightarrow (( p \wedge r) \vee q \vee s)$ ... $(( p \vee q ) \wedge ( r \vee s)) \Rightarrow ( p \vee q)$
A Boolean formula is said to be a $tautology$ if it evaluates to TRUE for all assignments to its variables. Which one of the following is NOT a tautology?$(( p \vee q) \w...
2.1k
views
answered
Dec 4, 2019
Mathematical Logic
tifr2016
mathematical-logic
propositional-logic
+
–
Page:
« prev
1
2
3
4
5
6
7
8
...
14
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register