Recent questions tagged gate2002

+4 votes

3 answers

1

My doubt of security concern while using Dynamic linking
"Dynamic linking can cause security concerns as till run time path for searching dynamic library is not known." Can someone explain this in his own and simple words?

asked Mar 28, 2018 in Operating System by Akash Kumar Roy Junior (547 points) | 122 views

+2 votes

2 answers

2

GATE2002-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 for ... starvation-free? For the above solution, show by an example that mutual exclusion is not ensured if TEST-AND-SET instruction is not atomic?

asked Feb 28, 2018 in Operating System by jothee Veteran (115k points) | 392 views

+4 votes

0 answers

3

UGCNET-June2015-III-12
In the indexed scheme of blocks to a file, the maximum possible size of the file depends on: The number of blocks used for index and the size of index Size of Blocks and size of Address Size of index Size of block

asked Jul 31, 2016 in Operating System by jothee Veteran (115k points) | 471 views

+13 votes

2 answers

4

GATE2002-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 (if and only if). $A \leftrightarrow (A \lor A)$ $(A \lor B) \rightarrow B$ $A \land (\neg (A \lor B))$

asked Nov 7, 2014 in Mathematical Logic by Arjun Veteran (395k points) | 827 views

+16 votes

1 answer

5

GATE2002-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?

asked Sep 16, 2014 in Compiler Design by Kathleen Veteran (59.8k points) | 725 views

+18 votes

1 answer

6

GATE2002-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

asked Sep 16, 2014 in Theory of Computation by Kathleen Veteran (59.8k points) | 720 views

+17 votes

2 answers

7

GATE2002-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() { while(1) { ... $c1$ and immediately before $c2$ so that the program works correctly for multiple producers and consumers.

asked Sep 16, 2014 in Operating System by Kathleen Veteran (59.8k points) | 1.5k views

+21 votes

3 answers

8

GATE2002-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 to ... entries that can be contained in each page? How many bits are available for storing protection and other information in each page table entry?

asked Sep 16, 2014 in Operating System by Kathleen Veteran (59.8k points) | 3.3k views

+15 votes

2 answers

9

GATE2002-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.

asked Sep 16, 2014 in Operating System by Kathleen Veteran (59.8k points) | 1.4k views

+18 votes

2 answers

10

GATE2002-17
The following table refers to search items for a key in $B$-trees and $B^+$ trees. B−tree B+−tree Successful search Unsuccessful search Successful search Unsuccessful search X1 X2 X3 X4 A successful search means that the key exists in the database and unsuccessful means that ... The tuples (2,11) and (11,6) are now inserted into R. What are the additional tuples that are inserted in V?

asked Sep 16, 2014 in Databases by Kathleen Veteran (59.8k points) | 1.6k views

+25 votes

3 answers

11

GATE2002-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, O). Is ... Is the 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?

asked Sep 16, 2014 in Databases by Kathleen Veteran (59.8k points) | 2.5k views

+14 votes

3 answers

12

GATE2002-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: ... $five$ students were offered jobs, the name of the degree and the average offered salary of students in this degree program.

asked Sep 16, 2014 in Databases by Kathleen Veteran (59.8k points) | 1.2k views

+14 votes

1 answer

13

GATE2002-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\}$ ... is the second step $M$ must make? What key property relates the behaviour of $M$ on $w$ to the behaviour of $M'$ on $x$?

asked Sep 16, 2014 in Theory of Computation by Kathleen Veteran (59.8k points) | 895 views

+16 votes

3 answers

14

GATE2002-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 the answer ... integer $n \geq k$ be expressed as the sum of $k$ positive integers (which are not necessarily distinct). Give only the answer without explanation.

asked Sep 16, 2014 in Combinatory by Kathleen Veteran (59.8k points) | 985 views

+17 votes

3 answers

15

GATE2002-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$, and $0$ otherwise. ... line containing the blanks in the Algorithm step and fill in the blanks. Fill in the blank: The running time of the Algorithm is $O$(___).

asked Sep 16, 2014 in Algorithms by Kathleen Veteran (59.8k points) | 1.2k views

