menu
Recent questions tagged gate2013
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged gate2013
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions tagged gate2013
0
votes
0
answers
62
views
GATE2013-45 Video Solution
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are ... during the execution of this program, the time (in ns) needed to complete the program is $132$ $165$ $176$ $328$
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
62
views
gate2013
normal
co-and-architecture
pipelining
video-solution
0
votes
0
answers
28
views
GATE2013-52 Video Solution
A computer uses $46-bit$ virtual address, $32-bit$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $(T1)$, which occupies exactly one page. Each entry of $T1$ stores the base address ... size is $64$ bytes. What is the size of a page in $KB$ in this computer? $2$ $4$ $8$ $16$
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
28
views
gate2013
operating-system
virtual-memory
normal
video-solution
0
votes
0
answers
29
views
GATE2013-39 Video Solution
A certain computation generates two arrays a and b such that $a[i] = f(i)$ for $0 \leq i < n$ and $b[i] = g(a[i])$ for $0 \leq i < n$. Suppose this computation is decomposed into two concurrent processes $X$ and $Y$ such that $X$ computes the array $a$ and $Y$ computes the ... EntryY(R, S) { V(S); P(R); } ExitX(R, S) { V(R); P(S); } EntryY(R, S) { V(S); P(R); }
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
29
views
gate2013
operating-system
process-synchronization
normal
video-solution
0
votes
0
answers
20
views
GATE2013-53 Video Solution
A computer uses $46-bit$ virtual address, $32-bit$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table ($T1$), which occupies exactly one page. Each entry of $T1$ ... to guarantee that no two synonyms map to different sets in the processor cache of this computer? $2$ $4$ $8$ $16$
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
20
views
gate2013
normal
operating-system
virtual-memory
video-solution
0
votes
0
answers
17
views
GATE2013-29 Video Solution
Consider a hard disk with $16$ recording surfaces $(0-15)$ having 16384 cylinders $(0-16383)$ and each cylinder contains $64$ sectors $(0-63)$. Data storage capacity in each sector is $512$ bytes. Data are organized cylinder-wise and the addressing format ... number of the last sector of the file, if it is stored in a contiguous manner? $1281$ $1282$ $1283$ $1284$
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
17
views
gate2013
operating-system
disks
normal
video-solution
0
votes
0
answers
21
views
GATE2013-30 Video Solution
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is $\Theta(1)$ $\Theta(\sqrt{\log} n)$ $\Theta(\frac{\log n}{\log \log n})$ $\Theta(\log n)$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
21
views
gate2013
algorithms
sorting
normal
video-solution
0
votes
0
answers
26
views
GATE2013-44 Video Solution
Consider the following operation along with Enqueue and Dequeue operations on queues, where $k$ is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m > 0) { Dequeue(Q) m = m – 1 } } What is the worst case time complexity of a sequence of $n$ queue operations on an initially empty queue? $Θ(n)$ $Θ(n + k)$ $Θ(nk)$ $Θ(n^2)$
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
26
views
gate2013
data-structures
algorithms
normal
queue
video-solution
0
votes
0
answers
24
views
GATE2013-9 Video Solution
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilon$ and $A \rightarrow a$) to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^{n}$
admin
asked
in
Compiler Design
Apr 18, 2020
by
admin
585
points
24
views
gate2013
compiler-design
parsing
normal
video-solution
0
votes
0
answers
21
views
GATE2013-37 Video Solution
In an IPv4 datagram, the $M$ bit is $0$, the value of $HLEN$ is $10$, the value of total length is $400$ and the fragment offset value is $300$. The position of the datagram, the sequence numbers of the first and the last bytes of the payload, ... , $2400$ and $2789$ First fragment, $2400$ and $2759$ Last fragment, $2400$ and $2759$ Middle fragment, $300$ and $689$
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
21
views
gate2013
computer-networks
ip-addressing
normal
video-solution
0
votes
0
answers
25
views
GATE2013-42 Video Solution
What is the return value of $f(p,p)$, if the value of $p$ is initialized to $5$ before the call? Note that the first parameter is passed by reference, whereas the second parameter is passed by value. int f (int &x, int c) { c = c - 1; if (c==0) return 1; x = x + 1; return f(x,c) * x; }
admin
asked
in
Programming
Apr 18, 2020
by
admin
585
points
25
views
gate2013
compiler-design
normal
marks-to-all
numerical-answers
parameter-passing
runtime-environments
video-solution
0
votes
0
answers
20
views
GATE2013-34 Video Solution
A shared variable $x$, initialized to zero, is operated on by four concurrent processes $W, X, Y, Z$ as follows. Each of the processes $W$ and $X$ reads $x$ from memory, increments by one, stores it to memory, and then terminates. Each of the ... initialized to two. What is the maximum possible value of $x$ after all processes complete execution? $-2$ $-1$ $1$ $2$
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
20
views
gate2013
operating-system
process-synchronization
normal
video-solution
0
votes
0
answers
13
views
GATE2013-31 Video Solution
Consider the following function: int unknown(int n){ int i, j, k=0; for (i=n/2; i<=n; i++) for (j=2; j<=n; j=j*2) k = k + n/2; return (k); } The return value of the function is $\Theta(n^2)$ $\Theta(n^2\log n)$ $\Theta(n^3)$ $\Theta(n^3\log n)$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
13
views
gate2013
algorithms
identify-function
normal
video-solution
0
votes
0
answers
26
views
GATE2013-24 Video Solution
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\dfrac{1}{2}.$ What is the expected number of unordered cycles of length three? $\dfrac {1}{8}$ $1$ $7$ $8$
admin
asked
in
Probability
Apr 18, 2020
by
admin
585
points
26
views
gate2013
probability
expectation
normal
video-solution
1
vote
1
answer
16
views
GATE2013-36 Video Solution
Determine the maximum length of the cable (in km) for transmitting data at a rate of $500$ Mbps in an Ethernet LAN with frames of size $10,000$ bits. Assume the signal speed in the cable to be $2,00,000$ km/s. $1$ $2$ $2.5$ $5$
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
16
views
gate2013
computer-networks
ethernet
normal
video-solution
0
votes
0
answers
15
views
GATE2013-16 Video Solution
Three concurrent processes $X$, $Y$, and $Z$ execute three different code segments that access and update certain shared variables. Process $X$ executes the $P$ operation (i.e., $wait$) on semaphores $a$, $b$ and $c$; process $Y$ executes the $P$ operation on semaphores $b$, $c$ and $d$; process $Z$ ... $X:$ $P(a)P(b)P(c)$ $Y:$ $P(c)P(b)P(d)$ $Z:$ $P(c)P(d)P(a)$
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
15
views
gate2013
operating-system
resource-allocation
normal
video-solution
0
votes
0
answers
19
views
GATE2013-10 Video Solution
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with zero (the lowest priority). The scheduler re-evaluates the process priorities every $T$ time units and decides the next process ... is equivalent to the shortest-job-first algorithm. This algorithm is equivalent to the shortest-remaining-time-first algorithm.
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
19
views
gate2013
operating-system
process-scheduling
normal
video-solution
0
votes
0
answers
16
views
GATE2013-8 Video Solution
Consider the languages $L_1 = \phi$ and $L_2 = \{a\}$. Which one of the following represents $L_1 {L_2}^* \cup {L_1}^*$ ? $\{\epsilon\}$ $\phi$ $a^*$ $\{\epsilon, a\}$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
16
views
gate2013
theory-of-computation
normal
regular-languages
video-solution
0
votes
0
answers
15
views
GATE2013-14 Video Solution
Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D. Network layer - $4$ times and Data link layer ... $4$ times and Data link layer - $6$ times Network layer - $2$ times and Data link layer - $6$ times
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
15
views
gate2013
computer-networks
network-layering
normal
video-solution
0
votes
0
answers
17
views
GATE2013-20 Video Solution
In a $k$-way set associative cache, the cache is divided into $v$ sets, each of which consists of $k$ lines. The lines of a set are placed in sequence one after another. The lines in set $s$ are sequenced before the lines in set $(s+1)$. The main memory blocks are numbered 0 onwards. The ... $(j \text{ mod } k) * v \text{ to } (j \text{ mod } k) * v + (v-1) $
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
17
views
gate2013
co-and-architecture
cache-memory
normal
video-solution
0
votes
0
answers
19
views
GATE2013-26 Video Solution
The line graph $L(G)$ of a simple graph $G$ is defined as follows: There is exactly one vertex $v(e)$ in $L(G)$ for each edge $e$ in $G$. For any two edges $e$ and $e'$ in $G$, $L(G)$ has an edge between $v(e)$ and $v(e')$, if and only if $e$ and ... of a planar graph is planar. (S) The line graph of a tree is a tree. $P$ only $P$ and $R$ only $R$ only $P, Q$ and $S$ only
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
19
views
gate2013
graph-theory
normal
line-graph
video-solution
0
votes
0
answers
17
views
GATE2013-54 Video Solution
Relation $R$ has eight attributes $\text{ABCDEFGH}$. Fields of $R$ contain only atomic values. $F$= $\text{{CH→G, A→BC, B→CFH, E→A, F→EG}}$ is a set of functional dependencies $(FDs)$ so that $F^+$ is exactly the set of $FDs$ that hold for $R$. How many candidate keys does the relation $R$ have? $3$ $4$ $5$ $6$
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
17
views
gate2013
databases
database-normalization
normal
video-solution
0
votes
0
answers
22
views
GATE2013-28 Video Solution
Consider the following sequence of micro-operations. MBR ← PC MAR ← X PC ← Y Memory ← MBR Which one of the following is a possible operation performed by this sequence? Instruction fetch Operand fetch Conditional branch Initiation of interrupt service
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
22
views
gate2013
co-and-architecture
microprogramming
normal
video-solution
0
votes
0
answers
26
views
GATE2013-40 Video Solution
Consider the following two sets of LR(1) items of an LR(1) grammar.$\begin{array}{l|l} X \rightarrow c.X, c/d &X → c.X, \$\\ X \rightarrow .cX, c/d& X → .cX, \$\\ X \rightarrow .d, c/d & X → .d, \$ ... Cannot be merged since goto on c will lead to two different sets. $1$ only $2$ only $1$ and $4$ only $\text{1, 2, 3}$ and $4$
admin
asked
in
Compiler Design
Apr 18, 2020
by
admin
585
points
26
views
gate2013
compiler-design
parsing
normal
video-solution
1
vote
1
answer
98
views
GATE2013-35 Video Solution
Consider the following relational schema. Students(rollno: integer, sname: string) Courses(courseno: integer, cname: string) Registration(rollno: integer, courseno: integer, percent: real) Which of the following queries are equivalent to this query in English? Find the distinct names of ... I, II, III and IV I, II and III only I, II and IV only II, III and IV only
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
98
views
gate2013
databases
sql
relational-calculus
normal
video-solution
0
votes
0
answers
17
views
GATE2013-32 Video Solution
Consider the following languages. $L_1 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0 \right \}$ $L_2 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0, p\neq r \right \}$ Which one of the following statements is FALSE? $L_2$ is context-free. $L_1\cap L_2$ is context-free. Complement of $L_2$ is recursive. Complement of $L_1$ is context-free but not regular.
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
17
views
gate2013
theory-of-computation
identify-class-language
normal
video-solution
0
votes
0
answers
19
views
GATE2013-19 Video Solution
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices? $\theta(n^2)$ $\theta(n^2\log n)$ $\theta(n^3)$ $\theta(n^3\log n)$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
19
views
gate2013
algorithms
graph-algorithms
normal
video-solution
0
votes
0
answers
17
views
GATE2013-33 Video Solution
Consider the DFA $A$ given below. Which of the following are FALSE? Complement of $L(A)$ is context-free. $L(A) = L((11^*0+0)(0 + 1)^*0^*1^*) $ For the language accepted by $A, A$ is the minimal DFA. $A$ accepts all strings over $\{0, 1\}$ of length at least $2$. 1 and 3 only 2 and 4 only 2 and 3 only 3 and 4 only
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
17
views
gate2013
theory-of-computation
finite-automata
normal
video-solution
0
votes
0
answers
21
views
GATE2013-15 Video Solution
An index is clustered, if it is on a set of fields that form a candidate key it is on a set of fields that include the primary key the data records of the file are organized in the same order as the data entries of the index the data records of the file are organized not in the same order as the data entries of the index
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
21
views
gate2013
databases
indexing
normal
video-solution
0
votes
0
answers
25
views
GATE2013-47 Video Solution
Which one of the following is NOT logically equivalent to $¬∃x(∀ y (α)∧∀z(β ))$ ? $∀ x(∃ z(¬β )→∀ y(α))$ $∀x(∀ z(β )→∃ y(¬α))$ $∀x(∀ y(α)→∃z(¬β ))$ $∀x(∃ y(¬α)→∃z(¬β ))$
admin
asked
in
Mathematical Logic
Apr 18, 2020
by
admin
585
points
25
views
mathematical-logic
normal
marks-to-all
gate2013
first-order-logic
video-solution
0
votes
0
answers
20
views
GATE2013-17 Video Solution
Which of the following statements is/are FALSE? For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. Turing recognizable languages are closed under union and complementation. Turing decidable languages are closed under intersection ... languages are closed under union and intersection. 1 and 4 only 1 and 3 only 2 only 3 only
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
20
views
gate2013
theory-of-computation
normal
closure-property
video-solution
0
votes
0
answers
24
views
GATE2013-27 Video Solution
What is the logical translation of the following statement? "None of my friends are perfect." $∃x(F (x)∧ ¬P(x))$ $∃ x(¬ F (x)∧ P(x))$ $ ∃x(¬F (x)∧¬P(x))$ $ ¬∃ x(F (x)∧ P(x))$
admin
asked
in
Mathematical Logic
Apr 18, 2020
by
admin
585
points
24
views
gate2013
mathematical-logic
easy
first-order-logic
video-solution
0
votes
0
answers
15
views
GATE2013-7 Video Solution
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of $n$ nodes? $O(1)$ $O(\log n)$ $O(n)$ $O(n \log n)$
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
15
views
gate2013
data-structures
easy
binary-search-tree
video-solution
0
votes
0
answers
16
views
GATE2013-50 Video Solution
The procedure given below is required to find and replace certain characters inside an input character string supplied in array $A$. The characters to be replaced are supplied in array $oldc$ ... given above, how many test cases will be able to capture the flaw? Only one Only two Only three All four
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
16
views
gate2013
data-structures
arrays
normal
video-solution
0
votes
0
answers
20
views
GATE2013-13 Video Solution
Using public key cryptography, $X$ adds a digital signature σ to message $M$, encrypts $<M, \sigma>$, and sends it to $Y$, where it is decrypted. Which one of the following sequences of keys is used for the operations? Encryption: $X's$ private key ... : $X's$ private key followed by $Y's$ public key; Decryption: $Y's$ private key followed by $X's$ public key
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
20
views
gate2013
computer-networks
network-security
normal
video-solution
0
votes
0
answers
18
views
GATE2013-2 Video Solution
Suppose $p$ is the number of cars per minute passing through a certain road junction between $5$ PM and $6$ PM, and $p$ has a Poisson distribution with mean $3$. What is the probability of observing fewer than $3$ cars during any given minute in this interval? $\dfrac{8}{(2e^{3})}$ $\dfrac{9}{(2e^{3})}$ $\dfrac{17}{(2e^{3})}$ $\dfrac{26}{(2e^{3})}$
admin
asked
in
Probability
Apr 18, 2020
by
admin
585
points
18
views
gate2013
probability
poisson-distribution
normal
video-solution
0
votes
0
answers
24
views
GATE2013-65 Video Solution
The current erection cost of a structure is Rs. 13,200. If the labour wages per day increase by 1/5 of the current wages and the working hours decrease by 1/24 of the current period, then the new cost of erection in Rs. is 16,500 15,180 11,000 10,120
admin
asked
in
Numerical Ability
Apr 18, 2020
by
admin
585
points
24
views
gate2013
numerical-ability
normal
work-time
video-solution
0
votes
0
answers
15
views
GATE2013-41 Video Solution
Which of the following is/are undecidable? $G$ is a CFG. Is $L(G) = \phi$? $G$ is a CFG. Is $L(G) = \Sigma^*$? $M$ is a Turing machine. Is $L(M)$ regular? $A$ is a DFA and $N$ is an NFA. Is $L(A) = L(N)$? 3 only 3 and 4 only 1, 2 and 3 only 2 and 3 only
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
15
views
gate2013
theory-of-computation
decidability
normal
video-solution
0
votes
0
answers
29
views
GATE2013-25 Video Solution
Which of the following statements is/are TRUE for undirected graphs? P: Number of odd degree vertices is even. Q: Sum of degrees of all vertices is even. P only Q only Both P and Q Neither P nor Q
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
29
views
gate2013
graph-theory
easy
degree-of-graph
video-solution
0
votes
0
answers
18
views
GATE2013-4 Video Solution
The smallest integer that can be represented by an $8-bit$ number in $2's$ complement form is $-256$ $-128$ $-127$ $0$
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
18
views
gate2013
digital-logic
number-representation
easy
video-solution
0
votes
0
answers
23
views
GATE2013-12 Video Solution
The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are TCP, UDP, UDP and TCP UDP, TCP, TCP and UDP UDP, TCP, UDP and TCP TCP, UDP, TCP and UDP
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
23
views
gate2013
computer-networks
tcp
udp
easy
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