Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
DebRC
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by DebRC
2
answers
1
GATE CSE 2023 | Question: 52
Consider a database of fixed-length records, stored as an ordered file. The database has $25,000$ records, with each record being $100$ bytes, of which the primary key occupies $15$ bytes. The data file is block-aligned in that each data ... required to identify the block in the data file that may contain a record with the key, in the worst case, is _____________.
Consider a database of fixed-length records, stored as an ordered file. The database has $25,000$ records, with each record being $100$ bytes, of which the primary key oc...
11.5k
views
commented
Feb 7, 2023
Databases
gatecse-2023
databases
file-system
indexing
numerical-answers
2-marks
+
–
1
answer
2
GATE CSE 2023 | Question: 12
Which one or more of the following need to be saved on a context switch from one thread $\text{(T1)}$ of a process to another thread $\text{(T2)}$ of the same process? Page table base register Stack pointer Program counter General purpose registers
Which one or more of the following need to be saved on a context switch from one thread $\text{(T1)}$ of a process to another thread $\text{(T2)}$ of the same process?Pag...
9.7k
views
commented
Feb 6, 2023
Operating System
gatecse-2023
operating-system
process-and-threads
multiple-selects
1-mark
+
–
0
answers
3
GATE CSE 2023 | Memory Based Question: 18
In general which of the following CPU scheduling algorithms suffers from starvation? SJF FCFS Round robin Priority
In general which of the following CPU scheduling algorithms suffers from starvation?SJFFCFSRound robinPriority
1.1k
views
commented
Feb 6, 2023
Operating System
memorybased-gatecse2023
goclasses
operating-system
process-scheduling
multiple-selects
+
–
6
answers
4
GATE CSE 2014 Set 2 | Question: 55
Consider the main memory system that consists of $8$ memory modules attached to the system bus, which is one word wide. When a write request is made, the bus is occupied for $100$ nanoseconds (ns) by the data, address, and control signals. ... bus at any time. The maximum number of stores (of one word each) that can be initiated in $1$ millisecond is ________
Consider the main memory system that consists of $8$ memory modules attached to the system bus, which is one word wide. When a write request is made, the bus is occupied ...
26.6k
views
commented
Feb 3, 2023
Operating System
gatecse-2014-set2
operating-system
memory-management
numerical-answers
normal
+
–
3
answers
5
DRDO CSE 2022 Paper 2 | Question: 24
Compute the following: $3^{32} \bmod 80$.
Compute the following: $3^{32} \bmod 80$.
528
views
commented
Feb 2, 2023
Quantitative Aptitude
drdocse-2022-paper2
quantitative-aptitude
modular-arithmetic
5-marks
descriptive
+
–
0
answers
6
Can DCFL be ambiguous?
Can DCFL be ambiguous?
Can DCFL be ambiguous?
442
views
commented
Feb 2, 2023
Theory of Computation
theory-of-computation
dcfl
ambiguous
+
–
1
answer
7
Unacademy Practice Question
Consider a 4 way set associative cache of size 16 KB organized into 4 words block. Cache memory is designed with the write back protocol having the miss ratio of read and write operations as 30% and 40% respectively. The tine taken by ... 50% read requests and 50% write requests. What is the average memory access time considering both read and write operations ?
Consider a 4 way set associative cache of size 16 KB organized into 4 words block. Cache memory is designed with the write back protocol having the miss ratio of read and...
734
views
commented
Feb 1, 2023
CO and Architecture
machine-instruction
co-and-architecture
+
–
4
answers
8
GATE CSE 2021 Set 2 | Question: 48
Consider a three-level page table to translate a $39-$bit virtual address to a physical address as shown below: The page size is $\text{4 KB} \;(1\text{KB}=2^{10}$ bytes$)$ and page table entry size at every level is $8$ bytes. A ... $P$ across all levels is _________ $\text{KB}$.
Consider a three-level page table to translate a $39-$bit virtual address to a physical address as shown below:The page size is $\text{4 KB} \;(1\text{KB}=2^{10}$ bytes$)...
28.1k
views
commented
Feb 1, 2023
Operating System
gatecse-2021-set2
numerical-answers
operating-system
memory-management
page-replacement
2-marks
+
–
4
answers
9
GATE CSE 2006 | Question: 5
For which one of the following reasons does internet protocol(IP) use the time-to-live(TTL) field in IP datagram header? Ensure packets reach destination within that time Discard packets that reach later than that time Prevent packets from looping indefinitely Limit the time for which a packet gets queued in intermediate routers
For which one of the following reasons does internet protocol(IP) use the time-to-live(TTL) field in IP datagram header?Ensure packets reach destination within that timeD...
11.3k
views
commented
Feb 1, 2023
Computer Networks
gatecse-2006
computer-networks
ip-addressing
ip-packet
easy
+
–
1
answer
10
Made Easy test series
answer given is 33
answer given is 33
517
views
commented
Jan 31, 2023
Programming in C
programming-in-c
output
made-easy-test-series
+
–
0
answers
11
Number of possible permutations that can be obtained using stack for input seq
Number of possible permutations that can be obtained using stack if the input sequence is 1, 2, 3, 4, 5 (in the order) is
Number of possible permutations that can be obtained using stack if the input sequence is 1, 2, 3, 4, 5 (in the order) is
577
views
commented
Jan 31, 2023
Algorithms
algorithms
stack
+
–
1
answer
12
GATE CSE 2021 Set 1 | GA Question: 8
There are five bags each containing identical sets of ten distinct chocolates. One chocolate is picked from each bag. The probability that at least two chocolates are identical is __________ $0.3024$ $0.4235$ $0.6976$ $0.8125$
There are five bags each containing identical sets of ten distinct chocolates. One chocolate is picked from each bag.The probability that at least two chocolates are iden...
10.7k
views
commented
Jan 31, 2023
Quantitative Aptitude
gatecse-2021-set1
quantitative-aptitude
probability
2-marks
+
–
12
answers
13
GATE CSE 2014 Set 1 | Question: 27
Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size used is $2$ KB. The time taken (in msec) by the TCP connection to get back to $32$ KB congestion window is _________.
Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size u...
37.5k
views
commented
Jan 31, 2023
Computer Networks
gatecse-2014-set1
computer-networks
tcp
congestion-control
numerical-answers
normal
+
–
8
answers
14
GATE CSE 2008 | Question: 14, ISRO2016-74
What is the maximum size of data that the application layer can pass on to the TCP layer below? Any size $2^{16}$ bytes - size of TCP header $2^{16}$ bytes $1500$ bytes
What is the maximum size of data that the application layer can pass on to the TCP layer below?Any size$2^{16}$ bytes - size of TCP header$2^{16}$ bytes$1500$ bytes
17.6k
views
commented
Jan 31, 2023
Computer Networks
gatecse-2008
easy
computer-networks
application-layer-protocols
isro2016
+
–
1
answer
15
Operand forwarding Made Easy Question
Consider 4-stage (IF, ID, EX, WB) pipeline used to execute the following code. All instructions are spending are spending one cycle on all the stages but ALU instructions are spending 3 cycles on 3rd stage. I1: LOAD R0, ... Number of cycles are saved using operand forwarding over without operand forwarding is? Can someone please explain by drawing the diagram?
Consider 4-stage (IF, ID, EX, WB) pipeline used to execute the following code. All instructions are spending are spending one cycle on all the stages but ALU instructions...
918
views
commented
Jan 30, 2023
CO and Architecture
pipelining
co-and-architecture
operand-forwarding
made-easy-test-series
+
–
2
answers
16
GATE CSE 2015 Set 1 | Question: 50
A variable $x$ is said to be live at a statement $s_{i}$ in a program if the following three conditions hold simultaneously: There exists a statement $S_{j}$ that uses $x$ There is a path from $S_{i}$ to $S_{j}$ in the flow graph corresponding to the program The path ... above control flow graph are $\text{p, s, u}$ $\text{r, s, u}$ $\text{r, u}$ $\text{q, v}$
A variable $x$ is said to be live at a statement $s_{i}$ in a program if the following three conditions hold simultaneously:There exists a statement $S_{j}$ that uses $x$...
25.9k
views
commented
Jan 30, 2023
Compiler Design
gatecse-2015-set1
compiler-design
live-variable-analysis
normal
+
–
2
answers
17
GATE CSE 1990 | Question: 3-xi
A graph is planar if and only if, It does not contain a subgraph homeomorphic to $k_{5}$ and $k_{3, 3}$. It does not contain a subgraph isomorphic to $k_{5}$ and $k_{3, 3}$. It does not contain a subgraph isomorphic to $k_{5}$ or $k_{3, 3}$ It does not contain a subgraph homeomorphic to $k_{5}$ or $k_{3, 3}$.
A graph is planar if and only if,It does not contain a subgraph homeomorphic to $k_{5}$ and $k_{3, 3}$.It does not contain a subgraph isomorphic to $k_{5}$ and $k_{3, 3}$...
12.5k
views
commented
Jan 28, 2023
Graph Theory
gate1990
normal
graph-theory
graph-planarity
multiple-selects
+
–
1
answer
18
TestBook Website
Assume that host A and host C are connected through intermediate bridge and router labeled B and R respectively. Determine how many times each frame has to visit the network layer, data link layer and physical layer during a transmission from A to C. 1 Network Layer - 4, Data ... 3, Data Link Layer - 3, Physical Layer - 4 4 Network Layer - 4, Data Link Layer - 4, Physical Layer - 5
Assume that host A and host C are connected through intermediate bridge and router labeled B and R respectively. Determine how many times each frame has to visit the netw...
424
views
answered
Jan 26, 2023
Computer Networks
computer-networks
network-layer
data-link-layer
+
–
1
answer
19
Pure Aloha | Made Easy Full Syllabus Test
A group of N stations shares a 100 Kbps pure ALOHA channel. Each station outputs a 1000 byte frame on average once every 50 seconds. The maximum value of N is ________. This is the solution they have provided, and i cannot make any sense out of it.
A group of N stations shares a 100 Kbps pure ALOHA channel. Each station outputs a 1000 byte frame on average once every 50 seconds. The maximum value of N is ________. ...
1.9k
views
comment edited
Jan 26, 2023
Computer Networks
pure-aloha
+
–
3
answers
20
GATE CSE 2022 | Question: 50
Consider the data transfer using $\text{TCP}$ over a $1 \; \text{Gbps}$ link. Assuming that the maximum segment lifetime $\text{(MSL)}$ is set to $60 \; \text{seconds},$ the minimum number of bits required for the sequence number field of the $\text{TCP}$ header, to prevent the sequence number space from wrapping around during the $\text{MSL}$ is ________________.
Consider the data transfer using $\text{TCP}$ over a $1 \; \text{Gbps}$ link. Assuming that the maximum segment lifetime $\text{(MSL)}$ is set to $60 \; \text{seconds},$ ...
7.4k
views
comment edited
Jan 26, 2023
Computer Networks
gatecse-2022
numerical-answers
computer-networks
tcp
2-marks
+
–
2
answers
21
GATE CSE 2022 | Question: 38
Consider the following languages: $L_{1} = \{ ww | w \in \{a,b\}^{\ast} \}$ $L_{2} = \{a^{n} b^{n} c^{m} | m,n \geq 0 \}$ $L_{3} = \{a^{m} b^{n} c^{n} | m,n \geq 0 \}$ Which of the following statements is/are $\text{FALSE}?$ ... $L_{2}$ is context-free. $L_{2}, L_{3}$ and $L_{2} \cap L_{3}$ all are context-free. Neither $L_{1}$ nor its complement is context-free.
Consider the following languages:$L_{1} = \{ ww | w \in \{a,b\}^{\ast} \}$$L_{2} = \{a^{n} b^{n} c^{m} | m,n \geq 0 \}$$L_{3} = \{a^{m} b^{n} c^{n} | m,n \geq 0 \}$Which ...
11.0k
views
comment edited
Jan 21, 2023
Theory of Computation
gatecse-2022
theory-of-computation
context-free-language
multiple-selects
2-marks
+
–
0
answers
22
Theory Of Computation | Minimum Pumping Length | MPL
MSQ Consider the following languages and their MPL (Minimum Pumping Length) Which among these are TRUE: L1 = aa(b)* :: MPL(L1) = 3 L2 = aa(aa)* :: MPL(L2) = 2 L2 = aa(aa)* :: MPL(L2) = 3 L2 = aa(aa)* :: MPL(L2) = 4 L3 = aa(ab)* :: MPL(L3) = 4 L4 = aa(b)* + aad(c)* :: MPL(L4) = 4
MSQ Consider the following languages and their MPL (Minimum Pumping Length)Which among these are TRUE: L1 = aa(b)* :: MPL(L1) = 3 L2 = aa(aa)* :: MPL(L2) = 2 L2 = aa(aa)*...
667
views
comment edited
Jan 19, 2023
Theory of Computation
theory-of-computation
pumping-lemma
+
–
1
answer
23
Pumping Lemma
If L = { x == y | where x and y are equal binary numbers} and Σ = {0, 1, =} How can I prove that L is not a regular language using pumping lemma and contradiction?
If L = { x == y | where x and y are equal binary numbers} and Σ = {0, 1, =}How can I prove that L is not a regular language using pumping lemma and contradiction?
424
views
answer edited
Jan 18, 2023
Theory of Computation
theory-of-computation
pumping-lemma
regular-language
+
–
1
answer
24
Aptitude | Gate Test Series
472
views
answered
Jan 17, 2023
Verbal Aptitude
general-aptitude
virtual-gate-test-series
+
–
1
answer
25
ZEAL TEST
Isn’t the “No of independent rows”= RAnk of matrix?
Isn’t the “No of independent rows”= RAnk of matrix?
592
views
comment edited
Jan 14, 2023
Linear Algebra
zeal
+
–
7
answers
26
GATE CSE 2016 Set 1 | Question: GA08
Consider the following statements relating to the level of poker play of four players $P,Q,R \ and \ S$. $P$ always beats $Q$ $R$ always beats $S$ $S$ loses to $P$ only sometimes. $R$ always loses to $Q$ Which of the following can be logically ... $S$ is the absolute worst player in the set (i). only (ii) only (i) and (ii) only' neither (i) nor (ii)
Consider the following statements relating to the level of poker play of four players $P,Q,R \ and \ S$.$P$ always beats $Q$$R$ always beats $S$$S$ loses to $P$ only som...
7.8k
views
comment edited
Jan 13, 2023
Analytical Aptitude
gatecse-2016-set1
analytical-aptitude
normal
statements-follow
+
–
0
answers
27
Test series
Can anyone solve this recurrence relation T(n) = 3T(n-1) + O(n^2) Its ans is O(3^n n^2)
Can anyone solve this recurrence relation T(n) = 3T(n-1) + O(n^2)Its ans is O(3^n n^2)
572
views
comment edited
Jan 13, 2023
Algorithms
recurrence-relation
algorithms
time-complexity
asymptotic-notation
+
–
0
answers
28
Made Easy Test Series | Prog. and DS | Dynamic Memory Allocation | Malloc
Which line number contains an error or warning:
Which line number contains an error or warning:
683
views
comment edited
Jan 10, 2023
Programming in C
programming-in-c
data-structures
memory-management
made-easy-test-series
numerical-answers
+
–
3
answers
29
CO and Arcitecture | RISC | Instruction pipelining
MSQ Which among the following statements is/are TRUE for a pipelined RISC computer. PC is usually incremented during Instruction Cycle (IF,ID) PC may be incremented during Execution Cycle (EX,MA,WB) Filling the Accumulator ... during the Instruction Cycle (IF,ID) All non-register memory fetching operations are done in Load instructions only.
MSQWhich among the following statements is/are TRUE for a pipelined RISC computer.PC is usually incremented during Instruction Cycle (IF,ID)PC may be incremented during ...
749
views
comment edited
Dec 16, 2022
CO and Architecture
pipelining
multiple-selects
co-and-architecture
machine-instruction
instruction-execution
+
–
12
answers
30
GATE CSE 2016 Set 2 | Question: 30
Suppose the functions $F$ and $G$ can be computed in $5$ and $3$ nanoseconds by functional units $U_{F}$ and $U_{G}$, respectively. Given two instances of $U_{F}$ and two instances of $U_{G}$, it is required to implement ... $1 \leq i \leq 10$. Ignoring all other delays, the minimum time required to complete this computation is ____________ nanoseconds.
Suppose the functions $F$ and $G$ can be computed in $5$ and $3$ nanoseconds by functional units $U_{F}$ and $U_{G}$, respectively. Given two instances of $U_{F}$ and two...
22.4k
views
comment edited
Dec 12, 2022
CO and Architecture
gatecse-2016-set2
co-and-architecture
data-path
normal
numerical-answers
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register