Computer Science Test

Question 1
2 / -0.66

Consider the processor of a supercomputer which can support a maximum memory of 512 TB. Assume that memory is word addressable and a word consists of 32 bytes. The size of the address bus of the processor is at least _____ bits.

A
42

B
43

C
44

D
45

Question 2
2 / -0.66

A box contains the following three coins.

I. A fair coin with head on one face and tail on the other face.

II. A coin with heads on both the faces.

III. A coin with tails on both the faces.

A coin is picked randomly from the box and tossed. Out of the two remaining coins in the box, one coin is then picked randomly and tossed. If the first toss results in a head, the probability of getting a head in the second toss is

A
2/5

B
1/3

C
2/3

D
1/3

Question 3
2 / -0.66

If G is a simple graph with 20 vertices and degree of each vertex is at most 13, then minimum edges possible in G̅ is ________.

A
60

B
61

C
62

D
63

Question 4
2 / -0.66

Identify the correct sequence in which following actions take place on the network when a user searches a specific URL in a web browser.

I. Browser initiates a TCP connection with the server.

II. The browser sends a request to the server and receives a response from the server.

III. If the requested URL is not in the cache, ISP’s DNS server initiates a DNS query to find the IP address of the server that hosts given URL.

IV. Browser checks for DNS record for corresponding IP Address of a given URL.

A
IV, III, I, II

B
I, II, IV, III

C
I, II, III, IV

D
IV, I, II, III

Question 5
2 / -0.66

The logic circuit given below consists of three 2:1 multiplexers. The output of the logic circuit is F. What is the expression for F?

A

B

C

D

Question 6
2 / -0.66

Consider a hypothetical workstation having an I/O bus speed of 2 Gbps and memory bandwidth of 10 Gbps. Assume that direct memory access is used to move data in and out of the main memory. Find the maximum number of interfaces, a switch based on this workstation can handle for a 160 Mbps Ethernet link?

A
4

B
5

C
6

D
7

Question 7

2 / -0.66

A hash table with 10 buckets with one slot per bucket is depicted here. The symbols, A to G are initially entered using a hashing function with linear probing. The maximum number of comparisons needed searching an item that is not present is

0	B
1	C
2
3	F
4
5	A
6
7	G
8	D
9	E

5

6

7

8

Question 8
2 / -0.66

Consider the following DAG.

Which of the following expression is represented by above DAG?

A
a * b + c(a * b) + c*(a * b)d

B
c(a * b) + c*(a * b)d

C
a(a * b) + c(a * b) + c*(a * b)d

D
(a * b)(a * b) + c(a * b) + c*(a * b)d

Question 9
2 / -0.66

Create a binary search tree B1 by inserting the numbers 1, 2, 3, ... n into an empty binary search tree. Create another binary search tree B2 by inserting the numbers into an empty binary search tree in the reverse order. What is the difference between the right-most element of B1 and the left-most element of B₂?

A
n

B
n-1

C
0

D
1

Question 10
2 / -0.66

What does the following query return?

SELECT Pnumber, Pname, COUNT (*)

FROM PROJECT, WORKS_ON

WHERE Pnumber = Pno

GROUP BY Pnumber, Pname

HAVING COUNT (*)>2;

The relational schemas are PROJECT(Pname, Pnumber, Plocation, Dnum) and WORKS_ON(Essn, Pno, Hours).

A
It retrieves the project number, the project name and the number of employees who work on the project.

B
It retrieves the project number and the project name of the employees who work on the project where for each project more than two employees work.

C
It retrieves the project number, the project name and the number of employees who work on the project where for each project more than two employees work.

D
It retrieves the project number and the number of employees who work on the project where for each project more than two employees work.

Submit Test

Computer Scienc...

Question 1

42

43

44

45

Question 2

2/5

1/3

2/3

1/3

Question 3

60

61

62

63

Question 4

IV, III, I, II

I, II, IV, III

I, II, III, IV

IV, I, II, III

Question 5

Question 6

4

5

6

7

Question 7

5

6

7

8

Question 8

a * b + c(a * b) + c*(a * b)d

c(a * b) + c*(a * b)d

a(a * b) + c(a * b) + c*(a * b)d

(a * b)(a * b) + c(a * b) + c*(a * b)d

Question 9

n

n-1

0

1

Question 10

It retrieves the project number, the project name and the number of employees who work on the project.

It retrieves the project number and the project name of the employees who work on the project where for each project more than two employees work.

It retrieves the project number, the project name and the number of employees who work on the project where for each project more than two employees work.

It retrieves the project number and the number of employees who work on the project where for each project more than two employees work.

User

Question Analysis

Results Announcement on: coming Monday

Stay Tuned: We’ll update you on your result via email or SMS.

a * b + c(a * b) + c(a b)d

c(a * b) + c(a b)d

a(a * b) + c(a * b) + c(a b)d

(a * b)(a * b) + c(a * b) + c(a b)d