Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gate1998
26
26 votes
4
answers
4 answers
9.3k
9.3k views
GATE CSE 1998 | Question: 10b
Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m <...
Arjun
9.3k
views
asked
Aug 12, 2018
Set Theory & Algebra
gate1998
descriptive
set-theory&algebra
relations
+
–
26
26 votes
3
answers
3 answers
10.3k
10.3k views
GATE CSE 1998 | Question: 6a
Solve the following recurrence relation$x_n = 2x_{n-1}-1, n>1$$x_1=2$
Arjun
10.3k
views
asked
May 3, 2016
Algorithms
gate1998
algorithms
recurrence-relation
descriptive
+
–
16
16 votes
6
6 answers
5.7k
5.7k views
GATE CSE 1998 | Question: 25b
Consider a disk with $c$ cylinders, $t$ tracks per cylinder, $s$ sectors per track and a sector length $s_l$. A logical file $d_l$ with fixed record length $r_l$ is stor...
Arjun
5.7k
views
asked
Mar 6, 2016
Operating System
gate1998
operating-system
disk
descriptive
+
–
55
55 votes
9
answers
9 answers
23.7k
23.7k views
GATE CSE 1998 | Question: 19b
Compute the post fix equivalent of the following expression $3^*\log(x+1)-\frac{a}{2}$
Arjun
23.7k
views
asked
Aug 29, 2015
Data Structures
gate1998
stack
infix-prefix
descriptive
+
–
65
65 votes
10
answers
10 answers
24.5k
24.5k views
GATE CSE 1998 | Question: 7-b
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|} \...
Arjun
24.5k
views
asked
Jul 10, 2015
Operating System
gate1998
operating-system
process-scheduling
normal
+
–
50
50 votes
8
answers
8 answers
16.3k
16.3k views
GATE CSE 1998 | Question: 3b
Give a regular expression for the set of binary strings where every $0$ is immediately followed by exactly $k$ $1$'s and preceded by at least $k$ $1$’s ($k$ is a fixed i...
Arjun
16.3k
views
asked
Oct 17, 2014
Theory of Computation
gate1998
theory-of-computation
regular-expression
easy
descriptive
+
–
41
41 votes
10
answers
10 answers
16.4k
16.4k views
GATE CSE 1998 | Question: 27
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 availab...
Kathleen
16.4k
views
asked
Sep 26, 2014
Databases
gate1998
databases
relational-algebra
normal
descriptive
+
–
67
67 votes
6
answers
6 answers
30.3k
30.3k views
GATE CSE 1998 | Question: 26
Consider the following database relations containing the attributesBook_idSubject_Category_of_bookName_of_AuthorNationality_of_AuthorWith Book_id as the primary key.What ...
Kathleen
30.3k
views
asked
Sep 26, 2014
Databases
gate1998
databases
database-normalization
normal
descriptive
+
–
35
35 votes
4
answers
4 answers
9.7k
9.7k views
GATE CSE 1998 | Question: 25-a
Free disk space can be used to keep track of using a free list or a bit map. Disk addresses require $d$ bits. For a disk with $B$ blocks, $F$ of which are free, state the...
Kathleen
9.7k
views
asked
Sep 26, 2014
Operating System
gate1998
operating-system
disk
descriptive
+
–
52
52 votes
5
answers
5 answers
19.1k
19.1k views
GATE CSE 1998 | Question: 24
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...
Kathleen
19.1k
views
asked
Sep 26, 2014
Operating System
gate1998
operating-system
process-scheduling
descriptive
+
–
27
27 votes
1
answers
1 answer
15.1k
15.1k views
GATE CSE 1998 | Question: 23
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 ...
Kathleen
15.1k
views
asked
Sep 26, 2014
Compiler Design
gate1998
compiler-design
syntax-directed-translation
normal
descriptive
+
–
29
29 votes
2
answers
2 answers
6.3k
6.3k views
GATE CSE 1998 | Question: 22
An identifier in a programming language consists of up to six letters and digits of which the first character must be a letter. Derive a regular expression for the identi...
Kathleen
6.3k
views
asked
Sep 26, 2014
Compiler Design
gate1998
compiler-design
parsing
descriptive
+
–
32
32 votes
1
answers
1 answer
7.2k
7.2k views
GATE CSE 1998 | Question: 21
Derive a recurrence relation for the size of the smallest AVL tree with height $h$.What is the size of the smallest AVL tree with height $8$?
Kathleen
7.2k
views
asked
Sep 26, 2014
Data Structures
gate1998
data-structures
avl-tree
descriptive
numerical-answers
+
–
31
31 votes
2
answers
2 answers
7.1k
7.1k views
GATE CSE 1998 | Question: 20
Draw the binary tree with node labels $\text{a, b, c, d, e, f and g}$ for which the inorder and postorder traversals result in the following sequences:Inorder: $\text{a f...
Kathleen
7.1k
views
asked
Sep 26, 2014
Data Structures
gate1998
data-structures
binary-tree
descriptive
+
–
38
38 votes
5
answers
5 answers
11.6k
11.6k views
GATE CSE 1998 | Question: 19a
Let $p$ be a pointer as shown in the figure in a single linked list. What do the following assignment state...
Kathleen
11.6k
views
asked
Sep 26, 2014
Data Structures
gate1998
data-structures
linked-list
normal
descriptive
+
–
45
45 votes
7
7 answers
27.3k
27.3k views
GATE CSE 1998 | Question: 18
For a set-associative Cache organization, the parameters are as follows:$$\begin{array}{|c|l|} \hline \text {$t _c$} & \text{Cache Access Time }\\\hline \text{$t _m$} &...
Kathleen
27.3k
views
asked
Sep 26, 2014
CO & Architecture
gate1998
co-and-architecture
cache-memory
descriptive
+
–
4
4 votes
1
1 answer
4.5k
4.5k views
GATE CSE 1998 | Question: 17
Calculate the total time required to read 35 sectors on a 2-sided floppy disk. Assume that each track has 8 sectors and the track-to-track step time is 8 milliseconds. Th...
Kathleen
4.5k
views
asked
Sep 26, 2014
Operating System
gate1998
operating-system
disk
normal
numerical-answers
out-of-gatecse-syllabus
+
–
27
27 votes
3
answers
3 answers
9.3k
9.3k views
GATE CSE 1998 | Question: 16
Design a synchronous counter to go through the following states:$$1, 4, 2, 3, 1, 4, 2, 3, 1, 4 \dots $$
Kathleen
9.3k
views
asked
Sep 26, 2014
Digital Logic
gate1998
digital-logic
normal
descriptive
synchronous-asynchronous-circuits
+
–
0
0 votes
0
0 answers
853
853 views
GATE CSE 1998 | Question: 15
Kathleen
853
views
asked
Sep 26, 2014
CO & Architecture
gate1998
co-and-architecture
8085-microprocessor
descriptive
out-of-gatecse-syllabus
+
–
17
17 votes
4
answers
4 answers
8.2k
8.2k views
GATE CSE 1998 | Question: 14
Let $G_1 = (N, T, P, S_1)$ be a CFG where, $N=\{S_1, A, B\},T=\{a, b\}$ and $P$ is given by$$\begin{array}{l|l}S_1 \rightarrow a S_1 b &S_1 \rightarrow a B b \\S_1 \right...
Kathleen
8.2k
views
asked
Sep 26, 2014
Compiler Design
gate1998
compiler-design
grammar
descriptive
+
–
39
39 votes
1
answers
1 answer
11.2k
11.2k views
GATE CSE 1998 | Question: 13
Let $M=(\{q_0, q_1\}, \{0, 1\}, \{z_0, X\}, \delta, q_0, z_0, \phi)$ be a Pushdown automation where $\delta$ is given by$\delta(q_0, 1, z_0) = \{(q_0, Xz_0)\}$$\delta(q_0...
Kathleen
11.2k
views
asked
Sep 26, 2014
Theory of Computation
gate1998
theory-of-computation
pushdown-automata
descriptive
+
–
44
44 votes
5
answers
5 answers
11.2k
11.2k views
GATE CSE 1998 | Question: 12
Let $(A, *)$ be a semigroup, Furthermore, for every $a$ and $b$ in $A$, if $a \neq b$, then $a*b \neq b*a$.Show that for every $a$ in $A$, $a*a=a$Show that for every $a$,...
Kathleen
11.2k
views
asked
Sep 26, 2014
Set Theory & Algebra
gate1998
set-theory&algebra
group-theory
descriptive
+
–
38
38 votes
3
answers
3 answers
18.5k
18.5k views
GATE CSE 1998 | Question: 11
Suppose $A = \{a, b, c, d\}$ and $\Pi_1$ is the following partition of A$\Pi_1 = \left\{\left\{a, b, c\right\}\left\{d\right\}\right\}$List the ordered pairs of the equiv...
Kathleen
18.5k
views
asked
Sep 26, 2014
Set Theory & Algebra
gate1998
set-theory&algebra
normal
partial-order
descriptive
+
–
26
26 votes
6
answers
6 answers
7.1k
7.1k views
GATE CSE 1998 | Question: 10a
Prove by induction that the expression for the number of diagonals in a polygon of $n$ sides is $\frac{n(n-3)}{2}$
Kathleen
7.1k
views
asked
Sep 26, 2014
Set Theory & Algebra
gate1998
set-theory&algebra
descriptive
relations
+
–
11
11 votes
2
answers
2 answers
6.1k
6.1k views
GATE CSE 1998 | Question: 9
Derive the expressions for the number of operations required to solve a system of linear equations in $n$ unknowns using the Gaussian Elimination Method. Assume that one ...
Kathleen
6.1k
views
asked
Sep 26, 2014
Linear Algebra
gate1998
linear-algebra
system-of-equations
descriptive
+
–
27
27 votes
2
answers
2 answers
7.7k
7.7k views
GATE CSE 1998 | Question: 8
Find the points of local maxima and minima, if any, of the following function defined in $0\leq x\leq 6$. $$x^3-6x^2+9x+15$$Integrate $$\int_{-\pi}^{\pi} x \cos x dx$$
Kathleen
7.7k
views
asked
Sep 26, 2014
Calculus
gate1998
calculus
maxima-minima
integration
normal
descriptive
+
–
32
32 votes
9
answers
9 answers
10.1k
10.1k views
GATE CSE 1998 | Question: 7-a
Suppose we have a database consisting of the following three relations.$\text{FREQUENTS (student, parlor)}$ giving the parlors each student visits.$\text{SERVES (parlor, ...
Kathleen
10.1k
views
asked
Sep 26, 2014
Databases
gate1998
databases
sql
descriptive
+
–
32
32 votes
3
answers
3 answers
11.3k
11.3k views
GATE CSE 1998 | Question: 6b
Consider the grammarS $\rightarrow Aa \mid b$A $\rightarrow Ac \mid Sd \mid \epsilon$Construct an equivalent grammar with no left recursion and with minimum number of pr...
Kathleen
11.3k
views
asked
Sep 25, 2014
Compiler Design
gate1998
compiler-design
grammar
descriptive
+
–
27
27 votes
3
answers
3 answers
6.8k
6.8k views
GATE CSE 1998 | Question: 5
The implication gate, shown below has two inputs ($x \text{ and }y)$; the output is 1 except when $x =1 \text{ and } y=0\text{, realize }f=\bar{x}y+x\bar{y}$ using only f...
Kathleen
6.8k
views
asked
Sep 25, 2014
Digital Logic
gate1998
digital-logic
functional-completeness
descriptive
+
–
53
53 votes
4
answers
4 answers
18.1k
18.1k views
GATE CSE 1998 | Question: 4
Design a deterministic finite state automaton (using minimum number of states) that recognizes the following language:$L=\{w \in \{0, 1\}^* \mid w$ interpreted as binar...
Kathleen
18.1k
views
asked
Sep 25, 2014
Theory of Computation
gate1998
theory-of-computation
finite-automata
normal
minimal-state-automata
descriptive
+
–
Page:
1
2
3
next »