Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatecse-2001
62
votes
3
answers
31
GATE CSE 2001 | Question: 2.18
Consider the following three C functions: $[P1]$ int *g(void) { int x = 10; return (&x); } $[P2]$ int *g(void) { int *px; *px = 10; return px; } $[P3]$ int *g(void) { int *px; px = (int*) malloc (sizeof(int)); *px = 10; ... of the above three functions are likely to cause problems with pointers? Only $P3$ Only $P1$ and $P3$ Only $P1$ and $P2$ $P1, P2$ and $P3$
Consider the following three C functions:$[P1]$ int *g(void) { int x = 10; return (&x); }$[P2]$ int *g(void) { int *px; *px = 10; return px; }$[P3]$ int *g(void) { int *p...
Kathleen
24.2k
views
Kathleen
asked
Sep 14, 2014
Programming in C
gatecse-2001
programming
programming-in-c
normal
pointers
+
–
27
votes
4
answers
32
GATE CSE 2001 | Question: 2.17 | UGCNET-AUG2016-III: 21
What is printed by the print statements in the program $P1$ assuming call by reference parameter passing? Program P1() { x = 10; y = 3; func1(y,x,x); print x; print y; } func1(x,y,z) { y = y + 4; z = x + y + z } $\text{10, 3}$ $\text{31, 3}$ $\text{27, 7}$ None of the above
What is printed by the print statements in the program $P1$ assuming call by reference parameter passing?Program P1() { x = 10; y = 3; func1(y,x,x); print x; print y; } f...
Kathleen
12.4k
views
Kathleen
asked
Sep 14, 2014
Programming in C
gatecse-2001
programming-in-c
parameter-passing
normal
ugcnetcse-aug2016-paper3
+
–
22
votes
7
answers
33
GATE CSE 2001 | Question: 2.16
What is the minimum number of stacks of size $n$ required to implement a queue of size $n$? One Two Three Four
What is the minimum number of stacks of size $n$ required to implement a queue of size $n$?OneTwoThreeFour
Kathleen
24.3k
views
Kathleen
asked
Sep 14, 2014
DS
gatecse-2001
data-structures
easy
stack
queue
+
–
53
votes
6
answers
34
GATE CSE 2001 | Question: 2.15
How many undirected graphs (not necessarily connected) can be constructed out of a given set $V=\{v_1, v_2, \dots v_n\}$ of $n$ vertices? $\frac{n(n-1)} {2}$ $2^n$ $n!$ $2^\frac{n(n-1)} {2} $
How many undirected graphs (not necessarily connected) can be constructed out of a given set $V=\{v_1, v_2, \dots v_n\}$ of $n$ vertices?$\frac{n(n-1)} {2}$$2^n$$n!$$2^\f...
Kathleen
14.1k
views
Kathleen
asked
Sep 14, 2014
Graph Theory
gatecse-2001
graph-theory
normal
counting
+
–
38
votes
7
answers
35
GATE CSE 2001 | Question: 2.14
Consider an undirected, unweighted graph $G$. Let a breadth-first traversal of $G$ be done starting from a node $r$. Let $d(r,u)$ and $d(r,v)$ be the lengths of the shortest paths from $r$ to $u$ and $v$ respectively in $G$. If $u$ is visited before $v$ during the breadth- ... correct? $d(r,u) < d(r,v)$ $d(r,u) > d(r,v)$ $d(r,u) \leq d(r,v)$ None of the above
Consider an undirected, unweighted graph $G$. Let a breadth-first traversal of $G$ be done starting from a node $r$. Let $d(r,u)$ and $d(r,v)$ be the lengths of the short...
Kathleen
14.1k
views
Kathleen
asked
Sep 14, 2014
Algorithms
gatecse-2001
algorithms
graph-algorithms
normal
graph-search
+
–
54
votes
11
answers
36
GATE CSE 2001 | Question: 2.13
Consider the following data path of a simple non-pipelined CPU. The registers $A, B$, $A_{1},A_{2}, \textsf{MDR},$ the $\textsf{bus}$ and the $\textsf{ALU}$ are $8$-$bit$ wide. $\textsf{SP}$ and $\textsf{MAR}$ are $16$-$bit$ registers. The ... $\textsf{CPU}$ clock cycles are required to execute the "push r" instruction? $2$ $3$ $4$ $5$
Consider the following data path of a simple non-pipelined CPU. The registers $A, B$, $A_{1},A_{2}, \textsf{MDR},$ the $\textsf{bus}$ and the $\textsf{ALU}$ are $8$-$bit$...
Kathleen
21.2k
views
Kathleen
asked
Sep 14, 2014
CO and Architecture
gatecse-2001
co-and-architecture
data-path
machine-instruction
normal
+
–
33
votes
7
answers
37
GATE CSE 2001 | Question: 2.12
Consider the circuit given below with initial state $Q_0=1, Q_1=Q_2=0$. The state of the circuit is given by the value $4Q_2+2Q_1+Q_0$ Which one of the following is correct state sequence of the circuit? $1, 3, 4, 6, 7, 5, 2$ $1, 2, 5, 3, 7, 6, 4$ $1, 2, 7, 3, 5, 6, 4$ $1, 6, 5, 7, 2, 3, 4$
Consider the circuit given below with initial state $Q_0=1, Q_1=Q_2=0$. The state of the circuit is given by the value $4Q_2+2Q_1+Q_0$Which one of the following is correc...
Kathleen
12.7k
views
Kathleen
asked
Sep 14, 2014
Digital Logic
gatecse-2001
digital-logic
normal
synchronous-asynchronous-circuits
+
–
47
votes
5
answers
38
GATE CSE 2001 | Question: 2.11
Consider the circuit shown below. The output of a $2:1$ MUX is given by the function $(ac' + bc)$. Which of the following is true? $f=X_1'+X_2$ $f=X_1'X_2+X_1X_2'$ $f=X_1X_2+X_1'X_2'$ $f=X_1+X_2'$
Consider the circuit shown below. The output of a $2:1$ MUX is given by the function $(ac' + bc)$.Which of the following is true?$f=X_1'+X_2$$f=X_1'X_2+X_1X_2'$$f=X_1X_2+...
Kathleen
11.4k
views
Kathleen
asked
Sep 14, 2014
Digital Logic
gatecse-2001
digital-logic
normal
multiplexer
+
–
30
votes
4
answers
39
GATE CSE 2001 | Question: 2.10
The $2's$ complement representation of (-539)10 in hexadecimal is $ABE$ $DBC$ $DE5$ $9E7$
The $2's$ complement representation of (-539)10 in hexadecimal is$ABE$$DBC$$DE5$$9E7$
Kathleen
12.1k
views
Kathleen
asked
Sep 14, 2014
Digital Logic
gatecse-2001
digital-logic
number-representation
easy
+
–
33
votes
2
answers
40
GATE CSE 2001 | Question: 2.9
Which is the most appropriate match for the items in the first column with the items in the second column: ... ), (Y, III), (Z, I) (X, III), (Y, II), (Z, I) (X, I), (Y, III), (Z, II)
Which is the most appropriate match for the items in the first column with the items in the second column:$$\begin{array}{|cl|cl|} \hline \text{X.} &\text{Indirect Addres...
Kathleen
7.5k
views
Kathleen
asked
Sep 14, 2014
CO and Architecture
gatecse-2001
co-and-architecture
addressing-modes
easy
match-the-following
+
–
62
votes
5
answers
41
GATE CSE 2001 | Question: 2.8
Consider the following circuit with initial state $Q_0 = Q_1 = 0$. The D Flip-flops are positive edged triggered and have set up times 20 nanosecond and hold times $0.$ Consider the following timing diagrams of X and C. The clock period of $C \geq 40$ nanosecond. Which one is the correct plot of Y?
Consider the following circuit with initial state $Q_0 = Q_1 = 0$. The D Flip-flops are positive edged triggered and have set up times 20 nanosecond and hold times $0.$Co...
Kathleen
21.4k
views
Kathleen
asked
Sep 14, 2014
Digital Logic
gatecse-2001
digital-logic
circuit-output
normal
+
–
53
votes
1
answer
42
GATE CSE 2001 | Question: 2.7
Consider the following problem $X$. Given a Turing machine $M$ over the input alphabet $\Sigma$, any state $q$ of $M$ and a word $w \in \Sigma^*$, does the computation of $M$ on $w$ visit the state of $q$? Which of the ... ? $X$ is decidable $X$ is undecidable but partially decidable $X$ is undecidable and not even partially decidable $X$ is not a decision problem
Consider the following problem $X$.Given a Turing machine $M$ over the input alphabet $\Sigma$, any state $q$ of $M$ and a word $w \in \Sigma^*$, does the computation of ...
Kathleen
13.5k
views
Kathleen
asked
Sep 14, 2014
Theory of Computation
gatecse-2001
theory-of-computation
decidability
normal
+
–
21
votes
5
answers
43
GATE CSE 2001 | Question: 2.6
Consider the following languages: $L1=\left\{ww \mid w \in \{a,b\}^*\right\}$ $L2=\left\{ww^R \mid w \in \{a,b\}^*, w^R \text{ is the reverse of w} \right\}$ $L3=\left\{0^{2i} \mid \text{ i is an integer} \right\}$ ... $L1$ and $L2$ Only $L2, L3$ and $L4$ Only $L3$ and $L4$ Only $L3$
Consider the following languages:$L1=\left\{ww \mid w \in \{a,b\}^*\right\}$$L2=\left\{ww^R \mid w \in \{a,b\}^*, w^R \text{ is the reverse of w} \right\}$$L3=\left\{0^{2...
Kathleen
8.0k
views
Kathleen
asked
Sep 14, 2014
Theory of Computation
gatecse-2001
theory-of-computation
normal
regular-language
+
–
41
votes
4
answers
44
GATE CSE 2001 | Question: 2.5
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of states that the DFA will have? $8$ $14$ $15$ $48$
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of s...
Kathleen
18.6k
views
Kathleen
asked
Sep 14, 2014
Theory of Computation
gatecse-2001
theory-of-computation
finite-automata
minimal-state-automata
+
–
38
votes
4
answers
45
GATE CSE 2001 | Question: 2.4
Seven (distinct) car accidents occurred in a week. What is the probability that they all occurred on the same day? $\dfrac{1}{7^7}\\$ $\dfrac{1}{7^6}\\$ $\dfrac{1}{2^7}\\$ $\dfrac{7}{2^7}\\$
Seven (distinct) car accidents occurred in a week. What is the probability that they all occurred on the same day?$\dfrac{1}{7^7}\\$$\dfrac{1}{7^6}\\$$\dfrac{1}{2^7}\\$$\...
Kathleen
19.8k
views
Kathleen
asked
Sep 14, 2014
Probability
gatecse-2001
probability
normal
+
–
49
votes
5
answers
46
GATE CSE 2001 | Question: 2.3
Let $f: A \rightarrow B$ a function, and let E and F be subsets of $A$. Consider the following statements about images. $S_1: f(E \cup F) = f(E) \cup f(F)$ $S_2: f(E \cap F)=f(E) \cap f(F)$ Which of the following is true about S1 and S2? Only $S_1$ is correct Only $S_2$ is correct Both $S_1$ and $S_2$ are correct None of $S_1$ and $S_2$ is correct
Let $f: A \rightarrow B$ a function, and let E and F be subsets of $A$. Consider the following statements about images.$S_1: f(E \cup F) = f(E) \cup f(F)$$S_2: f(E \cap F...
Kathleen
11.2k
views
Kathleen
asked
Sep 14, 2014
Set Theory & Algebra
gatecse-2001
set-theory&algebra
functions
normal
+
–
54
votes
5
answers
47
GATE CSE 2001 | Question: 2.2
Consider the following statements: $S_1:$ There exists infinite sets $A$, $B$, $C$ such that $A \cap (B \cup C)$ is finite. $S_2:$ There exists two irrational numbers $x$ and y such that $(x+y)$ ... $S_2$? Only $S_1$ is correct Only $S_2$ is correct Both $S_1$ and $S_2$ are correct None of $S_1$ and $S_2$ is correct
Consider the following statements:$S_1:$ There exists infinite sets $A$, $B$, $C$ such that $A \cap (B \cup C)$ is finite.$S_2:$ There exists two irrational numbers $x$ a...
Kathleen
8.9k
views
Kathleen
asked
Sep 14, 2014
Set Theory & Algebra
gatecse-2001
set-theory&algebra
normal
set-theory
+
–
38
votes
9
answers
48
GATE CSE 2001 | Question: 2.1
How many $4$-digit even numbers have all $4$ digits distinct? $2240$ $2296$ $2620$ $4536$
How many $4$-digit even numbers have all $4$ digits distinct?$2240$$2296$$2620$$4536$
Kathleen
12.7k
views
Kathleen
asked
Sep 14, 2014
Combinatory
gatecse-2001
combinatory
normal
+
–
52
votes
3
answers
49
GATE CSE 2001 | Question: 1.25
Let r and s be two relations over the relation schemes R and S respectively, and let A be an attribute in R. The relational algebra expression $\sigma_{A=a}(r \bowtie s)$ is always equal to $\sigma_{A=a}(r)$ $r$ $\sigma_{A=a}(r) \bowtie s$ None of the above
Let r and s be two relations over the relation schemes R and S respectively, and let A be an attribute in R. The relational algebra expression $\sigma_{A=a}(r \bowtie s)...
Kathleen
7.4k
views
Kathleen
asked
Sep 14, 2014
Databases
gatecse-2001
databases
relational-algebra
+
–
54
votes
4
answers
50
GATE CSE 2001 | Question: 1.24
Suppose the adjacency relation of vertices in a graph is represented in a table Adj $(X,Y).$ Which of the following queries cannot be expressed by a relational algebra expression of constant length? List all vertices adjacent to a given ... self loops List all vertices which belong to cycles of less than three vertices List all vertices reachable from a given vertex
Suppose the adjacency relation of vertices in a graph is represented in a table Adj $(X,Y).$ Which of the following queries cannot be expressed by a relational algebra ex...
Kathleen
7.9k
views
Kathleen
asked
Sep 14, 2014
Databases
gatecse-2001
databases
relational-algebra
normal
+
–
25
votes
2
answers
51
GATE CSE 2001 | Question: 1.22
Which of the following requires a device driver? Register Cache Main memory Disk
Which of the following requires a device driver?RegisterCacheMain memoryDisk
Kathleen
10.5k
views
Kathleen
asked
Sep 14, 2014
Operating System
gatecse-2001
operating-system
disk
easy
+
–
22
votes
2
answers
52
GATE CSE 2001 | Question: 1.21
Consider a virtual memory system with FIFO page replacement policy. For an arbitrary page access pattern, increasing the number of page frames in main memory will always decrease the number of page faults always increase the number of page faults sometimes increase the number of page faults never affect the number of page faults
Consider a virtual memory system with FIFO page replacement policy. For an arbitrary page access pattern, increasing the number of page frames in main memory willalways d...
Kathleen
8.2k
views
Kathleen
asked
Sep 14, 2014
Operating System
gatecse-2001
operating-system
page-replacement
normal
+
–
37
votes
3
answers
53
GATE CSE 2001 | Question: 1.20
Where does the swap space reside? RAM Disk ROM On-chip cache
Where does the swap space reside?RAMDiskROMOn-chip cache
Kathleen
12.7k
views
Kathleen
asked
Sep 14, 2014
Operating System
gatecse-2001
operating-system
easy
virtual-memory
+
–
37
votes
6
answers
54
GATE CSE 2001 | Question: 1.18
Which of the following statements is false? An unambiguous grammar has same leftmost and rightmost derivation An LL(1) parser is a top-down parser LALR is more powerful than SLR An ambiguous grammar can never be LR(k) for any k
Which of the following statements is false?An unambiguous grammar has same leftmost and rightmost derivationAn LL(1) parser is a top-down parserLALR is more powerful than...
Kathleen
18.1k
views
Kathleen
asked
Sep 14, 2014
Compiler Design
gatecse-2001
compiler-design
grammar
normal
+
–
36
votes
2
answers
55
GATE CSE 2001 | Question: 1.17
The process of assigning load addresses to the various parts of the program and adjusting the code and the data in the program to reflect the assigned addresses is called Assembly parsing Relocation Symbol resolution
The process of assigning load addresses to the various parts of the program and adjusting the code and the data in the program to reflect the assigned addresses is called...
Kathleen
12.6k
views
Kathleen
asked
Sep 14, 2014
Compiler Design
gatecse-2001
compiler-design
runtime-environment
easy
+
–
63
votes
7
answers
56
GATE CSE 2001 | Question: 1.16
Let $f(n) = n^2 \log n$ and $g(n) = n(\log n)^{10}$ be two positive functions of $n$. Which of the following statements is correct? $f(n) = O(g(n)) \text{ and } g(n) \neq O(f(n))$ $g(n) = O(f(n)) \text{ and } f(n) \neq O(g(n))$ $f(n) \neq O(g(n)) \text{ and } g(n) \neq O(f(n))$ $f(n) =O(g(n)) \text{ and } g(n) = O(f(n))$
Let $f(n) = n^2 \log n$ and $g(n) = n(\log n)^{10}$ be two positive functions of $n$. Which of the following statements is correct?$f(n) = O(g(n)) \text{ and } g(n) \neq ...
Kathleen
18.8k
views
Kathleen
asked
Sep 14, 2014
Algorithms
gatecse-2001
algorithms
asymptotic-notation
time-complexity
normal
+
–
25
votes
2
answers
57
GATE CSE 2001 | Question: 1.15
Consider any array representation of an $n$ element binary heap where the elements are stored from index $1$ to index $n$ of the array. For the element stored at index $i$ of the array $(i \leq n)$, the index of the parent is $i-1$ $\lfloor \frac{i}{2} \rfloor$ $\lceil \frac{i}{2} \rceil$ $\frac{(i+1)}{2}$
Consider any array representation of an $n$ element binary heap where the elements are stored from index $1$ to index $n$ of the array. For the element stored at index $i...
Kathleen
5.0k
views
Kathleen
asked
Sep 14, 2014
DS
gatecse-2001
data-structures
binary-heap
easy
+
–
43
votes
4
answers
58
GATE CSE 2001 | Question: 1.14
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using Randomized quicksort? $O(n)$ $O(n \log n)$ $O(n^2)$ $O(n!)$
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using Randomized quicksort?$O...
Kathleen
13.7k
views
Kathleen
asked
Sep 14, 2014
Algorithms
gatecse-2001
algorithms
sorting
time-complexity
easy
+
–
67
votes
5
answers
59
GATE CSE 2001 | Question: 1.13
A CPU has two modes -- privileged and non-privileged. In order to change the mode from privileged to non-privileged a hardware interrupt is needed a software interrupt is needed a privileged instruction (which does not generate an interrupt) is needed a non-privileged instruction (which does not generate an interrupt) is needed
A CPU has two modes privileged and non-privileged. In order to change the mode from privileged to non-privilegeda hardware interrupt is neededa software interrupt is ne...
Kathleen
22.0k
views
Kathleen
asked
Sep 14, 2014
Operating System
gatecse-2001
operating-system
normal
os-protection
+
–
30
votes
1
answer
60
GATE CSE 2001 | Question: 1.12
A processor needs software interrupt to test the interrupt system of the processor implement co-routines obtain system services which need execution of privileged instructions return from subroutine
A processor needs software interrupt totest the interrupt system of the processorimplement co-routinesobtain system services which need execution of privileged instructio...
Kathleen
8.8k
views
Kathleen
asked
Sep 14, 2014
Operating System
gatecse-2001
operating-system
interrupts
easy
+
–
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register