menu
Recent questions tagged gate1998
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged gate1998
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions tagged gate1998
0
votes
0
answers
43
views
GATE1998-2.17, UGCNET-Dec2012-III-43 Video Solution
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
43
views
gate1998
operating-system
process-scheduling
normal
ugcnetdec2012iii
video-solution
0
votes
0
answers
28
views
GATE1998-1.27 Video Solution
Type checking is normally done during lexical analysis syntax analysis syntax directed translation code optimization
admin
asked
in
Compiler Design
Apr 18, 2020
by
admin
585
points
28
views
gate1998
compiler-design
parsing
easy
video-solution
0
votes
0
answers
22
views
GATE1998-26 Video Solution
Consider the following database relations containing the attributes Book_id Subject_Category_of_book Name_of_Author Nationality_of_Author With Book_id as the primary key. What is the highest normal form satisfied by this relation? Suppose the attributes Book_title and ... to {Name_of_Author, Book_title}, what will be the highest normal form satisfied by the relation?
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
22
views
gate1998
databases
database-normalization
normal
video-solution
1
vote
1
answer
42
views
GATE1998-2.19 Video Solution
Which of the following query transformations (i.e., replacing the l.h.s. expression by the r.h.s expression) is incorrect? R1 and R2 are relations, C1 and C2 are selection conditions and A1 and A2 are attributes of R1. A. ... $\pi_{A_1} \left(\sigma_{C_1}\left(R_1\right)\right) \to \sigma_{C_1} \left(\pi_{A_1}\left(R_1\right)\right)$
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
42
views
gate1998
databases
relational-calculus
normal
video-solution
0
votes
0
answers
19
views
GATE1998-1.12 Video Solution
The string $1101$ does not belong to the set represented by $110^*(0 + 1)$ $1(0 + 1)^*101$ $(10)^*(01)^*(00 + 11)^*$ $(00 + (11)^*0)^*$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
19
views
gate1998
theory-of-computation
regular-expressions
easy
video-solution
0
votes
0
answers
22
views
GATE1998-1.32 Video Solution
A computer has six tape drives, with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock free? $6$ $5$ $4$ $3$
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
22
views
gate1998
operating-system
resource-allocation
normal
video-solution
0
votes
0
answers
16
views
GATE1998-2.18, UGCNET-June2012-III-48 Video Solution
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
16
views
gate1998
operating-system
virtual-memory
easy
ugcnetjune2012iii
video-solution
0
votes
0
answers
21
views
GATE1998-2.5 Video Solution
Let $L$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimal state deterministic finite state automaton accepting $L$ is $2$ $5$ $8$ $3$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
21
views
gate1998
theory-of-computation
finite-automata
normal
minimal-state-automata
video-solution
0
votes
0
answers
28
views
GATE1998-1.31 Video Solution
A counting semaphore was initialized to $10$. Then $6 P$ (wait) operations and $4V$ (signal) operations were completed on this semaphore. The resulting value of the semaphore is $0$ $8$ $10$ $12$
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
28
views
gate1998
operating-system
process-synchronization
semaphores
easy
video-solution
0
votes
0
answers
19
views
GATE1998-1.25, ISRO2008-41 Video Solution
In a resident – OS computer, which of the following systems must reside in the main memory under all situations? Assembler Linker Loader Compiler
admin
asked
in
Compiler Design
Apr 18, 2020
by
admin
585
points
19
views
gate1998
compiler-design
runtime-environments
normal
isro2008
video-solution
0
votes
0
answers
17
views
GATE1998-1.23 Video Solution
How many sub strings of different lengths (non-zero) can be formed from a character string of length $n$? $n$ $n^2$ $2^n$ $\frac{n(n+1)}{2}$
admin
asked
in
Combinatory
Apr 18, 2020
by
admin
585
points
17
views
gate1998
combinatory
normal
video-solution
0
votes
0
answers
18
views
GATE1998-1.18 Video Solution
Which of the following devices should get higher priority in assigning interrupts? Hard disk Printer Keyboard Floppy disk
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
18
views
gate1998
operating-system
interrupts
normal
video-solution
0
votes
0
answers
19
views
GATE1998-1.10 Video Solution
Which of the following set can be recognized by a Deterministic Finite state Automaton? The numbers $1, 2, 4, 8, \dots 2^n, \dots$ written in binary The numbers $1, 2, 4, 8,\dots 2^n, \dots$ written in unary The set of binary string in which the number of zeros is the same as the number of ones. The set $\{1, 101, 11011, 1110111, \dots\}$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
19
views
gate1998
theory-of-computation
finite-automata
normal
video-solution
0
votes
0
answers
21
views
GATE1998-19b Video Solution
Compute the post fix equivalent of the following expression $3^*\log(x+1)-\frac{a}{2}$
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
21
views
gate1998
stack
infix-prefix
video-solution
0
votes
0
answers
22
views
GATE1998-1.5 Video Solution
What is the converse of the following assertion? I stay only if you go I stay if you go If I stay then you go If you do not go then I do not stay If I do not stay then you go
admin
asked
in
Mathematical Logic
Apr 18, 2020
by
admin
585
points
22
views
gate1998
mathematical-logic
easy
propositional-logic
video-solution
0
votes
0
answers
17
views
GATE1998-7-b Video Solution
In a computer system where the best-fit' algorithm is used for allocating jobs' to memory partitions', the following situation was encountered:$\begin{array}{|l|l|} \hline \textbf{Partitions size in $KB$} & \textbf{$4K \ 8K \ 20K \ 2K$} \\\hline \textbf{Job sizes in $ ... $} \\\hline \end{array}$When will the $20K$ job complete?
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
17
views
gate1998
operating-system
process-scheduling
normal
video-solution
0
votes
0
answers
27
views
GATE1998-24 Video Solution
Four jobs are waiting to be run. Their expected run times are $6, 3, 5$ and $x.$ In what order should they be run to minimize the average response time? Write a concurrent program using $\text{par begin-par end}$ to represent the precedence graph shown below.
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
27
views
gate1998
operating-system
process-scheduling
descriptive
video-solution
0
votes
0
answers
28
views
GATE1998-1.21, ISRO2008-16 Video Solution
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph? Dynamic programming Backtracking Greedy Divide and Conquer
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
28
views
gate1998
algorithms
graph-algorithms
easy
isro2008
video-solution
0
votes
0
answers
18
views
GATE1998-2.8 Video Solution
Which of the following operations is commutative but not associative? AND OR NAND EXOR
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
18
views
gate1998
digital-logic
easy
boolean-algebra
video-solution
0
votes
0
answers
23
views
GATE1998-2.14 Video Solution
Let $A$ be a two dimensional array declared as follows: A: array [1 …. 10] [1 ….. 15] of integer; Assuming that each integer takes one memory location, the array is stored in row-major order and the first element of the array is stored at location $100$, what is the address of the element $A[i][j]$? $15i+j+84$ $15j+i+84$ $10i+j+89$ $10j+i+89$
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
23
views
gate1998
data-structures
arrays
easy
video-solution
0
votes
0
answers
23
views
GATE1998-1.24 Video Solution
Which of the following statements is false? A tree with a $n$ nodes has $(n – 1)$ edges A labeled rooted binary tree can be uniquely constructed given its postorder and preorder traversal results. A complete binary tree with $n$ internal nodes has $(n + 1)$ leaves. The maximum number of nodes in a binary tree of height h is $2^{h+1} - 1$
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
23
views
gate1998
data-structures
trees
normal
video-solution
0
votes
0
answers
60
views
GATE1998-1.35 Video Solution
There are five records in a database. ... and it contains the values $1, 3, 2, 5$ and $4$. Which one of the fields is the index built from? Age Name Occupation Category
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
60
views
gate1998
databases
indexing
normal
video-solution
0
votes
0
answers
16
views
GATE1998-2.12 Video Solution
What value would the following function return for the input $x=95$? Function fun (x:integer):integer; Begin If x > 100 then fun = x – 10 Else fun = fun(fun (x+11)) End; $89$ $90$ $91$ $92$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
16
views
gate1998
algorithms
recursion
identify-function
normal
video-solution
0
votes
0
answers
21
views
GATE1998-23 Video Solution
Let the attribute ‘$val$’ give the value of a binary number generated by $S$ in the following grammar: $S \rightarrow L.L \mid L$ $L \rightarrow LB \mid B$ $B \rightarrow 0 \mid 1$ For example, an input $101.101$ gives $S.val = 5.625$ Construct a syntax directed translation scheme using only synthesized attributes, to determine $S.val$.
admin
asked
in
Compiler Design
Apr 18, 2020
by
admin
585
points
21
views
gate1998
compiler-design
syntax-directed-translation
normal
descriptive
video-solution
0
votes
0
answers
16
views
GATE1998-2.11 Video Solution
A complete $n$-ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$-ary tree, the number of leaves in it is given by $x(n-1) +1$ $xn-1$ $xn +1$ $x(n+1)$
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
16
views
gate1998
data-structures
trees
normal
video-solution
0
votes
0
answers
27
views
GATE1998-1.20 Video Solution
Which of the following is true? Unless enabled, a CPU will not be able to process interrupts. Loop instructions cannot be interrupted till they complete. A processor checks for interrupts before executing a new instruction. Only level triggered interrupts are possible on microprocessors.
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
27
views
gate1998
co-and-architecture
interrupts
normal
video-solution
0
votes
0
answers
18
views
GATE1998-1.19 Video Solution
Which of the following addressing modes permits relocation without any change whatsoever in the code? Indirect addressing Indexed addressing Base register addressing PC relative addressing
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
18
views
gate1998
co-and-architecture
addressing-modes
easy
video-solution
0
votes
0
answers
19
views
GATE1998-1.6 Video Solution
Suppose $A$ is a finite set with $n$ elements. The number of elements in the largest equivalence relation of A is $n$ $n^2$ $1$ $n+1$
admin
asked
in
Set Theory & Algebra
Apr 18, 2020
by
admin
585
points
19
views
gate1998
set-theory&algebra
relations
easy
video-solution
0
votes
0
answers
18
views
GATE1998-2.15 Video Solution
Faster access to non-local variables is achieved using an array of pointers to activation records called a stack heap display activation tree
admin
asked
in
Compiler Design
Apr 18, 2020
by
admin
585
points
18
views
gate1998
programming
compiler-design
normal
runtime-environments
video-solution
0
votes
0
answers
15
views
GATE1998-1.7 Video Solution
Let $R_1$ and $R_2$ be two equivalence relations on a set. Consider the following assertions: $R_1 \cup R_2$ is an equivalence relation $R_1 \cap R_2$ is an equivalence relation Which of the following is correct? Both assertions are true Assertions (i) is true ... (ii) is not true Assertions (ii) is true but assertions (i) is not true Neither (i) nor (ii) is true
admin
asked
in
Set Theory & Algebra
Apr 18, 2020
by
admin
585
points
15
views
gate1998
set-theory&algebra
relations
normal
video-solution
0
votes
0
answers
16
views
GATE1998-2.16 Video Solution
The overlay tree for a program is as shown below: What will be the size of the partition (in physical memory) required to load (and run) this program? $\text{12 KB}$ $\text{14 KB}$ $\text{10 KB}$ $\text{8 KB}$
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
16
views
gate1998
operating-system
normal
memory-management
overlay
video-solution
0
votes
0
answers
16
views
GATE1998-1.30 Video Solution
When the result of a computation depends on the speed of the processes involved, there is said to be cycle stealing race condition a time lock a deadlock
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
16
views
gate1998
operating-system
easy
process-synchronization
video-solution
0
votes
0
answers
31
views
GATE1998-1.16 Video Solution
In serial communication employing $8$ data bits, a parity bit and $2$ stop bits, the minimum band rate required to sustain a transfer rate of $300$ characters per second is $2400$ band $19200$ band $4800$ band $1200$ band
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
31
views
gate1998
computer-networks
communication
serial-communication
normal
video-solution
0
votes
0
answers
19
views
GATE1998-2-9 Video Solution
Formatting for a floppy disk refers to arranging the data on the disk in contiguous fashion writing the directory erasing the system data writing identification information on all tracks and sectors
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
19
views
gate1998
operating-system
disks
normal
video-solution
0
votes
0
answers
17
views
GATE1998-1.26 Video Solution
Which of the following statements is true? SLR parser is more powerful than LALR LALR parser is more powerful than Canonical LR parser Canonical LR parser is more powerful than LALR parser The parsers SLR, Canonical CR, and LALR have the same power
admin
asked
in
Compiler Design
Apr 18, 2020
by
admin
585
points
17
views
gate1998
compiler-design
parsing
normal
video-solution
0
votes
0
answers
26
views
GATE1998-1.1 Video Solution
A die is rolled three times. The probability that exactly one odd number turns up among the three outcomes is $\dfrac{1}{6}$ $\dfrac{3}{8}$ $\dfrac{1}{8}$ $\dfrac{1}{2}$
admin
asked
in
Probability
Apr 18, 2020
by
admin
585
points
26
views
gate1998
probability
easy
video-solution
0
votes
0
answers
25
views
GATE1998-1.17 Video Solution
The octal representation of an integer is $(342)_8$. If this were to be treated as an eight-bit integer in an $8085$ based computer, its decimal equivalent is $226$ $-98$ $76$ $-30$
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
25
views
gate1998
digital-logic
number-representation
normal
8085
video-solution
0
votes
0
answers
29
views
GATE1998-2.7 Video Solution
The function represented by the Karnaugh map given below is $A.B$ $AB+BC+CA$ $\overline{B \oplus C}$ $A.BC$
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
29
views
gate1998
digital-logic
k-map
normal
video-solution
0
votes
0
answers
18
views
GATE1998-27 Video Solution
Consider the following relational database schemes: COURSES (Cno, Name) PRE_REQ(Cno, Pre_Cno) COMPLETED (Student_no, Cno) COURSES gives the number and name of all the available courses. PRE_REQ gives the information about which courses are pre- ... relational algebra: List all the courses for which a student with Student_no 2310 has completed all the pre-requisites.
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
18
views
gate1998
databases
relational-algebra
normal
video-solution
0
votes
0
answers
28
views
GATE1998-1.13 Video Solution
What happens when a bit-string is XORed with itself $n$-times as shown: $\left[B \oplus (B \oplus ( B \oplus (B \dots n \text{ times}\right]$ complements when $n$ is even complements when $n$ is odd divides by $2^n$ always remains unchanged when $n$ is even
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
28
views
gate1998
digital-logic
normal
boolean-algebra
video-solution
Page:
1
2
3
next »
Ask a Question
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Search GATE CSE Doubts