Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for gate1995
19
votes
1
answer
1
GATE CSE 1995 | Question: 20
The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is currently serving a request at track $55$. If the queue of requests kept in FIFO order is $10, 70, 75, 23, 65$ which of the two disk scheduling algorithms ... Come First Served) and SSTF (Shortest Seek Time First) will require less head movement? Find the head movement for each of the algorithms.
The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is currently serving a request at track $55$. If the queue of requests kept in FIFO order is $$10, 7...
Kathleen
122k
views
Kathleen
asked
Oct 8, 2014
Operating System
gate1995
operating-system
disk-scheduling
normal
descriptive
+
–
35
votes
6
answers
2
GATE CSE 1995 | Question: 1.16
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of $O(m)$ $O(n)$ $O(m+n)$ $O(\log m + \log n)$
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of$O(m)$$O(n)$$O(m+n)$$O(\log m + \log n)$
Kathleen
47.6k
views
Kathleen
asked
Oct 8, 2014
Algorithms
gate1995
algorithms
sorting
normal
+
–
49
votes
7
answers
3
GATE CSE 1995 | Question: 2.21
The postfix expression for the infix expression $A+B*(C+D)/F+D*E$ is: $AB + CD + *F/D +E*$ $ABCD + *F/DE* ++$ $A * B + CD/F *DE ++$ $A + *BCD/F* DE ++$
The postfix expression for the infix expression $A+B*(C+D)/F+D*E$ is:$AB + CD + *F/D +E*$$ABCD + *F/DE* ++$$A * B + CD/F *DE ++$$A + *BCD/F* DE ++$
Kathleen
38.1k
views
Kathleen
asked
Oct 8, 2014
DS
gate1995
data-structures
stack
easy
+
–
43
votes
6
answers
4
GATE CSE 1995 | Question: 1.17
A binary tree $T$ has $n$ leaf nodes. The number of nodes of degree $2$ in $T$ is $\log_2 n$ $n-1$ $n$ $2^n$
A binary tree $T$ has $n$ leaf nodes. The number of nodes of degree $2$ in $T$ is$\log_2 n$$n-1$$n$$2^n$
Kathleen
35.9k
views
Kathleen
asked
Oct 8, 2014
DS
gate1995
data-structures
binary-tree
normal
+
–
33
votes
5
answers
5
GATE CSE 1995 | Question: 1.25
The minimum number of edges in a connected cyclic graph on $n$ vertices is: $n-1$ $n$ $n+1$ None of the above
The minimum number of edges in a connected cyclic graph on $n$ vertices is:$n-1$$n$$n+1$None of the above
Kathleen
21.0k
views
Kathleen
asked
Oct 8, 2014
Graph Theory
gate1995
graph-theory
graph-connectivity
easy
+
–
24
votes
6
answers
6
GATE CSE 1995 | Question: 1.20
The number of elements in the power set $P(S)$ of the set $S=\{\{\emptyset\}, 1, \{2, 3\}\}$ is: $2$ $4$ $8$ None of the above
The number of elements in the power set $P(S)$ of the set $S=\{\{\emptyset\}, 1, \{2, 3\}\}$ is:$2$$4$$8$None of the above
Kathleen
16.2k
views
Kathleen
asked
Oct 8, 2014
Set Theory & Algebra
gate1995
set-theory&algebra
normal
set-theory
+
–
56
votes
5
answers
7
GATE CSE 1995 | Question: 2.7
The address sequence generated by tracing a particular program executing in a pure demand based paging system with $100$ records per page with $1$ free main memory frame is recorded as follows. What is the number of page faults? $0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0370$ $13$ $8$ $7$ $10$
The address sequence generated by tracing a particular program executing in a pure demand based paging system with $100$ records per page with $1$ free main memory frame ...
Kathleen
16.0k
views
Kathleen
asked
Oct 8, 2014
Operating System
gate1995
operating-system
page-replacement
normal
+
–
40
votes
5
answers
8
GATE CSE 1995 | Question: 1.7
In a paged segmented scheme of memory management, the segment table itself must have a page table because The segment table is often too large to fit in one page Each segment is spread over a number of pages Segment tables point to page tables and not to the physical locations of the segment The processor’s description base register points to a page table
In a paged segmented scheme of memory management, the segment table itself must have a page table becauseThe segment table is often too large to fit in one pageEach segme...
Kathleen
14.9k
views
Kathleen
asked
Oct 8, 2014
Operating System
gate1995
operating-system
virtual-memory
normal
+
–
28
votes
6
answers
9
GATE CSE 1995 | Question: 1.19
Let $R$ be a symmetric and transitive relation on a set $A$. Then $R$ is reflexive and hence an equivalence relation $R$ is reflexive and hence a partial order $R$ is reflexive and hence not an equivalence relation None of the above
Let $R$ be a symmetric and transitive relation on a set $A$. Then$R$ is reflexive and hence an equivalence relation$R$ is reflexive and hence a partial order$R$ is reflex...
Kathleen
14.2k
views
Kathleen
asked
Oct 8, 2014
Set Theory & Algebra
gate1995
set-theory&algebra
relations
normal
+
–
29
votes
9
answers
10
GATE CSE 1995 | Question: 1.9 , ISRO2017-13
In some programming language, an identifier is permitted to be a letter followed by any number of letters or digits. If $L$ and $D$ denote the sets of letters and digits respectively, which of the following expressions defines an identifier? $(L + D)^+$ $(L.D)^*$ $L(L + D)^*$ $L(L.D)^*$
In some programming language, an identifier is permitted to be a letter followed by any number of letters or digits. If $L$ and $D$ denote the sets of letters and digits ...
Kathleen
13.0k
views
Kathleen
asked
Oct 8, 2014
Theory of Computation
gate1995
theory-of-computation
regular-expression
easy
isro2017
+
–
26
votes
3
answers
11
GATE CSE 1995 | Question: 2.22
Which of the following statements is true? As the number of entries in a hash table increases, the number of collisions increases. Recursive programs are efficient The worst case complexity for Quicksort is $O(n^2)$ Binary search using a linear linked list is efficient I and II II and III I and IV I and III
Which of the following statements is true?As the number of entries in a hash table increases, the number of collisions increases.Recursive programs are efficientThe worst...
Kathleen
11.3k
views
Kathleen
asked
Oct 8, 2014
DS
gate1995
data-structures
linked-list
hashing
+
–
25
votes
3
answers
12
GATE CSE 1995 | Question: 2.16
In a virtual memory system the address space specified by the address lines of the CPU must be _____ than the physical memory size and ____ than the secondary storage size. smaller, smaller smaller, larger larger, smaller larger, larger
In a virtual memory system the address space specified by the address lines of the CPU must be _____ than the physical memory size and ____ than the secondary storage siz...
Kathleen
10.5k
views
Kathleen
asked
Oct 8, 2014
Operating System
gate1995
operating-system
virtual-memory
normal
+
–
14
votes
5
answers
13
GATE CSE 1995 | Question: 1.18
The probability that a number selected at random between $100$ and $999$ (both inclusive) will not contain the digit $7$ is: $\dfrac{16}{25}$ $\left(\dfrac{9}{10}\right)^{3}$ $\dfrac{27}{75}$ $\dfrac{18}{25}$
The probability that a number selected at random between $100$ and $999$ (both inclusive) will not contain the digit $7$ is: $\dfrac{16}{25}$$\left(\dfrac{9}{10}\right)^...
gatecse
11.0k
views
gatecse
asked
Sep 15, 2014
Probability
gate1995
probability
normal
+
–
28
votes
6
answers
14
GATE CSE 1995 | Question: 26
Consider the relation scheme $R(A, B, C)$ with the following functional dependencies: $A, B \rightarrow C,$ $C \rightarrow A$ Show that the scheme $R$ is in $3\text{NF}$ but not in $\text{BCNF}$. Determine the minimal keys of relation $R$.
Consider the relation scheme $R(A, B, C)$ with the following functional dependencies:$A, B \rightarrow C,$$C \rightarrow A$Show that the scheme $R$ is in $3\text{NF}$ but...
Kathleen
11.1k
views
Kathleen
asked
Oct 8, 2014
Databases
gate1995
databases
database-normalization
normal
descriptive
+
–
27
votes
4
answers
15
GATE CSE 1995 | Question: 2.17
Let $A$ be the set of all non-singular matrices over real number and let $*$ be the matrix multiplication operation. Then $A$ is closed under $*$ but $\langle A, *\rangle$ is not a semigroup. $\langle A, *\rangle$ is a semigroup but not a monoid. $\langle A, * \rangle$ is a monoid but not a group. $\langle A, *\rangle$ is a a group but not an abelian group.
Let $A$ be the set of all non-singular matrices over real number and let $*$ be the matrix multiplication operation. Then$A$ is closed under $*$ but $\langle A, *\rangle$...
Kathleen
9.8k
views
Kathleen
asked
Oct 8, 2014
Set Theory & Algebra
gate1995
set-theory&algebra
group-theory
+
–
41
votes
4
answers
16
GATE CSE 1995 | Question: 2.19
If the proposition $\lnot p \to q$ is true, then the truth value of the proposition $\lnot p \lor \left ( p \to q \right )$, where $\lnot$ is negation, $\lor$ is inclusive OR and $\to$ is implication, is True Multiple Values False Cannot be determined
If the proposition $\lnot p \to q$ is true, then the truth value of the proposition $\lnot p \lor \left ( p \to q \right )$, where $\lnot$ is negation, $\lor$ is inclusiv...
Kathleen
8.5k
views
Kathleen
asked
Oct 8, 2014
Mathematical Logic
gate1995
mathematical-logic
normal
propositional-logic
+
–
41
votes
5
answers
17
GATE CSE 1995 | Question: 2.23
A finite state machine with the following state table has a single input $x$ and a single out $z$ ... $C$ is: $01$ $10$ $101$ $110$
A finite state machine with the following state table has a single input $x$ and a single out $z$.$$\begin{array}{|c|ll|}\hline\textbf{present state} & \qquad \textbf{nex...
Kathleen
11.3k
views
Kathleen
asked
Oct 8, 2014
Theory of Computation
gate1995
theory-of-computation
finite-automata
normal
+
–
47
votes
5
answers
18
GATE CSE 1995 | Question: 2.6
The sequence __________ is an optimal non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for ________ unit(s) of time. ... $\{2, 1, 3\}, 0$ $\{3, 2, 1\}, 0$ $\{1, 2, 3\}, 5$
The sequence __________ is an optimal non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for ________ unit(s) of time.$$\small \begin{arr...
Kathleen
16.1k
views
Kathleen
asked
Oct 8, 2014
Operating System
gate1995
operating-system
process-scheduling
normal
+
–
20
votes
6
answers
19
GATE CSE 1995 | Question: 2.14
A bag contains $10$ white balls and $15$ black balls. Two balls are drawn in succession. The probability that one of them is black and the other is white is: $\frac{2}{3}$ $\frac{4}{5}$ $\frac{1}{2}$ $\frac{1}{3}$
A bag contains $10$ white balls and $15$ black balls. Two balls are drawn in succession. The probability that one of them is black and the other is white is:$\frac{2}{3}$...
Kathleen
8.4k
views
Kathleen
asked
Oct 8, 2014
Probability
gate1995
probability
normal
+
–
31
votes
6
answers
20
GATE CSE 1995 | Question: 2.12, ISRO2015-9
The number of $1$'s in the binary representation of $(3\ast4096 + 15\ast256 + 5\ast16 + 3)$ are: $8$ $9$ $10$ $12$
The number of $1$'s in the binary representation of $(3\ast4096 + 15\ast256 + 5\ast16 + 3)$ are:$8$$9$$10$$12$
Kathleen
18.3k
views
Kathleen
asked
Oct 8, 2014
Digital Logic
gate1995
digital-logic
number-representation
normal
isro2015
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register