menu
Recent questions tagged gate2015-3
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged gate2015-3
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions tagged gate2015-3
0
votes
0
answers
31
views
GATE2015-3-51 Video Solution
Consider the following reservation table for a pipeline having three stages $S_1, S_2 \text{ and } S_3$. $\begin{array}{|ccccc|} \hline \textbf{Time} \rightarrow \\\hline & \text{1}& \text{2} & \text{$3$} & \text{$4$} & \text{$ ... $} & & & \text{$X$} & \\\hline \end{array}$ The minimum average latency (MAL) is ______
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
31
views
gate2015-3
co-and-architecture
pipelining
difficult
numerical-answers
video-solution
1
vote
1
answer
33
views
GATE2015-3-36 Video Solution
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of data ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
33
views
gate2015-3
computer-networks
normal
numerical-answers
network-switching
video-solution
0
votes
0
answers
26
views
GATE2015-3-10 Video Solution
Two processes $X$ and $Y$ ... The proposed solution guarantees mutual exclusion and prevents deadlock The proposed solution fails to prevent deadlock and fails to guarantee mutual exclusion
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
26
views
gate2015-3
operating-system
process-synchronization
normal
video-solution
0
votes
0
answers
20
views
GATE2015-3-48 Video Solution
Consider the following C program: #include<stdio.h> int main() { int i, j, k = 0; j=2 * 3 / 4 + 2.0 / 5 + 8 / 5; k-=--j; for (i=0; i<5; i++) { switch(i+k) { case 1: case 2: printf("\n%d", i+k); case 3: printf("\n%d", i+k); default: printf("\n%d", i+k); } } return 0; } The number of times printf statement is executed is _______.
admin
asked
in
Programming
Apr 18, 2020
by
admin
585
points
20
views
gate2015-3
programming
programming-in-c
normal
numerical-answers
video-solution
0
votes
0
answers
21
views
GATE2015-3-24 Video Solution
In a room there are only two types of people, namely $\text{Type 1}$ and $\text{Type 2}$. $\text{Type 1}$ people always tell the truth and $\text{Type 2}$ people always lie. You give a fair coin to a person in that room, without knowing which type he ... person is of $\text{Type 2}$, then the result is tail If the person is of $\text{Type 1}$, then the result is tail
admin
asked
in
Mathematical Logic
Apr 18, 2020
by
admin
585
points
21
views
gate2015-3
mathematical-logic
difficult
logical-reasoning
video-solution
0
votes
1
answer
40
views
GATE2015-3-46 Video Solution
Consider a B+ tree in which the search key is $12$ $\text{byte}$ long, block size is $1024$ $\text{byte}$, recorder pointer is $10$ $\text{byte}$ long and the block pointer is $8$ $\text{byte}$ long. The maximum number of keys that can be accommodated in each non-leaf node of the tree is ______.
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
40
views
gate2015-3
databases
b-tree
normal
numerical-answers
video-solution
1
vote
1
answer
24
views
GATE2015-3-26 Video Solution
Consider the following C program #include<stdio.h> int main() { static int a[] = {10, 20, 30, 40, 50}; static int *p[] = {a, a+3, a+4, a+1, a+2}; int **ptr = p; ptr++; printf("%d%d", ptr-p, **ptr); } The output of the program is _______.
admin
asked
in
Programming
Apr 18, 2020
by
admin
585
points
24
views
gate2015-3
programming
programming-in-c
normal
numerical-answers
video-solution
0
votes
0
answers
15
views
GATE2015-3-27 Video Solution
Assume that a mergesort algorithm in the worst case takes $30$ seconds for an input of size $64$. Which of the following most closely approximates the maximum input size of a problem that can be solved in $6$ minutes? $256$ $512$ $1024$ $2018$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
15
views
gate2015-3
algorithms
sorting
video-solution
0
votes
0
answers
20
views
GATE2015-3-42 Video Solution
Let $f(n) = n$ and $g(n) = n^{(1 + \sin \: n)}$, where $n$ is a positive integer. Which of the following statements is/are correct? $f(n) = O(g(n))$ $f(n) = \Omega(g(n))$ Only I Only II Both I and II Neither I nor II
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
20
views
gate2015-3
algorithms
asymptotic-notations
normal
video-solution
0
votes
0
answers
35
views
GATE2015-3-38 Video Solution
In the network $200.10.11.144/27$, the $fourth$ octet (in decimal) of the last $IP$ address of the network which can be assigned to a host is _____.
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
35
views
gate2015-3
computer-networks
subnetting
normal
numerical-answers
video-solution
0
votes
0
answers
31
views
GATE2015-3-47 Video Solution
Consider the following code sequence having five instructions from $I_1 \text{ to } I_5$. Each of these instructions has the following format. OP Ri, Rj, Rk Where operation OP is performed on contents of registers Rj and Rk and the result is stored in register ... statements is/are correct? Only S1 is true Only S2 is true Only S1 and S3 are true Only S2 and S3 are true
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
31
views
gate2015-3
co-and-architecture
pipelining
data-dependences
normal
video-solution
1
vote
1
answer
30
views
GATE2015-3-28 Video Solution
Consider a network connecting two systems located $8000$ $\text{Km}$ apart. The bandwidth of the network is $500 \times 10^6$ $\text{bits}$ per second. The propagation speed of the media is $4 \times 10^6$ $\text{meters}$ per second ... . Assume that processing delays at nodes are negligible. Then, the minimum size in bits of the sequence number field has to be ______.
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
30
views
gate2015-3
computer-networks
sliding-window
normal
numerical-answers
video-solution
0
votes
0
answers
28
views
GATE2015-3-5 Video Solution
The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ________.
admin
asked
in
Combinatory
Apr 18, 2020
by
admin
585
points
28
views
gate2015-3
combinatory
normal
numerical-answers
video-solution
0
votes
0
answers
18
views
GATE2015-3-32 Video Solution
Which of the following languages are context-free? $L_1: \left\{a^mb^na^nb^m \mid m, n \geq 1\right\}$ $L_2: \left\{a^mb^na^mb^n \mid m, n \geq 1\right\}$ $L_3: \left\{a^mb^n \mid m = 2n +1 \right\}$ $L_1$ and $L_2$ only $L_1$ and $L_3$ only $L_2$ and $L_3$ only $L_3$ only
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
18
views
gate2015-3
theory-of-computation
context-free-languages
normal
video-solution
0
votes
0
answers
21
views
GATE2015-3-39 Video Solution
Consider the following recursive C function. void get(int n) { if (n<1) return; get (n-1); get (n-3); printf("%d", n); } If $get(6)$ function is being called in $main()$ then how many times will the $get()$ function be invoked before returning to the $main()$? $15$ $25$ $35$ $45$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
21
views
gate2015-3
algorithms
recurrence
normal
video-solution
0
votes
0
answers
19
views
GATE2015-3-18 Video Solution
Let $L$ be the language represented by the regular expression $\Sigma^*0011\Sigma^*$ where $\Sigma = \{0, 1\}$. What is the minimum number of states in a DFA that recognizes $\bar{L}$ (complement of $L$)? $4$ $5$ $6$ $8$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
19
views
gate2015-3
theory-of-computation
finite-automata
normal
minimal-state-automata
video-solution
0
votes
0
answers
16
views
GATE2015-3-25 Video Solution
Consider a binary tree T that has $200$ leaf nodes. Then the number of nodes in T that have exactly two children are ______.
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
16
views
gate2015-3
data-structures
binary-tree
normal
numerical-answers
video-solution
0
votes
0
answers
35
views
GATE2015-3-34 Video Solution
For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time? ... First Come First Serve Non-preemptive Shortest job first Shortest Remaining Time Round Robin with Quantum value two
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
35
views
gate2015-3
operating-system
process-scheduling
normal
video-solution
0
votes
1
answer
27
views
GATE2015-3-43 Video Solution
The total number of prime implicants of the function $f(w, x, y, z) = \sum (0, 2, 4, 5, 6, 10)$ is __________
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
27
views
gate2015-3
digital-logic
canonical-normal-form
normal
numerical-answers
video-solution
0
votes
0
answers
21
views
GATE2015-3-41 Video Solution
Let $R$ be a relation on the set of ordered pairs of positive integers such that $((p,q),(r,s)) \in R$ if and only if $p-s=q-r$. Which one of the following is true about R? Both reflexive and symmetric Reflexive but not symmetric Not reflexive but symmetric Neither reflexive nor symmetric
admin
asked
in
Set Theory & Algebra
Apr 18, 2020
by
admin
585
points
21
views
gate2015-3
set-theory&algebra
relations
normal
video-solution
0
votes
0
answers
27
views
GATE2015-3-29 Video Solution
Consider the partial Schedule $S$ involving two transactions $T1$ and $T2$. Only the $\textit{read}$ and the $\textit{write}$ operations have been shown. The $\textit{read}$ operation on data item $P$ ... re-started to ensure transaction atomicity Schedule $S$ is recoverable and can ensure transaction atomicity and nothing else needs to be done
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
27
views
gate2015-3
databases
transactions
normal
video-solution
0
votes
0
answers
19
views
GATE2015-3-4 Video Solution
Consider the equality $\displaystyle{\sum_{i=0}^n} i^3 = X$ and the following choices for $X$: $\Theta(n^4)$ $\Theta(n^5)$ $O(n^5)$ $\Omega(n^3)$ The equality above remains correct if $X$ is replaced by Only I Only II I or III or IV but not II II or III or IV but not I
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
19
views
gate2015-3
algorithms
asymptotic-notations
normal
video-solution
0
votes
0
answers
20
views
GATE2015-3-23 Video Solution
Suppose $U$ is the power set of the set $S = \{1, 2, 3, 4, 5, 6\}$. For any $T \in U$, let $|T|$ denote the number of elements in $T$ and $T'$ denote the complement of $T$. For any $T, R \in U \text{ let } T \backslash R$ be the set of all elements in ... $X \backslash Y = \phi)$ $\forall X \in U, \forall Y \in U, (X \backslash Y = Y' \backslash X')$
admin
asked
in
Set Theory & Algebra
Apr 18, 2020
by
admin
585
points
20
views
gate2015-3
set-theory&algebra
sets
normal
video-solution
0
votes
0
answers
21
views
GATE2015-3-9 Video Solution
The value of $\lim_{x \rightarrow \infty} (1+x^2)^{e^{-x}}$ is $0$ $\frac{1}{2}$ $1$ $\infty$
admin
asked
in
Calculus
Apr 18, 2020
by
admin
585
points
21
views
gate2015-3
calculus
limits
normal
video-solution
0
votes
0
answers
21
views
GATE2015-3-31 Video Solution
Consider the following grammar G $S \rightarrow F \mid H$ $F \rightarrow p \mid c$ $H \rightarrow d \mid c$ Where $S$, $F$, and $H$ are non-terminal symbols, $p, d$, and $c$ are terminal symbols. Which of the following statement(s) is/ ... using grammar G S2: LR(1) can parse all strings that are generated using grammar G Only S1 Only S2 Both S1 and S2 Neither S1 and S2
admin
asked
in
Compiler Design
Apr 18, 2020
by
admin
585
points
21
views
gate2015-3
compiler-design
parsing
normal
video-solution
0
votes
0
answers
15
views
GATE2015-3-22 Video Solution
Consider the following statements. TCP connections are full duplex TCP has no option for selective acknowledgement TCP connections are message streams Only I is correct Only I and III are correct Only II and III are correct All of I, II and III are correct
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
15
views
gate2015-3
computer-networks
tcp
normal
video-solution
0
votes
0
answers
15
views
GATE2015-3-52 Video Solution
Consider the following policies for preventing deadlock in a system with mutually exclusive resources. Process should acquire all their resources at the beginning of execution. If any resource is not available, all resources acquired so far are released. The resources are numbered uniquely, and ... ) and (III) but not (I) or (IV) Any one of (I), (II), (III) and (IV)
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
15
views
gate2015-3
operating-system
resource-allocation
normal
video-solution
0
votes
0
answers
21
views
GATE2015-3-6 Video Solution
Consider a CSMA/CD network that transmits data at a rate of $100\ Mbps$ ($10^8\ bits$ per second) over a $1\ km$ (kilometre) cable with no repeaters. If the minimum frame size required for this network is $1250\ bytes,$ What is the signal speed $(km/sec)$ in the cable? $8000$ $10000$ $16000$ $20000$
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
21
views
gate2015-3
computer-networks
congestion-control
csma-cd
normal
video-solution
0
votes
0
answers
28
views
GATE2015-3-54 Video Solution
Consider the following C program: #include<stdio.h> int f1(void); int f2(void); int f3(void); int x=10; int main() { int x=1; x += f1() + f2 () + f3() + f2(); printf("%d", x); return 0; } int f1() { int x = 25; x++; return x;} int f2() { static int x = 50; x++; return x;} int f3() { x *= 10; return x;} The output of the program is ______.
admin
asked
in
Programming
Apr 18, 2020
by
admin
585
points
28
views
gate2015-3
programming
programming-in-c
normal
numerical-answers
video-solution
0
votes
0
answers
71
views
GATE2015-3-12 Video Solution
The result evaluating the postfix expression $10 \ 5 + 60 \ 6 / * 8 -$ is $284$ $213$ $142$ $71$
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
71
views
gate2015-3
data-structures
stack
normal
video-solution
0
votes
0
answers
14
views
GATE2015-3-1 Video Solution
The maximum number of processes that can be in $\textit{Ready}$ state for a computer system with $n$ CPUs is : $n$ $n^2$ $2^n$ Independent of $n$
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
14
views
gate2015-3
operating-system
process-scheduling
easy
video-solution
0
votes
0
answers
17
views
GATE2015-3-37 Video Solution
Suppose $X_i$ for $i=1, 2, 3$ are independent and identically distributed random variables whose probability mass functions are $Pr[X_i = 0] = Pr[X_i = 1] = \frac{1} {2} \text{ for } i = 1, 2, 3$. Define another random variable $Y = X_1X_2 \oplus X_3$, where $\oplus$ denotes XOR. Then $Pr[Y=0 \mid X_3 = 0] =$______.
admin
asked
in
Probability
Apr 18, 2020
by
admin
585
points
17
views
gate2015-3
probability
random-variable
normal
numerical-answers
video-solution
0
votes
0
answers
22
views
GATE2015-3-20 Video Solution
Consider the relation $X(P,Q,R,S,T,U)$ with the following set of functional dependencies $F = \{ \\ \; \; \{P, R\} \rightarrow \{S, T\}, \\ \; \; \{P, S, U\} \rightarrow \{Q, R\} \\ \; \}$ Which of the following is the trivial functional dependency in $F^+$ ... $\{P, R\} \rightarrow \{R, T\}$ $\{P, S\} \rightarrow \{S\}$ $\{P, S, U\} \rightarrow \{Q\}$
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
22
views
gate2015-3
databases
database-normalization
easy
video-solution
0
votes
0
answers
17
views
GATE2015-3-3 Video Solution
Consider the following relation Cinema($\textit{theater, address, capacity}$) Which of the following options will be needed at the end of the SQL query SELECT P1.address FROM Cinema P1 such that it always finds the addresses of theaters with maximum capacity? ... (select max(P2.capacity) from Cinema P2) WHERE P1.capacity > Any (select max(P2.capacity) from Cinema P2)
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
17
views
gate2015-3
databases
sql
normal
video-solution
0
votes
0
answers
19
views
GATE2015-3-35 Video Solution
Consider the equation $(43)_x = (y3)_8$ where $x$ and $y$ are unknown. The number of possible solutions is _____
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
19
views
gate2015-3
digital-logic
number-representation
normal
numerical-answers
video-solution
0
votes
0
answers
23
views
GATE2015-3-33 Video Solution
If the following system has non-trivial solution, $px + qy + rz = 0$ $qx + ry + pz = 0$ $rx + py + qz = 0$, then which one of the following options is TRUE? $p - q + r = 0 \text{ or } p = q = -r$ $p + q - r = 0 \text{ or } p = -q = r$ $p + q + r = 0 \text{ or } p = q = r$ $p - q + r = 0 \text{ or } p = -q = -r$
admin
asked
in
Linear Algebra
Apr 18, 2020
by
admin
585
points
23
views
gate2015-3
linear-algebra
system-of-equations
normal
video-solution
0
votes
0
answers
26
views
GATE2015-3-15 Video Solution
In the given matrix $\begin{bmatrix} 1 & -1 & 2 \\ 0 & 1 & 0 \\ 1 & 2 & 1 \end{bmatrix}$ ... $\left\{a\left(- \sqrt{2},0,1\right) \mid a \neq 0, a \in \mathbb{R}\right\}$
admin
asked
in
Linear Algebra
Apr 18, 2020
by
admin
585
points
26
views
gate2015-3
linear-algebra
eigen-value
normal
video-solution
1
vote
1
answer
31
views
GATE2015-3-7 Video Solution
Consider the following C program segment. # include <stdio.h> int main() { char s1[7] = "1234", *p; p = s1 + 2; *p = '0'; printf("%s", s1); } What will be printed by the program? $12$ $120400$ $1204$ $1034$
admin
asked
in
Programming
Apr 18, 2020
by
admin
585
points
31
views
gate2015-3
programming
programming-in-c
normal
video-solution
0
votes
0
answers
7
views
GATE2015-3-40 Video Solution
Let $G$ be a connected undirected graph of $100$ vertices and $300$ edges. The weight of a minimum spanning tree of $G$ is $500$. When the weight of each edge of $G$ is increased by five, the weight of a minimum spanning tree becomes ______.
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
7
views
gate2015-3
algorithms
spanning-tree
easy
numerical-answers
video-solution
0
votes
0
answers
20
views
GATE2015-3-45 Video Solution
If for non-zero $x, \: af(x) + bf(\frac{1}{x}) = \frac{1}{x} - 25$ where a $a \neq b \text{ then } \int_1^2 f(x)dx$ is $\frac{1}{a^2 - b^2} \begin{bmatrix} a(\ln 2 - 25) + \frac{47b}{2} \end{bmatrix}$ ... $\frac{1}{a^2 - b^2} \begin{bmatrix} a(\ln 2 - 25) - \frac{47b}{2} \end{bmatrix}$
admin
asked
in
Calculus
Apr 18, 2020
by
admin
585
points
20
views
gate2015-3
calculus
integration
normal
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