The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged tifr2011
+5
votes
1
answer
1
TIFR2011B40
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 language C. Object oriented languages are more powerful than declarative programming languages. Parallelism cannot be realized in object oriented languages.
asked
Oct 26, 2015
in
Object Oriented Programming
by
makhdoom ghaya
Boss
(
30.7k
points)

302
views
tifr2011
programming
objectorientedprogramming
nongate
+9
votes
3
answers
2
TIFR2011B39
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$ comparisons are necessary ... $O (\log (m  n))$ comparisons suffice. $O (\log n)$ comparisons suffice. $O (\log (m / n))$ comparisons suffice.
asked
Oct 25, 2015
in
Algorithms
by
makhdoom ghaya
Boss
(
30.7k
points)

863
views
tifr2011
algorithms
sorting
+15
votes
2
answers
3
TIFR2011B38
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. Recursive programs require dynamic memory management. Recursive programs do not terminate sometimes. Iterative programs and recursive programs are equally expressive.
asked
Oct 25, 2015
in
Programming
by
makhdoom ghaya
Boss
(
30.7k
points)

1.4k
views
tifr2011
recursion
programming
+5
votes
1
answer
4
TIFR2011B37
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 that the input ... be solved in polynomial time, however the forward problem is $NP$hard. Both the forward and reverse problem are $NP$hard. None of the above.
asked
Oct 25, 2015
in
Algorithms
by
makhdoom ghaya
Boss
(
30.7k
points)

382
views
tifr2011
algorithms
pnpnpcnph
+13
votes
2
answers
5
TIFR2011B36
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.
asked
Oct 25, 2015
in
Computer Networks
by
makhdoom ghaya
Boss
(
30.7k
points)

655
views
tifr2011
computernetworks
networksecurity
+11
votes
3
answers
6
TIFR2011B35
Let $G$ be a connected simple graph (no selfloops 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 following statements ... weight spanning tree. The edge $e_{m}$ is never present in any maximum weight spanning tree. $G$ has a unique maximum weight spanning tree.
asked
Oct 24, 2015
in
Algorithms
by
makhdoom ghaya
Boss
(
30.7k
points)

580
views
tifr2011
algorithms
graphalgorithms
spanningtree
+3
votes
1
answer
7
TIFR2011B34
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 semaphores. Split binary ... are equivalent. All statements a  c are false. Petri nets with and without inhibitor arcs have the same power.
asked
Oct 22, 2015
in
Operating System
by
makhdoom ghaya
Boss
(
30.7k
points)

502
views
tifr2011
operatingsystem
processsynchronization
+12
votes
1
answer
8
TIFR2011B33
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.
asked
Oct 22, 2015
in
Graph Theory
by
makhdoom ghaya
Boss
(
30.7k
points)

616
views
tifr2011
graphtheory
trees
+4
votes
1
answer
9
TIFR2011B32
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.
asked
Oct 22, 2015
in
Programming
by
makhdoom ghaya
Boss
(
30.7k
points)

316
views
tifr2011
programming
parameterpassing
+23
votes
2
answers
10
TIFR2011B31
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. Both these elements ... $2n  3$ comparisons are necessary to determine these two elements. $nk$ comparisons are necessary to determine these two elements.
asked
Oct 22, 2015
in
Algorithms
by
makhdoom ghaya
Boss
(
30.7k
points)

2.3k
views
tifr2011
algorithms
sorting
+18
votes
3
answers
11
TIFR2011B30
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$ is a permutation 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.
asked
Oct 22, 2015
in
DS
by
makhdoom ghaya
Boss
(
30.7k
points)

1.1k
views
tifr2011
datastructures
arrays
+14
votes
3
answers
12
TIFR2011B29
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 $B$ in the ... be placed on top of another ring with a lower number. How many moves are required? $501$ $1023$ $2011$ $10079$ None of the above.
asked
Oct 22, 2015
in
Algorithms
by
makhdoom ghaya
Boss
(
30.7k
points)

734
views
tifr2011
algorithms
algorithmdesign
+10
votes
2
answers
13
TIFR2011B28
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 by both are ... exactly the 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.
asked
Oct 22, 2015
in
Operating System
by
makhdoom ghaya
Boss
(
30.7k
points)

556
views
tifr2011
processsynchronization
operatingsystem
normal
+22
votes
5
answers
14
TIFR2011B27
Let $n$ be a large integer. Which of the following statements is TRUE? $n^{1 / \sqrt{\log_2 n}} < \sqrt{\log_2 n} < n^{1/100}$ $n^{1/100} < n^{1 / \sqrt{\log_2 n}} < \sqrt{\log_2 n}$ $n^{1 / \sqrt{\log_2 n}} < n^{1/100} < \sqrt{\log_2 n}$ $\sqrt{\log_2 n} < n^{1 / \sqrt{\log_2 n}} < n^{1/100}$ $\sqrt{\log_2 n} < n^{1/100} < n^{1 / \sqrt{\log_2 n}}$
asked
Oct 22, 2015
in
Algorithms
by
makhdoom ghaya
Boss
(
30.7k
points)

969
views
tifr2011
asymptoticnotations
+17
votes
4
answers
15
TIFR2011B26
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 of the following is ... (i). Starvation is possible in (i). Deadlock is not possible in (ii). Starvation is not possible in (ii)
asked
Oct 22, 2015
in
Operating System
by
makhdoom ghaya
Boss
(
30.7k
points)

1.4k
views
tifr2011
operatingsystem
processsynchronization
+15
votes
1
answer
16
TIFR2011B25
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}$ ... $L$ is $\mathbf{NP}$ complete, $A_{TM}$ is polynomial time reducible to $L$. $A_{TM} \notin \mathbf{NP}$.
asked
Oct 20, 2015
in
Theory of Computation
by
makhdoom ghaya
Boss
(
30.7k
points)

