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
Filter
User Kathleen
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Kathleen
29
votes
9
answers
141
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)^*$
asked
in
Theory of Computation
Oct 8, 2014
13.2k
views
gate1995
theory-of-computation
regular-expression
easy
isro2017
20
votes
4
answers
142
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)
asked
in
Operating System
Oct 8, 2014
5.1k
views
gate1995
operating-system
page-replacement
normal
40
votes
5
answers
143
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
asked
in
Operating System
Oct 8, 2014
14.9k
views
gate1995
operating-system
virtual-memory
normal
25
votes
3
answers
144
GATE CSE 1995 | Question: 1.6
The principle of locality justifies the use of: Interrupts DMA Polling Cache Memory
asked
in
CO and Architecture
Oct 8, 2014
8.7k
views
gate1995
co-and-architecture
cache-memory
easy
21
votes
2
answers
145
GATE CSE 1995 | Question: 1.5
Merge sort uses: Divide and conquer strategy Backtracking approach Heuristic search Greedy approach
asked
in
Algorithms
Oct 8, 2014
5.0k
views
gate1995
algorithms
sorting
easy
algorithm-design-technique
merge-sort
21
votes
1
answer
146
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
asked
in
Algorithms
Oct 8, 2014
3.9k
views
gate1995
algorithms
identify-function
easy
19
votes
3
answers
147
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
asked
in
CO and Architecture
Oct 8, 2014
14.6k
views
gate1995
co-and-architecture
interrupts
normal
16
votes
2
answers
148
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
asked
in
CO and Architecture
Oct 8, 2014
4.8k
views
gate1995
co-and-architecture
normal
instruction-execution
1
vote
1
answer
149
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
asked
in
CO and Architecture
Oct 8, 2014
2.7k
views
gate1995
co-and-architecture
8085-microprocessor
out-of-gate-syllabus
34
votes
4
answers
150
GATE CSE 1994 | Question: 28
Consider the resource allocation graph in the figure. Find if the system is in a deadlock state Otherwise, find a safe sequence
asked
in
Operating System
Oct 5, 2014
19.6k
views
gate1994
operating-system
resource-allocation
normal
descriptive
18
votes
3
answers
151
GATE CSE 1994 | Question: 27
Draw a precedence graph for the following sequential code. The statements are numbered from $S_1$ to $S_6$ $S_1$ read n $S_2$ i := 1 $S_3$ if i > n next $S_4$ a(i) := i+1 $S_5$ i := i+1 $S_6$ next : write a(i) Can this graph be converted to a concurrent program using parbegin-parend construct only?
asked
in
Operating System
Oct 5, 2014
6.1k
views
gate1994
operating-system
process-synchronization
normal
descriptive
32
votes
3
answers
152
GATE CSE 1994 | Question: 26
A queue $Q$ containing $n$ items and an empty stack $S$ are given. It is required to transfer all the items from the queue to the stack, so that the item at the front of queue is on the TOP of the stack, and the order of all other ... which can be performed on the queue and stack are Delete, Insert, Push and Pop. Do not assume any implementation of the queue or stack.
asked
in
DS
Oct 5, 2014
7.4k
views
gate1994
data-structures
queue
stack
normal
descriptive
29
votes
6
answers
153
GATE CSE 1994 | Question: 25
An array $A$ contains $n$ integers in non-decreasing order, $A[1] \leq A[2] \leq \cdots \leq A[n]$. Describe, using Pascal like pseudo code, a linear time algorithm to find $i, j,$ such that $A[i]+A[j]=a$ given integer $M$, if such $i, j$ exist.
asked
in
DS
Oct 5, 2014
5.0k
views
gate1994
data-structures
array
normal
descriptive
30
votes
2
answers
154
GATE CSE 1994 | Question: 24
An independent set in a graph is a subset of vertices such that no two vertices in the subset are connected by an edge. An incomplete scheme for a greedy algorithm to find a maximum independent set in a tree is given below: V: Set of all ... I); Complete the algorithm by specifying the property of vertex $u$ in each case. What is the time complexity of the algorithm?
asked
in
Algorithms
Oct 5, 2014
5.9k
views
gate1994
algorithms
graph-algorithms
normal
descriptive
5
votes
0
answers
155
GATE CSE 1994 | Question: 23
Suppose we have a computer with single register and only three instructions given below: ... $T \rightarrow (E)\mid id$ Write a syntax directed translation to generate code using this grammar for the computer described above.
asked
in
Compiler Design
Oct 5, 2014
1.0k
views
gate1994
compiler-design
grammar
syntax-directed-translation
descriptive
unsolved
1
vote
1
answer
156
GATE CSE 1994 | Question: 22
Consider the program below: Program main: var r:integer; procedure two: begin write (r); end procedure one: var r:integer; begin r:=5; two; end begin r:=2; two; one; two; end What is printed by the above program if Static scoping is assumed for all variables; Dynamic scoping is assumed for all variables. Give reasons for your answer.
asked
in
Programming in C
Oct 5, 2014
1.8k
views
gate1994
programming
variable-binding
normal
out-of-gate-syllabus
37
votes
3
answers
157
GATE CSE 1994 | Question: 21
Consider the following recursive function: function fib (n:integer);integer; begin if (n=0) or (n=1) then fib := 1 else fib := fib(n-1) + fib(n-2) end; The above function is run on a computer with a stack of $64$ bytes. Assuming ... an address takes $2$ bytes each, estimate the maximum value of $n$ for which the stack will not overflow. Give reasons for your answer.
asked
in
Programming in C
Oct 5, 2014
25.5k
views
gate1994
programming
recursion
normal
descriptive
16
votes
3
answers
158
GATE CSE 1994 | Question: 20
A grammar $G$ is in Chomsky-Normal Form (CNF) if all its productions are of the form $A \to BC$ or $A \to a$, where $A,B$ and $C$, are non-terminals and $a$ is a terminal. Suppose $G$ is a CFG in CNF and $w$ is a string in $L(G)$ of length $n$, then how long is a derivation of $w$ in $G$?
asked
in
Compiler Design
Oct 5, 2014
4.9k
views
gate1994
compiler-design
grammar
normal
descriptive
28
votes
4
answers
159
GATE CSE 1994 | Question: 19
Given a set: $S = \left\{x \mid \text{ there is an x-block of 5's in the decimal expansion of } \pi\right\}$ (Note: $x$-$block$ is a maximal block of $x$ successive $5$'s) Which of the following statements is true with ... that a language $L_1$ is regular and that the language $L_1 \cup L_2$ is regular, is the language $L_2$ always regular? Prove your answer.
asked
in
Theory of Computation
Oct 5, 2014
5.4k
views
gate1994
theory-of-computation
identify-class-language
normal
descriptive
19
votes
2
answers
160
GATE CSE 1994 | Question: 18a
State whether the following statements are True or False with reasons for your answer A subroutine cannot always be used to replace a macro in an assembly language program.
asked
in
Compiler Design
Oct 5, 2014
2.9k
views
gate1994
compiler-design
normal
assembler
true-false
descriptive
Page:
« prev
1
...
3
4
5
6
7
8
9
10
11
12
13
...
61
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...