Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
wander
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by wander
3
answers
1
UGC NET CSE | October 2020 | Part 2 | Question: 11
Suppose you are compiling on a machine with $1$-byte chars, $2$-byte shorts, $4$-byte ints, and $8$-byte doubles, and with alignment rules that require the address of every primitive data element to be an integer multiple of the element's size. ... int i; } A[10]; /*10 element array of structs */ $150$ bytes $320$ bytes $240$ bytes $200$ bytes
Suppose you are compiling on a machine with $1$-byte chars, $2$-byte shorts, $4$-byte ints, and $8$-byte doubles, and with alignment rules that require the address of eve...
2.8k
views
commented
Apr 4, 2021
Programming in C
ugcnetcse-oct2020-paper2
programming-in-c
array
+
–
3
answers
2
GATE CSE 2021 Set 1 | Question: 11
In the context of operating systems, which of the following statements is/are correct with respect to paging? Paging helps solve the issue of external fragmentation Page size has no impact on internal fragmentation Paging incurs memory overheads Multi-level paging is necessary to support pages of different sizes
In the context of operating systems, which of the following statements is/are correct with respect to paging?Paging helps solve the issue of external fragmentationPage si...
12.6k
views
comment edited
Feb 19, 2021
Operating System
gatecse-2021-set1
multiple-selects
operating-system
page-replacement
1-mark
+
–
4
answers
3
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
commented
Feb 18, 2021
Operating System
gatecse-2021-set2
multiple-selects
operating-system
threads
2-marks
+
–
3
answers
4
GATE CSE 2021 Set 1 | Question: 10
A binary search tree $T$ contains $n$ distinct elements. What is the time complexity of picking an element in $T$ that is smaller than the maximum element in $T$? $\Theta(n\log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta (1)$
A binary search tree $T$ contains $n$ distinct elements. What is the time complexity of picking an element in $T$ that is smaller than the maximum element in $T$?$\Theta(...
11.5k
views
comment edited
Feb 18, 2021
DS
gatecse-2021-set1
data-structures
binary-search-tree
time-complexity
1-mark
+
–
1
answer
5
GATE CSE 2021 Set 1 | Question: 15
Consider a linear list based directory implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file metadata, such as the list of pointers to the data blocks. Consider a given directory ... $\textsf{foo}$ Renaming of an existing file in $\textsf{foo}$ Opening of an existing file in $\textsf{foo}$
Consider a linear list based directory implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file meta...
8.3k
views
answered
Feb 18, 2021
Operating System
gatecse-2021-set1
multiple-selects
operating-system
file-system
1-mark
+
–
9
answers
6
GATE CSE 2021 Set 1 | GA Question: 9
Given below are two statements $1$ and $2$, and two conclusions $\text{I}$ and $\text{II}$ $\text{Statement 1:}$ All bacteria are microorganisms. $\text{Statement 2:}$ All pathogens are microorganisms. $\text{Conclusion I:}$ Some pathogens are ... Either conclusion $\text{I}$ or $\text{II}$ is correct Neither conclusion $\text{I}$ nor $\text{II}$ is correct
Given below are two statements $1$ and $2$, and two conclusions $\text{I}$ and $\text{II}$$\text{Statement 1:}$ All bacteria are microorganisms.$\text{Statement 2:}$ All ...
14.0k
views
commented
Feb 18, 2021
Analytical Aptitude
gatecse-2021-set1
analytical-aptitude
logical-reasoning
statements-follow
2-marks
+
–
2
answers
7
Gateforum Test Series: Graph Theory - Graph Matching
836
views
answer edited
Feb 7, 2021
Graph Theory
gateforum-test-series
discrete-mathematics
graph-theory
graph-matching
+
–
1
answer
8
CMI-2018-DataScience-A: 19
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet three inhabitants: Ramesh, Bharath and Menaka. Ramesh claims, Bharat is a knave. Bharat says, Menaka and I are both ... correct? Bharat is a knave Ramesh is a knight Exactly two of the three are knaves Exactly two of the three are knights
A very special island is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You meet three inhabitants: Ramesh, Bharath and Menak...
821
views
answered
Jan 30, 2021
Others
cmi2018-datascience
+
–
2
answers
9
Concider the language L2
A. L2 is DCFL B. L2 is CFL but not DCFL C. L2 is not CFL D. None of these
A. L2 is DCFLB. L2 is CFL but not DCFLC. L2 is not CFLD. None of these
372
views
comment reshown
Jan 2, 2021
12
answers
10
GATE CSE 2016 Set 1 | Question: 41
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly $Top(S)$ returns the element at the top of $S$ without removing ... = Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Simi...
34.5k
views
answered
Jan 1, 2021
DS
gatecse-2016-set1
data-structures
queue
difficult
numerical-answers
+
–
2
answers
11
Test by Bikram | Computer Organization and Architecture | Test 2 | Question: 7
A system is having $4$ way set associative cache of $256$ KB. The cache line size is $8$ words and each word has $32$ bits. Suppose memory addresses are $64$ bits long. Then number of bits required for the index field of the cache memory is _______
A system is having $4$ way set associative cache of $256$ KB. The cache line size is $8$ words and each word has $32$ bits. Suppose memory addresses are $64$ bits long. T...
606
views
commented
Dec 25, 2020
CO and Architecture
tbb-coa-2
numerical-answers
co-and-architecture
cache-memory
+
–
11
answers
12
GATE CSE 2008 | Question: 52
Match the following NFAs with the regular expressions they correspond to: P Q R S $\epsilon + 0\left(01^*1+00\right)^*01^*$ $\epsilon + 0\left(10^*1+00\right)^*0$ $\epsilon + 0\left(10^*1+10\right)^*1$ $\epsilon + 0\left(10^*1+10\right)^*10^*$ $P-2, Q-1, R-3, S-4$ $P-1, Q-3, R-2, S-4$ $P-1, Q-2, R-3, S-4$ $P-3, Q-2, R-1, S-4$
Match the following NFAs with the regular expressions they correspond to: P Q R S $\epsilon + 0\left(01^*1+00\right)^*01^*$$\epsilon + 0\left(10^*1+00\right)^*0$$\epsilon...
12.5k
views
commented
Dec 24, 2020
Theory of Computation
gatecse-2008
theory-of-computation
finite-automata
normal
+
–
1
answer
13
Q 12 (control unit design) MadeEasy workBook
a micro programmed control memory supports 256 instructions .Every instruction on average consume 8 micro operations .The system supports 16 flag conditions and 48 control signals.If the horizontal micro programming is used,what is the size of each control word let 1 address control instruction is used. (a) 61 bits (b) 63 bits (c) 6 bits (d) 8 bits
a micro programmed control memory supports 256 instructions .Every instruction on average consume 8 micro operations .The system supports 16 flag conditions and 48 cont...
6.8k
views
commented
Dec 23, 2020
CO and Architecture
co-and-architecture
microprogramming
+
–
1
answer
14
Test by Bikram | Mock GATE | Test 1 | Question: 46
Assume there are n transactions $T^{1}$., $T^{2}$., .... ,$T^{n}$. Every transaction Writes a value of variable $X$ and then it is read by its successive transaction, like, $T^{1}$ writes a value of $X$ that is read by $T^{2}$ ... of transaction rollbacks are required to recover the schedule is ? $0$ $\left ( n \right )$ $1$ $\left ( n-1 \right )$
Assume there are n transactions $T^{1}$., $T^{2}$., .... ,$T^{n}$.Every transaction Writes a value of variable $X$ and then it is read by its successive transaction, l...
1.2k
views
commented
Dec 19, 2020
GATE
tbb-mockgate-1
transaction-and-concurrency
databases
+
–
1
answer
15
NIELIT Scientist B 2020 November: 78
____________ uses pretty good privacy algorithm. Electronic mails File encryption Both Electronic mails and File encryption None of the options
____________ uses pretty good privacy algorithm.Electronic mailsFile encryptionBoth Electronic mails and File encryptionNone of the options
345
views
answered
Dec 15, 2020
Unknown Category
nielit-scb-2020
+
–
1
answer
16
NIELIT Scientist B 2020 November: 76
In ____________ $VMs$ do not simulate the underlying hardware. Para Virtualization Full Virtualization Hardware-Assisted Virtualization Network Virtualization
In ____________ $VMs$ do not simulate the underlying hardware.Para VirtualizationFull VirtualizationHardware-Assisted VirtualizationNetwork Virtualization
301
views
answered
Dec 15, 2020
Unknown Category
nielit-scb-2020
+
–
1
answer
17
NIELIT Scientist B 2020 November: 67
___________ is a partitioning of single physical server into multiple logical servers. Virtualization Private cloud Hybrid cloud Public cloud
___________ is a partitioning of single physical server into multiple logical servers.VirtualizationPrivate cloudHybrid cloudPublic cloud
463
views
answered
Dec 15, 2020
Unknown Category
nielit-scb-2020
+
–
2
answers
18
GATE Overflow | Operating Systems | Test 1 | Question: 19
The E_CS() and L_CS() functions to implement critical section of a process are realized using Test-and-Set instruction as stated below: void E_CS(X) { while(Test-and-Set(X); } void L_CS(X) { X=0; } In above code snippet, X is a ... into CS in FIFO order more than 1 process can enter into CS at same time i only i and ii ii and iii iv only
The E_CS() and L_CS() functions to implement critical section of a process are realized using Test-and-Set instruction as stated below:void E_CS(X) { while(Test-and-Set(X...
449
views
answered
Dec 9, 2020
Operating System
go-os-1
operating-system
process-synchronization
+
–
2
answers
19
GATE Overflow | Operating Systems | Test 1 | Question: 22
On a virtual memory system with FIFO page replacement policy, for an arbitrary page access pattern, increasing the number of page frames in main memory will always decrease the number of page faults always increase the number of page faults sometimes increase the number of page faults do not affect the number of page faults
On a virtual memory system with FIFO page replacement policy, for an arbitrary page access pattern, increasing the number of page frames in main memory willalways decreas...
285
views
answered
Dec 9, 2020
Operating System
go-os-1
operating-system
page-replacement
+
–
1
answer
20
UGC NET CSE | June 2007 | Part 2 | Question: 27
Which of the following techniques are used to control data flow? Windowing Routing $\text{RPCs}$ Buffering $1,4$ $2,3,4$ $1,3,4$ $1,2,3,4$
Which of the following techniques are used to control data flow?WindowingRouting$\text{RPCs}$Buffering $1,4$$2,3,4$$1,3,4$$1,2,3,4$
314
views
answered
Dec 8, 2020
Others
ugcnetcse-june2007-paper2
+
–
1
answer
21
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 5
A binary search tree contains the values-$1,2,3,4,5,6,7$ and $8.$ The tree is traversed in preorder and the values are printed out. Which of the following sequences is a valid output? $5\;\;3\;\;1\;\;2\;\;4\;\;7\;\;8\;\;6\;\;$ ... $5\;\;3\;\;2\;\;4\;\;1\;\;6\;\;7\;\;8$ $5\;\;3\;\;1\;\;2\;\;4\;\;7\;\;6\;\;8$
A binary search tree contains the values-$1,2,3,4,5,6,7$ and $8.$ The tree is traversed in preorder and the values are printed out. Which of the following sequences is a ...
708
views
answered
Dec 8, 2020
DS
nielit2017oct-assistanta-cs
data-structures
binary-search-tree
tree-traversal
+
–
1
answer
22
UGC NET CSE | October 2020 | Part 2 | Question: 13
The data node and name node in HADOOP are Worker Node and Master Node respectively Master Node and Worker Node respectively Both Worker Nodes Both Master Nodes
The data node and name node in HADOOP areWorker Node and Master Node respectivelyMaster Node and Worker Node respectivelyBoth Worker NodesBoth Master Nodes
971
views
answered
Dec 8, 2020
Big Data Systems
ugcnetcse-oct2020-paper2
non-gate
big-data-systems
+
–
8
answers
23
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 39 (Page No. 177)
Consider the following piece of C code: void main( ) { fork( ); fork( ); exit( ); } How many child processes are created upon execution of this program?
Consider the following piece of C code: void main( ) { fork( ); fork( ); exit( ); }How many child processes are created upon execution of this program?
3.4k
views
answered
Dec 8, 2020
Operating System
tanenbaum
operating-system
process-and-threads
fork-system-call
descriptive
+
–
2
answers
24
Test by Bikram | Databases | Test 2 | Question: 16
$\sigma_{A=B \text{ and } B=C \text{ and } C=A} \bigg( \Pi_A (R) \times \Pi_B (R) \times \Pi_C (R) \bigg)$ The number of rows returned by the above relational algebraic expression is ________.
$\sigma_{A=B \text{ and } B=C \text{ and } C=A} \bigg( \Pi_A (R) \times \Pi_B (R) \times \Pi_C (R) \bigg)$The number of rows returned by the above relational algebraic ex...
412
views
answered
Dec 6, 2020
Databases
tbb-dbms-2
numerical-answers
databases
relational-algebra
+
–
4
answers
25
Directed acyclic graph
In questions like, when asked to find the edges or nodes in the DAG of following expression, a=a+b*c-(a+b)+(b*c) do we also consider "=" as a node and its related edges?
In questions like, when asked to find the edges or nodes in the DAG of following expression,a=a+b*c-(a+b)+(b*c)do we also consider "=" as a node and its related edges?
2.6k
views
answered
Dec 5, 2020
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
+
–
2
answers
26
dynamic prgramming
Given a two dimensional array A with n rows and k columns initialized to -1 . what is the time complexity of the function f(A,m,m)? int f(int **a,int n,int k) { if ((n<=k)||(k<=1)) return 1; if(a[n][k]==-1) a[n][k]=f(a,n-1,k)+f(a,n-1,k-1); return a[n][k]; } a)theta(m) b)theta(m^2) c)theta(2^m) d)O(1) }
Given a two dimensional array A with n rows and k columns initialized to -1 . what is the time complexity of the function f(A,m,m)?int f(int a,int n,int k){ if ((n<=...
449
views
answered
Sep 28, 2018
Algorithms
dynamic-programming
algorithms
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register