menu
Recent questions tagged gate2019
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged gate2019
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions tagged gate2019
0
votes
0
answers
83
views
GATE2019-46 Video Solution
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
83
views
gate2019
numerical-answers
data-structures
binary-tree
video-solution
0
votes
0
answers
31
views
GATE2019-50 Video Solution
What is the minimum number of $2$-input NOR gates required to implement a $4$ -variable function expressed in sum-of-minterms form as $f=\Sigma(0,2,5,7, 8, 10, 13, 15)?$ Assume that all the inputs and their complements are available. Answer: _______
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
31
views
gate2019
numerical-answers
digital-logic
canonical-normal-form
video-solution
0
votes
0
answers
33
views
GATE2019-15 Video Solution
For $\Sigma = \{a ,b \}$, let us consider the regular language $L=\{x \mid x = a^{2+3k} \text{ or } x=b^{10+12k}, k \geq 0\}$. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for $L$ ? $3$ $5$ $9$ $24$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
33
views
gate2019
theory-of-computation
pumping-lemma
video-solution
0
votes
0
answers
28
views
GATE2019-35 Video Solution
Consider the first order predicate formula $\varphi$: $\forall x [ ( \forall z \: z \mid x \Rightarrow (( z=x) \vee (z=1))) \rightarrow \exists w ( w > x) \wedge (\forall z \: z \mid w \Rightarrow ((w=z) \vee (z=1)))]$ ... of all positive integers $S3:$ Set of all integers Which of the above sets satisfy $\varphi$? S1 and S2 S1 and S3 S2 and S3 S1, S2 and S3
admin
asked
in
Mathematical Logic
Apr 18, 2020
by
admin
585
points
28
views
gate2019
engineering-mathematics
discrete-mathematics
mathematical-logic
first-order-logic
video-solution
0
votes
0
answers
23
views
GATE2019-22 Video Solution
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-bit$ (unsigned) binary representations have the same most significant bit is _______________.
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
23
views
gate2019
numerical-answers
digital-logic
number-representation
probability
video-solution
0
votes
0
answers
20
views
GATE2019-37 Video Solution
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)$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
20
views
gate2019
algorithms
time-complexity
video-solution
0
votes
0
answers
66
views
GATE2019-21 Video Solution
The value of $3^{51} \text{ mod } 5$ is _____
admin
asked
in
Combinatory
Apr 18, 2020
by
admin
585
points
66
views
gate2019
numerical-answers
combinatory
modular-arithmetic
video-solution
0
votes
0
answers
24
views
GATE2019-27 Video Solution
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$
admin
asked
in
Programming
Apr 18, 2020
by
admin
585
points
24
views
gate2019
programming-in-c
programming
video-solution
0
votes
0
answers
54
views
GATE2019-51 Video Solution
A relational database contains two tables Student and Performance as shown below: ... S, Performance P WHERE P.Marks >84 GROUP BY S.Student_name; The number of rows returned by the above SQL query is ________
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
54
views
gate2019
numerical-answers
databases
sql
video-solution
0
votes
0
answers
30
views
GATE2019-29 Video Solution
Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this? X sends an ARP request packet to the local gateway' ... packet with broadcast MAC address in its local subnet X sends an ARP request packet with broadcast IP address in its local subnet
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
30
views
gate2019
computer-networks
network-protocols
video-solution
0
votes
0
answers
14
views
GATE2019-1 Video Solution
A certain processor uses a fully associative cache of size $16$ kB, The cache block size is $16$ bytes. Assume that the main memory is byte addressable and uses a $32$-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated ... $0$ bits $28$ bits and $4$ bits $24$ bits and $4$ bits $28$ bits and $0$ bits
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
14
views
gate2019
co-and-architecture
cache-memory
normal
video-solution
0
votes
0
answers
42
views
GATE2019-26 Video Solution
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
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
42
views
gate2019
algorithms
identify-function
video-solution
0
votes
0
answers
23
views
GATE2019-48 Video Solution
Let $\Sigma$ be the set of all bijections from $\{1, \dots , 5\}$ to $\{1, \dots , 5 \}$, where $id$ denotes the identity function, i.e. $id(j)=j, \forall j$. Let $\circ$ ... Consider the language $L=\{x \in \Sigma^* \mid \pi (x) =id\}$. The minimum number of states in any DFA accepting $L$ is _______
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
23
views
gate2019
numerical-answers
theory-of-computation
finite-automata
minimal-state-automata
difficult
video-solution
0
votes
0
answers
23
views
GATE2019-12 Video Solution
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}$
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
23
views
gate2019
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
video-solution
0
votes
0
answers
23
views
GATE2019-47 Video Solution
Suppose $Y$ is distributed uniformly in the open interval $(1,6)$. The probability that the polynomial $3x^2 +6xY+3Y+6$ has only real roots is (rounded off to $1$ decimal place) _______
admin
asked
in
Probability
Apr 18, 2020
by
admin
585
points
23
views
gate2019
numerical-answers
engineering-mathematics
probability
uniform-distribution
video-solution
0
votes
0
answers
30
views
GATE2019-42 Video Solution
The index node (inode) of a Unix -like file system has $12$ direct, one single-indirect and one double-indirect pointers. The disk block size is $4$ kB, and the disk block address is $32$-bits long. The maximum possible file size is (rounded off to $1$ decimal place) ____ GB
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
30
views
gate2019
numerical-answers
operating-system
file-system
video-solution
0
votes
0
answers
25
views
GATE2019-GA-1 Video Solution
The expenditure on the project _____ as follows: equipment Rs.$20$ lakhs, salaries Rs.$12$ lakhs, and contingency Rs.$3$ lakhs. break down break breaks down breaks
admin
asked
in
Verbal Ability
Apr 18, 2020
by
admin
585
points
25
views
gate2019
general-aptitude
verbal-ability
most-appropriate-word
video-solution
0
votes
0
answers
32
views
GATE2019-38 Video Solution
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
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
32
views
gate2019
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
video-solution
0
votes
0
answers
26
views
GATE2019-33 Video Solution
Assume that in a certain computer, the virtual addresses are $64$ bits long and the physical addresses are $48$ bits long. The memory is word addressible. The page size is $8$ kB and the word size is $4$ bytes. The Translation Look-aside Buffer (TLB) in the address translation path ... TLB miss? $16 \times 2^{10}$ $256 \times 2^{10}$ $4 \times 2^{20}$ $8 \times 2^{20}$
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
26
views
gate2019
operating-system
virtual-memory
video-solution
0
votes
0
answers
22
views
GATE2019-23 Video Solution
Consider three concurrent processes $P1$, $P2$ and $P3$ as shown below, which access a shared variable $D$ that has been initialized to $100$ ... possible values of $D$ after the three processes have completed execution are $X$ and $Y$ respectively, then the value of $Y-X$ is ____
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
22
views
gate2019
numerical-answers
operating-system
process-synchronization
video-solution
0
votes
0
answers
19
views
GATE2019-17 Video Solution
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 ________________ .
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
19
views
gate2019
numerical-answers
operating-system
fork
video-solution
0
votes
0
answers
28
views
GATE2019-GA-6 Video Solution
The police arrested four criminals - $P, Q, R$ and $S.$ The criminals knew each other. They made the following statements: $P$ says Q committed the crime. $Q$ says S committed the crime. $R$ says I did not do it. $S$ says What Q ... the arrested four committed the crime and only one of the statements made above is true. Who committed the crime? $P$ $R$ $S$ $Q$
admin
asked
in
Verbal Ability
Apr 18, 2020
by
admin
585
points
28
views
gate2019
verbal-ability
verbal-reasoning
video-solution
0
votes
0
answers
16
views
GATE2019-25 Video Solution
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: ___________
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
16
views
gate2019
numerical-answers
algorithms
algorithm-design
video-solution
0
votes
0
answers
29
views
GATE2019-44 Video Solution
Consider the following matrix: $R = \begin{bmatrix} 1 & 2 & 4 & 8 \\ 1 & 3 & 9 & 27 \\ 1 & 4 & 16 & 64 \\ 1 & 5 & 25 & 125 \end{bmatrix}$ The absolute value of the product of Eigen values of $R$ is _______
admin
asked
in
Linear Algebra
Apr 18, 2020
by
admin
585
points
29
views
gate2019
numerical-answers
engineering-mathematics
linear-algebra
eigen-value
video-solution
0
votes
0
answers
29
views
GATE2019-49 Video Solution
Consider that $15$ machines need to be connected in a LAN using $8$-port Ethernet switches. Assume that these switches do not have any separate uplink ports. The minimum number of switches needed is ______
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
29
views
gate2019
numerical-answers
computer-networks
lan-technologies
video-solution
0
votes
0
answers
36
views
GATE2019-10 Video Solution
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$
admin
asked
in
Set Theory & Algebra
Apr 18, 2020
by
admin
585
points
36
views
gate2019
engineering-mathematics
discrete-mathematics
set-theory&algebra
group-theory
video-solution
0
votes
0
answers
21
views
GATE2019-GA-7 Video Solution
In the given diagram, teachers are represented in the triangle, researchers in the circle and administrators in the rectangle. Out of the total number of the people, the percentage of administrators shall be in the range of _______ $0$ to $15$ $16$ to $30$ $31$ to $45$ $46$ to $60$
admin
asked
in
Numerical Ability
Apr 18, 2020
by
admin
585
points
21
views
gate2019
general-aptitude
numerical-ability
venn-diagrams
video-solution
0
votes
0
answers
24
views
GATE2019-41 Video Solution
Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below: ... Time First scheduling algorithm. If the average waiting time of the processes is $1$ millisecond, then the value of $Z$ is _____
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
24
views
gate2019
numerical-answers
operating-system
process-scheduling
video-solution
0
votes
0
answers
18
views
GATE2019-20 Video Solution
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 ________
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
18
views
gate2019
numerical-answers
algorithms
quicksort
probability
video-solution
0
votes
0
answers
28
views
GATE2019-2 Video Solution
The chip select logic for a certain DRAM chip in a memory system design is shown below. Assume that the memory system has $16$ address lines denoted by $A_{15}$ to $A_0$. What is the range of address (in hexadecimal) of the memory system that can get enabled by the chip select (CS) signal? C800 to CFFF CA00 to CAFF C800 to C8FF DA00 to DFFF
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
28
views
gate2019
co-and-architecture
dram
video-solution
0
votes
0
answers
18
views
GATE2019-45 Video Solution
A certain processor deploys a single-level cache. The cache block size is $8$ words and the word size is $4$ bytes. The memory system uses a $60$-MHz clock. To service a cache miss, the memory controller first takes $1$ cycle to accept ... for the memory system when the program running on the processor issues a series of read operations is ______$\times 10^6$ bytes/sec
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
18
views
gate2019
numerical-answers
co-and-architecture
cache-memory
video-solution
0
votes
0
answers
21
views
GATE2019-43 Video Solution
Consider the augmented grammar given below: $S’ \rightarrow S$ $S \rightarrow \langle L \rangle \mid id$ $L \rightarrow L, S \mid S$ Let $I_0 = \text{CLOSURE} (\{[S’ \rightarrow \cdot S ]\}).$ The number of items in the set $\text{GOTO} (I_0, \langle \: )$ is______
admin
asked
in
Compiler Design
Apr 18, 2020
by
admin
585
points
21
views
gate2019
numerical-answers
compiler-design
grammar
video-solution
0
votes
0
answers
28
views
GATE2019-GA-9 Video Solution
In a college, there are three student clubs, $60$ students are only in the Drama club, $80$ students are only in the Dance club, $30$ students are only in Maths club, $40$ students are in both Drama and Dance clubs, $12$ students are in both Dance and ... are not in any of these clubs, then the total number of students in the college is _____. $1000$ $975$ $900$ $225$
admin
asked
in
Numerical Ability
Apr 18, 2020
by
admin
585
points
28
views
gate2019
general-aptitude
numerical-ability
venn-diagrams
video-solution
0
votes
0
answers
29
views
GATE2019-55 Video Solution
Consider the following relations $P(X,Y,Z), Q(X,Y,T)$ and $R(Y,V)$ ... Answer: ________
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
29
views
gate2019
numerical-answers
databases
relational-algebra
video-solution
0
votes
0
answers
28
views
GATE2019-11 Video Solution
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
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
28
views
gate2019
databases
transactions
video-solution
0
votes
0
answers
19
views
GATE2019-8 Video Solution
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
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
19
views
gate2019
digital-logic
number-representation
video-solution
0
votes
0
answers
22
views
GATE2019-54 Video Solution
In an RSA cryptosystem, the value of the public modulus parameter $n$ is $3007$. If it is also known as that $\phi(n)=2880$ where $\phi()$ denotes Euler’s Totient Function, then the prime factor of $n$ which is greater than $50$ is _________
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
22
views
gate2019
numerical-answers
computer-networks
network-security
video-solution
0
votes
0
answers
17
views
GATE2019-5 Video Solution
Let $U = \{1, 2, \dots , n\}$ Let $A=\{(x, X) \mid x \in X, X \subseteq U \}$. Consider the following two statements on $\mid A \mid$. $\mid A \mid = n2^{n-1}$ $\mid A \mid = \Sigma_{k=1}^{n} k \begin{pmatrix} n \\ k \end{pmatrix}$ Which of the above statements is/are TRUE? Only I Only II Both I and II Neither I nor II
admin
asked
in
Combinatory
Apr 18, 2020
by
admin
585
points
17
views
gate2019
engineering-mathematics
discrete-mathematics
combinatory
video-solution
0
votes
0
answers
20
views
GATE2019-40 Video Solution
Consider the following statements: The smallest element in a max-heap is always at a leaf node The second largest element in a max-heap is always a child of a root node A max-heap can be constructed from a binary search tree in $\theta(n)$ time A binary search tree ... time Which of te above statements are TRUE? I, II and III I, II and IV I, III and IV II, III and IV
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
20
views
gate2019
data-structures
heap
video-solution
1
vote
1
answer
49
views
GATE2019-53 Video Solution
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 _______
admin
asked
in
Programming
Apr 18, 2020
by
admin
585
points
49
views
gate2019
numerical-answers
programming-in-c
programming
video-solution
Page:
1
2
next »
Ask a Question
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Search GATE CSE Doubts