Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Prashant.
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Prashant.
2
answers
1
UGC NET CSE | December 2019 | Part 2 | Question: 8
How many reflexive relations are there on a set with $4$ elements? $2^4$ $2^{12}$ $4^2$ $2$
How many reflexive relations are there on a set with $4$ elements?$2^4$$2^{12}$$4^2$$2$
429
views
answer selected
Jul 24, 2021
Others
ugcnetcse-dec2019-paper2
+
–
6
answers
2
UGC NET CSE | December 2019 | Part 2 | Question: 3
The Boolean expression $AB+A \overline{B}+\overline{A}C+AC$ is unaffected by the value of the Boolean variable _________. $A$ $B$ $C$ $A, B$ and $C$
The Boolean expression $AB+A \overline{B}+\overline{A}C+AC$ is unaffected by the value of the Boolean variable _________.$A$$B$$C$$A, B$ and $C$
1.9k
views
answer selected
Jul 24, 2021
Others
ugcnetcse-dec2019-paper2
digital-logic
boolean-algebra
+
–
1
answer
3
UGC NET CSE | November 2017 | Part 2 | Question: 10
The output of the following combinational circuit is $F$. The value of $F$ is $P_1+P_2’P_3$ $P_1+P_2’P_3’$ $P_1+P_2P_3’$ $P_1’+P_2P_3$
The output of the following combinational circuit is $F$.The value of $F$ is$P_1+P_2’P_3$$P_1+P_2’P_3’$$P_1+P_2P_3’$$P_1’+P_2P_3$
899
views
commented
Jul 24, 2021
Unknown Category
ugcnetcse-nov2017-paper2
+
–
3
answers
4
UGC NET CSE | December 2014 | Part 3 | Question: 50
How many disk blocks are required to keep list of free disk blocks in a $16$ GB hard disk with $1$ kB block size using linked list of free disk blocks ? Assume that the disk block number is stored in $32$ bits. $1024$ blocks $16794$ blocks $20000$ blocks $1048576$ blocks
How many disk blocks are required to keep list of free disk blocks in a $16$ GB hard disk with $1$ kB block size using linked list of free disk blocks ? Assume that the d...
5.8k
views
commented
Jul 24, 2021
Operating System
ugcnetcse-dec2014-paper3
operating-system
file-system
+
–
3
answers
5
GATE CSE 2020 | Question: 34
Each of a set of $n$ processes executes the following code using two semaphores $a$ and $b$ initialized to $1$ and $0$, respectively. Assume that $\text{count}$ is a shared variable initialized to $0$ ... all processes execute CODE SECTION P mutually exclusively. It ensures that at most $n-1$ processes are in CODE SECTION P at any time.
Each of a set of $n$ processes executes the following code using two semaphores $a$ and $b$ initialized to $1$ and $0$, respectively. Assume that $\text{count}$ is a shar...
13.5k
views
commented
Feb 13, 2020
Operating System
gatecse-2020
operating-system
semaphore
2-marks
+
–
4
answers
6
GATE CSE 2020 | Question: 41
In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported elements is $k$. $\Theta (\log n)$ $\Theta (\log n +k)$ $\Theta (k \log n)$ $\Theta ( n \log k)$
In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported ...
21.5k
views
commented
Feb 13, 2020
DS
gatecse-2020
data-structures
binary-search-tree
2-marks
+
–
4
answers
7
GATE CSE 2020 | Question: 9
Consider the following statements. Symbol table is accessed only during lexical analysis and syntax analysis. Compilers for programming languages that support recursion necessarily need heap storage for memory allocation in the run-time environment. Errors violating the condition any ... the above statements is/are TRUE? I only I and III only Ⅱ only None of Ⅰ, Ⅱ and Ⅲ
Consider the following statements.Symbol table is accessed only during lexical analysis and syntax analysis.Compilers for programming languages that support recursion nec...
14.3k
views
answer edited
Feb 13, 2020
Compiler Design
gatecse-2020
compiler-design
compilation-phases
runtime-environment
1-mark
+
–
8
answers
8
GATE CSE 2020 | Question: 42
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.
16.3k
views
commented
Feb 12, 2020
Combinatory
gatecse-2020
numerical-answers
combinatory
2-marks
+
–
4
answers
9
GATE CSE 2020 | Question: 18
Let $G$ be a group of $35$ elements. Then the largest possible size of a subgroup of $G$ other than $G$ itself is _______.
Let $G$ be a group of $35$ elements. Then the largest possible size of a subgroup of $G$ other than $G$ itself is _______.
9.1k
views
answered
Feb 12, 2020
Set Theory & Algebra
gatecse-2020
numerical-answers
group-theory
easy
1-mark
+
–
3
answers
10
GATE CSE 2020 | Question: 50
Consider the following set of processes, assumed to have arrived at time $0$. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR, assume that the processes are scheduled in the order$P_1, P_2, P_3, P_4$ ... of the difference between the average turnaround times (in ms) of SJF and RR (round off to $2$ decimal places is_______
Consider the following set of processes, assumed to have arrived at time $0$. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR...
10.3k
views
answer edited
Feb 12, 2020
Operating System
gatecse-2020
numerical-answers
operating-system
process-scheduling
2-marks
+
–
4
answers
11
GATE CSE 2020 | Question: 20
If there are $m$ input lines and $n$ output lines for a decoder that is used to uniquely address a byte addressable $1$ KB RAM, then the minimum value of $m+n$ is ________ .
If there are $m$ input lines and $n$ output lines for a decoder that is used to uniquely address a byte addressable $1$ KB RAM, then the minimum value of $m+n$ is _______...
9.6k
views
answered
Feb 12, 2020
Digital Logic
gatecse-2020
numerical-answers
digital-logic
decoder
1-mark
+
–
4
answers
12
GATE CSE 2020 | Question: 48
Consider the following C functions. int tob (int b, int* arr) { int i; for (i = 0; b>0; i++) { if (b%2) arr [i] = 1; else arr[i] = 0; b = b/2; } return (i); } int pp(int a, int b) { int arr[20]; int i, tot = 1, ex, len; ex = a; len = tob(b ... ; i<len ; i++) { if (arr[i] ==1) tot = tot * ex; ex= ex*ex; } return (tot) ; } The value returned by $pp(3,4)$ is _______.
Consider the following C functions.int tob (int b, int* arr) { int i; for (i = 0; b>0; i++) { if (b%2) arr [i] = 1; else arr[i] = 0; b = b/2; } ret...
11.3k
views
answered
Feb 12, 2020
Algorithms
gatecse-2020
numerical-answers
identify-function
2-marks
+
–
1
answer
13
GATE CSE 2020 | Question: 3
Consider the following statements. Daisy chaining is used to assign priorities in attending interrupts. When a device raises a vectored interrupt, the CPU does polling to identify the source of interrupt. In polling, the CPU periodically checks the status bits to know if any ... . Which of the above statements is/are TRUE? Ⅰ and Ⅱ only Ⅰ and Ⅳ only Ⅰ and Ⅲ only Ⅲ only
Consider the following statements.Daisy chaining is used to assign priorities in attending interrupts.When a device raises a vectored interrupt, the CPU does polling to i...
8.6k
views
answered
Feb 12, 2020
CO and Architecture
gatecse-2020
co-and-architecture
interrupts
1-mark
+
–
3
answers
14
GATE CSE 2020 | Question: 46
Consider the following C functions. int fun1(int n) { static int i= 0; if (n > 0) { ++i; fun1(n-1); } return (i); } int fun2(int n) { static int i= 0; if (n>0) { i = i+ fun1 (n) ; fun2(n-1) ; } return (i); } The return value of $\text{fun}2 (5)$ is _________
Consider the following C functions.int fun1(int n) { static int i= 0; if (n 0) { ++i; fun1(n-1); } return (i); }int fun2(int n) { static int i= ...
23.2k
views
commented
Feb 12, 2020
Programming in C
gatecse-2020
numerical-answers
programming-in-c
recursion
2-marks
+
–
2
answers
15
GATE CSE 2020 | Question: 45
For $n>2$, let $a \in \{0,1\}^n$ be a non-zero vector. Suppose that $x$ is chosen uniformly at random from $\{0,1\}^n$. Then, the probability that $\displaystyle{} \Sigma_{i=1}^n a_i x_i$ is an odd number is______________
For $n>2$, let $a \in \{0,1\}^n$ be a non-zero vector. Suppose that $x$ is chosen uniformly at random from $\{0,1\}^n$. Then, the probability that $\displaystyle{} \Sigm...
12.1k
views
answer selected
Feb 12, 2020
Probability
gatecse-2020
numerical-answers
probability
uniform-distribution
2-marks
+
–
5
answers
16
GATE CSE 2020 | Question: 37
Consider a schedule of transactions $T_1$ and $T_2$ ...
Consider a schedule of transactions $T_1$ and $T_2$:$\begin{array}{|c|c|c|c|c|c|c|c|c|c|c|} \hline T_1 & RA & & & RC & & WD & & WB & \text{Commit} & \\ \hline T_2 & & R...
11.7k
views
answer selected
Feb 12, 2020
Databases
gatecse-2020
databases
transaction-and-concurrency
2-marks
+
–
4
answers
17
GATE CSE 2020 | Question: 32
Consider the following languages. $\begin{array}{ll} L_1= \{ wxyx \mid w,x,y \in (0+1)^{+} \} \\ L_2= \{xy \mid x,y \in (a+b)^{*}, \mid x \mid=\mid y \mid, x \neq y \} \end{array}$ ... context- free but not regular and $L_2$ is context-free. Neither $L_1$ nor $L_2$ is context- free. $L_1$ context- free but $L_2$ is not context-free.
Consider the following languages.$$\begin{array}{ll} L_1= \{ wxyx \mid w,x,y \in (0+1)^{+} \} \\ L_2= \{xy \mid x,y \in (a+b)^{*}, \mid x \mid=\mid y \mid, x \neq y \} \e...
17.8k
views
answered
Feb 12, 2020
Theory of Computation
gatecse-2020
theory-of-computation
identify-class-language
2-marks
+
–
3
answers
18
GATE CSE 2020 | Question: 30
A computer system with a word length of $32$ bits has a $16$ MB byte- addressable main memory and a $64$ KB, $4$-way set associative cache memory with a block size of $256$ ... set. $A3$ and $A4$ are mapped to the same cache set. $A1$ and $A3$ are mapped to the same cache set.
A computer system with a word length of $32$ bits has a $16$ MB byte- addressable main memory and a $64$ KB, $4$-way set associative cache memory with a block size of $25...
16.2k
views
answer edited
Feb 12, 2020
CO and Architecture
gatecse-2020
co-and-architecture
cache-memory
2-marks
+
–
4
answers
19
GATE CSE 2020 | Question: 28
Consider the Boolean function $z(a,b,c)$. Which one of the following minterm lists represents the circuit given above? $z=\sum (0,1,3,7)$ $z=\sum (1,4,5,6,7)$ $z=\sum (2,4,5,6,7)$ $z=\sum (2,3,5)$
Consider the Boolean function $z(a,b,c)$. Which one of the following minterm lists represents the circuit given above?$z=\sum (0,1,3,7)$$z=\sum (1,4,5,6,7)$$z=\sum (2,4,5...
7.9k
views
answer selected
Feb 12, 2020
Digital Logic
gatecse-2020
digital-logic
canonical-normal-form
2-marks
+
–
3
answers
20
GATE CSE 2020 | Question: 25
Assume that you have made a request for a web page through your web browser to a web server. Initially the browser cache is empty. Further, the browser is configured to send $\textsf{HTTP}$ requests in non-persistent mode. The web ... small images.The minimum number of $\textsf{TCP}$ connections required to display the web page completely in your browser is__________.
Assume that you have made a request for a web page through your web browser to a web server. Initially the browser cache is empty. Further, the browser is configured to s...
15.1k
views
answer selected
Feb 12, 2020
Computer Networks
gatecse-2020
numerical-answers
computer-networks
application-layer-protocols
1-mark
+
–
3
answers
21
GATE CSE 2020 | Question: 14
Which one of the following is used to represent the supporting many-one relationships of a weak entity set in an entity-relationship diagram? Diamonds with double/bold border Rectangles with double/bold border Ovals with double/bold border Ovals that contain underlined identifiers
Which one of the following is used to represent the supporting many-one relationships of a weak entity set in an entity-relationship diagram?Diamonds with double/bold bor...
12.9k
views
answered
Feb 12, 2020
Databases
gatecse-2020
databases
er-diagram
1-mark
+
–
3
answers
22
GATE CSE 2020 | Question: 7
Which one of the following regular expressions represents the set of all binary strings with an odd number of $1’$s? $((0+1)^*1(0+1)^*1)^*10^*$ $(0^*10^*10^*)^*0^*1$ $10^*(0^*10^*10^*)^*$ $(0^*10^*10^*)^*10^*$
Which one of the following regular expressions represents the set of all binary strings with an odd number of $1’$s?$((0+1)^*1(0+1)^*1)^*10^*$$(0^*10^*10^*)^*0^*1$$10^*...
23.4k
views
commented
Feb 12, 2020
Theory of Computation
gatecse-2020
regular-expression
normal
theory-of-computation
1-mark
+
–
5
answers
23
GATE CSE 2020 | Question: 5
The preorder traversal of a binary search tree is $15, 10, 12, 11, 20, 18, 16, 19$. Which one of the following is the postorder traversal of the tree? $10,11,12,15,16,18,19,20$ $11,12,10,16,19,18,20,15$ $20,19,18,16,15,12,11,10$ $19,16,18,20,11,12,10,15$
The preorder traversal of a binary search tree is $15, 10, 12, 11, 20, 18, 16, 19$. Which one of the following is the postorder traversal of the tree?$10,11,12,15,16,18,1...
18.6k
views
answered
Feb 12, 2020
DS
gatecse-2020
binary-search-tree
1-mark
+
–
3
answers
24
GATE CSE 2020 | Question: 8
Consider the following statements. If $L_1 \cup L_2$ is regular, then both $L_1$ and $L_2$ must be regular. The class of regular languages is closed under infinite union. Which of the above statements is/are TRUE? Ⅰ only Ⅱ only Both Ⅰ and Ⅱ Neither Ⅰ nor Ⅱ
Consider the following statements.If $L_1 \cup L_2$ is regular, then both $L_1$ and $L_2$ must be regular.The class of regular languages is closed under infinite union....
13.4k
views
answered
Feb 12, 2020
Theory of Computation
gatecse-2020
theory-of-computation
regular-language
1-mark
+
–
2
answers
25
GATE CSE 2020 | Question: 6
What is the worst case time complexity of inserting $n^{2}$ elements into an AVL-tree with $n$ elements initially? $\Theta (n^{4})$ $\Theta (n^{2})$ $\Theta (n^{2}\log n)$ $\Theta (n^{3})$
What is the worst case time complexity of inserting $n^{2}$ elements into an AVL-tree with $n$ elements initially?$\Theta (n^{4})$$\Theta (n^{2})$$\Theta (n^{2}\log n)$$\...
13.4k
views
answered
Feb 12, 2020
DS
gatecse-2020
binary-tree
avl-tree
1-mark
+
–
0
answers
26
prim's algorithm and krushkal's algorithm
Can someone please provide better explaination about how the complexity can be obtained for prim's and krushkal's algorithms using heaps.. by both binary heap and fibonacci heap... i am stuck there please help with pseudocode or general explaination
Can someone please provide better explaination about how the complexity can be obtained for prim's and krushkal's algorithms using heaps.. by both binary heap and fibonac...
508
views
commented
Aug 23, 2019
0
answers
27
Master's Theorem Recurrence Relation
T (n) = T (n/2) + 2n Using Master's Method What is the Complexity Of This Recurrence Relation? Or Using AnyOther Method?
T (n) = T (n/2) + 2nUsing Master's Method What is the Complexity Of This Recurrence Relation?Or Using AnyOther Method?
889
views
commented
Aug 20, 2018
Algorithms
algorithms
recurrence-relation
time-complexity
master-theorem
+
–
5
answers
28
GATE CSE 2015 Set 1 | Question: 40
An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decrease-key operations on a set of data ... if the goal is to achieve the best total asymptotic complexity considering all the operations? Unsorted array Min - heap Sorted array Sorted doubly linked list
An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decrease-...
23.5k
views
commented
Aug 20, 2018
Algorithms
gatecse-2015-set1
algorithms
data-structures
normal
time-complexity
+
–
2
answers
29
Test Datastructure
We are provided with an undirected connected graph such that weight of all the edges is equal to some constant k. We wish to find the shortest distance between given pair of nodes. Which of the following statements is(are) true? I. We can use Depth First Search to ... correct result only if the given graph is a tree. Only I and II Only II and IV Only III and IV Only II and III
We are provided with an undirected connected graph such that weight of all the edges is equal to some constant k. We wish to find the shortest distance between given pair...
929
views
commented
Aug 20, 2018
Algorithms
algorithms
graph-algorithm
+
–
0
answers
30
Wise to give GATE CSE ?
Hi. I have been preparingfor UPSC for the past four years.Had prepared for other government jobs as well, didnt get through anywhere. I am 27 years old. I wish to do M. Tech in CSE. Will my four year gap be an issue in placements ? My B ... issue. Learning coding skills is also not an issue. I am worried that come placement season, I might be rejected because of my history.
Hi.I have been preparingfor UPSC for the past four years.Had prepared for other government jobs as well, didnt get through anywhere. I am 27 years old. I wish to do M. Te...
243
views
commented
Aug 20, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register