BARC full Mock-15 for GATE & PSU CS Exams

Question 1

When does method overloading is determined?

Question 2

What is the process of defining more than one method in a class differentiated by method signature?

Question 3

The data structure required for Breadth-First Traversal on a graph is?

Question 4

A queue follows __________

Question 5

Find out maximum capacity of the channel (in Mbps) in an Ethernet LAN with frame size 1000 bits. Consider signal speed in the cable is 20,000 km/s and length of the cable is 2km

Question 6

The access methods for Wireless LANs (IEEE 802.11) and Ethernet LAN(IEEE802 .3) respectively

Question 7

Let f and g be the function from the set of integers to itself, defined by f(x) = 2x + 1 and g(x) = 3x + 4 . Then the composition of f and g is ____________

Question 8

A function is said to be ______________ if and only if f(a) = f(b) implies that a = b for all a and b in the domain of f.

Question 9

Concatenation Operation refers to which of the following set operations?

Question 10

The total number of substrings present in “GATE” is?

Question 11

The pushdown automata consist of a _____.

Question 12

Consider the following problems:
A) If A is a recursive language, then A’ is also recursive
B) If A is a regular language, then A’ is also regular
C) If A is a recursive enumerable language, then A’ is also recursive enumerable
D) If A is context-free, then A’ is also context-free
Which one of the above problems is decidable?

Question 13

Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called?

Question 14

Consider a single level paging scheme. The virtual address space is 128 TB and page size is 32 MB. What is the number of pages in process?

Question 15

Scheduling is done so as to ____________

Question 16

CREATE TABLE employee (name VARCHAR, id INTEGER)

What type of statement is this?

Question 17

Which SQL keyword is used to retrieve a maximum value?

Question 18

Consider the following schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them is conflict serializable?

Question 19

A single transaction failure leads to a series of transaction rollbacks is called as:

Question 20

Given a hash table T with 25 slots that stores 2000 elements, the load factor α for T is____________.

Question 21

Load the keys 23, 13, 21, 14, 7, 8, and 15 in this order, in a hash table of size 7 using quadratic probing with c(i) = ±i² the hash function h(key) = key % 7.
[Note: The required probe sequences are given by:

h_i (key) = (h(key) ±i²)%7, i = 0, 1, 2, 3 … n

How many collisions can occur in the hash table?