Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
samarpita
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by samarpita
1
answer
1
Made easy test
i=10 j=1 a=i*j b=i+j if a<=b goto 3 else goto 8 a=a+1 i=i-1 goto 2 Include start and end nodes Find the number of nodes and edges in the control flow graph of the above code?
i=10j=1a=i*jb=i+jif a<=b goto 3else goto 8a=a+1i=i-1 goto 2 Include start and end nodes Find the number of nodes and edges in the control flow graph of the...
1.9k
views
answer selected
Nov 18, 2023
Compiler Design
compiler-design
intermediate-code
made-easy-test-series
+
–
0
answers
2
COA
Which of the following is/are true for a CPU which does not have any stack pointer registers? A Interrupts are not possible. B All subroutine calls and interrupts are possible. C It cannot have nested subroutines call. D It cannot have subroutine call instruction.
Which of the following is/are true for a CPU which does not have any stack pointer registers?A Interrupts are not possible. B All subroutine calls and interrupts are po...
479
views
commented
Jan 25, 2023
CO and Architecture
co-and-architecture
self-doubt
interrupts
+
–
1
answer
3
Aptitude | Gate Test Series
472
views
commented
Jan 20, 2023
Verbal Aptitude
general-aptitude
virtual-gate-test-series
+
–
5
answers
4
GATE IT 2006 | Question: 6
Given a boolean function $f (x_1, x_2, \ldots, x_n),$ which of the following equations is NOT true? $f (x_1, x_2, \ldots, x_n) = x_1'f(x_1, x_2, \ldots, x_n) + x_1f(x_1, x_2, \ldots, x_n)$ ... $f (x_1, x_2, \ldots , x_n) = f(0, x_2, , x_n) + f(1, x_2, \ldots, x_n)$
Given a boolean function $f (x_1, x_2, \ldots, x_n),$ which of the following equations is NOT true?$f (x_1, x_2, \ldots, x_n) = x_1'f(x_1, x_2, \ldots, x_n) + x_1f(x_1, x...
6.1k
views
commented
Jan 14, 2023
Set Theory & Algebra
gateit-2006
set-theory&algebra
functions
normal
+
–
1
answer
5
ZEAL TEST
Isn’t the “No of independent rows”= RAnk of matrix?
Isn’t the “No of independent rows”= RAnk of matrix?
592
views
commented
Jan 14, 2023
Linear Algebra
zeal
+
–
6
answers
6
GATE IT 2007 | Question: 6, ISRO2011-25
A processor takes $12$ cycles to complete an instruction I. The corresponding pipelined processor uses $6$ stages with the execution times of $3, 2, 5, 4, 6$ and $2$ cycles respectively. What is the asymptotic speedup assuming that a very large number of instructions are to be executed? $1.83$ $2$ $3$ $6$
A processor takes $12$ cycles to complete an instruction I. The corresponding pipelined processor uses $6$ stages with the execution times of $3, 2, 5, 4, 6$ and $2$ cycl...
13.2k
views
comment edited
Dec 29, 2022
CO and Architecture
gateit-2007
co-and-architecture
pipelining
normal
isro2011
+
–
13
answers
7
GATE CSE 2004 | Question: 82
Let $A[1,\ldots,n]$ be an array storing a bit ($1$ or $0$) at each location, and $f(m)$ is a function whose time complexity is $\Theta(m)$. Consider the following program fragment written in a C like language: counter = 0; for (i=1; i<=n; i++) { if ( ... The complexity of this program fragment is $\Omega(n^2)$ $\Omega (n\log n) \text{ and } O(n^2)$ $\Theta(n)$ $o(n)$
Let $A[1,\ldots,n]$ be an array storing a bit ($1$ or $0$) at each location, and $f(m)$ is a function whose time complexity is $\Theta(m)$. Consider the following program...
20.0k
views
commented
Dec 21, 2022
Algorithms
gatecse-2004
algorithms
time-complexity
normal
+
–
3
answers
8
GATE CSE 2010 | Question: 33
A $5-$stage pipelined processor has Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Write Operand (WO) stages. The IF, ID, OF and WO stages take $1$ clock cycle each for any instruction. The PO stage takes $1$ clock cycle for ... $13$ $15$ $17$ $19$
A $5-$stage pipelined processor has Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Write Operand (WO) stages. The IF, ID,...
21.8k
views
commented
Dec 14, 2022
CO and Architecture
gatecse-2010
co-and-architecture
pipelining
normal
+
–
12
answers
9
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
+
–
5
answers
10
GATE CSE 1998 | Question: 18
For a set-associative Cache organization, the parameters are as follows: ... $1 \leq m \leq l$. Give the value of the hit ratio for $l = 1$.
For a set-associative Cache organization, the parameters are as follows:$$\begin{array}{|c|l|} \hline \text {$t _c$} & \text{Cache Access Time }\\\hline \text{$t _m$} &...
11.9k
views
commented
Dec 9, 2022
CO and Architecture
gate1998
co-and-architecture
cache-memory
descriptive
+
–
5
answers
11
GATE IT 2007 | Question: 44, ISRO2015-34
A hard disk system has the following parameters : Number of tracks $= 500$ Number of sectors/track $= 100$ Number of bytes /sector $= 500$ Time taken by the head to move from one track to adjacent track $= 1 \ ms$ Rotation speed $= 600 \ rpm$. What is ... time taken for transferring $250$ bytes from the disk ? $300.5 \ ms$ $255.5 \ ms$ $255 \ ms$ $300 \ ms$
A hard disk system has the following parameters :Number of tracks $= 500$Number of sectors/track $= 100$Number of bytes /sector $= 500$Time taken by the head to move from...
22.7k
views
commented
Dec 8, 2022
Operating System
gateit-2007
operating-system
disk
normal
isro2015
+
–
6
answers
12
GATE IT 2007 | Question: 26
Consider $n$ jobs $J_1, J_2 \dots J_n$ such that job $J_i$ has execution time $t_i$ and a non-negative integer weight $w_i$ ... the jobs? Non-decreasing order of $t_i$ Non-increasing order of $w_i$ Non-increasing order of $w_it_i$ Non-increasing order of $w_i/t_i$
Consider $n$ jobs $J_1, J_2 \dots J_n$ such that job $J_i$ has execution time $t_i$ and a non-negative integer weight $w_i$. The weighted mean completion time of the jobs...
14.4k
views
commented
Nov 29, 2022
Operating System
gateit-2007
operating-system
process-scheduling
normal
+
–
7
answers
13
GATE CSE 1990 | Question: 7-b
In a two-level virtual memory, the memory access time for main memory, $t_{M}=10^{-8}$ sec, and the memory access time for the secondary memory, $t_D=10^{-3}$ sec. What must be the hit ratio, $H$ such that the access efficiency is within $80$ percent of its maximum value?
In a two-level virtual memory, the memory access time for main memory, $t_{M}=10^{-8}$ sec, and the memory access time for the secondary memory, $t_D=10^{-3}$ sec. What m...
18.9k
views
commented
Nov 28, 2022
Operating System
gate1990
descriptive
operating-system
virtual-memory
+
–
4
answers
14
GATE CSE 1999 | Question: 2.11
Which of the following is/are advantage(s) of virtual memory? Faster access to memory on an average. Processes can be given protected address spaces. Linker can assign addresses independent of where the program will be loaded in physical memory. Program larger than the physical memory size can be run.
Which of the following is/are advantage(s) of virtual memory?Faster access to memory on an average.Processes can be given protected address spaces.Linker can assign addre...
13.7k
views
commented
Nov 27, 2022
Operating System
gate1999
operating-system
virtual-memory
easy
+
–
1
answer
15
Operating System | Round Robin | Preemption & Context Switch
Suppose only a process P1 is executing, using Round Robin scheduling. After the time slice expires, the same process comes back into execution. This could be considered as: (Time Slice of RR is smaller than burst of P1) Only preemption Only context switch Both preemption and context switch None
Suppose only a process P1 is executing, using Round Robin scheduling. After the time slice expires, the same process comes back into execution. This could be considered a...
742
views
commented
Nov 27, 2022
Operating System
round-robin-scheduling
operating-system
context-switch
+
–
6
answers
16
GATE CSE 2015 Set 3 | Question: 10
Two processes $X$ and $Y$ ... proposed solution guarantees mutual exclusion and prevents deadlock The proposed solution fails to prevent deadlock and fails to guarantee mutual exclusion
Two processes $X$ and $Y$ need to access a critical section. Consider the following synchronization construct used by both the processes$$\begin{array}{|l|l|}\hline \text...
20.4k
views
commented
Nov 26, 2022
Operating System
gatecse-2015-set3
operating-system
process-synchronization
normal
+
–
11
answers
17
GATE IT 2005 | Question: 41
Given below is a program which when executed spawns two concurrent processes : semaphore $X : = 0 ;$ /* Process now forks into concurrent processes $P1$ & $P2$ ... (II) are true. (I) is true but (II) is false. (II) is true but (I) is false Both (I) and (II) are false
Given below is a program which when executed spawns two concurrent processes :semaphore $X : = 0 ;$/* Process now forks into concurrent processes $P1$ & $P2$ */$\begin{ar...
23.7k
views
commented
Nov 26, 2022
Operating System
gateit-2005
operating-system
process-synchronization
normal
+
–
5
answers
18
GATE IT 2006 | Question: 55
Consider the solution to the bounded buffer producer/consumer problem by using general semaphores $S, F,$ and $E$. The semaphore $S$ is the mutual exclusion semaphore initialized to $1$. The semaphore $F$ corresponds to the number of free slots in the buffer and is ... Signal $(F)$ in the Consumer process (I) only (II) only Neither (I) nor (II) Both (I) and (II)
Consider the solution to the bounded buffer producer/consumer problem by using general semaphores $S, F,$ and $E$. The semaphore $S$ is the mutual exclusion semaphore ini...
13.2k
views
commented
Nov 26, 2022
Operating System
gateit-2006
operating-system
process-synchronization
normal
+
–
7
answers
19
GATE CSE 2016 Set 1 | Question: 50
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n-1}$. In the code, function $\text{pmax}$ ... in the critical section at any time The bounded wait condition is satisfied The progress condition is satisfied It cannot cause a deadlock
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n-1}$. In the code, function $\text{pmax}$ returns an inte...
47.1k
views
comment edited
Nov 25, 2022
Operating System
gatecse-2016-set1
operating-system
process-synchronization
difficult
ambiguous
+
–
6
answers
20
GATE IT 2006 | Question: 56
For each of the four processes $P_1, P_2, P_3,$ and $P_4$. The total size in kilobytes $(KB)$ ... $\text{S < P < T}$ $\text{S < T < P}$ $\text{T < S < P}$
For each of the four processes $P_1, P_2, P_3,$ and $P_4$. The total size in kilobytes $(KB)$ and the number of segments are given below.$$\small \begin{array}{|c|c|c|}\h...
28.6k
views
commented
Nov 24, 2022
Operating System
gateit-2006
operating-system
memory-management
difficult
+
–
3
answers
21
GATE CSE 2001 | Question: 20
Consider a disk with the $100$ tracks numbered from $0$ to $99$ rotating at $3000$ rpm. The number of sectors per track is $100$ and the time to move the head between two successive tracks is $0.2$ millisecond. Consider a set of disk ... at track $0$ and the elevator algorithm is used to schedule disk requests, what is the worse case time to complete all the requests?
Consider a disk with the $100$ tracks numbered from $0$ to $99$ rotating at $3000$ rpm. The number of sectors per track is $100$ and the time to move the head between two...
10.8k
views
commented
Nov 24, 2022
Operating System
gatecse-2001
operating-system
disk
normal
descriptive
+
–
6
answers
22
GATE IT 2004 | Question: 63
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let $P_h$ ... but starvation-free The scheme is neither deadlock-free nor starvation-free The scheme is both deadlock-free and starvation-free
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same ti...
13.3k
views
commented
Nov 23, 2022
Operating System
gateit-2004
operating-system
normal
deadlock-prevention-avoidance-detection
+
–
6
answers
23
GATE CSE 1999 | Question: 2-18, ISRO2008-46
Raid configurations of the disks are used to provide Fault-tolerance High speed High data density (A) & (B)
Raid configurations of the disks are used to provideFault-tolerance High speedHigh data density(A) & (B)
10.2k
views
commented
Nov 23, 2022
Operating System
gate1999
operating-system
disk
easy
isro2008
+
–
18
answers
24
GATE CSE 2019 | Question: 21
The value of $3^{51} \text{ mod } 5$ is _____
The value of $3^{51} \text{ mod } 5$ is _____
18.0k
views
commented
Nov 18, 2022
Combinatory
gatecse-2019
numerical-answers
combinatory
modular-arithmetic
1-mark
+
–
7
answers
25
GATE CSE 2008 | Question: 54
Which of the following are true? A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation Multi-level access link (or display) arrangement is ... activation records II and V only I, III and IV only I, II and V only II, III and V only
Which of the following are true?A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursio...
19.9k
views
commented
Nov 18, 2022
Compiler Design
gatecse-2008
compiler-design
difficult
runtime-environment
+
–
6
answers
26
GATE CSE 2003 | Question: 79
A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, ... tables of this process is $\text{8 KB}$ $\text{12 KB}$ $\text{16 KB}$ $\text{20 KB}$
A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical...
23.6k
views
comment edited
Nov 16, 2022
Operating System
gatecse-2003
operating-system
normal
virtual-memory
+
–
1
answer
27
GO Classes Test Series 2023 | Digital Logic | Test 3 | Question: 20
Consider the following circuit : If $A n, B n$ denote the next state corresponding to current states $A, B$ ... of states in the state transition diagram of this circuit that have a transition back to the same state is $2 .$
Consider the following circuit :If $A n, B n$ denote the next state corresponding to current states $A, B$ respectively, thenFor this circuit, which of the following is/a...
432
views
comment edited
Nov 7, 2022
Digital Logic
goclasses2024-dl-3-weekly-quiz
goclasses
digital-logic
sequential-circuit
flip-flop
multiple-selects
2-marks
+
–
4
answers
28
GATE CSE 2016 Set 1 | Question: 10
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ($n$ refers to the number of items in the queue) ? Both operations can be performed in $O(1)$ ... both operations will be $\Omega (n)$. Worst case time complexity for both operations will be $\Omega (\log n)$
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ($n$ refers to ...
23.1k
views
comment edited
Oct 30, 2022
DS
gatecse-2016-set1
data-structures
queue
normal
+
–
4
answers
29
GATE CSE 2021 Set 2 | Question: 42
Consider the following multi-threaded code segment (in a mix of C and pseudo-code), invoked by two processes $P_1$ and $P_2$, and each of the processes spawns two threads $T_1$ and $T_2$: int x = 0; // global Lock L1; // global main () { create a ... the value of $y$ as $2.$ Both $T_1$ and $T_2$, in both the processes, will print the value of $y$ as $1.$
Consider the following multi-threaded code segment (in a mix of C and pseudo-code), invoked by two processes $P_1$ and $P_2$, and each of the processes ...
10.1k
views
comment edited
Oct 30, 2022
Operating System
gatecse-2021-set2
multiple-selects
operating-system
threads
2-marks
+
–
3
answers
30
GATE CSE 2006 | Question: 30
For $s\in (0+1)^{*}$ let $d(s)$ denote the decimal value of $s ($e.g. $d (101) = 5 ).$ Let $L=\left \{ s\in (0+1)^*\mid d(s) \text{ mod } 5=2 \text{ and }d(s) \text{ mod } 7\neq 4 \right \}$Which ... following statements is true? $L$ is recursively enumerable, but not recursive $L$ is recursive, but not context-free $L$ is context-free, but not regular $L$ is regular
For $s\in (0+1)^{*}$ let $d(s)$ denote the decimal value of $s ($e.g. $d (101) = 5 ).$ Let$$L=\left \{ s\in (0+1)^*\mid d(s) \text{ mod } 5=2 \text{ and }d(s) \text{ mod ...
7.5k
views
comment edited
Oct 19, 2022
Theory of Computation
gatecse-2006
theory-of-computation
normal
identify-class-language
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register