Consider the following sequence of micro-operations 

MBR `leftarrow` PC

MAR `leftarrow` X 

PC `leftarrow` Y 

Memory `leftarrow` MBR

Which one of the following is a possible operation performed by this sequence?  

The number of elements that can be sorted in `Theta`(log n) time using heap sort is 

Consider a hard disk with 16 recording surfaces (0 - 15) having 16384 cylinders (0 - 16383 ) 

and each cylinder contains 64 sectors (0 - 63) . Data storage capacity in each sector is 512 

bytes. Data are organized cylinder - wise and the addressing format is . A file of size 42797 

KB is  stored  in the  disk  and  the  starting  disk location of the file is  <1200,  9,  40>.What  

is the cylinder number of the last sector of the file, if it is stored in a
contiguous manner?  

Consider the following languages  

`L_1` = {`0^p``1^q``0^r` l p,q,r `ge` 0}

`L_2` = {`0^p``1^q``0^r` l p,q,r `ge` 0,p `ne` r}

Which one of the following statements is FALSE? 

Consider the following function  

int unknown ( int n ) {

                int i, j, k = 0;

                for ( i = n / 2; i <= n; i + + )

                      for ( j = 2; j <= n; j = j*2)

                       k = k + n / 2;

                  return (k );

}

The return value of the function is

Consider the DFA given below.

                                                                      1

                                                        1

                                           `rightarrow`         `rightarrow`   

                                                       0.1

Which of the following are FALSE? 

1. Complement of L(A) is context - free 

2. L (A) = L((11* 0 + 0) (0 + 1)* 0*1* ) 

3. For the language accepted by A, A is the minimal DFA 

4. A accepts all strings over {0, 1} of length at least 2 

Consider the following relational schema.  

Students(rollno: integer, sname: string) 

 Courses(courseno: integer, cname: string) 

Registration(rollno: integer, courseno; integer, percent: real) 

Which of the following queries are equivalent to this query in English? 

 "Find the distinct names of all students who score more than 90% in the course numbered
107"

 (I) SELECT DISTINCT S.sname 

FROM Students as S, Registration as R 

WHERE R.rollno=S.rollno AND R.Courseno=107 AND R.percent>90

(II) `pi_(sname)` `(sigma_(courseno)` = 107 ^ Percent > 90 ( Registration    students))

(III) {Tl `exists` S `in` Students, `exists` R `in` Registration (S.roll no = R. roll no ^

        r.courseno = 107 ^ R.percent > 90 ^ T.sname = S. name)}

(iv)  {<`S_n` >l `exists` `S_R` `exists` `R_P` (<`S_R` , `S_N` > `in` Students ^ < `S_R` ,107 , `R_P`> `in`  Registration ^ `R_P` >90)}

A shared  variable x,  initialized to zero,  is  operated  on  by   four concurrent  processes 

W, X, Y, Z as
follows. Each of the processes W and X reads x from memory, increments

 by one, stores it to
memory, and then terminates. Each of the processes Y and Z reads

 x from memory, decrements by
two, stores it  to  memory,  and  then  terminates.  Each 

process  before reading  x  invokes  the P  operation (i.e., wait) on  a counting semaphore 

S and invokes the  V operation (i.e., signal) on the
semaphore S after storing x to memory. 

Semaphore S is initialized to two. What is the maximum
possible value of x after all processes 

complete execution?  

Determine the maximum length of cable (in km) for transmitting data at a rate of 500 Mbps 

in an Ethernet LAN with frames of size 10,000 bits. Assume the signal speed in the cable 

to be 2,00,000 km/s

In an IPv4 datagram, the M bit is 0, the value of HLEN is 10, the value of total length is 400
and the fragment offset value is 300. The position of the datagram, the sequence numbers of
the first and the last bytes of the payload, respectively are 

 (A) Last fragment, 2400 and 2789 

(B) First fragment, 2400 and 2759 

 (C) Last fragment, 2400 and 2759 

(D) Middle fragment, 300 and 689