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 tifr2011
5
votes
2
answers
1
TIFR CSE 2011 | Part B | Question: 40
Consider the class of object oriented languages. Which of the following is true? Pascal is an object oriented language. Object oriented languages require heap management. Object oriented languages cannot be implemented in ... languages are more powerful than declarative programming languages. Parallelism cannot be realized in object oriented languages.
makhdoom ghaya
asked
in
Object Oriented Programming
Oct 26, 2015
by
makhdoom ghaya
780
views
tifr2011
programming
object-oriented-programming
non-gate
17
votes
3
answers
2
TIFR CSE 2011 | Part B | Question: 39
The first $n$ cells of an array $L$ contain positive integers sorted in decreasing order, and the remaining $m - n$ cells all contain 0. Then, given an integer $x$, in how many comparisons can one find the position of $x$ in $L$? At least $n$ ... $O (\log n)$ comparisons suffice. $O (\log (m / n))$ comparisons suffice.
makhdoom ghaya
asked
in
Algorithms
Oct 25, 2015
by
makhdoom ghaya
2.8k
views
tifr2011
algorithms
sorting
20
votes
2
answers
3
TIFR CSE 2011 | Part B | Question: 38
Consider the class of recursive and iterative programs. Which of the following is false? Recursive programs are more powerful than iterative programs. For every iterative program there is an equivalent recursive program. ... memory management. Recursive programs do not terminate sometimes. Iterative programs and recursive programs are equally expressive.
makhdoom ghaya
asked
in
Programming
Oct 25, 2015
by
makhdoom ghaya
5.0k
views
tifr2011
recursion
programming
7
votes
1
answer
4
TIFR CSE 2011 | Part B | Question: 37
Given an integer $n\geq 3$, consider the problem of determining if there exist integers $a,b\geq 2$ such that $n=a^{b}$. Call this the forward problem. The reverse problem is: given $a$ and $b$, compute $a^{b}$ (mod b). Note ... in polynomial time, however the forward problem is $NP$-hard. Both the forward and reverse problem are $NP$-hard. None of the above.
makhdoom ghaya
asked
in
Algorithms
Oct 25, 2015
by
makhdoom ghaya
1.1k
views
tifr2011
algorithms
p-np-npc-nph
13
votes
2
answers
5
TIFR CSE 2011 | Part B | Question: 36
Consider malware programs. Which of the following is true? A worm is a parasite. A virus cannot affect a linux operating system. A trojan can be in the payload of only a worm. A worm and virus are self replicating programs. There is no difference between a virus and a worm.
makhdoom ghaya
asked
in
Computer Networks
Oct 25, 2015
by
makhdoom ghaya
1.4k
views
tifr2011
computer-networks
network-security
14
votes
3
answers
6
TIFR CSE 2011 | Part B | Question: 35
Let $G$ be a connected simple graph (no self-loops or parallel edges) on $n\geq 3$ vertices, with distinct edge weights. Let $e_{1}, e_{2},...,e_{m}$ be an ordering of the edges in decreasing order of weight. Which of the ... spanning tree. The edge $e_{m}$ is never present in any maximum weight spanning tree. $G$ has a unique maximum weight spanning tree.
makhdoom ghaya
asked
in
Algorithms
Oct 24, 2015
by
makhdoom ghaya
1.9k
views
tifr2011
algorithms
graph-algorithms
minimum-spanning-tree
7
votes
1
answer
7
TIFR CSE 2011 | Part B | Question: 34
Consider the class of synchronization primitives. Which of the following is false? Test and set primitives are as powerful as semaphores. There are various synchronizations that can be implemented using an array of semaphores but not by binary ... equivalent. All statements a - c are false. Petri nets with and without inhibitor arcs have the same power.
makhdoom ghaya
asked
in
Operating System
Oct 22, 2015
by
makhdoom ghaya
1.6k
views
tifr2011
operating-system
process-synchronization
17
votes
1
answer
8
TIFR CSE 2011 | Part B | Question: 33
Which of the following is NOT a sufficient and necessary condition for an undirected graph $G$ to be a tree? $G$ is connected and has $n -1$ edges. $G$ is acyclic and connected. $G$ is acyclic and has $n - 1$ edges. $G$ is acyclic, connected and has $n - 1$ edges. $G$ has $n - 1$ edges.
makhdoom ghaya
asked
in
Graph Theory
Oct 22, 2015
by
makhdoom ghaya
1.7k
views
tifr2011
graph-theory
graph-connectivity
9
votes
2
answers
9
TIFR CSE 2011 | Part B | Question: 32
Various parameter passing mechanisms have been in used in different programming languages. Which of the following statements is true? Call by value result is used in language Ada. Call by value result is the same as call by name. Call by value is the most robust. Call by reference is the same as call by name. Call by name is the most efficient.
makhdoom ghaya
asked
in
Programming
Oct 22, 2015
by
makhdoom ghaya
1.4k
views
tifr2011
programming
parameter-passing
36
votes
4
answers
10
TIFR CSE 2011 | Part B | Question: 31
Given a set of $n=2^{k}$ distinct numbers, we would like to determine the smallest and the second smallest using comparisons. Which of the following statements is TRUE? Both these elements can be determined using $2k$ comparisons. ... $nk$ comparisons are necessary to determine these two elements.
makhdoom ghaya
asked
in
Algorithms
Oct 22, 2015
by
makhdoom ghaya
6.1k
views
tifr2011
algorithms
sorting
25
votes
5
answers
11
TIFR CSE 2011 | Part B | Question: 30
Consider an array $A[1...n]$. It consists of a permutation of numbers $1....n$. Now compute another array $B[1...n]$ as follows: $B[A[i]]:= i$ for all $i$. Which of the following is true? $B$ will be a sorted array. $B$ ... of array $A$. Doing the same transformation twice will not give the same array. $B$ is not a permutation of array $A$. None of the above.
makhdoom ghaya
asked
in
DS
Oct 22, 2015
by
makhdoom ghaya
3.9k
views
tifr2011
data-structures
array
18
votes
3
answers
12
TIFR CSE 2011 | Part B | Question: 29
You are given ten rings numbered from $1$ to $10$, and three pegs labeled $A$, $B$, and $C$. Initially all the rings are on peg $A$, arranged from top to bottom in ascending order of their numbers. The goal is to move all the rings to peg ... on top of another ring with a lower number. How many moves are required? $501$ $1023$ $2011$ $10079$ None of the above.
makhdoom ghaya
asked
in
Algorithms
Oct 22, 2015
by
makhdoom ghaya
2.2k
views
tifr2011
data-structures
stack
tower-of-hanoi
12
votes
2
answers
13
TIFR CSE 2011 | Part B | Question: 28
Consider a basic block: x:= a[i]; a[j]:= y; z:= a[j] optimized by removing common sub expression a[i] as follows: x:= a[i]; z:= x; a[j]:= y. Which of the following is true? Both are equivalent. The values computed ... same values only if $i$ is not equal to $j$. They will be equivalent in concurrent programming languages with shared memory. None of the above.
makhdoom ghaya
asked
in
Operating System
Oct 22, 2015
by
makhdoom ghaya
1.3k
views
tifr2011
process-synchronization
operating-system
normal
30
votes
5
answers
14
TIFR CSE 2011 | Part B | Question: 27
Let $n$ be a large integer. Which of the following statements is TRUE? $n^\frac{1}{ \sqrt{\log_2 n}} < \sqrt{\log_2 n} < n^\frac{1}{100}$ $n^\frac{1}{100} < n^\frac{1} {\sqrt{\log_2 n}} < \sqrt{\log_2 n}$ ... $\sqrt{\log_2 n} < n^\frac{1}{100} < n^\frac{1}{\sqrt{\log_2 n}}$
makhdoom ghaya
asked
in
Algorithms
Oct 22, 2015
by
makhdoom ghaya
3.3k
views
tifr2011
asymptotic-notations
21
votes
5
answers
15
TIFR CSE 2011 | Part B | Question: 26
Consider the following two scenarios in the dining philosophers problem: First a philosopher has to enter a room with the table that restricts the number of philosophers to four. There is no restriction on the number of philosophers entering the room. Which ... . Starvation is possible in (i). Deadlock is not possible in (ii). Starvation is not possible in (ii)
makhdoom ghaya
asked
in
Operating System
Oct 22, 2015
by
makhdoom ghaya
4.8k
views
tifr2011
operating-system
process-synchronization
20
votes
2
answers
16
TIFR CSE 2011 | Part B | Question: 25
Let $A_{TM}$ be defined as follows: $A_{TM}=\left \{ \left \langle M, w \right \rangle \mid \text{ The Turing machine $M$ accepts the word } w \right \}$ And let $L$ be some $\mathbf{NP}-$ complete language. Which of the following statements is ... Since $L$ is $\mathbf{NP}-$ complete, $A_{TM}$ is polynomial time reducible to $L$. $A_{TM} \notin \mathbf{NP}$.
makhdoom ghaya
asked
in
Theory of Computation
Oct 20, 2015
by
makhdoom ghaya
1.7k
views
tifr2011
theory-of-computation
decidability
3
votes
0
answers
17
TIFR CSE 2011 | Part B | Question: 24
Consider the program x:=0; y:=0; (r1:=x; r2:=x; y:= if r1 = r2 then 1 ∥ r3:= y; x:= r3) Note that ∥ denotes the parallel operator. In which of the following cases can the program possibly ... in all sequential programming languages when the compiler appropriately translates the ∥ operator to interleaved statements in the sequential language. None of the above.
makhdoom ghaya
asked
in
Programming
Oct 20, 2015
by
makhdoom ghaya
345
views
tifr2011
programming
non-gate
10
votes
3
answers
18
TIFR CSE 2011 | Part B | Question: 23
Suppose $(S_{1}, S_{2},\ldots,S_{m})$ is a finite collection of non-empty subsets of a universe $U.$ Note that the sets in this collection need not be distinct. Consider the following basic step to be performed on this sequence. While there exist ... finite universe $U$ and a choice of $S_{i}$ and $S_{j}$ in each step such that the process does not terminate
makhdoom ghaya
asked
in
Set Theory & Algebra
Oct 20, 2015
by
makhdoom ghaya
1.3k
views
tifr2011
set-theory&algebra
set-theory
19
votes
1
answer
19
TIFR CSE 2011 | Part B | Question: 22
Consider the program P:: x:=1; y:=1; z:=1; u:=0 And the program Q:: x, y, z, u := 1, 1, 1, 1; u:= 0 Which of the following is true? P and Q are equivalent for sequential processors. P and Q are equivalent for all multi-processor models. P and Q are equivalent for all multi-core machines. P and Q are equivalent for all networks of computers. None of the above
makhdoom ghaya
asked
in
Operating System
Oct 20, 2015
by
makhdoom ghaya
1.8k
views
tifr2011
operating-system
process-synchronization
17
votes
2
answers
20
TIFR CSE 2011 | Part B | Question: 21
Let $S=\left \{ x_{1},....,x_{n} \right \}$ be a set of $n$ numbers. Consider the problem of storing the elements of $S$ in an array $A\left [ 1...n \right ]$ ... time. This problem can be solved in $O \left ( n^{2} \right )$ time but not in $O(n\log n)$ time. None of the above.
makhdoom ghaya
asked
in
Algorithms
Oct 20, 2015
by
makhdoom ghaya
1.6k
views
tifr2011
algorithms
sorting
6
votes
2
answers
21
TIFR CSE 2011 | Part A | Question: 20
Let $n>1$ be an odd integer. The number of zeros at the end of the number $99^{n}+1$ is $1$ $2$ $3$ $4$ None of the above
makhdoom ghaya
asked
in
Quantitative Aptitude
Oct 19, 2015
by
makhdoom ghaya
834
views
tifr2011
quantitative-aptitude
modular-arithmetic
26
votes
6
answers
22
TIFR CSE 2011 | Part A | Question: 19
Three dice are rolled independently. What is the probability that the highest and the lowest value differ by $4$? $\left(\dfrac{1}{3}\right)$ $\left(\dfrac{1}{6}\right)$ $\left(\dfrac{1}{9}\right)$ $\left(\dfrac{5}{18}\right)$ $\left(\dfrac{2}{9}\right)$
Arjun
asked
in
Probability
Oct 19, 2015
by
Arjun
2.2k
views
tifr2011
probability
independent-events
10
votes
1
answer
23
TIFR CSE 2011 | Part A | Question: 18
The equation of the tangent to the unit circle at point ($\cos \alpha, \sin \alpha $) is $x\cos \alpha-y \sin\alpha=1 $ $x\sin \alpha-y \cos\alpha =1$ $x\cos \alpha+ y\sin\alpha=1 $ $x\sin \alpha-y \cos\alpha=1 $ None of the above
makhdoom ghaya
asked
in
Quantitative Aptitude
Oct 19, 2015
by
makhdoom ghaya
873
views
tifr2011
quantitative-aptitude
geometry
circle
6
votes
1
answer
24
TIFR CSE 2011 | Part A | Question: 17
What is $\lim_{x \to 0} \frac{2^x-1}{x}$ $0$ $\log_2(e)$ $\log_e(2)$ $1$ None of the above
makhdoom ghaya
asked
in
Calculus
Oct 19, 2015
by
makhdoom ghaya
1.1k
views
tifr2011
limits
14
votes
2
answers
25
TIFR CSE 2011 | Part A | Question: 16
A variable that takes thirteen possible values can be communicated using? Thirteen bits. Three bits. $\log_{2}13$ bits. Four bits. None of the above.
makhdoom ghaya
asked
in
Digital Logic
Oct 19, 2015
by
makhdoom ghaya
1.6k
views
tifr2011
number-representation
11
votes
3
answers
26
TIFR CSE 2011 | Part A | Question: 15
The exponent of $3$ in the product $100!$ is $27$ $33$ $44$ $48$ None of the above
makhdoom ghaya
asked
in
Quantitative Aptitude
Oct 19, 2015
by
makhdoom ghaya
922
views
tifr2011
quantitative-aptitude
factors
tricky
12
votes
3
answers
27
TIFR CSE 2011 | Part A | Question: 14
The limit $\lim_{x \to 0} \frac{d}{dx}\,\frac{\sin^2 x}{x}$ is $0$ $2$ $1$ $\frac{1}{2}$ None of the above
makhdoom ghaya
asked
in
Calculus
Oct 19, 2015
by
makhdoom ghaya
1.8k
views
tifr2011
calculus
limits
8
votes
4
answers
28
TIFR CSE 2011 | Part A | Question: 13
If $z=\dfrac{\sqrt{3}-i}{2}$ and $\large(z^{95}+ i^{67})^{97}= z^{n}$, then the smallest value of $n$ is $1$ $10$ $11$ $12$ None of the above
makhdoom ghaya
asked
in
Quantitative Aptitude
Oct 19, 2015
by
makhdoom ghaya
933
views
tifr2011
quantitative-aptitude
complex-number
21
votes
3
answers
29
TIFR CSE 2011 | Part A | Question: 12
The action for this problem takes place in an island of Knights and Knaves, where Knights always make true statements and Knaves always make false statements and everybody is either a Knight or a Knave. Two friends A and B lives in a house. The census ... a Knave. A is a Knave and B is a Knight. Both are Knaves. Both are Knights. No conclusion can be drawn.
makhdoom ghaya
asked
in
Mathematical Logic
Oct 19, 2015
by
makhdoom ghaya
1.4k
views
tifr2011
mathematical-logic
propositional-logic
10
votes
3
answers
30
TIFR CSE 2011 | Part A | Question: 11
$\int_{0}^{1} \log_e(x) dx=$ $1$ $-1$ $\infty $ $-\infty $ None of the above
makhdoom ghaya
asked
in
Calculus
Oct 19, 2015
by
makhdoom ghaya
1.7k
views
tifr2011
calculus
definite-integral
Page:
1
2
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
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
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
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged tifr2011
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...