Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged gatecse-2011
35
votes
6
answers
1
GATE CSE 2011 | Question: 55
An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each edge $(v_i,v_j)$ is assigned a weight $i+j$. A sample graph with $n=4$ is shown below. The length of the path from $v_5$ to $v_6$ in the MST of previous question with $n=10$ is $11$ $25$ $31$ $41$
go_editor
asked
in
Algorithms
Apr 21, 2016
by
go_editor
8.8k
views
gatecse-2011
algorithms
graph-algorithms
spanning-tree
normal
16
votes
2
answers
2
GATE CSE 2011 | Question: 49
Consider the following recursive C function that takes two arguments. unsigned int foo(unsigned int n, unsigned int r) { if (n>0) return ((n%r) + foo(n/r, r)); else return 0; } What is the return value of the function $\text{foo}$ when it is called as $\text{foo(513, 2)}$? $9$ $8$ $5$ $2$
go_editor
asked
in
Algorithms
Apr 21, 2016
by
go_editor
4.0k
views
gatecse-2011
algorithms
recursion
identify-function
normal
24
votes
2
answers
3
GATE CSE 2011 | Question: 51
Consider the following circuit involving three D-type flip-flops used in a certain type of counter configuration. If all the flip-flops were reset to $0$ at power on, what is the total number of distinct outputs (states) represented by $PQR$ generated by the counter? $3$ $4$ $5$ $6$
go_editor
asked
in
Digital Logic
Apr 21, 2016
by
go_editor
5.7k
views
gatecse-2011
digital-logic
circuit-output
normal
50
votes
6
answers
4
GATE CSE 2011 | Question: 53
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ ... the NEXT ROUND of update, what will be the cost to $N1$ in the distance vector of $N3$ ? $3$ $9$ $10$ $\infty$
go_editor
asked
in
Computer Networks
Apr 21, 2016
by
go_editor
18.5k
views
gatecse-2011
computer-networks
routing
distance-vector-routing
normal
32
votes
2
answers
5
GATE CSE 2011 | Question: 24
Let $P$ be a regular language and $Q$ be a context-free language such that $Q \subseteq P$. (For example, let $P$ be the language represented by the regular expression $p^*q^*$ and $Q$ be $\{p^nq^n \mid n \in N\})$. Then which of the following is ALWAYS regular? $P \cap Q$ $P-Q$ $\Sigma^*-P$ $\Sigma^*-Q$
akash
asked
in
Theory of Computation
Oct 30, 2014
by
akash
7.7k
views
gatecse-2011
theory-of-computation
easy
regular-language
23
votes
3
answers
6
GATE CSE 2011 | Question: 65
A container originally contains $10$ litres of pure spirit. From this container, $1$ litre of spirit replaced with $1$ litre of water. Subsequently, $1$ litre of the mixture is again replaced with $1$ litre of water and this process is repeated one more time. How much spirit is now left in the container? $7.58$ litres $7.84$ litres $7$ litres $7.29$ litres
go_editor
asked
in
Quantitative Aptitude
Sep 29, 2014
by
go_editor
8.4k
views
gatecse-2011
quantitative-aptitude
normal
numerical-computation
24
votes
5
answers
7
GATE CSE 2011 | Question: 64
A transporter receives the same number of orders each day. Currently, he has some pending orders (backlog) to be shipped. If he uses $7$ trucks, then at the end of the $4^{th}$ day he can clear all the orders. Alternatively, if he uses only $3$ trucks, then all ... of trucks required so that there will be no pending order at the end of $5^{th}$ day? $4$ $5$ $6$ $7$
go_editor
asked
in
Quantitative Aptitude
Sep 29, 2014
by
go_editor
7.5k
views
gatecse-2011
quantitative-aptitude
normal
work-time
18
votes
2
answers
8
GATE CSE 2011 | Question: 63
The variable cost $(V)$ of manufacturing a product varies according to the equation $V=4q$, where $q$ is the quantity produced. The fixed cost $(F)$ of production of same product reduces with $q$ according to the equation $F=\dfrac{100}{q}$. How many units should be produced to minimize the total cost $(V+F)$? $5$ $4$ $7$ $6$
go_editor
asked
in
Quantitative Aptitude
Sep 29, 2014
by
go_editor
3.6k
views
gatecse-2011
quantitative-aptitude
cost-market-price
normal
26
votes
3
answers
9
GATE CSE 2011 | Question: 62
$P, Q, R$ and $S$ are four types of dangerous microbes recently found in a human habitat. The area of each circle with its diameter printed in brackets represents the growth of a single microbe surviving human immunity system within $24$ hours of ... against the most dangerous microbe. Which microbe should the company target in its first attempt? $P$ $Q$ $R$ $S$
go_editor
asked
in
Quantitative Aptitude
Sep 29, 2014
by
go_editor
5.8k
views
gatecse-2011
quantitative-aptitude
data-interpretation
normal
8
votes
2
answers
10
GATE CSE 2011 | Question: 61
Few school curricula include a unit on how to deal with bereavement and grief, and yet all students at some point in their lives suffer from losses through death and parting. Based on the above passage which topic would not be included in a ... stages are passed through in the healing process what the leading causes of death are how to give support to a grieving friend
go_editor
asked
in
Verbal Aptitude
Sep 29, 2014
by
go_editor
1.9k
views
gatecse-2011
verbal-aptitude
passage-reading
normal
10
votes
4
answers
11
GATE CSE 2011 | Question: 60
Choose the word from the options given below that is most nearly opposite in the meaning to the given word Amalgamate merge split collect separate
go_editor
asked
in
Verbal Aptitude
Sep 29, 2014
by
go_editor
2.2k
views
gatecse-2011
verbal-aptitude
opposite
normal
12
votes
2
answers
12
GATE CSE 2011 | Question: 59
Choose the most appropriate word from the options given below to complete the following sentence. If you are trying to make a strong impression on your audience, you cannot do so by being understated, tentative or ________. hyperbolic restrained argumentative indifferent
go_editor
asked
in
Verbal Aptitude
Sep 29, 2014
by
go_editor
2.3k
views
gatecse-2011
verbal-aptitude
most-appropriate-word
normal
11
votes
2
answers
13
GATE CSE 2011 | Question: 58
Choose the most appropriate word(s) from the options given below to complete the following sentence. I contemplated _________ Singapore for my vacation but decided against it. to visit having to visit visiting for a visit
go_editor
asked
in
Verbal Aptitude
Sep 29, 2014
by
go_editor
3.4k
views
gatecse-2011
verbal-aptitude
most-appropriate-word
easy
18
votes
2
answers
14
GATE CSE 2011 | Question: 57
If $\log (\text{P}) = (1/2)\log (\text{Q}) = (1/3)\log (\text{R})$, then which of the following options is TRUE? $\text{P}^2 = \text{Q}^3\text{R}^2$ $\text{Q}^2=\text{P}\text{R}$ $\text{Q}^2 = \text{R}^3\text{P}$ $\text{R}=\text{P}^2\text{Q}^2$
go_editor
asked
in
Quantitative Aptitude
Sep 29, 2014
by
go_editor
4.0k
views
gatecse-2011
quantitative-aptitude
normal
numerical-computation
logarithms
7
votes
2
answers
15
GATE CSE 2011 | Question: 56
Which of the following options is the closest in the meaning to the word below: Inexplicable Incomprehensible Indelible Inextricable Infallible
go_editor
asked
in
Verbal Aptitude
Sep 29, 2014
by
go_editor
2.3k
views
gatecse-2011
verbal-aptitude
meaning
normal
48
votes
9
answers
16
GATE CSE 2011 | Question: 54
An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each edge $(v_i,v_j)$ is assigned a weight $i+j$. A sample graph with $n=4$ is shown below. ... spanning tree (MST) of such a graph with $n$ nodes? $\frac{1}{12} (11n^2 - 5 n)$ $n^2-n+1$ $6n-11$ $2n+1$
go_editor
asked
in
Algorithms
Sep 29, 2014
by
go_editor
13.5k
views
gatecse-2011
algorithms
graph-algorithms
spanning-tree
normal
42
votes
4
answers
17
GATE CSE 2011 | Question: 52
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ N2: $(1, 0, 6, 7, 3)$ N3: $(7, 6, 0, 2, 6)$ ... $N3$? $(3, 2, 0, 2, 5)$ $(3, 2, 0, 2, 6)$ $(7, 2, 0, 2, 5)$ $(7, 2, 0, 2, 6)$
go_editor
asked
in
Computer Networks
Sep 29, 2014
by
go_editor
17.1k
views
gatecse-2011
computer-networks
routing
distance-vector-routing
normal
24
votes
4
answers
18
GATE CSE 2011 | Question: 50
Consider the following circuit involving three D-type flip-flops used in a certain type of counter configuration. If at some instance prior to the occurrence of the clock edge, $P, Q$ and $R$ have a value $0$, $1$ and $0$ respectively, what shall be the value of $PQR$ after the clock edge? $000$ $001$ $010$ $011$
go_editor
asked
in
Digital Logic
Sep 29, 2014
by
go_editor
9.0k
views
gatecse-2011
digital-logic
circuit-output
flip-flop
normal
16
votes
3
answers
19
GATE CSE 2011 | Question: 48
Consider the following recursive C function that takes two arguments. unsigned int foo(unsigned int n, unsigned int r) { if (n>0) return ((n%r) + foo(n/r, r)); else return 0; } What is the return value of the function $\text{foo}$ when it is called as $\text{foo(345, 10)}$? $345$ $12$ $5$ $3$
go_editor
asked
in
Algorithms
Sep 29, 2014
by
go_editor
7.4k
views
gatecse-2011
algorithms
recursion
identify-function
normal
4
votes
1
answer
20
GATE CSE 2011 | Question: 47
The following is the comment written for a C function. /* This function computes the roots of a quadratic equation a.x^2 + b.x + c = 0. The function stores two real roots in *root1 and *root2 and returns the status of validity of roots. It handles four different kinds of cases. (i) When ... ? (A) T1, T2, T3, T6 (B) T1, T3, T4, T5 (C) T2, T4, T5, T6 (D) T2, T3, T4, T5
go_editor
asked
in
IS&Software Engineering
Sep 29, 2014
by
go_editor
2.4k
views
gatecse-2011
is&software-engineering
test-cases
normal
33
votes
1
answer
21
GATE CSE 2011 | Question: 46
Database table by name $\text{Loan_Records}$ ... Bank_Manager FROM Loan_Records) AS S NATURAL JOIN (SELECT Bank_Manager, Loan_Amount FROM Loan_Records) AS T ); $3$ $9$ $5$ $6$
go_editor
asked
in
Databases
Sep 29, 2014
by
go_editor
8.8k
views
gatecse-2011
databases
sql
normal
31
votes
5
answers
22
GATE CSE 2011 | Question: 45
A deterministic finite automaton ($\text{DFA}$) $D$ with alphabet $\Sigma = \{a, b\}$ is given below. Which of the following finite state machines is a valid minimal $\text{DFA}$ which accepts the same languages as $D$?
go_editor
asked
in
Theory of Computation
Sep 29, 2014
by
go_editor
8.9k
views
gatecse-2011
theory-of-computation
finite-automata
easy
minimal-state-automata
37
votes
1
answer
23
GATE CSE 2011 | Question: 44
An application loads $100$ libraries at startup. Loading each library requires exactly one disk access. The seek time of the disk to a random location is given as $10$ ms. Rotational speed of disk is $6000$ rpm. If all $100$ libraries are loaded from random locations on the disk, how ... start of the block may be neglected.) $0.50 \ s$ $1.50 \ s$ $1.25 \ s$ $1.00 \ s$
go_editor
asked
in
Operating System
Sep 29, 2014
by
go_editor
10.3k
views
gatecse-2011
operating-system
disk
normal
28
votes
3
answers
24
GATE CSE 2011 | Question: 43
An $8\text{KB}$ direct-mapped write-back cache is organized as multiple blocks, each size of $32\text{-bytes}$. The processor generates $32\text{-bit}$ addresses. The cache controller contains the tag information for each cache block comprising of the ... the cache controller to store meta-data (tags) for the cache? $4864$ bits $6144$ bits $6656$ bits $5376$ bits
go_editor
asked
in
CO and Architecture
Sep 29, 2014
by
go_editor
9.3k
views
gatecse-2011
co-and-architecture
cache-memory
normal
52
votes
2
answers
25
GATE CSE 2011 | Question: 42
Definition of a language $L$ with alphabet $\{a\}$ is given as following.$ L = \left\{a^{nk} \mid k > 0, \:\: and \:\: n \text{ is a positive integer constant} \right\}$What is the minimum number of states needed in a DFA to recognize $L$? $k+1$ $n+1$ $2^{n+1}$ $2^{k+1}$
go_editor
asked
in
Theory of Computation
Sep 29, 2014
by
go_editor
14.0k
views
gatecse-2011
theory-of-computation
finite-automata
normal
minimal-state-automata
39
votes
2
answers
26
GATE CSE 2011 | Question: 41
Consider an instruction pipeline with four stages $\text{(S1, S2, S3 and S4)}$ each with combinational circuit only. The pipeline registers are required between each stage and at the end of the last stage. Delays for the stages and for the pipeline ... under ideal conditions when compared to the corresponding non-pipeline implementation? $4.0$ $2.5$ $1.1$ $3.0$
go_editor
asked
in
CO and Architecture
Sep 29, 2014
by
go_editor
10.5k
views
gatecse-2011
co-and-architecture
pipelining
normal
22
votes
4
answers
27
GATE CSE 2011 | Question: 40
Consider the matrix as given below. $\begin{bmatrix} 1 & 2 & 3 \\ 0 & 4 & 7 \\ 0 & 0 & 3\end{bmatrix}$ Which one of the following options provides the CORRECT values of the eigenvalues of the matrix? $1, 4, 3$ $3, 7, 3$ $7, 3, 2$ $1, 2, 3$
go_editor
asked
in
Linear Algebra
Sep 29, 2014
by
go_editor
3.7k
views
gatecse-2011
linear-algebra
eigen-value
easy
33
votes
6
answers
28
GATE CSE 2011 | Question: 39
Consider a relational table $r$ with sufficient number of records, having attributes $A_1, A_2, \dots ,A_n$ and let $1 \leq p \leq n$. Two queries $Q1$ and $Q2$ ... queries Hashing will outperform ordered indexing on $Q1$, but not on $Q2$ Hashing will outperform ordered indexing on $Q2$, but not on $Q1$
go_editor
asked
in
Databases
Sep 29, 2014
by
go_editor
7.3k
views
gatecse-2011
databases
indexing
normal
29
votes
4
answers
29
GATE CSE 2011 | Question: 38
Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q, \:\:q \times r, \:\:r \times s$ and $s \times t$ respectively can be multiplied in several ways with different number of total scalar multiplications. For example when multiplied as ... $t=80$, then the minimum number of scalar multiplications needed is $248000$ $44000$ $19000$ $25000$
go_editor
asked
in
Algorithms
Sep 29, 2014
by
go_editor
12.2k
views
gatecse-2011
algorithms
dynamic-programming
normal
39
votes
5
answers
30
GATE CSE 2011 | Question: 37
Which of the given options provides the increasing order of asymptotic complexity of functions $f_1, f_2, f_3$ and $f_4$? $f_1(n) = 2^n$ $f_2(n) = n^{3/2}$ $f_3(n) = n \log_2 n$ $f_4(n) = n^{\log_2 n}$ $f_3, f_2, f_4, f_1$ $f_3, f_2, f_1, f_4$ $f_2, f_3, f_1, f_4$ $f_2, f_3, f_4, f_1$
go_editor
asked
in
Algorithms
Sep 29, 2014
by
go_editor
14.2k
views
gatecse-2011
algorithms
asymptotic-notations
normal
Page:
1
2
3
next »
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent questions tagged gatecse-2011
Recent Blog Comments
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
@GO Classes @Deepak Poonia @Sachin...
@GO Classes @Deepak Poonia sir...
Maximum age limit changed from 35 yrs. to 28...