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
Recent questions tagged gatecse-2002
5
votes
3
answers
1
GATE CSE 2002 | Question: 18-b
The functionality of atomic TEST-AND-SET assembly language instruction is given by the following C function int TEST-AND-SET (int *x) { int y; A1: y=*x; A2: *x=1; A3: return y; } Complete the following C functions for implementing code ... -free? For the above solution, show by an example that mutual exclusion is not ensured if TEST-AND-SET instruction is not atomic?
go_editor
asked
in
Operating System
Feb 28, 2018
by
go_editor
2.3k
views
gatecse-2002
operating-system
process-synchronization
normal
descriptive
17
votes
2
answers
2
GATE CSE 2002 | Question: 5b
Determine whether each of the following is a tautology, a contradiction, or neither ("$\lor$" is disjunction, "$\land$" is conjunction, "$\rightarrow$" is implication, "$\neg$" is negation, and "$\leftrightarrow$" is biconditional ( ... $(A \lor B) \rightarrow B$ $A \land (\neg (A \lor B))$
Arjun
asked
in
Mathematical Logic
Nov 7, 2014
by
Arjun
2.5k
views
gatecse-2002
mathematical-logic
easy
descriptive
propositional-logic
24
votes
1
answer
3
GATE CSE 2002 | Question: 22
Construct all the parse trees corresponding to $i + j * k$ for the grammar $E \rightarrow E+E$ $E \rightarrow E*E$ $E \rightarrow id$ In this grammar, what is the precedence of the two operators $*$ and $+$? If only one parse tree is desired for any string in the same language, what changes are to be made so that the resulting LALR(1) grammar is unambiguous?
Kathleen
asked
in
Compiler Design
Sep 16, 2014
by
Kathleen
2.9k
views
gatecse-2002
compiler-design
parsing
normal
descriptive
22
votes
1
answer
4
GATE CSE 2002 | Question: 21
We require a four state automaton to recognize the regular expression $(a\mid b)^*abb$ Give an NFA for this purpose Give a DFA for this purpose
Kathleen
asked
in
Theory of Computation
Sep 16, 2014
by
Kathleen
3.0k
views
gatecse-2002
theory-of-computation
finite-automata
normal
descriptive
20
votes
3
answers
5
GATE CSE 2002 | Question: 20
The following solution to the single producer single consumer problem uses semaphores for synchronization. #define BUFFSIZE 100 buffer buf[BUFFSIZE]; int first = last = 0; semaphore b_full = 0; semaphore b_empty = BUFFSIZE void producer() { ... immediately after $c1$ and immediately before $c2$ so that the program works correctly for multiple producers and consumers.
Kathleen
asked
in
Operating System
Sep 16, 2014
by
Kathleen
4.7k
views
gatecse-2002
operating-system
process-synchronization
normal
descriptive
33
votes
3
answers
6
GATE CSE 2002 | Question: 19
A computer uses $32-bit$ virtual address, and $32-bit$ physical address. The physical memory is byte addressable, and the page size is $4$ $\text{Kbytes}.$ It is decided to use two level page tables to translate from virtual address ... that can be contained in each page? How many bits are available for storing protection and other information in each page table entry?
Kathleen
asked
in
Operating System
Sep 16, 2014
by
Kathleen
10.7k
views
gatecse-2002
operating-system
virtual-memory
normal
descriptive
15
votes
2
answers
7
GATE CSE 2002 | Question: 18-a
Draw the process state transition diagram of an OS in which (i) each process is in one of the five states: created, ready, running, blocked (i.e., sleep or wait), or terminated, and (ii) only non-preemptive scheduling is used by the OS. Label the transitions appropriately.
Kathleen
asked
in
Operating System
Sep 16, 2014
by
Kathleen
4.9k
views
gatecse-2002
operating-system
process-synchronization
normal
descriptive
31
votes
2
answers
8
GATE CSE 2002 | Question: 17
The following table refers to search items for a key in $B$-trees and $B^+$ ... $(2,11)$ and $(11,6)$ are now inserted into $R.$ What are the additional tuples that are inserted in $V$?
Kathleen
asked
in
Databases
Sep 16, 2014
by
Kathleen
4.3k
views
gatecse-2002
databases
b-tree
normal
descriptive
49
votes
4
answers
9
GATE CSE 2002 | Question: 16
For relation R=(L, M, N, O, P), the following dependencies hold: $ M \rightarrow O,$ $NO \rightarrow P,$ $P \rightarrow L$ and $L \rightarrow MN$ R is decomposed into R1 = (L, M, N, P) and R2 = (M, ... above decomposition dependency-preserving? If not, list all the dependencies that are not preserved. What is the highest normal form satisfied by the above decomposition?
Kathleen
asked
in
Databases
Sep 16, 2014
by
Kathleen
12.3k
views
gatecse-2002
databases
database-normalization
normal
descriptive
28
votes
5
answers
10
GATE CSE 2002 | Question: 15
A university placement center maintains a relational database of companies that interview students on campus and make job offers to those successful in the interview. The schema of the database is given below: ... students were offered jobs, the name of the degree and the average offered salary of students in this degree program.
Kathleen
asked
in
Databases
Sep 16, 2014
by
Kathleen
4.0k
views
gatecse-2002
databases
normal
descriptive
relational-algebra
sql
23
votes
1
answer
11
GATE CSE 2002 | Question: 14
The aim of the following question is to prove that the language $\{M \mid M$ $\text {is the code of the Turing Machine which, irrespective of the input, halts and outputs a}$ $1\}$ ... second step $M$ must make? What key property relates the behaviour of $M$ on $w$ to the behaviour of $M'$ on $x$?
Kathleen
asked
in
Theory of Computation
Sep 16, 2014
by
Kathleen
2.4k
views
gatecse-2002
theory-of-computation
decidability
normal
turing-machine
descriptive
difficult
33
votes
7
answers
12
GATE CSE 2002 | Question: 13
In how many ways can a given positive integer $n \geq 2$ be expressed as the sum of $2$ positive integers (which are not necessarily distinct). For example, for $n=3$, the number of ways is $2$, i.e., $1+2, 2+1$. Give only ... $n \geq k$ be expressed as the sum of $k$ positive integers (which are not necessarily distinct). Give only the answer without explanation.
Kathleen
asked
in
Combinatory
Sep 16, 2014
by
Kathleen
5.1k
views
gatecse-2002
combinatory
normal
descriptive
balls-in-bins
23
votes
3
answers
13
GATE CSE 2002 | Question: 12
Fill in the blanks in the following template of an algorithm to compute all pairs shortest path lengths in a directed graph $G$ with $n*n$ adjacency matrix $A$. $A[i,j]$ equals $1$ if there is an edge in $G$ from $i$ to $j$ ... containing the blanks in the Algorithm step and fill in the blanks. Fill in the blank: The running time of the Algorithm is $O$(___).
Kathleen
asked
in
Algorithms
Sep 16, 2014
by
Kathleen
5.1k
views
gatecse-2002
algorithms
graph-algorithms
time-complexity
normal
descriptive
21
votes
2
answers
14
GATE CSE 2002 | Question: 11
The following recursive function in C is a solution to the Towers of Hanoi problem. void move(int n, char A, char B, char C) { if (......................) { move (.............................); printf("Move disk %d from pole %c to pole %c\n", n, A, C); move (.....................); } } Fill in the dotted parts of the solution.
Kathleen
asked
in
Programming
Sep 16, 2014
by
Kathleen
2.4k
views
gatecse-2002
programming
recursion
descriptive
32
votes
1
answer
15
GATE CSE 2002 | Question: 10
In a C program, an array is declared as $\text{float} \ A[2048]$. Each array element is $4 \ \text{Bytes}$ in size, and the starting address of the array is $0x00000000$. This program is run on a computer that has a direct ... ? Justify your answer briefly. Assume that the data cache is initially empty and that no other data or instruction accesses are to be considered.
Kathleen
asked
in
CO and Architecture
Sep 16, 2014
by
Kathleen
4.7k
views
gatecse-2002
co-and-architecture
cache-memory
normal
descriptive
36
votes
4
answers
16
GATE CSE 2002 | Question: 9
Consider the following $32\text{-bit}$ floating-point representation scheme as shown in the format below. A value is specified by $3$ fields, a one bit sign field (with $0$ for positive and $1$ ... the hexadecimal. What is the largest value that can be represented using this format? Express your answer as the nearest power of $10$.
Kathleen
asked
in
Digital Logic
Sep 16, 2014
by
Kathleen
8.8k
views
gatecse-2002
digital-logic
number-representation
normal
descriptive
12
votes
1
answer
17
GATE CSE 2002 | Question: 8
Consider the following circuit. $A = a_2a_1a_0$ and $B=b_2b_1b_0$ are three bit binary numbers input to the circuit. The output is $Z=z_3z_2z_1z_0$. R0, R1 and R2 are registers with loading clock shown. The registers are loaded with their input data with the falling ... b. What does the circuit implement?
Kathleen
asked
in
Digital Logic
Sep 16, 2014
by
Kathleen
2.3k
views
gatecse-2002
digital-logic
normal
descriptive
digital-counter
28
votes
5
answers
18
GATE CSE 2002 | Question: 7
Express the function $f(x,y,z) = xy' + yz'$ with only one complement operation and one or more AND/OR operations. Draw the logic circuit implementing the expression obtained, using a single NOT gate and one or more AND/OR gates. ... (without expressing its switching function) into an equivalent logic circuit that employs only $6$ NAND gates each with $2$-inputs.
Kathleen
asked
in
Digital Logic
Sep 16, 2014
by
Kathleen
4.9k
views
gatecse-2002
digital-logic
normal
descriptive
digital-circuits
18
votes
1
answer
19
GATE CSE 2002 | Question: 6
Draw all binary trees having exactly three nodes labeled $A, B$ and $C$ on which preorder traversal gives the sequence $C, B, A$.
Kathleen
asked
in
DS
Sep 16, 2014
by
Kathleen
1.8k
views
gatecse-2002
data-structures
binary-tree
easy
descriptive
25
votes
5
answers
20
GATE CSE 2002 | Question: 5a
Obtain the eigen values of the matrix$A=\begin {bmatrix} 1 & 2 & 34 & 49 \\ 0 & 2 & 43 & 94 \\ 0 & 0 & -2 & 104 \\ 0 & 0 & 0 & -1 \end{bmatrix}$
Kathleen
asked
in
Linear Algebra
Sep 16, 2014
by
Kathleen
3.1k
views
gatecse-2002
linear-algebra
eigen-value
normal
descriptive
16
votes
2
answers
21
GATE CSE 2002 | Question: 4
$S=\{(1,2), (2,1)\}$ is binary relation on set $A = \{1,2,3\}$. Is it irreflexive? Add the minimum number of ordered pairs to S to make it an equivalence relation. Give the modified $S$. Let $S=\{a,b\}$ ... the binary relation '$\subseteq$ (set inclusion)' on $\square(S)$. Draw the Hasse diagram corresponding to the lattice ($\square(S), \subseteq$)
Kathleen
asked
in
Set Theory & Algebra
Sep 16, 2014
by
Kathleen
2.2k
views
gatecse-2002
set-theory&algebra
normal
lattice
descriptive
16
votes
5
answers
22
GATE CSE 2002 | Question: 3
Let $A$ be a set of $n(>0)$ elements. Let $N_r$ be the number of binary relations on $A$ and let $N_f$ be the number of functions from $A$ to $A$ Give the expression for $N_r,$ in terms of $n.$ Give the expression for $N_f,$ terms of $n.$ Which is larger for all possible $n,N_r$ or $N_f$
Kathleen
asked
in
Set Theory & Algebra
Sep 16, 2014
by
Kathleen
3.0k
views
gatecse-2002
set-theory&algebra
normal
descriptive
relations
49
votes
6
answers
23
GATE CSE 2002 | Question: 2.25
From the following instance of a relation schema $R(A,B,C)$ ... functionally determine $C$ $B$ does not functionally determine $C$ $A$ does not functionally determine $B$ and $B$ does not functionally determine $C$
Kathleen
asked
in
Databases
Sep 16, 2014
by
Kathleen
12.3k
views
gatecse-2002
databases
database-normalization
43
votes
5
answers
24
GATE CSE 2002 | Question: 2.24
Relation $R$ is decomposed using a set of functional dependencies, $F$, and relation $S$ is decomposed using another set of functional dependencies, $G$. One decomposition is definitely $\text{BCNF}$, the other is definitely $3NF$, but it is ... the closures of $F$ and $G$ are available). Dependency-preservation Lossless-join $\text{BCNF}$ definition $3NF$ definition
Kathleen
asked
in
Databases
Sep 16, 2014
by
Kathleen
8.1k
views
gatecse-2002
databases
database-normalization
easy
39
votes
6
answers
25
GATE CSE 2002 | Question: 2.23, UGCNET-June2012-II: 26
A $B^+$ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are of length $8$ bytes, disk blocks are of size $512$ bytes, and index pointers are of size $4$ bytes. Given the scenario, what ... of the degree (i.e. number of pointers per node) of the $B^+$ - tree? $16$ $42$ $43$ $44$
Kathleen
asked
in
Databases
Sep 16, 2014
by
Kathleen
11.0k
views
gatecse-2002
databases
b-tree
normal
ugcnetcse-june2012-paper2
30
votes
5
answers
26
GATE CSE 2002 | Question: 2.22
In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on the size of the blocks, and the size of the address of the blocks. the number of blocks used for the index, and the size of the blocks. the size of the blocks, the number of blocks used for the index, and the size of the address of the blocks. None of the above
Kathleen
asked
in
Operating System
Sep 16, 2014
by
Kathleen
11.1k
views
gatecse-2002
operating-system
normal
file-system
40
votes
5
answers
27
GATE CSE 2002 | Question: 2.21
Which combination of the following features will suffice to characterize an OS as a multi-programmed OS? More than one program may be loaded into main memory at the same time for execution If a program waits for certain events such as I/O, another program is immediately scheduled ... is immediately scheduled for execution. (a) (a) and (b) (a) and (c) (a), (b) and (c)
Kathleen
asked
in
Operating System
Sep 16, 2014
by
Kathleen
9.3k
views
gatecse-2002
operating-system
normal
process
25
votes
4
answers
28
GATE CSE 2002 | Question: 2.20
Dynamic linking can cause security concerns because Security is dynamic The path for searching dynamic libraries is not known till runtime Linking is insecure Cryptographic procedures are not available for dynamic linking
Kathleen
asked
in
Operating System
Sep 16, 2014
by
Kathleen
5.0k
views
gatecse-2002
operating-system
runtime-environment
easy
26
votes
5
answers
29
GATE CSE 2002 | Question: 2.19
To evaluate an expression without any embedded function calls One stack is enough Two stacks are needed As many stacks as the height of the expression tree are needed A Turing machine is needed in the general case
Kathleen
asked
in
Compiler Design
Sep 16, 2014
by
Kathleen
7.3k
views
gatecse-2002
compiler-design
expression-evaluation
easy
31
votes
3
answers
30
GATE CSE 2002 | Question: 2.18
The C language is: A context free language A context sensitive language A regular language Parsable fully only by a Turing machine
Kathleen
asked
in
Programming
Sep 16, 2014
by
Kathleen
7.6k
views
gatecse-2002
programming
programming-in-c
normal
Page:
1
2
3
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged gatecse-2002
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...