GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

661.

Assume the following C variable declaration
int * A[10], B[10][10];
Of the following expressions
I. A[2]
II. A[2][3]
III. B[1]
IV. B[2][3]
which will not give compile-time errors if used as left hand sides of assignment
statements in a C program? [1 mark]
(A) I,II, and IV only
(B) II, III, and IV only
(C) II and IV only
(D) IV only

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
662.

Consider the following C function.
float f,(float x, int y) {
float p, s; int i;
for (s=1,p=1,i=1; i<y; i++) {
p *= x/i;
s+=p;
}
return s;
}
For large values of y, the return value of the function f best approximates [1 mark]
(A) X^y
(B) e^x
(C) ln(1+x)
(D) X^X

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
663.

We require a four state automaton to recognize the regular expression (a b) * abb.
(a) Give an NFA for this purpose.
(b) Give a DFA for this purpose.
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
664.

(a) Construct all the parse trees corresponding to i + j * k for the grammar
E -> E+E
E -> E*E
E -> id
(b) In this grammar, what is the precedence of the two operators * and +?
(c) 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 nonambiguous?
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
665.

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) {
produce an item;
p1: …………………..;
put the item into buff (first);
first=(first+1)%BUFFSIZE;
p2: …………………..;
}
}
void consumer()
{
while (1) {
c1:……………………..
take the item from buf[last];
last=(last+1)%BUFFSIZE;
c2: ……………………..;
consume the item;
}
}
(a) Complete the dotted part of the above solution.
(b) Using another semaphore variable, insert one line statement each immediately after p1, immediately before p2, immediately after c1, and immediately before c2 so that the program works correctly for multiple procedures and consumers.
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
666.

(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.
(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;
}
(i) Complete the following C functions for implementing code for entering and
leaving critical sections based on the above TEST-AND-SET instruction.
int mutex=0;
void enter-cs()
{
while (…………………………………);
}
void leave-cs()
{
…………………………………..;
}
(ii) Is the above solution to the critical section problem deadlock free and starvation-free?
(iii) For the above solution, show by an example that mutual exclusion is not ensured if TEST-AND-SET instruction is not atomic.
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]

801 1 ...‹‹109 110111 112 113 ›› ... 134

High Frequency Word List with Mnemonics

GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).

Check Now