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-2002
29
votes
6
answers
31
GATE CSE 2002 | Question: 2.17
The binary relation $S= \phi \text{(empty set)}$ on a set $A = \left \{ 1,2,3 \right \}$ is Neither reflexive nor symmetric Symmetric and reflexive Transitive and reflexive Transitive and symmetric
Kathleen
asked
in
Set Theory & Algebra
Sep 15, 2014
by
Kathleen
12.9k
views
gatecse-2002
set-theory&algebra
normal
relations
22
votes
5
answers
32
GATE CSE 2002 | Question: 2.16
Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is $\frac{1}{16}$ $\frac{1}{8}$ $\frac{7}{8}$ $\frac{15}{16}$
Kathleen
asked
in
Probability
Sep 15, 2014
by
Kathleen
10.5k
views
gatecse-2002
probability
easy
binomial-distribution
0
votes
1
answer
33
GATE CSE 2002 | Question: 2.15
The Newton-Raphson iteration $X_{n+1} = (\frac{X_n}{2}) + \frac{3}{(2X_n)}$ can be used to solve the equation $X^2 =3$ $X^3 =3$ $X^2 =2$ $X^3 =2$
Kathleen
asked
in
Numerical Methods
Sep 15, 2014
by
Kathleen
816
views
gatecse-2002
numerical-methods
normal
non-gate
37
votes
5
answers
34
GATE CSE 2002 | Question: 2.14
Which of the following is true? The complement of a recursive language is recursive The complement of a recursively enumerable language is recursively enumerable The complement of a recursive language is either recursive or recursively enumerable The complement of a context-free language is context-free
Kathleen
asked
in
Theory of Computation
Sep 15, 2014
by
Kathleen
11.4k
views
gatecse-2002
theory-of-computation
easy
closure-property
26
votes
3
answers
35
GATE CSE 2002 | Question: 2.13
The smallest finite automaton which accepts the language $\{x \mid$ length of $x$ is divisible by $3\}$ has $2$ states $3$ states $4$ states $5$ states
Kathleen
asked
in
Theory of Computation
Sep 15, 2014
by
Kathleen
7.9k
views
gatecse-2002
theory-of-computation
normal
finite-automata
minimal-state-automata
101
votes
7
answers
36
GATE CSE 2002 | Question: 2.12
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the furthest ... which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$
Kathleen
asked
in
DS
Sep 15, 2014
by
Kathleen
23.3k
views
gatecse-2002
data-structures
binary-tree
normal
47
votes
7
answers
37
GATE CSE 2002 | Question: 2.11
The running time of the following algorithm Procedure $A(n)$ If $n \leqslant 2$ return ($1$) else return $(A( \lceil \sqrt{n} \rceil))$; is best described by $O(n)$ $O(\log n)$ $O(\log \log n)$ $O(1)$
Kathleen
asked
in
Algorithms
Sep 15, 2014
by
Kathleen
17.8k
views
gatecse-2002
algorithms
recurrence-relation
normal
71
votes
11
answers
38
GATE CSE 2002 | Question: 2.10
Consider the following algorithm for searching for a given number $x$ in an unsorted array $A[1..n]$ having $n$ distinct values: Choose an $i$ at random from $1..n$ If $A[i] = x$, then Stop else Goto 1; Assuming that $x$ is present in $A$, what is the expected number of comparisons made by the algorithm before it terminates? $n$ $n-1$ $2n$ $\frac{n}{2}$
Kathleen
asked
in
Algorithms
Sep 15, 2014
by
Kathleen
22.2k
views
gatecse-2002
searching
normal
35
votes
5
answers
39
GATE CSE 2002 | Question: 2.9
The number of leaf nodes in a rooted tree of n nodes, with each node having $0$ or $3$ children is: $\frac{n}{2}$ $\frac{(n-1)}{3}$ $\frac{(n-1)}{2}$ $\frac{(2n+1)}{3}$
Kathleen
asked
in
DS
Sep 15, 2014
by
Kathleen
30.8k
views
gatecse-2002
data-structures
tree
normal
38
votes
4
answers
40
GATE CSE 2002 | Question: 2.8
Consider the following declaration of a two-dimensional array in C: char $a[100][100]$; Assuming that the main memory is byte-addressable and that the array is stored starting from memory address $0$, the address of $a [40][50]$ is: $4040$ $4050$ $5040$ $5050$
Kathleen
asked
in
Programming in C
Sep 15, 2014
by
Kathleen
27.7k
views
gatecse-2002
programming-in-c
programming
easy
14
votes
2
answers
41
GATE CSE 2002 | Question: 2.7
Horizontal microprogramming: does not require use of signal decoders results in larger sized microinstructions than vertical microprogramming uses one bit for each control signal all of the above
Kathleen
asked
in
CO and Architecture
Sep 15, 2014
by
Kathleen
5.1k
views
gatecse-2002
co-and-architecture
microprogramming
29
votes
3
answers
42
GATE CSE 2002 | Question: 2.6, ISRO2008-19
The performance of a pipelined processor suffers if: the pipeline stages have different delays consecutive instructions are dependent on each other the pipeline stages share hardware resources All of the above
Kathleen
asked
in
CO and Architecture
Sep 15, 2014
by
Kathleen
11.4k
views
gatecse-2002
co-and-architecture
pipelining
easy
isro2008
40
votes
3
answers
43
GATE CSE 2002 | Question: 2.5
The finite state machine described by the following state diagram with $A$ as starting state, where an arc label is $x/y,$ and $x$ stands for $1$-bit input and $y$ stands for $2$-bit output outputs the sum of the present and the ... the input outputs $01$ whenever the input sequence contains $11$ outputs $00$ whenever the input sequence contains $10$ none of the above
Kathleen
asked
in
Theory of Computation
Sep 15, 2014
by
Kathleen
11.2k
views
gatecse-2002
theory-of-computation
normal
finite-automata
4
votes
0
answers
44
GATE CSE 2002 | Question: 2.4
What are the states of the Auxillary Carry (AC) and Carry Flag (CY) after executing the following 8085 program? MVI H, 5DH MIV L, 6BH MOV A, H ADD L AC = 0 and CY = 0 AC = 1 and CY = 1 AC = 1 and CY = 0 AC = 0 and CY = 1
Kathleen
asked
in
CO and Architecture
Sep 15, 2014
by
Kathleen
2.0k
views
gatecse-2002
co-and-architecture
8085-microprocessor
out-of-syllabus-now
30
votes
1
answer
45
GATE CSE 2002 | Question: 2-3
Let $f(A,B) = A'+B$. Simplified expression for function $f(f(x+y, y), z)$ is $x' + z$ $xyz$ $xy' + z$ None of the above
Kathleen
asked
in
Digital Logic
Sep 15, 2014
by
Kathleen
7.8k
views
gatecse-2002
digital-logic
boolean-algebra
normal
39
votes
2
answers
46
GATE CSE 2002 | Question: 2.2
Consider the following multiplexer where $I0, I1, I2, I3$ are four data input lines selected by two address line combinations $A1A0=00,01,10,11$ respectively and $f$ is the output of the multiplexor. EN is the Enable input. The function $f(x,y,z)$ implemented by the above circuit is $xyz'$ $xy + z$ $x + y$ None of the above
Kathleen
asked
in
Digital Logic
Sep 15, 2014
by
Kathleen
13.3k
views
gatecse-2002
digital-logic
circuit-output
normal
57
votes
4
answers
47
GATE CSE 2002 | Question: 2-1
Consider the following logic circuit whose inputs are functions $f_1, f_2, f_3$ and output is $f$ Given that $f_1(x,y,z) = \Sigma (0,1,3,5)$ $f_2(x,y,z) = \Sigma (6,7),$ and $f(x,y,z) = \Sigma (1,4,5).$ $f_3$ is $\Sigma (1,4,5)$ $\Sigma (6,7)$ $\Sigma (0,1,3,5)$ None of the above
Kathleen
asked
in
Digital Logic
Sep 15, 2014
by
Kathleen
14.3k
views
gatecse-2002
digital-logic
normal
canonical-normal-form
circuit-output
39
votes
8
answers
48
GATE CSE 2002 | Question: 1.25, ISRO2008-30, ISRO2016-6
The maximum number of edges in a $n$-node undirected graph without self loops is $n^2$ $\frac{n(n-1)}{2}$ $n-1$ $\frac{(n+1)(n)}{2}$
Kathleen
asked
in
Graph Theory
Sep 15, 2014
by
Kathleen
17.5k
views
gatecse-2002
graph-theory
easy
isro2008
isro2016
graph-connectivity
32
votes
5
answers
49
GATE CSE 2002 | Question: 1.24
In the absolute addressing mode: the operand is inside the instruction the address of the operand in inside the instruction the register containing the address of the operand is specified inside the instruction the location of the operand is implicit
Kathleen
asked
in
CO and Architecture
Sep 15, 2014
by
Kathleen
13.7k
views
gatecse-2002
co-and-architecture
addressing-modes
easy
21
votes
1
answer
50
GATE CSE 2002 | Question: 1.23
The optimal page replacement algorithm will select the page that Has not been used for the longest time in the past Will not be used for the longest time in the future Has been used least number of times Has been used most number of times
Kathleen
asked
in
Operating System
Sep 15, 2014
by
Kathleen
8.0k
views
gatecse-2002
operating-system
page-replacement
easy
31
votes
5
answers
51
GATE CSE 2002 | Question: 1.22
Which of the following scheduling algorithms is non-preemptive? Round Robin First-In First-Out Multilevel Queue Scheduling Multilevel Queue Scheduling with Feedback
Kathleen
asked
in
Operating System
Sep 15, 2014
by
Kathleen
18.1k
views
gatecse-2002
operating-system
process-scheduling
easy
30
votes
3
answers
52
GATE CSE 2002 | Question: 1.21
In $2's$ complement addition, overflow is flagged whenever there is carry from sign bit addition cannot occur when a positive value is added to a negative value is flagged when the carries from sign bit and previous bit match None of the above
Kathleen
asked
in
Digital Logic
Sep 15, 2014
by
Kathleen
9.2k
views
gatecse-2002
digital-logic
number-representation
normal
39
votes
4
answers
53
GATE CSE 2002 | Question: 1.20
With regards to the expressive power of the formal relational query languages, which of the following statements is true? Relational algebra is more powerful than relational calculus Relational algebra has the same power as relational calculus Relational algebra has the same power as safe relational calculus None of the above
Kathleen
asked
in
Databases
Sep 15, 2014
by
Kathleen
7.1k
views
gatecse-2002
databases
relational-calculus
normal
63
votes
7
answers
54
GATE CSE 2002 | Question: 1.19
Relation $R$ with an associated set of functional dependencies, $F$, is decomposed into $\text{BCNF}$. The redundancy (arising out of functional dependencies) in the resulting set of relations is Zero More than zero but less than that of an equivalent $3NF$ decomposition Proportional to the size of F+ Indeterminate
Kathleen
asked
in
Databases
Sep 15, 2014
by
Kathleen
20.1k
views
gatecse-2002
databases
database-normalization
normal
13
votes
2
answers
55
GATE CSE 2002 | Question: 1.18
The results returned by function under value-result and reference parameter passing conventions Do not differ Differ in the presence of loops Differ in all cases May differ in the presence of exception
Kathleen
asked
in
Programming in C
Sep 15, 2014
by
Kathleen
8.2k
views
gatecse-2002
programming
parameter-passing
normal
out-of-syllabus-now
39
votes
1
answer
56
GATE CSE 2002 | Question: 1.17
In the C language: At most one activation record exists between the current activation record and the activation record for the main The number of activation records between the current activation record and the activation records from the main ... record for the recursive function to be saved in a different stack before the recursive function can be called.
Kathleen
asked
in
Programming in C
Sep 15, 2014
by
Kathleen
10.1k
views
gatecse-2002
programming
programming-in-c
easy
descriptive
34
votes
4
answers
57
GATE CSE 2002 | Question: 1.16
Sign extension is a step in floating point multiplication signed $16$ bit integer addition arithmetic left shift converting a signed integer from one size to another
Kathleen
asked
in
Digital Logic
Sep 15, 2014
by
Kathleen
6.6k
views
gatecse-2002
digital-logic
easy
number-representation
27
votes
6
answers
58
GATE CSE 2002 | Question: 1.15
The $2's$ complement representation of the decimal value $-15$ is $1111$ $11111$ $111111$ $10001$
Kathleen
asked
in
Digital Logic
Sep 15, 2014
by
Kathleen
9.9k
views
gatecse-2002
digital-logic
number-representation
easy
23
votes
3
answers
59
GATE CSE 2002 | Question: 1.14
The decimal value $0.25$ is equivalent to the binary value $0.1$ is equivalent to the binary value $0.01$ is equivalent to the binary value $0.00111$ cannot be represented precisely in binary
Kathleen
asked
in
Digital Logic
Sep 15, 2014
by
Kathleen
5.8k
views
gatecse-2002
digital-logic
number-representation
easy
16
votes
2
answers
60
GATE CSE 2002 | Question: 1.13
Which of the following is not a form of memory instruction cache instruction register instruction opcode translation look-a-side buffer
Kathleen
asked
in
CO and Architecture
Sep 15, 2014
by
Kathleen
6.1k
views
gatecse-2002
co-and-architecture
easy
instruction-execution
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-2002
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:...