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 AbhayPrajapati
6
answers
1
GATE CSE 2015 Set 1 | Question: 34
Suppose $L = \left\{ p, q, r, s, t\right\}$ is a lattice represented by the following Hasse diagram: For any $x, y \in L$, not necessarily distinct , $x \vee y$ and $x \wedge y$ are join and meet of $x, y$ ... $p_r = 0$ $p_r = 1$ $0 < p_r ≤ \frac{1}{5}$ $\frac{1}{5} < p_r < 1$
Suppose $L = \left\{ p, q, r, s, t\right\}$ is a lattice represented by the following Hasse diagram:For any $x, y \in L$, not necessarily distinct , $x \vee y$ and $x \we...
17.3k
views
commented
Jul 8, 2021
Set Theory & Algebra
gatecse-2015-set1
set-theory&algebra
normal
lattice
+
–
10
answers
2
GATE CSE 2014 Set 1 | Question: 51
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $(a,b)$ and $(c,d)$ if $|a-c| \leq 1$ and $|b-d| \leq 1$. The number of edges in this graph is______.
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $...
26.9k
views
commented
Oct 21, 2020
Graph Theory
gatecse-2014-set1
graph-theory
numerical-answers
normal
graph-connectivity
+
–
6
answers
3
GATE CSE 2012 | Question: 15
Which of the following statements are TRUE about an SQL query? P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause Q : An SQL query can contain a HAVING clause only if it has a GROUP BY clause R : All attributes used ... Not all attributes used in the GROUP BY clause need to appear in the SELECT clause P and R P and S Q and R Q and S
Which of the following statements are TRUE about an SQL query?P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clauseQ : An SQL query can ...
40.2k
views
commented
Aug 19, 2020
Databases
gatecse-2012
databases
easy
sql
ambiguous
+
–
3
answers
4
ISI2016-MMA-27
Consider the function $f(x) = \dfrac{e^{- \mid x \mid}}{\text{max}\{e^x, e^{-x}\}}, \: \: x \in \mathbb{R}$. Then $f$ is not continuous at some points $f$ is continuous everywhere, but not differentiable anywhere $f$ is continuous everywhere, but not differentiable at exactly one point $f$ is differentiable everywhere
Consider the function $f(x) = \dfrac{e^{- \mid x \mid}}{\text{max}\{e^x, e^{-x}\}}, \: \: x \in \mathbb{R}$. Then$f$ is not continuous at some points$f$ is continuous eve...
553
views
commented
Aug 15, 2020
Calculus
isi2016-mmamma
calculus
continuity
differentiation
+
–
3
answers
5
ISI2014-DCG-17
$\underset{x \to 2}{\lim} \dfrac{1}{1+e^{\frac{1}{x-2}}}$ is $0$ $1/2$ $1$ non-existent
$\underset{x \to 2}{\lim} \dfrac{1}{1+e^{\frac{1}{x-2}}}$ is$0$$1/2$$1$non-existent
635
views
answered
Aug 14, 2020
Calculus
isi2014-dcg
calculus
limits
+
–
2
answers
6
ISI2016-DCG-45
The value of $\underset{x \to 0}{\lim} \dfrac{\tan^{2}\:x-x\:\tan\:x}{\sin\:x}$ is $\frac{\sqrt{3}}{2}$ $\frac{1}{2}$ $0$ None of these
The value of $\underset{x \to 0}{\lim} \dfrac{\tan^{2}\:x-x\:\tan\:x}{\sin\:x}$ is$\frac{\sqrt{3}}{2}$$\frac{1}{2}$$0$None of these
454
views
answered
Aug 14, 2020
Calculus
isi2016-dcg
limits
+
–
4
answers
7
GATE IT 2005 | Question: 21
Consider the entities 'hotel room', and 'person' with a many to many relationship 'lodging' as shown below: If we wish to store information about the rent payment to be made by person (s) occupying different hotel rooms, then this information should appear as an attribute of Person Hotel Room Lodging None of these
Consider the entities 'hotel room', and 'person' with a many to many relationship 'lodging' as shown below:If we wish to store information about the rent payment to be ma...
10.7k
views
answered
Aug 12, 2020
Databases
gateit-2005
databases
er-diagram
easy
+
–
5
answers
8
GATE CSE 2018 | Question: 11
In an Entity-Relationship (ER) model, suppose $R$ is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in $R$ and that the cardinality of E1 is greater than the cardinality of E2. Which ... Every entity in E2 is associated with exactly one entity in E1 Every entity in E2 is associated with at most one entity in E1
In an Entity-Relationship (ER) model, suppose $R$ is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in $R$ and ...
28.0k
views
commented
Aug 12, 2020
Databases
gatecse-2018
databases
er-diagram
normal
1-mark
+
–
3
answers
9
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.2k
views
commented
Aug 10, 2020
Databases
gate1997
databases
sql
relational-algebra
descriptive
+
–
3
answers
10
GATE CSE 2009 | Question: 54
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths $m$ and $n$, respectively with indexes of $X$ and $Y$ starting from $0$. We wish to find the length of ... $L[M, N]$. $L[p, q]$ needs to be computed before $L[r, s]$ if either $p<r$ or $q < s$.
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths ...
14.5k
views
answered
May 25, 2020
Algorithms
gatecse-2009
normal
algorithms
dynamic-programming
recursion
+
–
2
answers
11
Made Easy Test Series:Algorithm-Recurrence Relation
What is the solution of recurrence relation $T\left ( n \right )=T\left ( n-1 \right )+n$
What is the solution of recurrence relation$T\left ( n \right )=T\left ( n-1 \right )+n$
892
views
answered
May 4, 2020
Algorithms
algorithms
time-complexity
recurrence-relation
+
–
7
answers
12
GATE CSE 2008 | Question: 40
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is $\Theta(n)$ $\Theta(\log n)$ $\Theta(\log^*n)$ $\Theta(1)$
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is$\Theta(n)$$\Theta(\log n)...
36.8k
views
commented
May 3, 2020
Algorithms
gatecse-2008
normal
algorithms
time-complexity
+
–
5
answers
13
GATE IT 2006 | Question: 64
Suppose that it takes $1$ unit of time to transmit a packet (of fixed size) on a communication link. The link layer uses a window flow control protocol with a window size of $N$ packets. Each packet causes an ack or a nak to be generated by the receiver, and ack/nak transmission times are ... $1- \dfrac{ N}{i}$ $\dfrac{i}{(N + i)}$ $1$ $1 - e^{\left(\frac{i}{N}\right)}$
Suppose that it takes $1$ unit of time to transmit a packet (of fixed size) on a communication link. The link layer uses a window flow control protocol with a window size...
12.9k
views
commented
Apr 22, 2020
Computer Networks
gateit-2006
computer-networks
sliding-window
normal
+
–
6
answers
14
GATE CSE 2014 Set 2 | Question: 55
Consider the main memory system that consists of $8$ memory modules attached to the system bus, which is one word wide. When a write request is made, the bus is occupied for $100$ nanoseconds (ns) by the data, address, and control signals. ... bus at any time. The maximum number of stores (of one word each) that can be initiated in $1$ millisecond is ________
Consider the main memory system that consists of $8$ memory modules attached to the system bus, which is one word wide. When a write request is made, the bus is occupied ...
27.0k
views
commented
Apr 3, 2020
Operating System
gatecse-2014-set2
operating-system
memory-management
numerical-answers
normal
+
–
4
answers
15
GATE CSE 2015 Set 2 | Question: 15
Consider the following function written in the C programming langauge : void foo(char *a) { if (*a && *a != ' ') { foo(a+1); putchar(*a); } } The output of the above function on input "$ABCD \ EFGH$" is $ABCD \ EFGH$ $ABCD$ $HGFE \ DCBA$ $DCBA$
Consider the following function written in the C programming langauge :void foo(char *a) { if (*a && *a != ' ') { foo(a+1); putchar(*a); } }The output of the above func...
14.5k
views
answered
Apr 1, 2020
Programming in C
gatecse-2015-set2
programming
programming-in-c
normal
recursion
+
–
3
answers
16
GATE IT 2005 | Question: 62
Two shared resources $R_1$ and $R_2$ are used by processes $P_1$ and $P_2$. Each process has a certain priority for accessing each resource. Let $T_{ij}$ denote the priority of $P_i$ for accessing $R_j$. A process $P_i$ can snatch a resource $R_k$ from process $P_j$ ... that $P_1$ and $P_2$ can never deadlock? (I) and (IV) (II) and (III) (I) and (II) None of the above
Two shared resources $R_1$ and $R_2$ are used by processes $P_1$ and $P_2$. Each process has a certain priority for accessing each resource. Let $T_{ij}$ denote the prior...
8.9k
views
commented
Mar 25, 2020
Operating System
gateit-2005
operating-system
resource-allocation
normal
+
–
4
answers
17
GATE CSE 2003 | Question: 77
A uni-processor computer system only has two processes, both of which alternate $10$ $\text{ms}$ CPU bursts with $90$ $\text{ms}$ I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes ... Static priority scheduling with different priorities for the two processes Round robin scheduling with a time quantum of $5$ $\text{ms}$
A uni-processor computer system only has two processes, both of which alternate $10$ $\text{ms}$ CPU bursts with $90$ $\text{ms}$ I/O bursts. Both the processes were crea...
19.8k
views
answered
Mar 16, 2020
Operating System
gatecse-2003
operating-system
process-scheduling
normal
+
–
15
answers
18
GATE CSE 2005 | Question: 39
Suppose there are $\lceil \log n \rceil$ sorted lists of $\lfloor n /\log n \rfloor$ elements each. The time complexity of producing a sorted list of all these elements is: (Hint:Use a heap data structure) $O(n \log \log n)$ $\Theta(n \log n)$ $\Omega(n \log n)$ $\Omega\left(n^{3/2}\right)$
Suppose there are $\lceil \log n \rceil$ sorted lists of $\lfloor n /\log n \rfloor$ elements each. The time complexity of producing a sorted list of all these elements i...
26.5k
views
answered
Sep 13, 2019
Algorithms
gatecse-2005
algorithms
sorting
normal
+
–
11
answers
19
GATE CSE 2017 Set 1 | Question: 08
Consider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->next; } p->next = m; } Assuming that m and n ... append list m to the end of list n. cause a null pointer dereference for all inputs. append list n to the end of list m for all inputs.
Consider the C code fragment given below.typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->ne...
25.8k
views
answered
Aug 21, 2019
DS
gatecse-2017-set1
data-structures
linked-list
normal
+
–
9
answers
20
GATE CSE 2014 Set 2 | Question: 41
Suppose a stack implementation supports an instruction $\text{REVERSE}$, which reverses the order of elements on the stack, in addition to the $\text{PUSH}$ and $\text{POP}$ ... instruction. A queue can be implemented where both $\text{ENQUEUE}$ and $\text{DEQUEUE}$ take a single instruction each.
Suppose a stack implementation supports an instruction $\text{REVERSE}$, which reverses the order of elements on the stack, in addition to the $\text{PUSH}$ and $\text{PO...
24.9k
views
commented
May 26, 2019
DS
gatecse-2014-set2
data-structures
stack
easy
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register