651
views
tifr2011
theoryofcomputation
decidability
+3
votes
0
answers
17
TIFR2011B24
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 result in a ... Possible in all sequential programming languages when the compiler appropriately translates the ∥ operator to interleaved statements in the sequential language. None of the above.
asked
Oct 20, 2015
in
Programming
by
makhdoom ghaya
Boss
(
30.7k
points)

168
views
tifr2011
programming
nongate
+8
votes
3
answers
18
TIFR2011B23
Suppose $(S_{1}, S_{2},\ldots,S_{m})$ is a finite collection of nonempty 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 sets $S_{i}$ and ... of a finite universe $U$ and a choice of $S_{i}$ and $S_{j}$ in each step such that the process does not terminate.
asked
Oct 20, 2015
in
Set Theory & Algebra
by
makhdoom ghaya
Boss
(
30.7k
points)

443
views
tifr2011
settheory&algebra
sets
+16
votes
1
answer
19
TIFR2011B22
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 multiprocessor models. P and Q are equivalent for all multicore machines. P and Q are equivalent for all networks of computers. None of the above
asked
Oct 20, 2015
in
Operating System
by
makhdoom ghaya
Boss
(
30.7k
points)

838
views
tifr2011
operatingsystem
processsynchronization
+15
votes
2
answers
20
TIFR2011B21
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 ]$ ... $O \left ( n^{2} \right )$ time but not in $O(n\log n)$ time. None of the above.
asked
Oct 20, 2015
in
Algorithms
by
makhdoom ghaya
Boss
(
30.7k
points)

628
views
tifr2011
algorithms
sorting
+5
votes
1
answer
21
TIFR2011A20
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.
asked
Oct 19, 2015
in
Numerical Ability
by
makhdoom ghaya
Boss
(
30.7k
points)

299
views
tifr2011
numericalability
permutationandcombination
+18
votes
6
answers
22
TIFR2011A19
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)$
asked
Oct 19, 2015
in
Probability
by
Arjun
Veteran
(
431k
points)

880
views
tifr2011
probability
+7
votes
1
answer
23
TIFR2011A18
The equation of the tangent to the unit circle at point ($\cos \alpha, \sin \alpha $) is $x\cos \alphay \sin\alpha=1 $ $x\sin \alphay \cos\alpha =1$ $x\cos \alpha+ y\sin\alpha=1 $ $x\sin \alphay \cos\alpha=1 $ None of the above.
asked
Oct 19, 2015
in
Numerical Ability
by
makhdoom ghaya
Boss
(
30.7k
points)

350
views
tifr2011
numericalability
geometry
circle
+4
votes
1
answer
24
TIFR2011A17
What is the value of the following limit? $\lim_{x \to 0} \frac{2^x1}{x}$ $0$ $\log_2(e)$ $\log_e(2)$ $1$ None of the above.
asked
Oct 19, 2015
in
Calculus
by
makhdoom ghaya
Boss
(
30.7k
points)

434
views
tifr2011
limits
+11
votes
2
answers
25
TIFR2011A16
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.
asked
Oct 19, 2015
in
Digital Logic
by
makhdoom ghaya
Boss
(
30.7k
points)

614
views
tifr2011
numberrepresentation
+7
votes
1
answer
26
TIFR2011A15
The exponent of $3$ in the product $100!$ is $27$ $33$ $44$ $48$ None of the above.
asked
Oct 19, 2015
in
Numerical Ability
by
makhdoom ghaya
Boss
(
30.7k
points)

302
views
tifr2011
numericalability
factors
tricky
+9
votes
3
answers
27
TIFR2011A14
What is the value of the following limit? $\lim_{x \to 0} \frac{d}{dx}\,\frac{\sin^2 x}{x}$ $0$ $2$ $1$ $\frac{1}{2}$ None of the above
asked
Oct 19, 2015
in
Calculus
by
makhdoom ghaya
Boss
(
30.7k
points)

639
views
tifr2011
calculus
limits
+6
votes
2
answers
28
TIFR2011A13
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.
asked
Oct 19, 2015
in
Numerical Ability
by
makhdoom ghaya
Boss
(
30.7k
points)

342
views
tifr2011
numericalability
complexnumber
+16
votes
2
answers
29
TIFR2011A12
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 taker (an outsider) ... B is a Knave. A is a Knave and B is a Knight. Both are Knaves. Both are Knights. No conclusion can be drawn.
asked
Oct 19, 2015
in
Mathematical Logic
by
makhdoom ghaya
Boss
(
30.7k
points)

548
views
tifr2011
mathematicallogic
logicalreasoning
+6
votes
3
answers
30
TIFR2011A11
$\int_{0}^{1} \ln x\, \mathrm{d}x=$ $1$ $1$ $\infty $ $\infty $ None of the above.
asked
Oct 19, 2015
in
Calculus
by
makhdoom ghaya
Boss
(
30.7k
points)

603
views
tifr2011
calculus
integration
Page:
1
2
next »
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
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
Follow @csegate
Recent questions tagged tifr2011
Recent Blog Comments
@Susheel It will be 1250 only,because when you...
In set A, Little endian question answer given...
What about this...
Compared to previous years...was this paper...
sure buddyy..
50,737
questions
57,279
answers
198,173
comments
104,839
users