menu
Answers by Digvijay Pandey
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Answers by Digvijay Pandey
All Activity
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Prev
Blogs
New Blog
Exams
Answers by Digvijay Pandey
Filter
User Digvijay Pandey
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
39
votes
1
GATE CSE 2019 | Question: 10
Let $G$ be an arbitrary group. Consider the following relations on $G$: $R_1: \forall a , b \in G, \: a R_1 b \text{ if and only if } \exists g \in G \text{ such that } a = g^{-1}bg$ ... $R_1$ and $R_2$ $R_1$ only $R_2$ only Neither $R_1$ nor $R_2$
answered
in
Set Theory & Algebra
Feb 7, 2019
11.5k
views
gate2019-cse
engineering-mathematics
discrete-mathematics
set-theory&algebra
group-theory
27
votes
2
GATE CSE 2019 | Question: 25
Consider a sequence of $14$ elements: $A=[-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]$. The sequence sum $S(i,j) = \Sigma_{k=i}^j A[k]$. Determine the maximum of $S(i,j)$, where $0 \leq i \leq j <14$. (Divide and conquer approach may be used.) Answer: ___________
answered
in
Algorithms
Feb 7, 2019
12.3k
views
gate2019-cse
numerical-answers
algorithms
algorithm-design
19
votes
3
GATE CSE 2019 | Question: 37
There are $n$ unsorted arrays: $A_1, A_2, \dots, A_n$. Assume that $n$ is odd.Each of $A_1, A_2, \dots, A_n$ contains $n$ distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of $A_1, A_2, \dots , A_n$ is $O(n)$ $O(n \: \log \: n)$ $O(n^2)$ $\Omega (n^2 \log n)$
answered
in
Algorithms
Feb 7, 2019
17.3k
views
gate2019-cse
algorithms
time-complexity
53
votes
4
GATE CSE 2019 | Question: 35
Consider the first order predicate formula $\varphi$: $\forall x [ ( \forall z \: z | x \Rightarrow (( z=x) \vee (z=1))) \rightarrow \exists w ( w > x) \wedge (\forall z \: z | w \Rightarrow ((w=z) \vee (z=1)))]$ Here $a \mid b$ denotes ... of all integers Which of the above sets satisfy $\varphi$? $S_1$ and $S_2$ $S_1$ and $S_3$ $S_2$ and $S_3$ $S_1, S_2$ and $S_3$
answered
in
Mathematical Logic
Feb 7, 2019
13.6k
views
gate2019-cse
engineering-mathematics
discrete-mathematics
mathematical-logic
first-order-logic
27
votes
5
GATE CSE 2019 | Question: 52
Consider the following C program: #include <stdio.h> int main() { float sum = 0.0, j=1.0, i=2.0; while (i/j > 0.0625) { j=j+j; sum=sum+i/j; printf("%f\n", sum); } return 0; } The number of times the variable sum will be printed, when the above program is executed, is _________
answered
in
Programming
Feb 7, 2019
7.7k
views
gate2019-cse
numerical-answers
programming-in-c
programming
24
votes
6
GATE CSE 2019 | Question: 53
Consider the following C program: #include <stdio.h> int main() { int a[] = {2, 4, 6, 8, 10}; int i, sum=0, *b=a+4; for (i=0; i<5; i++) sum=sum+(*b-i)-*(b-i); printf("%d\n", sum); return 0; } The output of the above C program is _______
answered
in
Programming
Feb 7, 2019
9.6k
views
gate2019-cse
numerical-answers
programming-in-c
programming
19
votes
7
GATE CSE 2019 | Question: 38
Let $G$ be any connected, weighted, undirected graph. $G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight. $G$ has a unique minimum spanning tree, if, for every cut of $G$, there is a unique minimum-weight edge crossing the cut. Which of the following statements is/are TRUE? I only II only Both I and II Neither I nor II
answered
in
Graph Theory
Feb 7, 2019
14.2k
views
gate2019-cse
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
35
votes
8
GATE CSE 2019 | Question: 32
Let the set of functional dependencies $F=\{QR \rightarrow S, \: R \rightarrow P, \: S \rightarrow Q \}$ hold on a relation schema $X=(PQRS)$. $X$ is not in BCNF. Suppose $X$ is decomposed into two schemas $Y$ and $Z$ ... and $Z$ is dependency preserving and lossless Which of the above statements is/are correct? Both I and II I only II only Neither I nor II
answered
in
Databases
Feb 7, 2019
8.5k
views
gate2019-cse
databases
database-normalization
22
votes
9
GATE CSE 2019 | Question: 31
Which one of the following languages over $\Sigma=\{a, b\}$ is NOT context-free? $\{ww^R \mid w \in \{a, b\}^*\}$ $\{wa^nb^nw^R \mid w \in \{a,b\}^*, n \geq 0\}$ $\{wa^nw^Rb^n \mid w \in \{a,b\}^* , n \geq 0\}$ $\{ a^nb^i \mid i \in \{n, 3n, 5n\}, n \geq 0\}$
answered
in
Theory of Computation
Feb 7, 2019
8.8k
views
gate2019-cse
theory-of-computation
context-free-languages
17
votes
10
GATE CSE 2019 | Question: 26
Consider the following C function. void convert (int n ) { if (n<0) printf{ %d , n); else { convert(n/2); printf( %d , n%2); } } Which one of the following will happen when the function convert is called with any positive ... order and terminate It will print the binary representation of $n$ but will not terminate It will not print anything and will not terminate
answered
in
Algorithms
Feb 7, 2019
11.3k
views
gate2019-cse
algorithms
identify-function
35
votes
11
GATE CSE 2019 | Question: 23
Consider three concurrent processes $P_1, P_2$ and $P_3$ as shown below, which access a shared variable $D$ that has been initialized to $100.$ ... values of $D$ after the three processes have completed execution are $X$ and $Y$ respectively, then the value of $Y-X$ is ______
answered
in
Operating System
Feb 7, 2019
11.3k
views
gate2019-cse
numerical-answers
operating-system
process-synchronization
46
votes
12
GATE CSE 2019 | Question: 22
Two numbers are chosen independently and uniformly at random from the set $\{1,2,\ldots,13\}.$ The probability (rounded off to $3$ decimal places) that their $4\text{-bit}$ (unsigned) binary representations have the same most significant bit is ___________.
answered
in
Digital Logic
Feb 7, 2019
13.3k
views
gate2019-cse
numerical-answers
digital-logic
number-representation
probability
38
votes
13
GATE CSE 2019 | Question: 20
An array of $25$ distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element gets placed in the worst possible location in the first round of partitioning (rounded off to $2$ decimal places) is ________
answered
in
Algorithms
Feb 7, 2019
10.2k
views
gate2019-cse
numerical-answers
algorithms
quicksort
probability
28
votes
14
GATE CSE 2019 | Question: 18
Consider the following C program : #include<stdio.h> int jumble(int x, int y){ x = 2*x+y; return x; } int main(){ int x=2, y=5; y=jumble(y,x); x=jumble(y,x); printf("%d \n",x); return 0; } The value printed by the program is ______________.
answered
in
Algorithms
Feb 7, 2019
6.8k
views
gate2019-cse
numerical-answers
identify-function
17
votes
15
GATE CSE 2019 | Question: 17
The following C program is executed on a Unix/Linux system : #include<unistd.h> int main() { int i; for(i=0; i<10; i++) if(i%2 == 0) fork(); return 0; } The total number of child processes created is ________________ .
answered
in
Operating System
Feb 7, 2019
11.4k
views
gate2019-cse
numerical-answers
operating-system
fork
9
votes
16
GATE CSE 2019 | Question: 16
Which of the following protocol pairs can be used to send and retrieve e-mails (in that order)? $\textsf{IMAP, POP3}$ $\textsf{SMTP, POP3}$ $\textsf{SMTP, MIME}$ $\textsf{IMAP, SMTP}$
answered
in
Computer Networks
Feb 7, 2019
9.5k
views
gate2019-cse
computer-networks
application-layer-protocols
44
votes
17
GATE CSE 2019 | Question: 11
Consider the following two statements about database transaction schedules: Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable. Timestamp-ordering concurrency control protocol with Thomas' Write Rule can generate view serializable ... the above statements is/are TRUE? I only II only Both I and II Neither I nor II
answered
in
Databases
Feb 7, 2019
12.6k
views
gate2019-cse
databases
transaction-and-concurrency
27
votes
18
GATE CSE 2019 | Question: 14
Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table? B+ Tree is a height-balanced tree Non-leaf nodes have pointers to data records Key values in each node are kept in sorted order Each leaf node has a pointer to the next leaf node
answered
in
Databases
Feb 7, 2019
7.8k
views
gate2019-cse
databases
b-tree
32
votes
19
GATE CSE 2019 | Question: 12
Let $G$ be an undirected complete graph on $n$ vertices, where $n > 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to $n!$ $(n-1)!$ $1$ $\frac{(n-1)!}{2}$
answered
in
Graph Theory
Feb 7, 2019
14.9k
views
gate2019-cse
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
29
votes
20
GATE CSE 2019 | Question: 6
Which one of the following is NOT a valid identity? $(x \oplus y) \oplus z = x \oplus (y \oplus z)$ $(x + y) \oplus z = x \oplus (y+z)$ $x \oplus y = x+y, \text{ if } xy=0$ $x \oplus y = (xy+x’y’)’$
answered
in
Digital Logic
Feb 7, 2019
8.1k
views
gate2019-cse
digital-logic
boolean-algebra
19
votes
21
GATE CSE 2019 | Question: 9
Let $X$ be a square matrix. Consider the following two statements on $X$. $X$ is invertible Determinant of $X$ is non-zero Which one of the following is TRUE? I implies II; II does not imply I II implies I; I does not imply II I does not imply II; II does not imply I I and II are equivalent statements
answered
in
Linear Algebra
Feb 7, 2019
6.5k
views
gate2019-cse
engineering-mathematics
linear-algebra
determinant
12
votes
22
GATE CSE 2019 | Question: 8
Consider $Z=X-Y$ where $X, Y$ and Z are all in sign-magnitude form. X and Y are each represented in $n$ bits. To avoid overflow, the representation of $Z$ would require a minimum of: $n$ bits $n-1$ bits $n+1$ bits $n+2$ bits
answered
in
Digital Logic
Feb 7, 2019
8.9k
views
gate2019-cse
digital-logic
number-representation
32
votes
23
GATE CSE 2019 | Question: 7
If $L$ is a regular language over $\Sigma = \{a,b\} $, which one of the following languages is NOT regular? $L.L^R = \{xy \mid x \in L , y^R \in L\}$ $\{ww^R \mid w \in L \}$ $\text{Prefix } (L) = \{x \in \Sigma^* \mid \exists y \in \Sigma^* $such that$ \ xy \in L\}$ $\text{Suffix }(L) = \{y \in \Sigma^* \mid \exists x \in \Sigma^* $such that$ \ xy \in L\}$
answered
in
Theory of Computation
Feb 7, 2019
10.4k
views
gate2019-cse
theory-of-computation
regular-languages
34
votes
24
GATE CSE 2019 | Question: 4
In $16$-bit $2$’s complement representation, the decimal number $-28$ is: $1111 \: 1111 \: 0001 \: 1100$ $0000 \: 0000 \: 1110 \: 0100$ $1111 \: 1111 \: 1110 \: 0100$ $1000 \: 0000 \: 1110 \: 0100$
answered
in
Digital Logic
Feb 7, 2019
7.4k
views
gate2019-cse
digital-logic
number-representation
26
votes
25
GATE CSE 2019 | Question: 3
Which one of the following kinds of derivation is used by LR parsers? Leftmost Leftmost in reverse Rightmost Rightmost in reverse
answered
in
Compiler Design
Feb 7, 2019
6.9k
views
gate2019-cse
compiler-design
parsing
0
votes
26
gatebook COA test
Consider a program being run on a processor. A modification in processor design caused 30% of the program to speed up by ten times while three fourth of the remaining program has a speed up of 80 and 40% of the remaining part of the program performs poorer ... by 50%. The remaining program has a speedup of 1. The overall speedup of the program exact to two decimal places is:-
answered
in
CO and Architecture
Dec 23, 2018
329
views
co-and-architecture
gatebook
speedup
4
votes
27
True/False
Which of the following statements related to graphs are True? Minimum Spanning Tree has ALWAYS Minimum weight edge included in it. Minimum Spanning Tree MIGHT have Maximum weight edge weight included in it. Maximum Spanning Tree has ALWAYS Maximum weight edge included ... edge included in it. Longest path from source to destination MAY OR MAY NOT have Maximum weight edge included in it.
answered
in
Graph Theory
Apr 12, 2018
1.4k
views
graphs
graph-algorithms
algorithms
0
votes
28
Naive Bayes Algorithm
What is the step by step procedure to apply algorithms like Decision Tree, Naive Bayes, etc... on a dataset using Python?
answered
in
Big Data/Data Analytics
Feb 22, 2018
608
views
conditional-probability
probability
data-analytics
machine-learning
9
votes
29
GATE CSE 2018 | Question: 30
Let $G$ be a simple undirected graph. Let $T_D$ be a depth first search tree of $G$. Let $T_B$ be a breadth first search tree of $G$. Consider the following statements. No edge of $G$ is a cross edge with respect to $T_D$. (A cross edge in $G$ ... $\mid i-j \mid =1$. Which of the statements above must necessarily be true? I only II only Both I and II Neither I nor II
answered
in
Algorithms
Feb 14, 2018
20.2k
views
gate2018-cse
algorithms
graph-algorithms
graph-search
normal
36
votes
30
GATE CSE 2018 | Question: 21
Consider the following $\text{C}$ program: #include<stdio.h> int counter=0; int calc (int a, int b) { int c; counter++; if(b==3) return (a*a*a); else { c = calc(a, b/3); return (c*c*c); } } int main() { calc(4, 81); printf("%d", counter); } The output of this program is ______.
answered
in
Programming
Feb 14, 2018
7.0k
views
gate2018-cse
programming-in-c
numerical-answers
recursion
programming
Page:
1
2
3
4
5
6
...
21
next »
Ask a Question
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
My Experience at IIIT Allahabad after 1 year of M.Tech and few tips
COAP Responses | GATE CSE 2022
IIT Delhi Mtech CSE Interview
Journey of GO
Honouring the Contributors to GATE Overflow
Categories
All categories
General Aptitude
(2.3k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.1k)
Programming and DS
(5.4k)
Algorithms
(4.7k)
Theory of Computation
(6.4k)
Compiler Design
(2.3k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.1k)
Admissions
(637)
Exam Queries
(857)
Tier 1 Placement Questions
(18)
Job Queries
(72)
Projects
(9)
Unknown Category
(1.1k)
Follow @gateoverflow
GATE Overflow
Recent Blog Comments
Thanks to all those who added the response. It is...
@
[email protected]
[email protected]
# CLRS is the...
@Chaitrasj In interviews you were quite...
nice sir
No new books for 2023:...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Search GATE Overflow for GATE CSE