Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User 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
commented
in
Programming in C
Apr 4, 2021
2.8k
views
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
comment edited
in
Operating System
Feb 19, 2021
12.7k
views
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.$
commented
in
Operating System
Feb 18, 2021
10.2k
views
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)$
comment edited
in
DS
Feb 18, 2021
11.5k
views
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}$
answered
in
Operating System
Feb 18, 2021
8.3k
views
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
commented
in
Analytical Aptitude
Feb 18, 2021
14.4k
views
gatecse-2021-set1
analytical-aptitude
logical-reasoning
statements-follow
2-marks
2
answers
7
Gateforum Test Series: Graph Theory - Graph Matching
answer edited
in
Graph Theory
Feb 7, 2021
852
views
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
answered
in
Others
Jan 30, 2021
829
views
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
comment reshown
in
Theory of Computation
Jan 2, 2021
393
views
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 _______.
answered
in
DS
Jan 1, 2021
34.8k
views
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 _______
commented
in
CO and Architecture
Dec 25, 2020
673
views
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$
commented
in
Theory of Computation
Dec 24, 2020
12.6k
views
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
commented
in
CO and Architecture
Dec 23, 2020
6.8k
views
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 )$
commented
in
GATE
Dec 19, 2020
1.3k
views
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
answered
in
Unknown Category
Dec 15, 2020
355
views
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
answered
in
Unknown Category
Dec 15, 2020
308
views
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
answered
in
Unknown Category
Dec 15, 2020
474
views
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
answered
in
Operating System
Dec 9, 2020
475
views
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
answered
in
Operating System
Dec 9, 2020
296
views
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$
answered
in
Others
Dec 8, 2020
324
views
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$
answered
in
DS
Dec 8, 2020
722
views
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
answered
in
Big Data Systems
Dec 8, 2020
994
views
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?
answered
in
Operating System
Dec 8, 2020
3.5k
views
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 ________.
answered
in
Databases
Dec 6, 2020
438
views
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?
answered
in
Compiler Design
Dec 5, 2020
2.6k
views
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) }
answered
in
Algorithms
Sep 28, 2018
455
views
dynamic-programming
algorithms
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...