Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gate1995
28
votes
6
answers
61
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
+
–
43
votes
6
answers
62
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
+
–
35
votes
6
answers
63
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
+
–
39
votes
4
answers
64
GATE CSE 1995 | Question: 1.15
Which scheduling policy is most suitable for a time shared operating system? Shortest Job First Round Robin First Come First Serve Elevator
Which scheduling policy is most suitable for a time shared operating system?Shortest Job FirstRound RobinFirst Come First ServeElevator
Kathleen
13.0k
views
Kathleen
asked
Oct 8, 2014
Operating System
gate1995
operating-system
process-scheduling
easy
+
–
44
votes
1
answer
65
GATE CSE 1995 | Question: 1.14
A linker is given object modules for a set of programs that were compiled separately. What information need to be included in an object module? Object code Relocation bits Names and locations of all external symbols defined in the object module Absolute addresses of internal symbols
A linker is given object modules for a set of programs that were compiled separately. What information need to be included in an object module?Object codeRelocation bitsN...
Kathleen
16.6k
views
Kathleen
asked
Oct 8, 2014
Compiler Design
gate1995
compiler-design
runtime-environment
normal
+
–
2
votes
0
answers
66
GATE CSE 1995 | Question: 1.13
Kathleen
1.4k
views
Kathleen
asked
Oct 8, 2014
Others
gate1995
out-of-syllabus-now
pascal
+
–
25
votes
5
answers
67
GATE CSE 1995 | Question: 1.12
What is the distance of the following code $000000$, $010101$, $000111$, $011001$, $111111$? $2$ $3$ $4$ $1$
What is the distance of the following code $000000$, $010101$, $000111$, $011001$, $111111$?$2$$3$$4$$1$
Kathleen
7.5k
views
Kathleen
asked
Oct 8, 2014
Computer Networks
gate1995
computer-networks
error-detection
normal
+
–
15
votes
3
answers
68
GATE CSE 1995 | Question: 1.11
What are $x$ and $y$ in the following macro definition? macro Add x, y Load y Mul x Store y end macro Variables Identifiers Actual parameters Formal parameters
What are $x$ and $y$ in the following macro definition?macro Add x, y Load y Mul x Store y end macroVariablesIdentifiersActual parametersFormal parameters
Kathleen
4.6k
views
Kathleen
asked
Oct 8, 2014
Compiler Design
gate1995
compiler-design
macros
easy
+
–
38
votes
3
answers
69
GATE CSE 1995 | Question: 1.10
Consider a grammar with the following productions $S \rightarrow a \alpha b \mid b \alpha c \mid aB$ $S \rightarrow \alpha S\mid b$ $S \rightarrow \alpha b b\mid ab$ $S \alpha \rightarrow bd b\mid b$ The above grammar is: Context free Regular Context sensitive $LR(k)$
Consider a grammar with the following productions$S \rightarrow a \alpha b \mid b \alpha c \mid aB$$S \rightarrow \alpha S\mid b$$S \rightarrow \alpha b b\mid ab$$...
Kathleen
18.1k
views
Kathleen
asked
Oct 8, 2014
Compiler Design
gate1995
compiler-design
grammar
normal
+
–
29
votes
9
answers
70
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
+
–
20
votes
4
answers
71
GATE CSE 1995 | Question: 1.8
Which of the following page replacement algorithms suffers from Belady’s anamoly? Optimal replacement LRU FIFO Both (A) and (C)
Which of the following page replacement algorithms suffers from Belady’s anamoly?Optimal replacementLRUFIFOBoth (A) and (C)
Kathleen
5.1k
views
Kathleen
asked
Oct 8, 2014
Operating System
gate1995
operating-system
page-replacement
normal
+
–
40
votes
5
answers
72
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
+
–
25
votes
3
answers
73
GATE CSE 1995 | Question: 1.6
The principle of locality justifies the use of: Interrupts DMA Polling Cache Memory
The principle of locality justifies the use of:InterruptsDMAPollingCache Memory
Kathleen
8.6k
views
Kathleen
asked
Oct 8, 2014
CO and Architecture
gate1995
co-and-architecture
cache-memory
easy
+
–
21
votes
2
answers
74
GATE CSE 1995 | Question: 1.5
Merge sort uses: Divide and conquer strategy Backtracking approach Heuristic search Greedy approach
Merge sort uses:Divide and conquer strategyBacktracking approachHeuristic searchGreedy approach
Kathleen
5.0k
views
Kathleen
asked
Oct 8, 2014
Algorithms
gate1995
algorithms
sorting
easy
algorithm-design-technique
merge-sort
+
–
21
votes
1
answer
75
GATE CSE 1995 | Question: 1.4
In the following Pascal program segment, what is the value of X after the execution of the program segment? X := -10; Y := 20; If X > Y then if X < 0 then X := abs(X) else X := 2*X; $10$ $-20$ $-10$ None
In the following Pascal program segment, what is the value of X after the execution of the program segment?X := -10; Y := 20; If X Y then if X < 0 then X := abs(X) else ...
Kathleen
3.9k
views
Kathleen
asked
Oct 8, 2014
Algorithms
gate1995
algorithms
identify-function
easy
+
–
19
votes
3
answers
76
GATE CSE 1995 | Question: 1.3
In a vectored interrupt: The branch address is assigned to a fixed location in memory The interrupting source supplies the branch information to the processor through an interrupt vector The branch address is obtained from a register in the processor None of the above
In a vectored interrupt:The branch address is assigned to a fixed location in memoryThe interrupting source supplies the branch information to the processor through an in...
Kathleen
14.6k
views
Kathleen
asked
Oct 8, 2014
CO and Architecture
gate1995
co-and-architecture
interrupts
normal
+
–
16
votes
2
answers
77
GATE CSE 1995 | Question: 1.2
Which of the following statements is true? ROM is a Read/Write memory PC points to the last instruction that was executed Stack works on the principle of LIFO All instructions affect the flags
Which of the following statements is true?ROM is a Read/Write memoryPC points to the last instruction that was executedStack works on the principle of LIFOAll instruction...
Kathleen
4.7k
views
Kathleen
asked
Oct 8, 2014
CO and Architecture
gate1995
co-and-architecture
normal
instruction-execution
+
–
1
votes
1
answer
78
GATE CSE 1995 | Question: 1.1
A single instruction to clear the lower four bits of the accumulator in 8085 assembly language? XRI 0FH ANI F0H XRI F0H ANI 0FH
A single instruction to clear the lower four bits of the accumulator in 8085 assembly language?XRI 0FHANI F0HXRI F0HANI 0FH
Kathleen
2.6k
views
Kathleen
asked
Oct 8, 2014
CO and Architecture
gate1995
co-and-architecture
8085-microprocessor
out-of-gate-syllabus
+
–
14
votes
5
answers
79
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
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register