Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by prajjwalsingh_11
4
answers
1
GATE CSE 2017 Set 2 | Question: 50
A message is made up entirely of characters from the set $X=\{P, Q, R, S, T\}$ ... message of $100$ characters over $X$ is encoded using Huffman coding, then the expected length of the encoded message in bits is ______.
A message is made up entirely of characters from the set $X=\{P, Q, R, S, T\}$. The table of probabilities for each of the characters is shown below:$$\begin{array}{|c|c|...
21.2k
views
commented
Jan 24, 2021
Algorithms
gatecse-2017-set2
huffman-code
numerical-answers
algorithms
+
–
1
answer
2
GATE Overflow Test Series | Computer Organization and Architecture | Test 1 | Question: 18
Consider a $5$-stage pipeline - IF (Instruction Fetch), ID (Instruction Decode and register read), EX (Execute), MEM (Memory) and WB (Write Back). All register reads take place in the second phase of a clock cycle and ... read) hazards by $B$ and WAW (Write after write) hazards by $C,$ then $A+B+C = $_____
Consider a $5$-stage pipeline - IF (Instruction Fetch), ID (Instruction Decode and register read), EX (Execute), MEM (Memory) and WB (Write Back). All register reads take...
779
views
commented
Jan 17, 2021
CO and Architecture
go2025-coa-1
numerical-answers
pipelining
+
–
2
answers
3
GATE Overflow Test Series | Operating Systems | Test 2 | Question: 23
A typical program has $10\%$ memory instructions. Assume there are $2\%$ data TLB misses, each requiring $100$ extra cycles to be handled. Also assume that each instruction requires $1$ cycle to execute, data TLB access ... takes $45$ extra cycles to be handled. How long (in cycles) would it take to execute $100$ instructions?
A typical program has $10\%$ memory instructions. Assume there are $2\%$ data TLB misses, each requiring $100$ extra cycles to be handled. Also assume that each instructi...
548
views
commented
Dec 29, 2020
Operating System
go2025-os-2
numerical-answers
cache-memory
+
–
1
answer
4
GATE Overflow Test Series | Operating Systems | Test 2 | Question: 20
If the virtual address space supported is $2^{64}\:\text{bits},$ the page size is $4\:\text{Kbyte,}$ the size of the physical memory is $2\:\text{GB,}$ the size of a PTE is four bytes for standard page table and eight bytes for inverted ... $2^{51}\;\text{bytes},\;2^{22}\;\text{bytes}$ $2^{50}\;\text{bytes},\;256\;\text{bytes}$
If the virtual address space supported is $2^{64}\:\text{bits},$ the page size is $4\:\text{Kbyte,}$ the size of the physical memory is $2\:\text{GB,}$ the size of a PTE ...
388
views
commented
Dec 29, 2020
Operating System
go2025-os-2
memory-management
paging
virtual-memory
+
–
1
answer
5
GATE Overflow Test Series | Operating Systems | Test 1 | Question: 19
Consider the following two process synchronization solution. Assume all assignments are atomic. flag[0] = flag[1] = FALSE; P0: do { flag[0] = TRUE; turn = 1; while (flag[1] && ( ... appropriate choices) Race condition may be possible. Mutual exclusion is guaranteed. Progress is guaranteed. Bounded waiting is guaranteed.
Consider the following two process synchronization solution. Assume all assignments are atomic. flag[0] = flag = FALSE; P0: do { flag[0] = TRUE; turn = 1; while (flag &...
348
views
commented
Dec 29, 2020
Operating System
go2025-os-1
process-synchronization
multiple-selects
+
–
1
answer
6
GATE Overflow Test Series | Computer Networks | Test 1 | Question: 22
A $2\;\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $32,604\;\text{km}$ and speed of the signal is $3\times 10^8\;\text{ m/s}$. Assuming that the acknowledgment ... for a channel utilization of $35\%$ for a satellite link using $\text{GoBack-63}$ sliding window protocol is _______
A $2\;\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $32,604\;\text{km}$ and speed of the signal is $3\times 10^8\;\text{ m/s}...
484
views
commented
Dec 29, 2020
Computer Networks
go2025-cn-1
numerical-answers
sliding-window
normal
+
–
2
answers
7
GATE Overflow Test Series | Theory of Computation | Test 1 | Question: 18
Let $L$ be the language containing only the single string $w,$ where $w = \begin{cases} 0 &\text{if India wins 2023 Cricket World Cup}\\ 1 &\text{otherwise} \end{cases}$Which of the following ... $L$ is not recursive $L$ is not recursively enumerable $L$ is recursively enumerable but not recursive
Let $L$ be the language containing only the single string $w,$ where$$w = \begin{cases}0 &\text{if India wins 2023 Cricket World Cup}\\1 &\text{otherwise}\end{cases}$$Whi...
449
views
commented
Dec 26, 2020
Theory of Computation
go2025-toc-1
identify-class-language
+
–
1
answer
8
GATE Overflow Test Series | Computer Organization and Architecture | Test 1 | Question: 21
In a C program, an array is declared as $\text{double arr[8192]}$. The starting address of the array is $\textsf{0x}00000000$. This program is run on a computer that has a $4$-way set associative cache ... empty and that no other data or instruction accesses are to be considered.) $2048$ $1536$ $256$ $1024$
In a C program, an array is declared as $\text{double arr[8192]}$. The starting address of the array is $\textsf{0x}00000000$. This program is run on a computer that has ...
465
views
commented
Dec 25, 2020
CO and Architecture
go2025-coa-1
normal
cache-memory
+
–
1
answer
9
GATE Overflow Test Series | Algorithms | Test 2 | Question: 30
If $s$ is the source node in the following graph, the number of back edges, forward edges, cross edges and tree edges respectively are (assuming that whenever there is a choice in the depth-first traversal), the vertex earlier in the alphabetical order is to be chosen) ____________ $3,2,2,6$ $2,4,1,6$ $3,2,1,4$ $2,1,4,6$
If $s$ is the source node in the following graph, the number of back edges, forward edges, cross edges and tree edges respectively are (assuming that whenever there is a ...
486
views
commented
Dec 22, 2020
Algorithms
go2025-algorithms-2
graph-connectivity
+
–
1
answer
10
GATE Overflow Test Series | Algorithms | Test 2 | Question: 11
If the worst case time complexity by the best algorithm for finding the outdegrees and indegrees of all the vertices (extra space can be used if required) in a dense graph of $n$ vertices (number of edges $= \Theta(n^2))$ represented in Adjacency List ... $2\times a + 3 \times b + 5 \times c + 7 \times d = $ _____
If the worst case time complexity by the best algorithm for finding the outdegrees and indegrees of all the vertices (extra space can be used if required) in a dense grap...
445
views
commented
Dec 22, 2020
Algorithms
go2025-algorithms-2
time-complexity
graph-representation
numerical-answers
+
–
2
answers
11
GATE Overflow Test Series | Algorithms | Test 1 | Question: 29
Consider the following C function for arguments $m,n > 1$ int foo(int n, int m) { while (m != n) { if(m > n) m = m - n; else n = n - m; } return n; } Which of the following is/are true about the above ... $m,n.$ The space complexity of the function is $\Omega(\log (\min(m,n)))$
Consider the following C function for arguments $m,n 1$int foo(int n, int m) { while (m != n) { if(m n) m = m - n; else n = n - m; } return n; }Which of the following i...
564
views
commented
Dec 21, 2020
Algorithms
go2025-algorithms-1
identify
function
multiple-selects
+
–
2
answers
12
GATE Overflow Test Series | Algorithms | Test 1 | Question: 10
Which of the following is/are the possible array contents after second pass of Quick Sort for the following initial ordering assuming first element is taken as pivot?$34, 8, 64, 51, 32, 21$ $8, 21, 32, 34, 51, 64$ $8, 32, 34, 51, 64, 21$ $8, 34, 51, 64, 32, 21$ $8, 34, 64, 51, 32, 21$
Which of the following is/are the possible array contents after second pass of Quick Sort for the following initial ordering assuming first element is taken as pivot?$$34...
324
views
commented
Dec 21, 2020
Algorithms
go2025-algorithms-1
quick-sort
+
–
1
answer
13
Computer Architecture-Secondary Memory
Susheel is setting up a website. He bought a fancy new hard disk which advertises: an 8 ms average seek time. 10000 RPM or roughly 6 ms per rotation. a2 ms overhead for each disk operation. a transfer speed of 10,000,000 bytes per ... have an average size of 8000 bytes. How much time will it take on an average to read a random HTML file from the disk?
Susheel is setting up a website. He bought a fancy new hard disk which advertises:• an 8 ms average seek time.• 10000 RPM or roughly 6 ms per rotation.• a2 ms overh...
691
views
answered
Dec 2, 2020
CO and Architecture
co-and-architecture
secondary-memory
+
–
9
answers
14
GATE CSE 2015 Set 1 | Question: 54
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
24.6k
views
answered
Oct 27, 2020
Graph Theory
gatecse-2015-set1
graph-theory
graph-connectivity
normal
graph-planarity
numerical-answers
+
–
11
answers
15
GATE CSE 2014 Set 1 | Question: 47
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true? There exists a $y$ in the interval $(0,1)$ such that $f(y) = f(y+1)$ For every $y$ ... the function in the interval $(0,2)$ is $1$ There exists a $y$ in the interval $(0,1)$ such that $f(y)$ = $-f(2-y)$
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true?There exis...
21.0k
views
answered
Oct 9, 2020
Calculus
gatecse-2014-set1
calculus
continuity
normal
+
–
4
answers
16
GATE CSE 2006 | Question: 58
Consider the following grammar: $S\rightarrow FR$ $ R\rightarrow * S\mid \varepsilon $ $ F\rightarrow id $ In the predictive parser table $M$ of the grammar the entries $M[S,id]$ and $M[R,\$]$ respectively are $ \left \{ S\rightarrow FR \right \} $ and $ ... $ \left \{ F\rightarrow id \right \} $ and $ \left \{ R\rightarrow \varepsilon \right \} $
Consider the following grammar:$S\rightarrow FR$$ R\rightarrow * S\mid \varepsilon $$ F\rightarrow id $In the predictive parser table $M$ of the grammar the entries $M[S...
8.2k
views
comment edited
Aug 2, 2020
Compiler Design
gatecse-2006
compiler-design
parsing
normal
+
–
7
answers
17
GATE IT 2008 | Question: 34
Consider a CFG with the following productions. $S \to AA \mid B$ $A \to 0A \mid A0 \mid 1$ $B \to 0B00 \mid 1$ $S$ is the start symbol, $A$ and $B$ ... $\{0, 1\}$ containing at least two $0$'s
Consider a CFG with the following productions.$S \to AA \mid B$$A \to 0A \mid A0 \mid 1$$B \to 0B00 \mid 1$$S$ is the start symbol, $A$ and $B$ are non-terminals and 0 an...
15.0k
views
answered
Jul 14, 2020
Theory of Computation
gateit-2008
theory-of-computation
context-free-language
normal
+
–
3
answers
18
GATE IT 2007 | Question: 49
Consider the following grammars. Names representing terminals have been specified in capital letters. ... $G_1$ and $G_2$ are regular Both $G_1$ and $G_2$ are context-free but neither of them is regular
Consider the following grammars. Names representing terminals have been specified in capital letters.$$\begin{array}{llll}\hline \text{$G1$ :} & \text{stmnt} & \text{$\...
12.8k
views
commented
Jul 14, 2020
Theory of Computation
gateit-2007
theory-of-computation
context-free-language
normal
+
–
4
answers
19
GATE IT 2006 | Question: 14
Consider the relations $r_{1}\text{(P, Q, R)}$ and $r_{2}\text{(R, S, T)}$ with primary keys $\text{P}$ and $\text{R}$ respectively. The relation $r_{1}$ contains $2000$ tuples and $r_{2}$ contains $2500$ tuples. The maximum size of the join $r_1⋈ r_2$ is : $2000$ $2500$ $4500$ $5000$
Consider the relations $r_{1}\text{(P, Q, R)}$ and $r_{2}\text{(R, S, T)}$ with primary keys $\text{P}$ and $\text{R}$ respectively. The relation $r_{1}$ contains $2000$ ...
17.4k
views
commented
Jul 6, 2020
Databases
gateit-2006
databases
joins
natural-join
normal
+
–
4
answers
20
GATE CSE 1990 | Question: 10b
One giga bytes of data are to be organized as an indexed-sequential file with a uniform blocking factor $8.$ Assuming a block size of $1$ Kilo bytes and a block refrencing pointer size of $32$ bits, find out the number of levels of indexing ... size of the master index. The referencing capability (fanout ratio) per block of index storage may be considered to be $32$.
One giga bytes of data are to be organized as an indexed-sequential file with a uniform blocking factor $8.$ Assuming a block size of $1$ Kilo bytes and a block refrencin...
6.4k
views
commented
Jul 5, 2020
Databases
gate1990
databases
indexing
descriptive
+
–
5
answers
21
GATE IT 2006 | Question: 79
A pipelined processor uses a 4-stage instruction pipeline with the following stages: Instruction fetch (IF), Instruction decode (ID), Execute (EX) and Writeback (WB). The arithmetic operations as well as the load and store operations are carried out in the EX ... is used. The number of clock cycles required to complete the sequence of instructions is $10$ $12$ $14$ $16$
A pipelined processor uses a 4-stage instruction pipeline with the following stages: Instruction fetch (IF), Instruction decode (ID), Execute (EX) and Writeback (WB). The...
17.4k
views
commented
Jun 27, 2020
CO and Architecture
gateit-2006
co-and-architecture
pipelining
normal
+
–
4
answers
22
GATE CSE 2005 | Question: 68
A $5$ stage pipelined CPU has the following sequence of stages: IF - instruction fetch from instruction memory RD - Instruction decode and register read EX - Execute: ALU operation for data and address computation MA - Data memory access - for write access, the ... taken to complete the above sequence of instructions starting from the fetch of $I_1$? $8$ $10$ $12$ $15$
A $5$ stage pipelined CPU has the following sequence of stages:IF – instruction fetch from instruction memoryRD – Instruction decode and register readEX – Execute: ...
46.2k
views
commented
Jun 27, 2020
CO and Architecture
gatecse-2005
co-and-architecture
pipelining
normal
+
–
8
answers
23
GATE CSE 2007 | Question: 45
What is the $\text{time complexity}$ of the following recursive function? int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); } $\Theta(n^2)$ $\Theta(n \log_2n)$ $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$
What is the $\text{time complexity}$ of the following recursive function?int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); ...
32.0k
views
commented
Jun 18, 2020
Algorithms
gatecse-2007
algorithms
time-complexity
normal
+
–
6
answers
24
GATE CSE 2004 | Question: 49
A unix-style I-nodes has $10$ direct pointers and one single, one double and one triple indirect pointers. Disk block size is $1$ Kbyte, disk block address is $32$ bits, and $48$-bit integers are used. What is the maximum possible file size? $2^{24}$ bytes $2^{32}$ bytes $2^{34}$ bytes $2^{48}$ bytes
A unix-style I-nodes has $10$ direct pointers and one single, one double and one triple indirect pointers. Disk block size is $1$ Kbyte, disk block address is $32$ bits, ...
27.6k
views
answered
Jun 14, 2020
Operating System
gatecse-2004
operating-system
disk
normal
+
–
6
answers
25
GATE IT 2004 | Question: 65
The semaphore variables full, empty and mutex are initialized to $0$, $n$ and $1$, respectively. Process P1 repeatedly adds one item at a time to a buffer of size $n$, and process P2 repeatedly removes one item at a time from the same buffer using the programs given below. In ... P(empty), V(full) P(empty), V(full), P(empty), V(full) P(empty), V(full), P(full), V(empty)
The semaphore variables full, empty and mutex are initialized to $0$, $n$ and $1$, respectively. Process P1 repeatedly adds one item at a time to a buffer of size $n$, an...
7.1k
views
commented
Jun 14, 2020
Operating System
gateit-2004
operating-system
process-synchronization
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register