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-2000
48
votes
4
answers
31
GATE CSE 2000 | Question: 2.16
Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited `in a postorder, inorder and preorder traversal respectively, of a complete binary tree. Which of the following is always true? LASTIN = LASTPOST LASTIN = LASTPRE LASTPRE = LASTPOST None of the above
Kathleen
asked
in
DS
Sep 14, 2014
by
Kathleen
17.5k
views
gatecse-2000
data-structures
binary-tree
normal
27
votes
1
answer
32
GATE CSE 2000 | Question: 2.15
Suppose you are given an array $s[1....n]$ and a procedure reverse $(s, i, j)$ which reverses the order of elements in $s$ between positions $i$ and $j$ (both inclusive). What does the following sequence do, where $1 \leqslant k \leqslant n$: ... reverse (s, 1, n); Rotates $s$ left by $k$ positions Leaves $s$ unchanged Reverses all elements of $s$ None of the above
Kathleen
asked
in
Algorithms
Sep 14, 2014
by
Kathleen
9.0k
views
gatecse-2000
algorithms
normal
identify-function
41
votes
4
answers
33
GATE CSE 2000 | Question: 2.14
Consider the values of $A = 2.0 \times 10^{30}, B = -2.0 \times 10^{30}, C = 1.0,$ and the sequence X:= A + B Y:= A + C X:= X + C Y:= Y + B executed on a computer where floating point numbers are represented with $32$ bits. The values for $X$ and $Y$ will be $X = 1.0, Y = 1.0$ $X = 1.0, Y = 0.0$ $X = 0.0, Y = 1.0$ $X = 0.0, Y = 0.0$
Kathleen
asked
in
Digital Logic
Sep 14, 2014
by
Kathleen
11.9k
views
gatecse-2000
digital-logic
number-representation
normal
21
votes
1
answer
34
GATE CSE 2000 | Question: 2.13
A graphics card has on board memory of $1$ MB. Which of the following modes can the card not support? $1600 \times 400$ resolution with $256$ colors on a $17$ inch monitor $1600 \times 400$ resolution with $16$ million colors on a $14$ inch monitor ... with $16$ million colors on a $17$ inch monitor $800 \times 800$ resolution with $256$ colors on a $14$ inch monitor
Kathleen
asked
in
Computer Graphics
Sep 14, 2014
by
Kathleen
11.2k
views
gatecse-2000
operating-system
normal
computer-graphics
non-gate
37
votes
5
answers
35
GATE CSE 2000 | Question: 2.12
The following arrangement of master-slave flip flops has the initial state of $P, Q$ as $0, 1$ (respectively). After three clock cycles the output state $P, Q$ is (respectively), $1, 0$ $1, 1$ $0, 0$ $0, 1$
Kathleen
asked
in
Digital Logic
Sep 14, 2014
by
Kathleen
11.5k
views
gatecse-2000
digital-logic
circuit-output
normal
flip-flop
35
votes
6
answers
36
GATE CSE 2000 | Question: 2.11
Which functions does NOT implement the Karnaugh map given below? $(w + x) y$ $xy + yw$ $(w + x) (\bar{w} + y) (\bar{x} + y)$ None of the above
Kathleen
asked
in
Digital Logic
Sep 14, 2014
by
Kathleen
7.1k
views
gatecse-2000
digital-logic
k-map
normal
41
votes
5
answers
37
GATE CSE 2000 | Question: 2.10
The simultaneous equations on the Boolean variables $x, y, z$ and $w$, $x + y + z = 1 $ $xy = 0$ $xz + w = 1$ $xy + \bar{z}\bar{w} = 0$ have the following solution for $x, y, z$ and $w,$ respectively: $0 \ 1 \ 0 \ 0$ $1 \ 1 \ 0 \ 1$ $1 \ 0 \ 1 \ 1$ $1 \ 0 \ 0 \ 0$
Kathleen
asked
in
Digital Logic
Sep 14, 2014
by
Kathleen
7.1k
views
gatecse-2000
digital-logic
boolean-algebra
easy
46
votes
2
answers
38
GATE CSE 2000 | Question: 2.9
Consider the following decision problems: $(P1):$ Does a given finite state machine accept a given string? $(P2):$ Does a given context free grammar generate an infinite number of strings? Which of the following statements is true? Both$(P1)$ and $(P2)$ are decidable Neither $(P1)$ nor $(P2)$ is decidable Only $(P1)$ is decidable Only $(P2)$ is decidable
Kathleen
asked
in
Theory of Computation
Sep 14, 2014
by
Kathleen
8.9k
views
gatecse-2000
theory-of-computation
decidability
normal
39
votes
6
answers
39
GATE CSE 2000 | Question: 2.8
What can be said about a regular language $L$ over $\{ a \}$ whose minimal finite state automaton has two states? $L$ must be $\{a^n \mid n \ \text{ is odd}\}$ $L$ must be $\{a^n \mid n \ \text{ is even}\}$ $L$ must be $\{a^n \mid n \geq 0\}$ Either $L$ must be $\{a^n \mid n \text{ is odd}\}$, or $L$ must be $\{a^n \mid n \text{ is even}\}$
Kathleen
asked
in
Theory of Computation
Sep 14, 2014
by
Kathleen
8.9k
views
gatecse-2000
theory-of-computation
easy
regular-language
47
votes
7
answers
40
GATE CSE 2000 | Question: 2.7
Let $a, b, c, d$ be propositions. Assume that the equivalence $a ⇔ ( b \vee \neg b)$ and $b ⇔c$ hold. Then the truth-value of the formula $(a ∧ b) → (a ∧ c) ∨ d$ is always True False Same as the truth-value of $b$ Same as the truth-value of $d$
Kathleen
asked
in
Mathematical Logic
Sep 14, 2014
by
Kathleen
12.1k
views
gatecse-2000
mathematical-logic
normal
propositional-logic
60
votes
6
answers
41
GATE CSE 2000 | Question: 2.6
Let $P(S)$ denotes the power set of set $S.$ Which of the following is always true? $P(P(S)) = P(S)$ $P(S) ∩ P(P(S)) = \{ Ø \}$ $P(S) ∩ S = P(S)$ $S ∉ P(S)$
Kathleen
asked
in
Set Theory & Algebra
Sep 14, 2014
by
Kathleen
13.5k
views
gatecse-2000
set-theory&algebra
easy
set-theory
39
votes
5
answers
42
GATE CSE 2000 | Question: 2.5
A relation $R$ is defined on the set of integers as $xRy$ iff $(x + y)$ is even. Which of the following statements is true? $R$ is not an equivalence relation $R$ is an equivalence relation having $1$ equivalence class $R$ is an equivalence relation having $2$ equivalence classes $R$ is an equivalence relation having $3$ equivalence classes
Kathleen
asked
in
Set Theory & Algebra
Sep 14, 2014
by
Kathleen
14.0k
views
gatecse-2000
set-theory&algebra
relations
normal
37
votes
4
answers
43
GATE CSE 2000 | Question: 2.4
A polynomial $p(x)$ satisfies the following: $p(1) = p(3) = p(5) = 1$ $p(2) = p(4) = -1$ The minimum degree of such a polynomial is $1$ $2$ $3$ $4$
Kathleen
asked
in
Set Theory & Algebra
Sep 14, 2014
by
Kathleen
7.7k
views
gatecse-2000
set-theory&algebra
normal
polynomials
35
votes
3
answers
44
GATE CSE 2000 | Question: 2.3
Let $S = \sum_{i=3}^{100} i \log_{2} i$, and $T = \int_{2}^{100} x \log_{2}x dx$. Which of the following statements is true? $S > T$ $S = T$ $S < T$ and $2S > T$ $2S ≤ T$
Kathleen
asked
in
Calculus
Sep 14, 2014
by
Kathleen
6.4k
views
gatecse-2000
calculus
integration
normal
28
votes
3
answers
45
GATE CSE 2000 | Question: 2.2
$E_{1}$ and $E_{2}$ are events in a probability space satisfying the following constraints: $Pr$\left ( E_{1} \right )$ = $Pr$\left ( E_{2} \right )$ $Pr$\left ( E_{1}\cup E_{2} \right )$ = $1$ $E_{1}$ and $E_{2}$ are independent The value of $Pr$\left ( E_{1} \right )$, the probability of the event $E_{1}$, is $0$ $\dfrac{1}{4}$ $\dfrac{1}{2}$ $1$
Kathleen
asked
in
Probability
Sep 14, 2014
by
Kathleen
5.2k
views
gatecse-2000
probability
easy
independent-events
5
votes
2
answers
46
GATE CSE 2000 | Question: 2.1
X, Y and Z are closed intervals of unit length on the real line. The overlap of X and Y is half a unit. The overlap of Y and Z is also half a unit. Let the overlap of X and Z be k units. Which of the following is true? k must be 1 k must be 0 k can take any value between 0 and 1 None of the above
Kathleen
asked
in
Numerical Methods
Sep 14, 2014
by
Kathleen
1.9k
views
gatecse-2000
numerical-methods
normal
non-gate
out-of-gate-syllabus
43
votes
3
answers
47
GATE CSE 2000 | Question: 1.23, ISRO2016-57
Given the relations employee (name, salary, dept-no), and department (dept-no, dept-name,address), Which of the following queries cannot be expressed using the basic relational algebra operations ... whose name is the same as their department name The sum of all employees' salaries All employees of a given department
Kathleen
asked
in
Databases
Sep 14, 2014
by
Kathleen
14.8k
views
gatecse-2000
databases
relational-algebra
easy
isro2016
45
votes
4
answers
48
GATE CSE 2000 | Question: 1.22, UGCNET-June2012-II: 11
B$^{+}$-trees are preferred to binary trees in databases because Disk capacities are greater than memory capacities Disk access is much slower than memory access Disk data transfer rates are much less than memory data transfer rates Disks are more reliable than memory
Kathleen
asked
in
Databases
Sep 14, 2014
by
Kathleen
15.5k
views
gatecse-2000
databases
b-tree
normal
ugcnetcse-june2012-paper2
48
votes
7
answers
49
GATE CSE 2000 | Question: 1.21
Let $m[0]\ldots m[4]$ be mutexes (binary semaphores) and $P[0]\ldots P[4]$ be processes. Suppose each process $P[i]$ executes the following: wait (m[i]); wait (m(i+1) mod 4]); ........... release (m[i]); release (m(i+1) mod 4]); This could cause Thrashing Deadlock Starvation, but not deadlock None of the above
Kathleen
asked
in
Operating System
Sep 14, 2014
by
Kathleen
21.9k
views
gatecse-2000
operating-system
process-synchronization
normal
41
votes
6
answers
50
GATE CSE 2000 | Question: 1.20, ISRO2008-47
Which of the following need not necessarily be saved on a context switch between processes? General purpose registers Translation look-aside buffer Program counter All of the above
Kathleen
asked
in
Operating System
Sep 14, 2014
by
Kathleen
11.9k
views
gatecse-2000
operating-system
easy
isro2008
context-switch
22
votes
6
answers
51
GATE CSE 2000 | Question: 1.19, UGCNET-Dec2013-II: 30
Which of the following derivations does a top-down parser use while parsing an input string? The input is scanned from left to right. Leftmost derivation Leftmost derivation traced out in reverse Rightmost derivation Rightmost derivation traced out in reverse
Kathleen
asked
in
Compiler Design
Sep 14, 2014
by
Kathleen
7.7k
views
gatecse-2000
compiler-design
parsing
normal
ugcnetcse-dec2013-paper2
41
votes
7
answers
52
GATE CSE 2000 | Question: 1.18, ISRO2015-25
The number of tokens in the following C statement is printf("i=%d, &i=%x", i, &i); $3$ $26$ $10$ $21$
Kathleen
asked
in
Compiler Design
Sep 14, 2014
by
Kathleen
36.5k
views
gatecse-2000
compiler-design
compiler-tokenization
easy
isro2015
51
votes
4
answers
53
GATE CSE 2000 | Question: 1.17, ISRO2015-79
Consider the following C declaration: struct { short x[5]; union { float y; long z; } u; )t; Assume that the objects of the type short, float and long occupy $2$ bytes, $4$ bytes and $8$ bytes, respectively. The memory requirement for variable $t$, ignoring alignment consideration, is: $22$ bytes $14$ bytes $18$ bytes $10$ bytes
Kathleen
asked
in
Programming in C
Sep 14, 2014
by
Kathleen
20.6k
views
gatecse-2000
programming
programming-in-c
easy
isro2015
union
42
votes
9
answers
54
GATE CSE 2000 | Question: 1.16
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable
Kathleen
asked
in
Programming in C
Sep 14, 2014
by
Kathleen
22.2k
views
gatecse-2000
programming
easy
aliasing
59
votes
6
answers
55
GATE CSE 2000 | Question: 1.15
Let $S$ be a sorted array of $n$ integers. Let $T(n)$ denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than $1000$ in $S$. Which of the following statement is true? $T (n)$ is $O(1)$ $n \leq T(n) \leq n \log_2 n$ $n \log_2 n ≤ T(n) < \frac{n}{2}$ $T(n) = \left (\frac{n}{2} \right)$
Kathleen
asked
in
Algorithms
Sep 14, 2014
by
Kathleen
15.6k
views
gatecse-2000
easy
algorithms
time-complexity
33
votes
8
answers
56
GATE CSE 2000 | Question: 1.14
Consider the following nested representation of binary trees: $(X \ Y \ Z)$ indicates $Y$ and $Z$ are the left and right subtrees, respectively, of node $X$. Note that $Y$ and $Z$ may be $NULL$ ... $(1 \ (2 \ 3 \ 4) \ (5 \ 6 \ 7))$ $(1 \ (2 \ 3 \ NULL) \ (4 \ 5))$
Kathleen
asked
in
DS
Sep 14, 2014
by
Kathleen
10.9k
views
gatecse-2000
data-structures
binary-tree
easy
25
votes
2
answers
57
GATE CSE 2000 | Question: 1.13
The most appropriate matching for the following pairs $\begin{array}{|l|l|}\hline \text{X: depth first search} & \text{1: heap } \\\hline \text{Y: breadth first search} & \text{2: queue} \\\hline \text{Z: sorting} & \text{3: stack} \\\hline \end{array}$ ... $\text{X - 3, Y - 2, Z - 1}$ $\text{X - 2, Y - 3, Z - 1}$
Kathleen
asked
in
Algorithms
Sep 14, 2014
by
Kathleen
5.4k
views
gatecse-2000
algorithms
easy
graph-algorithm
graph-search
match-the-following
51
votes
3
answers
58
GATE CSE 2000 | Question: 1.12
The most appropriate matching for the following pairs ... $X - 3 \ \ Y - 2 \ \ Z - 1$ $X - 3 \ \ Y - 1 \ \ Z - 2$
Kathleen
asked
in
Programming in C
Sep 14, 2014
by
Kathleen
11.8k
views
gatecse-2000
programming
programming-in-c
easy
match-the-following
pointers
41
votes
5
answers
59
GATE CSE 2000 | Question: 1.11
The following C declarations: struct node { int i: float j; }; struct node *s[10]; define s to be: An array, each element of which is a pointer to a structure of type node A structure of $2$ ... $3$ fields: an integer, a float, and an array of $10$ elements An array, each element of which is a structure of type node
Kathleen
asked
in
Programming in C
Sep 14, 2014
by
Kathleen
19.2k
views
gatecse-2000
programming
programming-in-c
easy
structure
28
votes
2
answers
60
GATE CSE 2000 | Question: 1.10
The most appropriate matching for the following pairs$\begin{array}{ll} \text{X: Indirect addressing} & \text{1: Loops } \\ \text{Y: Immediate addressing } & \text{2: Pointers} \\ \text{Z: Auto decrement addressing } & \text{3: Constants } \\ \end{array}$ is $X - 3, Y - 2, Z - 1$ $X - 1, Y - 3, Z - 2$ $X - 2, Y - 3, Z - 1$ $X - 3, Y - 1, Z - 2$
Kathleen
asked
in
CO and Architecture
Sep 14, 2014
by
Kathleen
8.4k
views
gatecse-2000
co-and-architecture
easy
addressing-modes
match-the-following
Page:
« prev
1
2
3
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged gatecse-2000
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...