Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatecse-2001
7
votes
3
answers
1
GATE CSE 2001 | Question: 21-b
Consider a relation examinee (regno, name, score), where regno is the primary key to score is a real number. Write an SQL query to list the regno of examinees who have a score greater than the average score.
Consider a relation examinee (regno, name, score), where regno is the primary key to score is a real number.Write an SQL query to list the regno of examinees who have a s...
go_editor
2.0k
views
go_editor
asked
Feb 8, 2018
Databases
gatecse-2001
databases
sql
normal
descriptive
+
–
4
votes
1
answer
2
GATE CSE 2001 | Question: 21-c
Consider a relation $\text{examinee (regno, name, score)},$ where regno is the primary key to score is a real number. Suppose the relation $\text{appears (regno, centr_code)}$ specifies the center where an examinee appears. Write an SQL query to list the centr_code having an examinee of score greater than $80.$
Consider a relation $\text{examinee (regno, name, score)},$ where regno is the primary key to score is a real number.Suppose the relation $\text{appears (regno, centr_cod...
go_editor
1.9k
views
go_editor
asked
Feb 8, 2018
Databases
gatecse-2001
databases
sql
normal
descriptive
+
–
21
votes
6
answers
3
ISRO2007-11, GATE CSE 2001 | Question: 1.19
Consider a set of n tasks with known runtimes $r_1, r_2, \dots r_n$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput? Round Robin Shortest job first Highest response ratio next first come first served
Consider a set of n tasks with known runtimes $r_1, r_2, \dots r_n$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will resul...
go_editor
13.0k
views
go_editor
asked
Jun 10, 2016
Operating System
isro2007
operating-system
process-scheduling
gatecse-2001
+
–
8
votes
3
answers
4
GATE CSE 2001 | Question: 22
We wish to construct a $B^+$ tree with fan-out (the number of pointers per node) equal to $3$ for the following set of key values: $80, 50, 10, 70, 30, 100, 90$ Assume that the tree is initially empty and the values are added in the order ... need not be shown. The key values $30$ and $10$ are now deleted from the tree in that order show the tree after each deletion.
We wish to construct a $B^+$ tree with fan-out (the number of pointers per node) equal to $3$ for the following set of key values:$80, 50, 10, 70, 30, 100, 90$Assume that...
Kathleen
4.8k
views
Kathleen
asked
Sep 14, 2014
Databases
gatecse-2001
databases
b-tree
normal
descriptive
+
–
16
votes
2
answers
5
GATE CSE 2001 | Question: 21-a
Consider a relation examinee (regno, name, score), where regno is the primary key to score is a real number. Write a relational algebra using $( \Pi, \sigma, \rho, \times)$ to find the list of names which appear more than once in examinee.
Consider a relation examinee (regno, name, score), where regno is the primary key to score is a real number.Write a relational algebra using $( \Pi, \sigma, \rho, \times)...
Kathleen
3.8k
views
Kathleen
asked
Sep 14, 2014
Databases
gatecse-2001
databases
sql
normal
descriptive
+
–
40
votes
3
answers
6
GATE CSE 2001 | Question: 20
Consider a disk with the $100$ tracks numbered from $0$ to $99$ rotating at $3000$ rpm. The number of sectors per track is $100$ and the time to move the head between two successive tracks is $0.2$ millisecond. Consider a set of disk ... at track $0$ and the elevator algorithm is used to schedule disk requests, what is the worse case time to complete all the requests?
Consider a disk with the $100$ tracks numbered from $0$ to $99$ rotating at $3000$ rpm. The number of sectors per track is $100$ and the time to move the head between two...
Kathleen
10.9k
views
Kathleen
asked
Sep 14, 2014
Operating System
gatecse-2001
operating-system
disk
normal
descriptive
+
–
35
votes
3
answers
7
GATE CSE 2001 | Question: 19
Two concurrent processes $P1$ and $P2$ want to use resources $R1$ and $R2$ in a mutually exclusive manner. Initially, $R1$ and $R2$ ... . Exchange the statements $Q1$ and $Q3$ and statements $Q2$ and $Q4$. Is mutual exclusion guaranteed now? Can deadlock occur?
Two concurrent processes $P1$ and $P2$ want to use resources $R1$ and $R2$ in a mutually exclusive manner. Initially, $R1$ and $R2$ are free. The programs executed by the...
Kathleen
5.5k
views
Kathleen
asked
Sep 14, 2014
Operating System
gatecse-2001
operating-system
resource-allocation
normal
descriptive
+
–
20
votes
2
answers
8
GATE CSE 2001 | Question: 18
Remove left-recursion from the following grammar: $S \rightarrow Sa \mid Sb \mid a \mid b$ Consider the following grammar: $S \rightarrow aSbS\mid bSaS \mid ∊$ Construct all possible parse trees for the string abab. Is the grammar ambiguous?
Remove left-recursion from the following grammar: $S \rightarrow Sa \mid Sb \mid a \mid b$Consider the following grammar: $S \rightarrow aSbS\mid bSaS \mid �...
Kathleen
3.6k
views
Kathleen
asked
Sep 14, 2014
Compiler Design
gatecse-2001
compiler-design
grammar
descriptive
+
–
8
votes
1
answer
9
GATE CSE 2001 | Question: 17
The syntax of the repeat-until statement is given by the following grammar $S \rightarrow\text{ repeat }S_1\text{ until }E$ where E stands for expressions, $S$ and $S_1$ stand for statements. The non-terminals $S$ and $S_1$ have an ... Use the operator '\\' to concatenate two strings and the function gen(s) to generate a line containing the string s.
The syntax of the repeat-until statement is given by the following grammar$S \rightarrow\text{ repeat }S_1\text{ until }E$where E stands for expressions, $S$ and $S_1$ st...
Kathleen
2.1k
views
Kathleen
asked
Sep 14, 2014
Compiler Design
gatecse-2001
compiler-design
syntax-directed-translation
normal
descriptive
+
–
23
votes
2
answers
10
GATE CSE 2001 | Question: 16
Consider the following grammar with terminal alphabet $\Sigma =\{a,(,),+,* \}$ and start symbol $E$. The production rules of the grammar are: $ E \rightarrow aA$ $ E \rightarrow (E)$ $A \rightarrow +E$ $A \rightarrow *E$ $A \rightarrow \epsilon $ Compute the FIRST and FOLLOW sets for $E$ and $A$. Complete the LL(1) parse table for the grammar.
Consider the following grammar with terminal alphabet $\Sigma =\{a,(,),+,* \}$ and start symbol $E$. The production rules of the grammar are:$ E \rightarrow aA$$ E \right...
Kathleen
4.8k
views
Kathleen
asked
Sep 14, 2014
Compiler Design
gatecse-2001
compiler-design
parsing
normal
descriptive
+
–
29
votes
3
answers
11
GATE CSE 2001 | Question: 15
Consider a weighted undirected graph with vertex set $V = \{n1, n2, n3, n4, n5, n6 \}$ ... all possible minimum spanning trees of a graph? Is the maximum among the edge weights of a minimum spanning tree unique over all possible minimum spanning tree of a graph?
Consider a weighted undirected graph with vertex set $V = \{n1, n2, n3, n4, n5, n6 \}$ and edge set $E = \{(n1,n2,2), (n1,n3,8), (n1,n6,3), (n2,n4,4), (n2,n5,12), (n3,n4,...
Kathleen
4.5k
views
Kathleen
asked
Sep 14, 2014
Algorithms
gatecse-2001
algorithms
spanning-tree
normal
descriptive
+
–
33
votes
3
answers
12
GATE CSE 2001 | Question: 14
Insert the following keys one by one into a binary search tree in the order specified.$15, 32, 20, 9, 3, 25, 12, 1$Show the final binary search tree after the insertions. Draw the binary search tree after deleting $15$ from it. Complete the statements $S1$ ... ; x = depth (t -> left); S1: ___________; S2: if (x > y) return __________; S3: else return _______; }
Insert the following keys one by one into a binary search tree in the order specified.$$15, 32, 20, 9, 3, 25, 12, 1$$Show the final binary search tree after the insertion...
Kathleen
6.9k
views
Kathleen
asked
Sep 14, 2014
DS
gatecse-2001
data-structures
binary-search-tree
normal
descriptive
+
–
31
votes
2
answers
13
GATE CSE 2001 | Question: 13
Consider the following C program: void abc(char*s) { if(s[0]=='\0')return; abc(s+1); abc(s+1); printf("%c",s[0]); } main() { abc("123"); } What will be the output of the program? If $abc(s)$ is called ... string $s$ of length $n$ characters (not counting the null ('\0') character), how many characters will be printed by $abc(s)$?
Consider the following C program:void abc(char*s) { if(s[0]=='\0')return; abc(s+1); abc(s+1); printf("%c",s[0]); } main() { abc("123"); }What will be the output of the pr...
Kathleen
11.1k
views
Kathleen
asked
Sep 14, 2014
Programming in C
gatecse-2001
programming
recursion
normal
descriptive
+
–
54
votes
2
answers
14
GATE CSE 2001 | Question: 12
Consider a $5-$stage pipeline - IF (Instruction Fetch), ID (Instruction Decode and register read), EX (Execute), MEM (memory), and WB (Write Back). All (memory or register) reads take place in the second phase of a clock cycle ... Show all data dependencies between the four instructions. Identify the data hazards. Can all hazards be avoided by forwarding in this case.
Consider a $5-$stage pipeline - IF (Instruction Fetch), ID (Instruction Decode and register read), EX (Execute), MEM (memory), and WB (Write Back). All (memory or registe...
Kathleen
18.0k
views
Kathleen
asked
Sep 14, 2014
CO and Architecture
gatecse-2001
co-and-architecture
pipelining
normal
descriptive
+
–
24
votes
2
answers
15
GATE CSE 2001 | Question: 11
A sequential circuit takes an input stream of $0's$ and $1's$ and produces an output stream of $0's$ and $1's.$ Initially it replicates the input on its output until two consecutive $0's$ are encountered on the input. From then ... Give the minimized sum-of-product expression for $\text{J}$ and $\text{K}$ inputs of one of its state flip-flops
A sequential circuit takes an input stream of $0's$ and $1's$ and produces an output stream of $0's$ and $1's.$ Initially it replicates the input on its output until two ...
Kathleen
5.2k
views
Kathleen
asked
Sep 14, 2014
Digital Logic
gatecse-2001
digital-logic
normal
descriptive
flip-flop
+
–
26
votes
6
answers
16
GATE CSE 2001 | Question: 10
Is the $3\text{-variable}$ function $f= \Sigma(0,1,2,4)$ its self-dual? Justify your answer. Give a minimal product-of-sum form of the $b$ output of the following $\text{excess-3}$ to $\text{BCD}$ converter.
Is the $3\text{-variable}$ function $f= \Sigma(0,1,2,4)$ its self-dual? Justify your answer.Give a minimal product-of-sum form of the $b$ output of the following $\text{e...
Kathleen
4.1k
views
Kathleen
asked
Sep 14, 2014
Digital Logic
gatecse-2001
digital-logic
normal
descriptive
min-sum-of-products-form
+
–
29
votes
2
answers
17
GATE CSE 2001 | Question: 9
A CPU has $32-bit$ memory address and a $256 \ KB$ cache memory. The cache is organized as a $4-way$ set associative cache with cache block size of $16$ bytes. What is the number of sets in the cache? What is the size (in bits) of ... are required to find the byte offset within a cache block? What is the total amount of extra memory (in bytes) required for the tag bits?
A CPU has $32-bit$ memory address and a $256 \ KB$ cache memory. The cache is organized as a $4-way$ set associative cache with cache block size of $16$ bytes.What is the...
Kathleen
13.1k
views
Kathleen
asked
Sep 14, 2014
CO and Architecture
gatecse-2001
co-and-architecture
cache-memory
normal
descriptive
+
–
44
votes
3
answers
18
GATE CSE 2001 | Question: 8
Consider a disk with the following specifications: 20 surfaces, 1000 tracks/surface, 16 sectors/track, data density 1 KB/sector, rotation speed 3000 rpm. The operating system initiates the transfer between the disk and the memory sector-wise. Once the head ... What is the maximum percentage of time the CPU is held up for this disk I/O for cycle-stealing DMA transfer?
Consider a disk with the following specifications: 20 surfaces, 1000 tracks/surface, 16 sectors/track, data density 1 KB/sector, rotation speed 3000 rpm. The operating sy...
Kathleen
10.1k
views
Kathleen
asked
Sep 14, 2014
Operating System
gatecse-2001
operating-system
disk
normal
descriptive
+
–
32
votes
3
answers
19
GATE CSE 2001 | Question: 7
Let a decision problem $X$ be defined as follows: $X$: Given a Turing machine $M$ over $\Sigma$ and any word $w \in \Sigma$, does $M$ loop forever on $w$? You may assume that the halting problem of Turing machine is undecidable but partially decidable. Show that $X$ is undecidable Show that $X$ is not even partially decidable
Let a decision problem $X$ be defined as follows:$X$: Given a Turing machine $M$ over $\Sigma$ and any word $w \in \Sigma$, does $M$ loop forever on $w$?You may assume th...
Kathleen
4.6k
views
Kathleen
asked
Sep 14, 2014
Theory of Computation
gatecse-2001
theory-of-computation
decidability
turing-machine
easy
descriptive
+
–
18
votes
2
answers
20
GATE CSE 2001 | Question: 6
Give a deterministic PDA for the language $L=\{a^ncb^{2n} \mid n \geq 1\}$ over the alphabet $\Sigma = \{a,b,c\}$. Specify the acceptance state.
Give a deterministic PDA for the language $L=\{a^ncb^{2n} \mid n \geq 1\}$ over the alphabet $\Sigma = \{a,b,c\}$. Specify the acceptance state.
Kathleen
5.1k
views
Kathleen
asked
Sep 14, 2014
Theory of Computation
gatecse-2001
theory-of-computation
normal
pushdown-automata
descriptive
+
–
36
votes
2
answers
21
GATE CSE 2001 | Question: 5
Construct DFA's for the following languages: $L=\left\{w \mid w \in \{a,b\}^*, \text{ w has baab as a substring } \right\}$ $L=\left\{w \mid w \in \{a,b\}^*, \text{ w has an odd number of a's and an odd number of b's } \right\} $
Construct DFA's for the following languages:$L=\left\{w \mid w \in \{a,b\}^*, \text{ w has baab as a substring } \right\}$$L=\left\{w \mid w \in \{a,b\}^*, \text{ w has ...
Kathleen
5.3k
views
Kathleen
asked
Sep 14, 2014
Theory of Computation
gatecse-2001
theory-of-computation
easy
descriptive
finite-automata
normal
+
–
15
votes
4
answers
22
GATE CSE 2001 | Question: 4
Consider the function $h: N \times N \rightarrow N$ so that $h(a,b) = (2a +1)2^b - 1$, where $N=\{0,1,2,3,\dots\}$ is the set of natural numbers. Prove that the function $h$ is an injection (one-one). Prove that it is also a Surjection (onto)
Consider the function $h: N \times N \rightarrow N$ so that $h(a,b) = (2a +1)2^b - 1$, where $N=\{0,1,2,3,\dots\}$ is the set of natural numbers.Prove that the function $...
Kathleen
3.2k
views
Kathleen
asked
Sep 14, 2014
Set Theory & Algebra
gatecse-2001
functions
set-theory&algebra
normal
descriptive
+
–
11
votes
2
answers
23
GATE CSE 2001 | Question: 3
Prove that powerset $(A \cap B) = \text{powerset}(A) \cap \text{powerset}(B)$ Let $\text{sum} (n) = 0 + 1 + 2 + ..... + n$ for all natural numbers n. Give an induction proof to show that the following equation is true for all natural numbers $m$ and $n$: $\text{sum}(m+n) = \text{sum}(m) + \text{sum}(n) + mn$
Prove that powerset $(A \cap B) = \text{powerset}(A) \cap \text{powerset}(B)$Let $\text{sum} (n) = 0 + 1 + 2 + ..... + n$ for all natural numbers n. Give an induction pro...
Kathleen
2.2k
views
Kathleen
asked
Sep 14, 2014
Set Theory & Algebra
gatecse-2001
set-theory&algebra
normal
set-theory
descriptive
+
–
61
votes
5
answers
24
GATE CSE 2001 | Question: 2.25
Consider a relation geq which represents "greater than or equal to", that is, $(x,y) \in $ geq only if $y \geq x$. create table geq ( ib integer not null, ub integer not null, primary key ib, foreign key (ub) references geq on delete cascade ); Which ... (z,w) with z > x is deleted A tuple (z,w) with w < x is deleted The deletion of (x,y) is prohibited
Consider a relation geq which represents "greater than or equal to", that is, $(x,y) \in $ geq only if $y \geq x$.create table geq ( ib integer not null, ub integer not n...
Kathleen
10.7k
views
Kathleen
asked
Sep 14, 2014
Databases
gatecse-2001
databases
sql
normal
+
–
46
votes
6
answers
25
GATE CSE 2001 | Question: 2.24
Which of the following relational calculus expression is not safe? $\left\{t \mid \exists u \in R_1\left(t[A] = u[A]\right) \land \neg \exists s \in R_2 \left(t[A] = s[A]\right)\right\}$ ...
Which of the following relational calculus expression is not safe?$\left\{t \mid \exists u \in R_1\left(t[A] = u[A]\right) \land \neg \exists s \in R_2 \left(t[A] = s[A]\...
Kathleen
8.7k
views
Kathleen
asked
Sep 14, 2014
Databases
gatecse-2001
relational-calculus
normal
databases
+
–
128
votes
6
answers
26
GATE CSE 2001 | Question: 2.23
$R(A,B,C,D)$ is a relation. Which of the following does not have a lossless join, dependency preserving $BCNF$ decomposition? $A \rightarrow B, B \rightarrow CD$ $A \rightarrow B, B \rightarrow C, C \rightarrow D$ $ AB \rightarrow C, C \rightarrow AD$ $A \rightarrow BCD$
$R(A,B,C,D)$ is a relation. Which of the following does not have a lossless join, dependency preserving $BCNF$ decomposition?$A \rightarrow B, B \rightarrow CD$$A \righta...
Kathleen
52.1k
views
Kathleen
asked
Sep 14, 2014
Databases
gatecse-2001
databases
database-normalization
normal
+
–
59
votes
5
answers
27
GATE CSE 2001 | Question: 2.22
Consider Peterson's algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below. repeat flag[i] = true; turn = j; while (P) do no-op; Enter critical section, perform actions, then exit critical section Flag[i] = ... i flag[j] = true and turn = j flag[i] = true and turn = j flag[i] = true and turn = i
Consider Peterson's algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below.repeat flag[i] = true; turn = ...
Kathleen
27.0k
views
Kathleen
asked
Sep 14, 2014
Operating System
gatecse-2001
operating-system
process-synchronization
normal
+
–
49
votes
4
answers
28
GATE CSE 2001 | Question: 2.21
Consider a machine with $64$ MB physical memory and a $32$-bit virtual address space. If the page size s $4$ KB, what is the approximate size of the page table? $\text{16 MB}$ $\text{8 MB}$ $\text{2 MB}$ $\text{24 MB}$
Consider a machine with $64$ MB physical memory and a $32$-bit virtual address space. If the page size s $4$ KB, what is the approximate size of the page table?$\text{16 ...
Kathleen
66.2k
views
Kathleen
asked
Sep 14, 2014
Operating System
gatecse-2001
operating-system
virtual-memory
normal
+
–
59
votes
4
answers
29
GATE CSE 2001 | Question: 2.20
Which of the following does not interrupt a running process? A device Timer Scheduler process Power failure
Which of the following does not interrupt a running process?A deviceTimerScheduler processPower failure
Kathleen
24.5k
views
Kathleen
asked
Sep 14, 2014
Operating System
gatecse-2001
operating-system
easy
process
+
–
11
votes
2
answers
30
GATE CSE 2001 | Question: 2.19
Consider the following program Program P2 var n : int; procedure W(var x : int) begin x = x + 1; print x; end procedure D begin var n : int; n = 3; W(n); end begin \\begin P2 n=10; D; end If the language has dynamic scooping and parameters are passed by reference, what will be printed by the program? 10 11 3 None of the above
Consider the following programProgram P2 var n : int; procedure W(var x : int) begin x = x + 1; print x; end procedure D begin var n : int; n = 3; W(n); end begin \\begin...
Kathleen
7.4k
views
Kathleen
asked
Sep 14, 2014
Programming in C
gatecse-2001
programming
parameter-passing
normal
out-of-syllabus-now
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register