Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
gaurav_kumar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by gaurav_kumar
1
answer
1
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 37
Suppose that an operating system provides two functions, block() which puts the calling process on the blocked queue, and wakeup(P) which moves process P to the ready queue if it is currently on the blocked queue. ... alternation printing ABABAB . A and B will always run forever with strick alternation printing BABABA . None of these
Suppose that an operating system provides two functions, block() which puts the calling process on the blocked queue, and wakeup(P) which moves process P to the ready que...
406
views
commented
Feb 8
Operating System
goclasses2024-mockgate-14
operating-system
process-synchronization
deadlock-prevention-avoidance-detection
2-marks
+
–
4
answers
2
GATE CSE 2000 | Question: 2.14
Consider the values of $A = 2.0 \times 10^{30}, B = -2.0 \times 10^{30}, C = 1.0,$ and the sequence X:= A + B Y:= A + C X:= X + C Y:= Y + B executed on a computer where floating point numbers are represented with $32$ bits. The values for $X$ and $Y$ will be $X = 1.0, Y = 1.0$ $X = 1.0, Y = 0.0$ $X = 0.0, Y = 1.0$ $X = 0.0, Y = 0.0$
Consider the values of $A = 2.0 \times 10^{30}, B = -2.0 \times 10^{30}, C = 1.0,$ and the sequence X:= A + B Y:= A + C X:= X + C Y:= Y + Bexecuted on a computer where fl...
11.8k
views
commented
Jan 17
Digital Logic
gatecse-2000
digital-logic
number-representation
normal
+
–
6
answers
3
GATE CSE 2000 | Question: 6
Let $S$ be a set of $n$ elements $\left\{1, 2,\ldots, n\right\}$ and $G$ a graph with $2^{n}$ vertices, each vertex corresponding to a distinct subset of $S$. Two vertices are adjacent iff the symmetric difference of the corresponding sets has ... Every vertex in $G$ has the same degree. What is the degree of a vertex in $G$? How many connected components does $G$ have?
Let $S$ be a set of $n$ elements $\left\{1, 2,\ldots, n\right\}$ and $G$ a graph with $2^{n}$ vertices, each vertex corresponding to a distinct subset of $S$. Two vertice...
6.2k
views
commented
Dec 14, 2023
Set Theory & Algebra
gatecse-2000
set-theory&algebra
normal
descriptive
set-theory
+
–
5
answers
4
GATE CSE 2002 | Question: 3
Let $A$ be a set of $n(>0)$ elements. Let $N_r$ be the number of binary relations on $A$ and let $N_f$ be the number of functions from $A$ to $A$ Give the expression for $N_r,$ in terms of $n.$ Give the expression for $N_f,$ terms of $n.$ Which is larger for all possible $n,N_r$ or $N_f$
Let $A$ be a set of $n(>0)$ elements. Let $N_r$ be the number of binary relations on $A$ and let $N_f$ be the number of functions from $A$ to $A$Give the expression for $...
4.0k
views
commented
Dec 14, 2023
Set Theory & Algebra
gatecse-2002
set-theory&algebra
normal
descriptive
relations
+
–
4
answers
5
GATE CSE 1999 | Question: 22-a
Consider the set of relations EMP (Employee-no. Dept-no, Employee-name, Salary) DEPT (Dept-no. Dept-name, Location) Write an SQL query to: Find all employees names who work in departments located at ‘Calcutta’ and whose salary is greater than Rs.50,000. Calculate, for each department number, the number of employees with a salary greater than Rs. 1,00,000.
Consider the set of relationsEMP (Employee-no. Dept-no, Employee-name, Salary)DEPT (Dept-no. Dept-name, Location)Write an SQL query to:Find all employees names who work i...
12.2k
views
commented
Nov 13, 2023
Databases
gate1999
databases
sql
easy
descriptive
+
–
7
answers
6
GATE CSE 2003 | Question: 65
Consider the following $2-3-4$ tree (i.e., B-tree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in constructing the tree. What is the result of inserting $G$ in the above tree? None of the above
Consider the following $2-3-4$ tree (i.e., B-tree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in...
9.9k
views
commented
Nov 11, 2023
Databases
gatecse-2003
databases
b-tree
normal
+
–
3
answers
7
GATE CSE 1997 | Question: 16
A size-balanced binary tree is a binary tree in which for every node the difference between the number of nodes in the left and right subtree is at most $1$. The distance of a node from the root is the length of the path from the root to the ... height $h \geqslant 1$, how many nodes are at distance $h-1$ from the root? Write only the answer without any explanations.
A size-balanced binary tree is a binary tree in which for every node the difference between the number of nodes in the left and right subtree is at most $1$. The distance...
4.9k
views
comment edited
Sep 2, 2022
DS
gate1997
data-structures
binary-tree
normal
descriptive
proof
+
–
2
answers
8
GATE CSE 1989 | Question: 1-v
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given $n$) is ___________.
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given $n$) is ___________.
6.4k
views
comment edited
Apr 23, 2022
Set Theory & Algebra
gate1989
descriptive
set-theory&algebra
binary-operation
+
–
1
answer
9
Block Nested Loop Join
Could Anybody tell me the concept of this block nested join? I have a dount regarding that whether we have to check each block of S for each block of R or each record of R....If R is the outer Loop
Could Anybody tell me the concept of this block nested join?I have a dount regarding that whether we have to check each block of S for each block of R or each record of R...
3.9k
views
comment reshown
Mar 20, 2022
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register