BARC full Mock-5 for GATE & PSU CS Exams

Question 1

Which of the following operations is performed more efficiently by doubly linked list than by linear linked list?

Question 2

Consider the following C declaration

struct {

short s [5]

union {

float y;

long z;

}u;

} t;

Assume that objects of the type short, float and long occupy 2 bytes, 4 bytes and 8 bytes, respectively. The memory requirement for variable t, ignoring alignment considerations, is

Question 3

Output of following program?

# include <stdio.h>

void fun(int *ptr)

{

*ptr = 30;

}

int main()

{

int y = 20;

fun(&y);

printf("%d", y);

return 0;

}

Question 4

A one-dimensional array A has indices 1....75. Each element is a string and takes up three memory words. The array is stored at location 1120 decimal. The starting address of A[49] is?

Question 5

What is split horizon in routing environment?

Question 6

Which of the following layer is responsible for routing?

Question 7

Which of the following is not a bipartite graph?

Question 8

Suppose all vertices in a graph G have degree k, where k is an odd number. The number of edges in G is

Question 9

Consider the following languages, the one which cannot represent by Pushdown Automata.

Question 10

Identify CFL generated by following CFG

A → aB|C|ε

B → Ad|Cd

C → bD|ε

D → Cc

Question 11

Context free grammar is not closed under?

Question 12

Which of the following CFGs generates a CFL but not regular?

Question 13

In a paging system, it takes 30 ns to search translation Look-a-side Buffer (TLB) and 90 ns to access the main memory. We are using a two- level page table. If the TLB hit ratio is 70%, the effective memory access time is ?

Question 14

How many RAM chips of size (256 K × 1 bit) are required to build 1M byte memory?

Question 15

The process executes the following code and after execution _______ number of child process get created.

fork();

Question 16

Which are two fundamental models of interprocess communication?

1) shared memory

2) message passing.

3) independent

4) cooperating

Question 17

Consider the following schema:
Suppliers (sid: integer, sname: string, address: string)
Parts (pid: integer, pname: string, color: string)
Catalog (sid: integer, pid: integer, cost: real)
The key ﬁelds are underlined, and the domain of each ﬁeld is listed after the ﬁeld name. Therefore sid is the key for Suppliers, pid is the key for Parts, and sid and pid together form the key for Catalog. The Catalog relation lists the prices charged for parts by Suppliers.
Which of the following will result into “Name of all the suppliers Who supplies red part which cost less than 100”?
S1:

S2:

Question 18

Consider the following relations:
Student (snum: integer, sname: string, major: string, level: string, age: integer)
Class (name: string, meets at: string, room: string, ﬁd: integer)
Enrolled (snum: integer, cname: string)
Faculty (ﬁd: integer, fname: string, deptid: integer)
Consider the following SQL statements:
SELECT DISTINCT S.sname
FROM Student S
WHERE S.snum IN
(SELECT E.snum
FROM Enrolled E
GROUP BY E.snum
HAVING COUNT (*) >= ALL (SELECT COUNT (*)
FROM Enrolled E2
GROUP BY E2.snum))
What is the output of the following Query?

Question 19

Consider an ordered file with 1,00,000 records stored on a disk using un-spanned file organization. Block size is 2048 bytes and record length 256 bytes. If primary indexing is used over a field of size 10 bytes and block pointer size is 6 bytes. Then total number of indexes will be:

Question 20

What is the time complexity of job sequencing with deadline algorithm if we use greedy method?

Question 21

Consider a graph G(V, E) such that every vertex of G is connected to every other vertex through direct link. What is the time complexity to compute the shortest path using Bellman Ford algorithm

Question 22

If C is a non-singular matrix and

then:

Question 23

A system of two linear equations in x and y:
px + qy = r
sx + ty = u
Has a unique solution if?

Question 24

Consider a fully associative cache with 8 cache blocks (0-7). The memory block requests are in the order-

4, 3, 25, 8, 19, 6, 25, 8, 16, 35, 45, 22, 8, 3, 16, 25, 7

If LRU replacement policy is used, which cache line will have memory block 7?

Question 25

Consider a memory system with 2 levels operated in strict access mode with h=0.9. Their access times are 5ms and 50ms respectively. Then, The average access time is _____ms.

Question 26

A hard disk has 63 sectors per track, 10 platters each with 2 recording surfaces and 1000 cylinders.

The address of a sector is given as a triple (c, h, s) where c is the cylinder number, h is the surface number and s is the sector number. Thus, the 0th sector is addressed as (0,0,0), the 1st sector as (0,0,1) and so on.

The address of 1039 sector is-

Question 27

Consider the following grammar

P → QR

Q → +P | *R | t | ∈

R → id

In the predictive parser table M of the grammar the entries M[P, $], M[P, id], M[Q, $] and M[Q, id] are respectively.
Note : { } represents blank entry.

Question 28

Which of the following statements is / are false?

S1 : LR(0) grammar and SLR(1) grammar are equivalent

S2 : LR(1) grammar are subset of LALR(1) grammars.

Question 29

The below register represents:

Question 30

How many different states does a 3-bit asynchronous counter have?