Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
sauravgahlawat
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by sauravgahlawat
11
answers
1
GATE CSE 2018 | Question: 1
Which one of the following is a closed form expression for the generating function of the sequence $\{a_n\}$, where $a_n = 2n +3 \text{ for all } n=0, 1, 2, \dots$? $\frac{3}{(1-x)^2}$ $\frac{3x}{(1-x)^2}$ $\frac{2-x}{(1-x)^2}$ $\frac{3-x}{(1-x)^2}$
Which one of the following is a closed form expression for the generating function of the sequence $\{a_n\}$, where $a_n = 2n +3 \text{ for all } n=0, 1, 2, \dots$?$\frac...
22.5k
views
commented
Dec 31, 2022
Combinatory
gatecse-2018
generating-functions
normal
combinatory
1-mark
+
–
2
answers
2
made easy test series for gate cse 2023
please help me out in solving this question. the solution provided there is not upto the mark
please help me out in solving this question. the solution provided there is not upto the mark
1.1k
views
commented
Dec 21, 2022
Programming in C
data-structures
heap-sort
heap
difficult
made-easy-test-series
+
–
3
answers
3
GO Classes Weekly Quiz 13 | Discrete Mathematics | Combinatorics | Question: 7
We want those bit strings of length $10$ which Start and end with the symbol $1.$ No two zeroes are consecutive. How many such bit strings are there?
We want those bit strings of length $10$ whichStart and end with the symbol $1.$No two zeroes are consecutive.How many such bit strings are there?
1.1k
views
commented
Aug 21, 2022
Combinatory
goclasses_wq13
numerical-answers
goclasses
combinatory
counting
2-marks
+
–
1
answer
4
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
commented
Feb 24, 2022
Operating System
gatecse-2021-set1
multiple-selects
operating-system
file-system
1-mark
+
–
4
answers
5
GATE CSE 2008 | Question: 65
Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes? In deadlock prevention, the request for resources is always granted if the resulting state is safe In deadlock avoidance, the request ... safe Deadlock avoidance is less restrictive than deadlock prevention Deadlock avoidance requires knowledge of resource requirements apriori..
Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes?In deadlock prevention, the request for resources is always granted if the result...
23.7k
views
commented
Feb 23, 2022
Operating System
gatecse-2008
operating-system
easy
resource-allocation
+
–
13
answers
6
GATE CSE 2009 | Question: 33
The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows: void enter_CS(X) { while(test-and-set(X)); } void leave_CS(X) { X = 0; } In the above solution, $X$ is a memory location ... at the same time Which of the above statements are TRUE? (I) only (I) and (II) (II) and (III) (IV) only
The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows:void enter_CS(X) { while(test-an...
24.7k
views
commented
Feb 18, 2022
Operating System
gatecse-2009
operating-system
process-synchronization
normal
+
–
5
answers
7
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
Feb 17, 2022
Operating System
gateit-2006
operating-system
process-synchronization
normal
+
–
3
answers
8
GATE CSE 1991 | Question: 01,xiv
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.
5.7k
views
commented
Dec 16, 2021
Set Theory & Algebra
gate1991
set-theory&algebra
partial-order
normal
fill-in-the-blanks
+
–
2
answers
9
GATE CSE 1990 | Question: 3-ix
The number of ways in which $5\; A's, 5\; B's$ and $5\; C's$ can be arranged in a row is: $15!/(5!)^{3}$ $15!$ $\left(\frac{15}{5}\right)$ $15!(5!3!)$.
The number of ways in which $5\; A's, 5\; B's$ and $5\; C's$ can be arranged in a row is:$15!/(5!)^{3}$$15!$$\left(\frac{15}{5}\right)$$15!(5!3!)$.
3.1k
views
commented
Dec 12, 2021
Combinatory
gate1990
normal
combinatory
+
–
2
answers
10
GATE CSE 1993 | Question: 02.7
If $A = \begin{pmatrix} 1 & 0 & 0 & 1 \\ 0 & -1 & 0 & -1 \\ 0 & 0 & i & i \\ 0 & 0 & 0 & -i \end{pmatrix}$ the matrix $A^4$, calculated by the use of Cayley-Hamilton theorem or otherwise, is _______
If $A = \begin{pmatrix} 1 & 0 & 0 & 1 \\ 0 & -1 & 0 & -1 \\ 0 & 0 & i & i \\ 0 & 0 & 0 & -i \end{pmatrix}$ the matrix $A^4$, calculated by the use of Cayley-Hamilton theo...
5.6k
views
answer edited
Dec 6, 2021
Linear Algebra
gate1993
linear-algebra
normal
matrix
fill-in-the-blanks
+
–
5
answers
11
GATE CSE 2012 | Question: 37
How many onto (or surjective) functions are there from an $n$-element $(n ≥ 2)$ set to a $2$-element set? $ 2^{n}$ $2^{n} – 1$ $2^{n} – 2$ $2(2^{n} – 2)$
How many onto (or surjective) functions are there from an $n$-element $(n ≥ 2)$ set to a $2$-element set?$ 2^{n}$$2^{n} – 1$$2^{n} – 2$$2(2^{n} – 2)$
9.2k
views
comment edited
Sep 4, 2021
Set Theory & Algebra
gatecse-2012
set-theory&algebra
functions
normal
+
–
4
answers
12
GATE CSE 1993 | Question: 13
Consider a singly linked list having $n$ nodes. The data items $d_1, d_2, \dots d_n$ are stored in these $n$ nodes. Let $X$ be a pointer to the $j^{\text{th}}$ node $(1 \leq j \leq n)$ in which $d_j$ is stored. A new data item $d$ stored ... insert $d$ into the list to obtain a list having items $d_1, d_2, \dots, d_{j}, d,\dots, d_n$ in order without using the header.
Consider a singly linked list having $n$ nodes. The data items $d_1, d_2, \dots d_n$ are stored in these $n$ nodes. Let $X$ be a pointer to the $j^{\text{th}}$ node $(1 \...
3.6k
views
commented
Aug 29, 2021
DS
gate1993
data-structures
linked-list
normal
descriptive
+
–
2
answers
13
TIFR CSE 2021 | Part B | Question: 1
Consider the following statements about propositional formulas. $\left ( p\wedge q \right )\rightarrow r$ and $\left ( p \rightarrow r \right )\wedge \left ( q\rightarrow r \right )$ are $\textit{not }$ ... values $p$ and $q$, $\text{(i)}$ can be either true or false, while $\text{(ii)}$ is always false.
Consider the following statements about propositional formulas.$\left ( p\wedge q \right )\rightarrow r$ and $\left ( p \rightarrow r \right )\wedge \left ( q\rightarrow ...
847
views
commented
Aug 28, 2021
Mathematical Logic
tifr2021
mathematical-logic
propositional-logic
+
–
9
answers
14
GATE CSE 2019 | Question: 27
Consider the following C program: #include <stdio.h> int r() { static int num=7; return num--; } int main() { for (r();r();r()) printf(“%d”,r()); return 0; } Which one of the following values will be displayed on execution of the programs? $41$ $52$ $63$ $630$
Consider the following C program:#include <stdio.h int r() { static int num=7; return num ; } int main() { for (r();r();r()) printf(“%d”,r()); return 0; }Which one of...
27.1k
views
commented
Aug 15, 2021
Programming in C
gatecse-2019
programming-in-c
programming
2-marks
+
–
3
answers
15
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 20
The possible number of Boolean function of $3$ variables $X,Y$ and $Z$ such that $f(X,Y,Z) = f(X’,Y’,Z’)$ $8$ $16$ $64$ $32$
The possible number of Boolean function of $3$ variables $X,Y$ and $Z$ such that $f(X,Y,Z) = f(X’,Y’,Z’)$$8$$16$$64$$32$
1.3k
views
commented
Jul 29, 2021
Digital Logic
nielit2017oct-assistanta-cs
digital-logic
boolean-algebra
+
–
3
answers
16
GATE IT 2008 | Question: 72
A Binary Search Tree (BST) stores values in the range $37$ to $573$. Consider the following sequence of keys. $81, 537, 102, 439, 285, 376, 305$ $52, 97, 121, 195, 242, 381, 472$ $142, 248, 520, 386, 345, 270, 307$ ... inorder sequence of some BST where $121$ is the root and $52$ is a leaf IV is a postorder sequence of some BST with $149$ as the root
A Binary Search Tree (BST) stores values in the range $37$ to $573$. Consider the following sequence of keys.$81, 537, 102, 439, 285, 376, 305$$52, 97, 121, 195, 242, 381...
6.0k
views
commented
Jul 18, 2021
DS
gateit-2008
data-structures
binary-search-tree
easy
+
–
1
answer
17
GATE CSE 1998 | Question: 1.33
Given two union compatible relations $R_1(A, B)$ and $R_2 (C, D)$, what is the result of the operation $R_1 \Join_{ A = C \wedge B = D} R_2$? $R_1 \cup R_2$ $R_1 \times R_2$ $R_1 – R_2$ $R_1 \cap R_2$
Given two union compatible relations $R_1(A, B)$ and $R_2 (C, D)$, what is the result of the operation $R_1 \Join_{ A = C \wedge B = D} R_2$?$R_1 \cup R_2$$R_1 \times R_2...
7.2k
views
commented
Jun 7, 2021
Databases
gate1998
normal
relational-algebra
+
–
3
answers
18
Gateoverflow Computer architecture 2 exam question
Suppose there are 500 memory references in which 50 misses in the 1st level cache and 20 misses in the 2nd level cache . Let the miss penalty from L2 cache to memory is 100 cycles . Hit time in L2 cache is 20 cycles and hit ... per instruction will be __________ Ans is : 15 Can any explain how to solve this type of question, Thanks in advance.
Suppose there are 500 memory references in which 50 misses in the 1st level cache and 20 misses in the 2nd level cache . Let the miss penalty from L2 cache to memory is 1...
1.3k
views
commented
Jun 7, 2021
CO and Architecture
co-and-architecture
cache-memory
stall-cycle-per-instrution
+
–
3
answers
19
GATE CSE 1997 | Question: 76-a
Consider the following relational database schema: EMP (eno name, age) PROJ (pno name) INVOLVED (eno, pno) EMP contains information about employees. PROJ about projects and involved about which employees involved in which projects. The underlined ... which is equivalent to SQL query. select eno from EMP|INVOLVED where EMP.eno=INVOLVED.eno and INVOLVED.pno=3
Consider the following relational database schema:EMP (eno name, age)PROJ (pno name)INVOLVED (eno, pno)EMP contains information about employees. PROJ about projects and i...
6.1k
views
commented
Jun 6, 2021
Databases
gate1997
databases
sql
relational-algebra
descriptive
+
–
5
answers
20
GATE CSE 2003 | Question: 53
A single tape Turing Machine $M$ has two states $q0$ and $q1$, of which $q0$ is the starting state. The tape alphabet of $M$ is $\{0, 1, B\}$ and its input alphabet is $\{0, 1\}$. The symbol $B$ is the blank symbol used to indicate end of an input ... halt on any string in $(00+1)^*$ $M$ halts on all strings ending in a $0$ $M$ halts on all strings ending in a $1$
A single tape Turing Machine $M$ has two states $q0$ and $q1$, of which $q0$ is the starting state. The tape alphabet of $M$ is $\{0, 1, B\}$ and its input alphabet is $\...
11.7k
views
commented
May 27, 2021
Theory of Computation
gatecse-2003
theory-of-computation
turing-machine
normal
+
–
2
answers
21
Pipelining
Suppose that an unpipelined processor has a cycle time of 25ns, and that it's data path is made up of modules with latencies of 2,3,4,7,3,2 and 4ns(in that order).In pipelining this processor ,it is not possible to rearrange the order of the modules(for examples, putting ... what is the latency of the pipeline? (a). no latency (b). 35 ns latency (c). 40 ns latency (d). 56 ns latency
Suppose that an unpipelined processor has a cycle time of 25ns, and that it's data path is made up of modules with latencies of 2,3,4,7,3,2 and 4ns(in that order).In pipe...
3.4k
views
answered
Mar 27, 2021
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register