Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatecse-2004
15
votes
7
answers
61
GATE CSE 2004 | Question: 30, ISRO2017-10
The problem $\text{3-SAT}$ and $\text{2-SAT}$ are both in $\text{P}$ both $\text{NP}$ complete $\text{NP}$-complete and in $\text{P}$ respectively undecidable and $\text{NP}$ complete respectively
The problem $\text{3-SAT}$ and $\text{2-SAT}$ are both in $\text{P}$both $\text{NP}$ complete$\text{NP}$-complete and in $\text{P}$ respectivelyundecidable and $\text{NP}...
Kathleen
11.7k
views
Kathleen
asked
Sep 18, 2014
Algorithms
gatecse-2004
algorithms
p-np-npc-nph
easy
isro2017
out-of-gate-syllabus
+
–
77
votes
5
answers
62
GATE CSE 2004 | Question: 29
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of $n$ $n^2$ $n \log n$ $n \log^2n$
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of$n$$n^2$$n \log n$$n \log^2n$
Kathleen
33.3k
views
Kathleen
asked
Sep 18, 2014
Algorithms
gatecse-2004
algorithms
sorting
asymptotic-notation
easy
+
–
42
votes
5
answers
63
GATE CSE 2004 | Question: 28
What is the result of evaluating the following two expressions using three-digit floating point arithmetic with rounding? $(113. + -111.) + 7.51$ $113. + (-111. + 7.51)$ $9.51$ and $10.0$ respectively $10.0$ and $9.51$ respectively $9.51$ and $9.51$ respectively $10.0$ and $10.0$ respectively
What is the result of evaluating the following two expressions using three-digit floating point arithmetic with rounding?$(113. + -111.) + 7.51$$113. + (-111. + 7.51)$$9....
Kathleen
16.0k
views
Kathleen
asked
Sep 18, 2014
Digital Logic
gatecse-2004
digital-logic
number-representation
normal
+
–
35
votes
4
answers
64
GATE CSE 2004 | Question: 27
Let $A, B, C, D$ be $n \times n$ matrices, each with non-zero determinant. If $ABCD = I$, then $B^{-1}$ is $D^{-1}C^{-1}A^{-1}$ $CDA$ $ADC$ Does not necessarily exist
Let $A, B, C, D$ be $n \times n$ matrices, each with non-zero determinant. If $ABCD = I$, then $B^{-1}$ is $D^{-1}C^{-1}A^{-1}$ $CDA$ $ADC$ Does not necessarily e...
Kathleen
10.0k
views
Kathleen
asked
Sep 18, 2014
Linear Algebra
gatecse-2004
linear-algebra
normal
matrix
+
–
25
votes
7
answers
65
GATE CSE 2004 | Question: 26
The number of different $n \times n $ symmetric matrices with each element being either 0 or 1 is: (Note: $\text{power} \left(2, X\right)$ is same as $2^X$) $\text{power} \left(2, n\right)$ $\text{power} \left(2, n^2\right)$ $\text{power} \left(2,\frac{ \left(n^2+ n \right) }{2}\right)$ $\text{power} \left(2, \frac{\left(n^2 - n\right)}{2}\right)$
The number of different $n \times n $ symmetric matrices with each element being either 0 or 1 is: (Note: $\text{power} \left(2, X\right)$ is same as $2^X$)$\text{power} ...
Kathleen
12.4k
views
Kathleen
asked
Sep 18, 2014
Linear Algebra
gatecse-2004
linear-algebra
normal
matrix
+
–
16
votes
3
answers
66
GATE CSE 2004 | Question: 25
If a fair coin is tossed four times. What is the probability that two heads and two tails will result? $\frac{3}{8}$ $\frac{1}{2}$ $\frac{5}{8}$ $\frac{3}{4}$
If a fair coin is tossed four times. What is the probability that two heads and two tails will result?$\frac{3}{8}$$\frac{1}{2}$$\frac{5}{8}$$\frac{3}{4}$
Kathleen
5.6k
views
Kathleen
asked
Sep 18, 2014
Probability
gatecse-2004
probability
easy
+
–
34
votes
6
answers
67
GATE CSE 2004 | Question: 24
Consider the binary relation: $S= \left\{\left(x, y\right) \mid y=x+1 \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$ The reflexive transitive closure is $S$ ... $\left\{\left(x, y\right) \mid y \leq x \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$
Consider the binary relation:$S= \left\{\left(x, y\right) \mid y=x+1 \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$The reflexive transitive closure is $S$ is$\lef...
Kathleen
9.7k
views
Kathleen
asked
Sep 18, 2014
Set Theory & Algebra
gatecse-2004
set-theory&algebra
easy
relations
+
–
87
votes
7
answers
68
GATE CSE 2004 | Question: 23, ISRO2007-32
Identify the correct translation into logical notation of the following assertion. Some boys in the class are taller than all the girls Note: $\text{taller} (x, y)$ is true if $x$ is taller than $y$ ... $(\exists x) (\text{boy}(x) \land (\forall y) (\text{girl}(y) \rightarrow \text{taller}(x, y)))$
Identify the correct translation into logical notation of the following assertion.Some boys in the class are taller than all the girlsNote: $\text{taller} (x, y)$ is true...
Kathleen
115k
views
Kathleen
asked
Sep 18, 2014
Mathematical Logic
gatecse-2004
mathematical-logic
easy
isro2007
first-order-logic
+
–
24
votes
3
answers
69
GATE CSE 2004 | Question: 22
How many $8-bi$t characters can be transmitted per second over a $9600$ baud serial communication link using asynchronous mode of transmission with one start bit, eight data bits, two stop bits and one parity bit? $600$ $800$ $876$ $1200$
How many $8-bi$t characters can be transmitted per second over a $9600$ baud serial communication link using asynchronous mode of transmission with one start bit, eight d...
Kathleen
15.7k
views
Kathleen
asked
Sep 18, 2014
Computer Networks
gatecse-2004
computer-networks
serial-communication
normal
out-of-gate-syllabus
+
–
66
votes
9
answers
70
GATE CSE 2004 | Question: 21, ISRO2007-44
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by the instruction set architecture page size number of processes in memory physical memory size
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined bythe instruction set architecturepage sizenum...
Kathleen
23.7k
views
Kathleen
asked
Sep 18, 2014
Operating System
gatecse-2004
operating-system
virtual-memory
page-replacement
normal
isro2007
+
–
41
votes
4
answers
71
GATE CSE 2004 | Question: 20
Which of the following addressing modes are suitable for program relocation at run time? Absolute addressing Based addressing Relative addressing Indirect addressing I and IV I and II II and III I, II and IV
Which of the following addressing modes are suitable for program relocation at run time?Absolute addressingBased addressingRelative addressingIndirect addressingI and IVI...
Kathleen
12.0k
views
Kathleen
asked
Sep 18, 2014
CO and Architecture
gatecse-2004
co-and-architecture
addressing-modes
easy
+
–
19
votes
2
answers
72
GATE CSE 2004 | Question: 19
If $73_x$ (in base-x number system) is equal to $54_y$ (in base $y$-number system), the possible values of $x$ and $y$ are $8, 16$ $10, 12$ $9, 13$ $8, 11$
If $73_x$ (in base-x number system) is equal to $54_y$ (in base $y$-number system), the possible values of $x$ and $y$ are$8, 16$$10, 12$$9, 13$$8, 11$
Kathleen
6.3k
views
Kathleen
asked
Sep 18, 2014
Digital Logic
gatecse-2004
digital-logic
number-representation
easy
+
–
47
votes
9
answers
73
GATE CSE 2004 | Question: 18, ISRO2007-31
In an $SR$ latch made by cross-coupling two NAND gates, if both $S$ and $R$ inputs are set to $0$, then it will result in $Q = 0, Q' = 1$ $Q = 1, Q' = 0$ $Q = 1, Q' = 1$ Indeterminate states
In an $SR$ latch made by cross-coupling two NAND gates, if both $S$ and $R$ inputs are set to $0$, then it will result in$Q = 0, Q' = 1$$Q = 1, Q' = 0$$Q = 1, Q' = 1$Inde...
Kathleen
22.0k
views
Kathleen
asked
Sep 18, 2014
Digital Logic
gatecse-2004
digital-logic
easy
isro2007
flip-flop
+
–
28
votes
5
answers
74
GATE CSE 2004 | Question: 17
A Boolean function $x’y’ + xy + x’y$ is equivalent to $x' + y'$ $x + y$ $x + y'$ $x' + y$
A Boolean function $x’y’ + xy + x’y$ is equivalent to$x' + y'$$x + y$$x + y'$$x' + y$
Kathleen
7.8k
views
Kathleen
asked
Sep 18, 2014
Digital Logic
gatecse-2004
digital-logic
easy
boolean-algebra
+
–
21
votes
2
answers
75
GATE CSE 2004 | Question: 16
Which of the following is NOT true with respect to a transparent bridge and a router? Both bridge and router selectively forward data packets A bridge uses IP addresses while a router uses MAC addresses A bridge builds up its routing table by inspecting incoming packets A router can connect between a LAN and a WAN
Which of the following is NOT true with respect to a transparent bridge and a router?Both bridge and router selectively forward data packetsA bridge uses IP addresses whi...
Kathleen
10.1k
views
Kathleen
asked
Sep 18, 2014
Computer Networks
gatecse-2004
computer-networks
routers-bridge-hubs-switches
normal
+
–
28
votes
5
answers
76
GATE CSE 2004 | Question: 15
Choose the best matching between $\text{Group 1}$ and $\text{Group 2}$ ... $\text{P-2, Q-4, R-1}$ $\text{P-2, Q-3, R-1}$ $\text{P-1, Q-3, R-2}$
Choose the best matching between $\text{Group 1}$ and $\text{Group 2}$$$\begin{array}{|l|l|}\hline \textbf{Group-1} & \textbf{Group-2} \\\hline \text{P. Data link layer}...
Kathleen
7.1k
views
Kathleen
asked
Sep 18, 2014
Computer Networks
gatecse-2004
computer-networks
network-layering
normal
+
–
64
votes
7
answers
77
GATE CSE 2004 | Question: 14
Consider the following relation schema pertaining to a students database: Students (rollno, name, address) Enroll (rollno, courseno, coursename) where the primary keys are shown underlined. The number of tuples in the student and Enroll tables are $120$ and $8$ respectively. What ... Student * Enroll), where *' denotes natural join? $8, 8$ $120, 8$ $960, 8$ $960, 120$
Consider the following relation schema pertaining to a students database:Students (rollno, name, address)Enroll (rollno, courseno, coursename)where the primary keys are s...
Kathleen
28.4k
views
Kathleen
asked
Sep 18, 2014
Databases
gatecse-2004
databases
easy
joins
natural-join
+
–
33
votes
1
answer
78
GATE CSE 2004 | Question: 13
Let $R_1 \left(\underline{A}, B, C\right)$ and $R_2\left(\underline{D}, E \right) $ be two relation schema, where the primary keys are shown underlined, and let C be a foreign key in $R_1$ referring to $R_2$. Suppose there is no violation of the above ... $\Pi_D \left(r_1 \bowtie_{C \neq D}r_2\right)$ $\Pi_C \left(r_1 \bowtie_{C = D}r_2\right)$
Let $R_1 \left(\underline{A}, B, C\right)$ and $R_2\left(\underline{D}, E \right) $ be two relation schema, where the primary keys are shown underlined, and let C be a fo...
Kathleen
7.0k
views
Kathleen
asked
Sep 18, 2014
Databases
gatecse-2004
databases
relational-calculus
easy
+
–
56
votes
4
answers
79
GATE CSE 2004 | Question: 12
Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is First Come First Served (FCFS). If FCFS is replaced by Shortest Seek Time First (SSTF), claimed by the vendor to give ... is the expected improvement in the I/O performance of user programs? $50 \%$ $40\%$ $25\%$ $0\%$
Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is First Come First Serv...
Kathleen
16.8k
views
Kathleen
asked
Sep 18, 2014
Operating System
gatecse-2004
operating-system
disk-scheduling
normal
+
–
53
votes
4
answers
80
GATE CSE 2004 | Question: 11
Consider the following statements with respect to user-level threads and kernel-supported threads context switch is faster with kernel-supported threads for user-level threads, a system call can block the entire process Kernel supported threads can be scheduled independently User level threads ... ) and (IV) only (II) and (III) only (I) and (III) only (I) and (II) only
Consider the following statements with respect to user-level threads and kernel-supported threadscontext switch is faster with kernel-supported threadsfor user-level thre...
Kathleen
27.5k
views
Kathleen
asked
Sep 18, 2014
Operating System
gatecse-2004
operating-system
threads
normal
+
–
29
votes
2
answers
81
GATE CSE 2004 | Question: 9
Consider a program $P$ that consists of two source modules $M_1$ and $M_2$ contained in two different files. If $M_1$ contains a reference to a function defined in $M_2$ the reference will be resolved at Edit time Compile time Link time Load time
Consider a program $P$ that consists of two source modules $M_1$ and $M_2$ contained in two different files. If $M_1$ contains a reference to a function defined in $M_2$ ...
Kathleen
6.4k
views
Kathleen
asked
Sep 18, 2014
Compiler Design
gatecse-2004
compiler-design
easy
linker
+
–
21
votes
2
answers
82
GATE CSE 2004 | Question: 8
Which of the following grammar rules violate the requirements of an operator grammar? $P, Q, R$ are nonterminals, and $r, s, t$ are terminals. $P \rightarrow Q R$ $P \rightarrow Q s R$ $P \rightarrow \: \varepsilon$ $P \rightarrow Q t R r $ (I) only (I) and (III) only (II) and (III) only (III) and (IV) only
Which of the following grammar rules violate the requirements of an operator grammar? $P, Q, R$ are nonterminals, and $r, s, t$ are terminals.$P \rightarrow Q R$$P \right...
Kathleen
11.0k
views
Kathleen
asked
Sep 18, 2014
Compiler Design
gatecse-2004
compiler-design
grammar
normal
+
–
24
votes
5
answers
83
GATE CSE 2004 | Question: 7
Given the following input $(4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199)$ and the hash function $x$ mod $10$, which of the following statements are true? $9679, 1989, 4199$ hash to the same value $1471, 6171$ hash to the same value All elements hash to the same value Each element hashes to a different value I only II only I and II only III or IV
Given the following input $(4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199)$ and the hash function $x$ mod $10$, which of the following statements are true?$9679, 1989, 4...
Kathleen
9.8k
views
Kathleen
asked
Sep 18, 2014
DS
gatecse-2004
data-structures
hashing
easy
+
–
19
votes
3
answers
84
GATE CSE 2004 | Question: 6
Level order traversal of a rooted tree can be done by starting from the root and performing preorder traversal in-order traversal depth first search breadth first search
Level order traversal of a rooted tree can be done by starting from the root and performingpreorder traversalin-order traversaldepth first searchbreadth first search
Kathleen
6.4k
views
Kathleen
asked
Sep 18, 2014
DS
gatecse-2004
data-structures
tree
easy
+
–
19
votes
4
answers
85
GATE CSE 2004 | Question: 5
The best data structure to check whether an arithmetic expression has balanced parentheses is a queue stack tree list
The best data structure to check whether an arithmetic expression has balanced parentheses is aqueuestacktreelist
Kathleen
6.9k
views
Kathleen
asked
Sep 18, 2014
DS
gatecse-2004
data-structures
easy
stack
+
–
27
votes
6
answers
86
GATE CSE 2004 | Question: 4, ISRO2009-26
The following numbers are inserted into an empty binary search tree in the given order: $10, 1, 3, 5, 15, 12, 16$. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)? $2$ $3$ $4$ $6$
The following numbers are inserted into an empty binary search tree in the given order: $10, 1, 3, 5, 15, 12, 16$. What is the height of the binary search tree (the heigh...
Kathleen
22.4k
views
Kathleen
asked
Sep 18, 2014
DS
gatecse-2004
data-structures
binary-search-tree
easy
isro2009
+
–
48
votes
6
answers
87
GATE CSE 2004 | Question: 3
A single array $A[1 \ldots \text{MAXSIZE}]$ is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables $top1$ and $top2$ $(top1 < top 2)$ point to the location of the topmost element in each of the stacks. If the space is to ... $(top1 = \text{MAXSIZE} / 2)$ or $(top2 = \text{MAXSIZE})$ $top1 = top2 - 1$
A single array $A[1 \ldots \text{MAXSIZE}]$ is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables $top1$ and $top2$ $(top1 < top...
Kathleen
35.1k
views
Kathleen
asked
Sep 18, 2014
DS
gatecse-2004
data-structures
stack
easy
+
–
30
votes
5
answers
88
GATE CSE 2004 | Question: 2,ISRO2017-54
Consider the following function void swap(int a, int b) { int temp; temp = a; a = b; b = temp; } In order to exchange the values of two variables $x$ and $y$. call $swap(x, y)$ call $swap(\&x, \&y)$ $swap (x, y)$ cannot be used as it does not return any value $swap (x, y)$ cannot be used as the parameters are passed by value
Consider the following functionvoid swap(int a, int b) { int temp; temp = a; a = b; b = temp; }In order to exchange the values of two variables $x$ and $y$.call $swap(x, ...
Kathleen
14.5k
views
Kathleen
asked
Sep 18, 2014
Compiler Design
gatecse-2004
compiler-design
programming-in-c
parameter-passing
easy
isro2017
runtime-environment
+
–
24
votes
2
answers
89
GATE CSE 2004 | Question: 1
The goal of structured programming is to: have well indented programs be able to infer the flow of control from the compiled code be able to infer the flow of control from the program text avoid the use of GOTO statements
The goal of structured programming is to:have well indented programsbe able to infer the flow of control from the compiled codebe able to infer the flow of control from t...
Kathleen
8.9k
views
Kathleen
asked
Sep 18, 2014
Programming in C
gatecse-2004
programming
easy
programming-paradigms
+
–
129
votes
19
answers
90
GATE CSE 2004 | Question: 47
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. ... execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An avera...
gatecse
63.0k
views
gatecse
asked
Sep 5, 2014
CO and Architecture
gatecse-2004
co-and-architecture
virtual-memory
normal
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register