+13 votes

2 answers

16

GATE2002-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.

asked Sep 16, 2014 in Programming by Kathleen Veteran (59.8k points) | 972 views

+20 votes

1 answer

17

GATE2002-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 mapped ... occur? Justify your answer briefly. Assume that the data cache is initially empty and that no other data or instruction accesses are to be considered.

asked Sep 16, 2014 in CO & Architecture by Kathleen Veteran (59.8k points) | 1.4k views

+19 votes

3 answers

18

GATE2002-9
Consider the following $32-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$ for negative values), a $24 bit$ fraction field (with the ... the hexadecimal. What is the largest value that can be represented using this format? Express your answer as the nearest power of $10$.

asked Sep 16, 2014 in Digital Logic by Kathleen Veteran (59.8k points) | 2.8k views

+5 votes

0 answers

19

GATE2002-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 edge of a clock ... 000 B= 101 101 011 110 000 000 000 000 Clock No 1 2 3 4 5 6 7 8 b. What does the circuit implement?

asked Sep 16, 2014 in Digital Logic by Kathleen Veteran (59.8k points) | 524 views

+17 votes

4 answers

20

GATE2002-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. Transform the ... circuit (without expressing its switching function) into an equivalent logic circuit that employs only $6$ NAND gates each with $2$-inputs.

asked Sep 16, 2014 in Digital Logic by Kathleen Veteran (59.8k points) | 1.6k views

+14 votes

2 answers

21

GATE2002-6
Draw all binary trees having exactly three nodes labeled $A, B$ and $C$ on which preorder traversal gives the sequence $C, B, A$.

asked Sep 16, 2014 in DS by Kathleen Veteran (59.8k points) | 533 views

+17 votes

4 answers

22

GATE2002-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}$

asked Sep 16, 2014 in Linear Algebra by Kathleen Veteran (59.8k points) | 770 views

+12 votes

2 answers

23

GATE2002-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\}$ and let $\square(S)$ be the ... . Consider the binary relation '$\subseteq$ (set inclusion)' on $\square(S)$. Draw the Hasse diagram corresponding to the lattice ($\square(S), \subseteq$)

asked Sep 16, 2014 in Set Theory & Algebra by Kathleen Veteran (59.8k points) | 854 views

+11 votes

2 answers

24

GATE2002-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$

asked Sep 16, 2014 in Set Theory & Algebra by Kathleen Veteran (59.8k points) | 669 views

+25 votes

6 answers

25

GATE2002-2.25
From the following instance of a relation schema $R(A,B,C)$ ... not functionally determine $C$ $B$ does not functionally determine $C$ $A$ does not functionally determine $B$ and $B$ does not functionally determine $C$

asked Sep 16, 2014 in Databases by Kathleen Veteran (59.8k points) | 2.8k views

+25 votes

5 answers

26

GATE2002-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 not known ... that the closures of $F$ and $G$ are available). Dependency-preservation Lossless-join $\text{BCNF}$ definition $3NF$ definition

asked Sep 16, 2014 in Databases by Kathleen Veteran (59.8k points) | 2.5k views

+20 votes

3 answers

27

GATE2002-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 would be the best choice of the degree (i.e. number of pointers per node) of the $B^+$ - tree? $16$ $42$ $43$ $44$

asked Sep 16, 2014 in Databases by Kathleen Veteran (59.8k points) | 3.7k views

+18 votes

5 answers

28

GATE2002-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

asked Sep 16, 2014 in Databases by Kathleen Veteran (59.8k points) | 3.7k views

+27 votes

4 answers

29

GATE2002-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 for ... program is immediately scheduled for execution. (a) (a) and (b) (a) and (c) (a), (b) and (c)

asked Sep 16, 2014 in Operating System by Kathleen Veteran (59.8k points) | 2.9k views

+20 votes

3 answers

30

GATE2002-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

asked Sep 16, 2014 in Operating System by Kathleen Veteran (59.8k points) | 1.7k views

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 questions tagged gate2002

Recent Posts

Recent Blog Comments