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 gateit-2004
34
votes
2
answers
31
GATE IT 2004 | Question: 61
Consider the following C program: #include <stdio.h> typedef struct { char *a; char *b; } t; void f1 (t s); void f2 (t *p); main() { static t s = {"A", "B"}; printf ("%s %s\n", s.a, s.b); f1(s); printf ("%s %s\n", s.a, s.b); f2(&s); } void ... $A \ B$ $V \ W$ $A \ B$ $U \ V$ $U \ V$ $V \ W$ $A \ B$ $U \ V$ $V \ W$ $U \ V$
Ishrat Jahan
asked
in
Programming
Nov 2, 2014
by
Ishrat Jahan
7.3k
views
gateit-2004
programming
programming-in-c
normal
structure
19
votes
3
answers
32
GATE IT 2004 | Question: 60
Choose the correct option to fill the $?1$ and $?2$ so that the program prints an input string in reverse order. Assume that the input string is terminated by a new line character. #include <stdio.h> void wrt_it (void); int main (void) { printf("Enter Text"); printf (" ... $?2$ is $putchar(c);$ $?1$ is $(c = getchar()) ! =$ '\n' $?2$ is $putchar(c);$
Ishrat Jahan
asked
in
Programming
Nov 2, 2014
by
Ishrat Jahan
3.2k
views
gateit-2004
programming
programming-in-c
normal
30
votes
2
answers
33
GATE IT 2004 | Question: 59
What is the output of the following program? #include<stdio.h> int funcf (int x); int funcg (int y); main () { int x = 5, y = 10, count; for (count = 1; count <= 2; ++count) { y += funcf(x) + funcg(x); printf ("%d", y); } } funcf (int x) { int y; y ... funcg (int x) { static int y = 10; y += 1; return (y + x); } $43 \ 80$ $42 \ 74$ $33 \ 37$ $32 \ 32$
Ishrat Jahan
asked
in
Programming
Nov 2, 2014
by
Ishrat Jahan
7.0k
views
gateit-2004
programming
programming-in-c
normal
27
votes
3
answers
34
GATE IT 2004 | Question: 58
Consider the following C program which is supposed to compute the transpose of a given $4 \times 4$ matrix $M$. Note that, there is an $X$ in the program which indicates some missing statements. Choose the correct option to replace $X$ in the program. #include<stdio.h> #define ROW 4 #define COL 4 ... j < 4; ++j){ M[i][j] = t; t = M[j][i]; M[j][i] = M[i][j]; }
Ishrat Jahan
asked
in
Programming
Nov 2, 2014
by
Ishrat Jahan
9.8k
views
gateit-2004
programming
easy
programming-in-c
array
18
votes
5
answers
35
GATE IT 2004 | Question: 57
Consider a list of recursive algorithms and a list of recurrence relations as shown below. Each recurrence relation corresponds to exactly one algorithm and is used to derive the time complexity of the algorithm. ... $\text{P-III, Q-II, R-IV, S-I}$ $\text{P-IV, Q-II, R-I, S-III}$
Ishrat Jahan
asked
in
Algorithms
Nov 2, 2014
by
Ishrat Jahan
4.6k
views
gateit-2004
algorithms
recurrence-relation
normal
21
votes
3
answers
36
GATE IT 2004 | Question: 56
Consider the undirected graph below: Using Prim's algorithm to construct a minimum spanning tree starting with node A, which one of the following sequences of edges represents a possible order in which the edges would be added to construct the minimum spanning tree? ... $\text{(A, D), (A, B), (D, F), (F, C), (F, G), (G, E)}$
Ishrat Jahan
asked
in
Algorithms
Nov 2, 2014
by
Ishrat Jahan
9.7k
views
gateit-2004
algorithms
graph-algorithms
normal
37
votes
6
answers
37
GATE IT 2004 | Question: 55
Let $f(n)$, $g(n)$ and $h(n)$ be functions defined for positive integers such that $f(n) = O(g(n))$, $g(n) \neq O(f(n))$, $g(n) = O(h(n))$, and $h(n) = O(g(n))$. Which one of the following statements is FALSE? $f(n) + g(n) = O(h(n) + h(n))$ $f(n) = O(h(n))$ $h(n) \neq O(f(n))$ $f(n)h(n) \neq O(g(n)h(n))$
Ishrat Jahan
asked
in
Algorithms
Nov 2, 2014
by
Ishrat Jahan
9.3k
views
gateit-2004
algorithms
asymptotic-notations
normal
22
votes
4
answers
38
GATE IT 2004 | Question: 54
Which one of the following binary trees has its inorder and preorder traversals as $BCAD$ and $ABCD$, respectively?
Ishrat Jahan
asked
in
DS
Nov 2, 2014
by
Ishrat Jahan
4.0k
views
gateit-2004
binary-tree
easy
data-structures
39
votes
4
answers
39
GATE IT 2004 | Question: 53
An array of integers of size $n$ can be converted into a heap by adjusting the heaps rooted at each internal node of the complete binary tree starting at the node $\left \lfloor (n - 1) /2 \right \rfloor$ ... to construct a heap in this manner is $O(\log n)$ $O(n)$ $O (n \log \log n)$ $O(n \log n)$
Ishrat Jahan
asked
in
DS
Nov 2, 2014
by
Ishrat Jahan
8.3k
views
gateit-2004
data-structures
heap
normal
23
votes
1
answer
40
GATE IT 2004 | Question: 52
A program attempts to generate as many permutations as possible of the string, '$abcd$' by pushing the characters $a, b, c, d$ in the same order onto a stack, but it may pop off the top character at any time. Which one of the following strings CANNOT be generated using this program? $abcd$ $dcba$ $cbad$ $cabd$
Ishrat Jahan
asked
in
DS
Nov 2, 2014
by
Ishrat Jahan
4.4k
views
gateit-2004
data-structures
normal
stack
61
votes
5
answers
41
GATE IT 2004 | Question: 51
The storage area of a disk has the innermost diameter of $10$ cm and outermost diameter of $20$ cm. The maximum storage density of the disk is $1400$ bits/cm. The disk rotates at a speed of $4200$ RPM. The main memory of a computer has $64$-bit word length ... from the disk, the percentage of memory cycles stolen for transferring one word is $0.5 \%$ $1 \%$ $5\%$ $10\%$
Ishrat Jahan
asked
in
CO and Architecture
Nov 2, 2014
by
Ishrat Jahan
13.7k
views
gateit-2004
co-and-architecture
dma
normal
31
votes
1
answer
42
GATE IT 2004 | Question: 49
A CPU has only three instructions $I1, I2$ and $I3,$ which use the following signals in time steps $T1-T5$: $I1 : T1$ : Ain, Bout, Cin $T2$ : PCout, Bin $T3$ : Zout, Ain $T4$ : Bin, Cout $T5$ : End $I2 : T1$ : Cin, Bout, Din $T2$ : Aout, Bin $T3$ : Zout, Ain $T4$ : Bin, ... $(T1 + T2 ).I1 + (T2 + T4).I3 + T3$ $(T1 + T2 ).I2 + (T1 + T3).I1 + T3$
Ishrat Jahan
asked
in
CO and Architecture
Nov 2, 2014
by
Ishrat Jahan
6.5k
views
gateit-2004
co-and-architecture
microprogramming
normal
31
votes
2
answers
43
GATE IT 2004 | Question: 48
Consider a fully associative cache with $8$ cache blocks (numbered $0-7$) and the following sequence of memory block requests: $4, 3, 25, 8, 19, 6, 25, 8, 16, 35, 45, 22, 8, 3, 16, 25, 7$ If LRU replacement policy is used, which cache block will have memory block $7$? $4$ $5$ $6$ $7$
Ishrat Jahan
asked
in
CO and Architecture
Nov 2, 2014
by
Ishrat Jahan
11.0k
views
gateit-2004
co-and-architecture
cache-memory
normal
34
votes
3
answers
44
GATE IT 2004 | Question: 47
Consider a pipeline processor with $4$ stages $S1$ to $S4$. We want to execute the following loop: for (i = 1; i < = 1000; i++) {I1, I2, I3, I4} where the time taken (in ns) by instructions $I1$ to $I4$ for stages $S1$ to $S4$ ... output of $I1$ for $i = 2$ will be available after $\text{11 ns}$ $\text{12 ns}$ $\text{13 ns}$ $\text{28 ns}$
Ishrat Jahan
asked
in
CO and Architecture
Nov 2, 2014
by
Ishrat Jahan
9.4k
views
gateit-2004
co-and-architecture
pipelining
normal
29
votes
1
answer
45
GATE IT 2004 | Question: 46
If we use internal data forwarding to speed up the performance of a CPU (R1, R2 and R3 are registers and M[100] is a memory reference), then the sequence of operations R1 → M[100] M[100] → R2 M[100] → R3 can be replaced by R1 → R3 R2 → M[100] M[100] → R2 R1 → R2 R1 → R3 R1 → M[100] R2 → R3 R1 → R2 R1 → R3 R1 → M[100]
Ishrat Jahan
asked
in
CO and Architecture
Nov 2, 2014
by
Ishrat Jahan
5.3k
views
gateit-2004
co-and-architecture
machine-instructions
easy
28
votes
3
answers
46
GATE IT 2004 | Question: 45
A serial transmission $T1$ uses $8$ information bits, $2$ start bits, $1$ stop bit and $1$ parity bit for each character. A synchronous transmission $T2$ uses $3$ eight-bit sync characters followed by $30$ eight-bit information characters. If ... $136$ characters/sec $100$ characters/sec, $136$ characters/sec $80$ characters/sec, $153$ characters/sec
Ishrat Jahan
asked
in
Computer Networks
Nov 2, 2014
by
Ishrat Jahan
10.6k
views
gateit-2004
computer-networks
serial-communication
normal
out-of-gate-syllabus
32
votes
4
answers
47
GATE IT 2004 | Question: 44
The function $A \bar B C + \bar A B C + AB \bar C+ \bar A \bar B C+ A \bar B \bar C$ is equivalent to $A \bar C + AB+ \bar A C$ $A \bar B+ A \bar C+ \bar A C$ $\bar A B+ A \bar C+ A \bar B$ $\bar AB+ AC+ A \bar B$
Ishrat Jahan
asked
in
Digital Logic
Nov 2, 2014
by
Ishrat Jahan
5.2k
views
gateit-2004
digital-logic
boolean-algebra
easy
24
votes
2
answers
48
GATE IT 2004 | Question: 43
The number $(123456)_8$ is equivalent to $\text{(A72E)}_{16}$ and $(22130232)_4$ $\text{(A72E)}_{16}$ and $(22131122)_4$ $\text{(A73E)}_{16}$ and $(22130232)_4$ $\text{(A62E)}_{16}$ and $(22120232)_4$
Ishrat Jahan
asked
in
Digital Logic
Nov 2, 2014
by
Ishrat Jahan
3.3k
views
gateit-2004
digital-logic
number-representation
normal
23
votes
4
answers
49
GATE IT 2004 | Question: 42
Using a $4-bit$ $2's$ complement arithmetic, which of the following additions will result in an overflow? $1100 + 1100$ $0011 + 0111$ $1111 + 0111$ i only ii only iii only i and iii only
Ishrat Jahan
asked
in
Digital Logic
Nov 2, 2014
by
Ishrat Jahan
7.1k
views
gateit-2004
digital-logic
number-representation
normal
38
votes
3
answers
50
GATE IT 2004 | Question: 41
Let $M=(K, Σ, \sigma, s, F)$ be a finite state automaton, where $K = \{A, B\}, Σ = \{a, b\}, s = A, F = \{B\},$ $\sigma(A, a) = A, \sigma(A, b) = B, \sigma(B, a) = B \text{ and} \ \sigma(B, b) = A$ A grammar to generate the language accepted by $M$ can be ... $\{A → bB, A → aB, B → aA, B → bA, B → \epsilon)$ $\{A → aA, A → bA, B → aB, B → bA, A → \epsilon)$
Ishrat Jahan
asked
in
Theory of Computation
Nov 2, 2014
by
Ishrat Jahan
5.1k
views
gateit-2004
theory-of-computation
finite-automata
normal
45
votes
8
answers
51
GATE IT 2004 | Question: 40
Let $M = (K, Σ, Г, Δ, s, F)$ be a pushdown automaton, where $K = (s, f), F = \{f\}, \Sigma = \{a, b\}, Г = \{a\}$ and $Δ = \{((s, a, \epsilon), (s, a)), ((s, b, \epsilon), (s, a)), (( s, a, a), (f, \epsilon)), ((f, a, a), (f, \epsilon)), ((f, b, a), (f, \epsilon))\}$. Which one of the following strings is not a member of $L(M)$? $aaa$ $aabab$ $baaba$ $bab$
Ishrat Jahan
asked
in
Theory of Computation
Nov 2, 2014
by
Ishrat Jahan
15.2k
views
gateit-2004
theory-of-computation
pushdown-automata
normal
2
votes
0
answers
52
GATE IT 2004 | Question: 39
Consider the following iterative root finding methods and convergence properties: Iterative root finding methods Convergence properties Q. False Position I. Order of convergence = 1.62 R. Newton Raphson II. Order of convergence = 2 S. Secant III. Order of convergence = 1 with guarantee of convergence T. ... R-II, S-I, T-IV Q-II, R-I, S-IV, T-III Q-I, R-IV, S-II, T-III
Ishrat Jahan
asked
in
Numerical Methods
Nov 2, 2014
by
Ishrat Jahan
1.3k
views
gateit-2004
numerical-methods
normal
3
votes
1
answer
53
GATE IT 2004 | Question: 38
If f(l) = 2, f(2) = 4 and f(4) = 16, what is the value of f(3) using Lagrange's interpolation formula? 8 8(1/3) 8(2/3) 9
Ishrat Jahan
asked
in
Numerical Methods
Nov 2, 2014
by
Ishrat Jahan
2.6k
views
gateit-2004
numerical-methods
lagranges-interpolation
normal
33
votes
2
answers
54
GATE IT 2004 | Question: 37
What is the number of vertices in an undirected connected graph with $27$ edges, $6$ vertices of degree $2, 3$ vertices of degree $4$ and remaining of degree $3$? $10$ $11$ $18$ $19$
Ishrat Jahan
asked
in
Graph Theory
Nov 2, 2014
by
Ishrat Jahan
9.3k
views
gateit-2004
graph-theory
graph-connectivity
normal
20
votes
4
answers
55
GATE IT 2004 | Question: 36
If matrix $X = \begin{bmatrix} a & 1 \\ -a^2+a-1 & 1-a \end{bmatrix}$ and $X^2 - X + I = O$ ($I$ is the identity matrix and $O$ is the zero matrix), then the inverse of $X$ is $\begin{bmatrix} 1-a &-1 \\ a^2& a \end{bmatrix}$ ... $\begin{bmatrix} -a &1 \\ -a^2+a-1& 1-a \end{bmatrix}$ $\begin{bmatrix} a^2-a+1 &a \\ 1& 1-a \end{bmatrix}$
Ishrat Jahan
asked
in
Linear Algebra
Nov 2, 2014
by
Ishrat Jahan
3.0k
views
gateit-2004
linear-algebra
matrix
normal
39
votes
11
answers
56
GATE IT 2004 | Question: 35
In how many ways can we distribute $5$ distinct balls, $B_1, B_2, \ldots, B_5$ in $5$ distinct cells, $C_1, C_2, \ldots, C_5$ such that Ball $B_i$ is not in cell $C_i$, $\forall i= 1,2,\ldots 5$ and each cell contains exactly one ball? $44$ $96$ $120$ $3125$
Ishrat Jahan
asked
in
Combinatory
Nov 2, 2014
by
Ishrat Jahan
8.3k
views
gateit-2004
combinatory
normal
balls-in-bins
39
votes
1
answer
57
GATE IT 2004 | Question: 34
Let $H_1, H_2, H_3,$ ... be harmonic numbers. Then, for $n \in Z^+$, $\sum_{j=1}^{n} H_j$ can be expressed as $nH_{n+1} - (n + 1)$ $(n + 1)H_n - n$ $nH_n - n$ $(n + 1) H_{n+1} - (n + 1)$
Ishrat Jahan
asked
in
Combinatory
Nov 2, 2014
by
Ishrat Jahan
3.8k
views
gateit-2004
recurrence-relation
combinatory
normal
42
votes
1
answer
58
GATE IT 2004 | Question: 33
Let $X$ and $Y$ be two exponentially distributed and independent random variables with mean $α$ and $β$, respectively. If $Z$ = min $(X, Y)$, then the mean of $Z$ is given by $\left(\dfrac{1}{\alpha + \beta}\right)$ $\min (\alpha, \beta)$ $\left(\dfrac{\alpha\beta}{\alpha + \beta}\right)$ $\alpha + \beta$
Ishrat Jahan
asked
in
Probability
Nov 2, 2014
by
Ishrat Jahan
13.2k
views
gateit-2004
probability
exponential-distribution
random-variable
normal
37
votes
3
answers
59
GATE IT 2004 | Question: 32
Let $A$ be an $n \times n$ ...
Ishrat Jahan
asked
in
Linear Algebra
Nov 2, 2014
by
Ishrat Jahan
5.2k
views
gateit-2004
linear-algebra
matrix
normal
33
votes
7
answers
60
GATE IT 2004 | Question: 31
Let $p, q, r$ and $s$ be four primitive statements. Consider the following arguments: $P: [(¬p\vee q) ∧ (r → s) ∧ (p \vee r)] → (¬s → q)$ $Q: [(¬p ∧q) ∧ [q → (p → r)]] → ¬r$ $R: [[(q ∧ r) → p] ∧ (¬q \vee p)] → r$ $S: [p ∧ (p → r) ∧ (q \vee ¬ r)] → q$ Which of the above arguments are valid? $P$ and $Q$ only $P$ and $R$ only $P$ and $S$ only $P, Q, R$ and $S$
Ishrat Jahan
asked
in
Mathematical Logic
Nov 2, 2014
by
Ishrat Jahan
7.7k
views
gateit-2004
mathematical-logic
normal
propositional-logic
Page:
« prev
1
2
3
4
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
Aptitude Overflow Book
Participate in Machine Learning benchmarking
GATE Overflow Tikz Templates
UPSC One Time Registration OTR Online Form 2022
DRDO CEPTAM 10 Online Form 2022
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.2k)
Programming and DS
(5.7k)
Algorithms
(4.5k)
Theory of Computation
(6.5k)
Compiler Design
(2.2k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.5k)
Admissions
(644)
Exam Queries
(838)
Tier 1 Placement Questions
(17)
Job Queries
(72)
Projects
(9)
Unknown Category
(851)
Recent questions tagged gateit-2004
Recent Blog Comments
Try...
@Arjun @Deepak Sir, In Test Schedule google...
sir is this for gate? it has way more questions...
https://gateoverflow.in/tag/gate2010 this link is...
previous years than GATE 2010 paper