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 svmk_18
3
answers
1
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.7k
views
commented
Feb 8
Operating System
gatecse-2021-set1
multiple-selects
operating-system
page-replacement
1-mark
+
–
7
answers
2
GATE CSE 2002 | Question: 2.12
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the furthest ... which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the rig...
23.3k
views
commented
Dec 28, 2023
DS
gatecse-2002
data-structures
binary-tree
normal
+
–
4
answers
3
GATE CSE 1989 | Question: 12a
The below figure shows a $B^+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted into the $B^+$ tree. Obtain the modified $B^+$ tree after insertion.
The below figure shows a $B^+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted...
8.4k
views
commented
Dec 24, 2023
Databases
descriptive
gate1989
databases
b-tree
+
–
7
answers
4
GATE CSE 2008 | Question: 23
Which of the following statements is true for every planar graph on $n$ vertices? The graph is connected The graph is Eulerian The graph has a vertex-cover of size at most $\frac{3n}{4}$ The graph has an independent set of size at least $\frac{n}{3}$
Which of the following statements is true for every planar graph on $n$ vertices?The graph is connectedThe graph is EulerianThe graph has a vertex-cover of size at most $...
55.1k
views
commented
Dec 17, 2023
Graph Theory
gatecse-2008
graph-theory
normal
graph-planarity
+
–
2
answers
5
GATE IT 2006 | Question: 57
The wait and signal operations of a monitor are implemented using semaphores as follows. In the following, $x$ is a condition variable, mutex is a semaphore initialized to $1$, $x$_sem is a semaphore initialized to $0$, $x$_count is the number of processes waiting on semaphore $x$_sem, ... $V(next), P(x\_sem)$ $P(next), V(x\_sem)$ $P(x\_sem), V(x\_sem)$
The wait and signal operations of a monitor are implemented using semaphores as follows. In the following,$x$ is a condition variable,mutex is a semaphore initialized to ...
6.5k
views
commented
Nov 14, 2023
Operating System
gateit-2006
operating-system
process-synchronization
semaphore
normal
+
–
6
answers
6
GATE CSE 2013 | Question: 39
A certain computation generates two arrays a and b such that $a[i] = f(i)$ for $0 \leq i < n$ and $b[i] = g(a[i])$ for $0 \leq i < n$. Suppose this computation is decomposed into two concurrent processes $X$ and $Y$ such that $X$ computes the array $a$ and $Y$ computes the ... EntryY(R, S) { V(S); P(R); } ExitX(R, S) { V(R); P(S); } EntryY(R, S) { V(S); P(R); }
A certain computation generates two arrays a and b such that $a[i] = f(i)$ for $0 \leq i < n$ and $b[i] = g(a[i])$ for $0 \leq i < n$. Suppose this computation is decompo...
28.4k
views
commented
Nov 3, 2023
Operating System
gatecse-2013
operating-system
process-synchronization
normal
+
–
3
answers
7
GATE CSE 1997 | Question: 73
A concurrent system consists of $3$ processes using a shared resource $R$ in a non-preemptible and mutually exclusive manner. The processes have unique priorities in the range $1 \dots 3$, $3$ being the highest priority. It is required to synchronize ... =true; else begin V(proceed [priority]); busy:=true; end V(mutex) Give the pseudo code for the procedure release_R.
A concurrent system consists of $3$ processes using a shared resource $R$ in a non-preemptible and mutually exclusive manner. The processes have unique priorities in the ...
1.9k
views
commented
Oct 31, 2023
Operating System
gate1997
operating-system
process-synchronization
descriptive
+
–
4
answers
8
GATE CSE 2014 Set 1 | Question: 5
The value of the dot product of the eigenvectors corresponding to any pair of different eigenvalues of a $4-by-4$ symmetric positive definite matrix is ___________
The value of the dot product of the eigenvectors corresponding to any pair of different eigenvalues of a $4-by-4$ symmetric positive definite matrix is ___________
14.4k
views
commented
Oct 30, 2023
Linear Algebra
gatecse-2014-set1
linear-algebra
eigen-value
numerical-answers
normal
+
–
5
answers
9
GATE CSE 2003 | Question: 74
The following program fragment is written in a programming language that allows global variables and does not allow nested declarations of functions. global int i=100, j=5; void P(x) { int i=10; print(x+10); i=200; j=20; print (x); } main() {P(i ... by name parameter passing mechanism, the values printed by the above program are $115, 220$ $25, 220$ $25, 15$ $115, 105$
The following program fragment is written in a programming language that allows global variables and does not allow nested declarations of functions.global int i=100, j=5...
12.9k
views
commented
Oct 27, 2023
Compiler Design
gatecse-2003
programming
compiler-design
parameter-passing
runtime-environment
normal
+
–
3
answers
10
GATE IT 2007 | Question: 17
Exponentiation is a heavily used operation in public key cryptography. Which of the following options is the tightest upper bound on the number of multiplications required to compute $b^n \bmod{m}, 0 \leq b, n \leq m$ ? $O(\log n)$ $O(\sqrt n)$ $O\Biggl (\frac{n}{\log n} \Biggr )$ $O(n)$
Exponentiation is a heavily used operation in public key cryptography. Which of the following options is the tightest upper bound on the number of multiplications require...
8.9k
views
commented
Oct 20, 2023
Algorithms
gateit-2007
algorithms
time-complexity
normal
+
–
2
answers
11
GATE CSE 1991 | Question: 12,b
Suppose a database consist of the following relations: SUPPLIER (SCODE,SNAME,CITY). PART (PCODE,PNAME,PDESC,CITY). PROJECTS (PRCODE,PRNAME,PRCITY). SPPR (SCODE,PCODE,PRCODE,QTY). Write algebraic solution to the following : Get SCODE values for ... both projects PR1 and PR2. Get PRCODE values for projects supplied by at least one supplier not in the same city.
Suppose a database consist of the following relations:SUPPLIER (SCODE,SNAME,CITY). PART (PCODE,PNAME,PDESC,CITY). PROJECTS (PRCODE,PRNAME,PRCITY). SPPR (SCODE,PCODE,PRCOD...
2.4k
views
commented
Sep 28, 2023
Databases
sql
gate1991
normal
databases
descriptive
+
–
7
answers
12
GATE IT 2005 | Question: 12
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number to be inserted in the tree must be $p$ $p + 1$ $n - p$ $n - p + 1$
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number...
13.4k
views
commented
Jul 11, 2023
DS
gateit-2005
data-structures
normal
binary-search-tree
+
–
2
answers
13
GATE IT 2007 | Question: 38
The following expression was to be realized using $2$-input AND and OR gates. However, during the fabrication all $2$-input AND gates were mistakenly substituted by $2$-input NAND gates. $(a.b).c + (a'.c).d + (b.c).d + a. d$ What is the function finally ... $a' + b' + c' + d'$ $a' + b + c' + d'$ $a' + b' + c + d'$
The following expression was to be realized using $2$-input AND and OR gates. However, during the fabrication all $2$-input AND gates were mistakenly substituted by $2$-i...
6.3k
views
commented
Jul 11, 2023
Digital Logic
gateit-2007
digital-logic
circuit-output
normal
+
–
3
answers
14
GATE CSE 2001 | Question: 14
Insert the following keys one by one into a binary search tree in the order specified.$15, 32, 20, 9, 3, 25, 12, 1$Show the final binary search tree after the insertions. Draw the binary search tree after deleting $15$ from it. Complete the statements $S1$ ... ; x = depth (t -> left); S1: ___________; S2: if (x > y) return __________; S3: else return _______; }
Insert the following keys one by one into a binary search tree in the order specified.$$15, 32, 20, 9, 3, 25, 12, 1$$Show the final binary search tree after the insertion...
6.9k
views
commented
Jul 7, 2023
DS
gatecse-2001
data-structures
binary-search-tree
normal
descriptive
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register