Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatecse-2011
63
63 votes
7
answers
7 answers
21.1k
21.1k views
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 ...
go_editor
21.1k
views
asked
Apr 21, 2016
Algorithms
gatecse-2011
algorithms
graph-algorithms
minimum-spanning-tree
normal
+
–
30
30 votes
2
answers
2 answers
9.3k
9.3k views
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...
go_editor
9.3k
views
asked
Apr 21, 2016
Algorithms
gatecse-2011
algorithms
recursion
identify-function
normal
+
–
38
38 votes
3
answers
3 answers
13.0k
13.0k views
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...
go_editor
13.0k
views
asked
Apr 21, 2016
Digital Logic
gatecse-2011
digital-logic
circuit-output
normal
+
–
91
91 votes
10
answers
10 answers
40.5k
40.5k views
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 distanc...
go_editor
40.5k
views
asked
Apr 21, 2016
Computer Networks
gatecse-2011
computer-networks
routing
distance-vector-routing
normal
+
–
50
50 votes
2
answers
2 answers
17.0k
17.0k views
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...
akash
17.0k
views
asked
Oct 29, 2014
Theory of Computation
gatecse-2011
theory-of-computation
easy
regular-language
+
–
45
45 votes
6
answers
6 answers
18.4k
18.4k views
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 mixt...
go_editor
18.4k
views
asked
Sep 29, 2014
Quantitative Aptitude
gatecse-2011
quantitative-aptitude
normal
alligation-mixture
+
–
54
54 votes
6
answers
6 answers
17.0k
17.0k views
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...
go_editor
17.0k
views
asked
Sep 29, 2014
Quantitative Aptitude
gatecse-2011
quantitative-aptitude
normal
work-time
+
–
27
27 votes
3
answers
3 answers
7.9k
7.9k views
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...
go_editor
7.9k
views
asked
Sep 29, 2014
Quantitative Aptitude
gatecse-2011
quantitative-aptitude
cost-market-price
normal
+
–
54
54 votes
3
answers
3 answers
14.1k
14.1k views
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 gro...
go_editor
14.1k
views
asked
Sep 29, 2014
Quantitative Aptitude
gatecse-2011
quantitative-aptitude
data-interpretation
normal
+
–
18
18 votes
2
answers
2 answers
5.5k
5.5k views
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 part...
go_editor
5.5k
views
asked
Sep 29, 2014
Verbal Aptitude
gatecse-2011
verbal-aptitude
passage-reading
normal
+
–
18
18 votes
4
answers
4 answers
6.1k
6.1k views
GATE CSE 2011 | Question: 60
Choose the word from the options given below that is most nearly opposite in the meaning to the given wordAmalgamatemergesplitcollectseparate
go_editor
6.1k
views
asked
Sep 29, 2014
Verbal Aptitude
gatecse-2011
verbal-aptitude
antonyms
normal
+
–
23
23 votes
4
answers
4 answers
6.9k
6.9k views
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 canno...
go_editor
6.9k
views
asked
Sep 29, 2014
Verbal Aptitude
gatecse-2011
verbal-aptitude
most-appropriate-word
normal
+
–
24
24 votes
2
answers
2 answers
8.7k
8.7k views
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...
go_editor
8.7k
views
asked
Sep 29, 2014
Verbal Aptitude
gatecse-2011
verbal-aptitude
most-appropriate-word
easy
+
–
31
31 votes
5
answers
5 answers
10.0k
10.0k views
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}\te...
go_editor
10.0k
views
asked
Sep 29, 2014
Quantitative Aptitude
gatecse-2011
quantitative-aptitude
normal
logarithms
+
–
16
16 votes
4
answers
4 answers
6.2k
6.2k views
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
6.2k
views
asked
Sep 29, 2014
Verbal Aptitude
gatecse-2011
verbal-aptitude
synonyms
normal
+
–
78
78 votes
11
answers
11 answers
27.6k
27.6k views
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 ...
go_editor
27.6k
views
asked
Sep 29, 2014
Algorithms
gatecse-2011
algorithms
graph-algorithms
minimum-spanning-tree
normal
+
–
72
72 votes
8
answers
8 answers
38.7k
38.7k views
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 distanc...
go_editor
38.7k
views
asked
Sep 29, 2014
Computer Networks
gatecse-2011
computer-networks
routing
distance-vector-routing
normal
+
–
35
35 votes
5
answers
5 answers
16.1k
16.1k views
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 ...
go_editor
16.1k
views
asked
Sep 29, 2014
Digital Logic
gatecse-2011
digital-logic
circuit-output
flip-flop
normal
+
–
25
25 votes
3
answers
3 answers
12.0k
12.0k views
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...
go_editor
12.0k
views
asked
Sep 29, 2014
Algorithms
gatecse-2011
algorithms
recursion
identify-function
normal
+
–
4
4 votes
1
answers
1 answer
4.5k
4.5k views
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 ...
go_editor
4.5k
views
asked
Sep 29, 2014
IS&Software Engineering
gatecse-2011
is&software-engineering
test-cases
normal
out-of-gatecse-syllabus
+
–
53
53 votes
2
answers
2 answers
19.9k
19.9k views
GATE CSE 2011 | Question: 46
Database table by name $\text{Loan_Records}$ is given below.$$\begin{array}{|c|c|c|} \hline \textbf {Borrower} & \textbf {Bank_Manager} &\textbf {Loan_Amount} \\\hline \...
go_editor
19.9k
views
asked
Sep 29, 2014
Databases
gatecse-2011
databases
sql
normal
+
–
47
47 votes
7
answers
7 answers
17.0k
17.0k views
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 $\tex...
go_editor
17.0k
views
asked
Sep 29, 2014
Theory of Computation
gatecse-2011
theory-of-computation
finite-automata
easy
minimal-state-automata
+
–
56
56 votes
2
answers
2 answers
20.1k
20.1k views
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...
go_editor
20.1k
views
asked
Sep 29, 2014
Operating System
gatecse-2011
operating-system
disk
normal
+
–
47
47 votes
3
answers
3 answers
21.3k
21.3k views
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 cac...
go_editor
21.3k
views
asked
Sep 29, 2014
CO & Architecture
gatecse-2011
co-and-architecture
cache-memory
normal
+
–
90
90 votes
4
answers
4 answers
28.1k
28.1k views
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\}$$...
go_editor
28.1k
views
asked
Sep 29, 2014
Theory of Computation
gatecse-2011
theory-of-computation
finite-automata
normal
minimal-state-automata
+
–
62
62 votes
4
answers
4 answers
22.7k
22.7k views
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 stag...
go_editor
22.7k
views
asked
Sep 29, 2014
CO & Architecture
gatecse-2011
co-and-architecture
pipelining
normal
+
–
55
55 votes
6
answers
6 answers
10.9k
10.9k views
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...
go_editor
10.9k
views
asked
Sep 29, 2014
Linear Algebra
gatecse-2011
linear-algebra
eigen-value
easy
+
–
65
65 votes
6
answers
6 answers
18.6k
18.6k views
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$ are given...
go_editor
18.6k
views
asked
Sep 29, 2014
Databases
gatecse-2011
databases
indexing
normal
+
–
51
51 votes
6
answers
6 answers
25.2k
25.2k views
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 d...
go_editor
25.2k
views
asked
Sep 29, 2014
Algorithms
gatecse-2011
algorithms
dynamic-programming
normal
matrix-chain-ordering
+
–
74
74 votes
6
answers
6 answers
30.2k
30.2k views
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_...
go_editor
30.2k
views
asked
Sep 29, 2014
Algorithms
gatecse-2011
algorithms
asymptotic-notations
normal
+
–
Page:
1
2
3
next »