Bntrance Examinations - 2016

Ph.D. Computer Science

Time : 2 Hours Maximum Marks : 75

Instructions

1. Write your Hall Ticket Number in the box above and on the OMR Answer
Sheet.

2. This test is for 2 hours duration carrying 75 marks.

3. All Answers should be marked clearly in the OMR answer sheet.

4. Every correct answer get 1 (ONR) mark. There is negative marking of

'i 0.33 marks for every wrong answer'

5. Do ali the rough work only in the pages provided in the question booklet,
nowhere else.

6. Use of non-programmable calculator and log-tables is allowed.

Hand over the OMR answer sheet to the Invigilator before leaving
the
7.
examination hall.

M-s3
Entrance Examination (2016 Ph.D. in Computer Science

1. consider the binary representation of an integer x by b^b*_r .. .br6o, where each bi

is either 0 or 1. The integer r is divisible bV 6 tf and only i,f

A. D:f'b; is divisible by 6
B. D::T b; is divisible by 6 and b6 : g
C. the alternating sum ba - h * bz -. . . (-l)*b- is 0
D. the alternating sum bo - h -f bz - .. . (-I)^b*is divisible by J and, bo : 0

2. Which of the following protocols has all of the properties: (i) imposing restric-
tions on the order of items being accessed, (ii) ensuring seriaiizability without the
requirement of two phase locking, and (iii) additionaily ensuring deadlock freedom.

A. Three phase locking

B. Time stamp ordering
C. Graph based locking
D. Strict two phase locking
3. The property which ensures "once a transaction completes successfully, the changes
it has made to databases persist, even if there are subsequent failures" is called
A. Atomicity
B. Consistency
C. Isolation
D. Durability
4. Which of the following is an index mechanism, where an index record appears for
only some of the search key values?

A. Dense index
B. Sparse index
C. lvlulti-level index
D. None of these

5. In the context of databases SET concept is used in

A. Relational Model
B. Network Model
C. Hierarchical Model
D. Physical Model

6. Databases that store information about the states of real world along'with timeline
are

A. Temporal databases
B, Mohile datahases
C. Multimedia databases
il-53
Entrance Examination Ph.D. in Computer Science

D. Spatial databases
,there are no non-trivial functional dependencies of attributes on
Z. The condition -
anything other than a superset of a candidate key", is both necessary and suffi'cient
for a database to be in

A. 2"dNormal form
B. 3"d Normal form
C. PJNF
D. BCNF .:.

g. A bits is randomly generated. The probability that at

sequence of length 10
lea"st

one of these bits is zero is equal to

l\'r 1023
ro24

B.;
c. I
D.#
9. In a University, 7232 students have taken a course in Spanish, 879 have taken a
course in Flench and 114 have taken a course in Russian. F\rrther, 103 have
taken
course in both Spanish and Flench, 23 have taken in course both Spanish and
Russian, and 14 have taken course in both Flench and Russian, If 2092 students
have taken at ]east one of Spanish, tlench ancl Russian, how many students
have
taken a course in all three languages

4.7
B. 14

c. 23

D. 103

10. The relation R is represented by the matrix 'A' given as

(iii)
If the inverse relation of R is d^efined as R-i : {(b, o)l(o, b) € R}' Then the matrix
representing the inverse relation is

A.A
B. A_1

c. AdjA
D. A2

'I'li,,iiritllii--i ,,f ,liffet-i.,rit i.,,,,ffexivr. i'elii,tiriiis r)ii ?i, iirlt -wiili il, i:llrui+:ttts is

S. 2n(n-L)
M- s:
Ent{ance Examinaiion (2016) Ph.D. in Computer Science u-

B. 2'
C. n2

D. 2n

12 p -+ q is logically equivalent to

A. -pV Q

B. pV -q
c.pv q

D. -pV-q
13. What is the output of the following program ?

#include <stdio.h>
void maino
t
char ch=1026;
switch(ch) {
case I printf ("Response t") ; break;
case 2printf ("Response 2"); break;
case 3 printf ("Response 3") ; break;
default printf ("Default Response" ) ; ]

A. Response 1
B. Response 2
C. Response 3
D. Default Response
14. What is the output of the foliowing program ?

#include <stdio.h>
int naino
t
if (printf printf ("True") ;
("ABC"))
else printf("False");
return 0;
)
A. Compilation error
B. ABC
C. ABCTrue
D. ABCFalse
rI (a
P i- -,t-
 Entrance Examination (2016) Ph.D. in Computer Science

15. Which of the following declarations are legal ?

I. int a=0, b=1 , c=2i int array[3]={a,b,c};

IL int size = 3;int arraylsize];
III. int size = 3;int arraylsize]= {1,2,3};
' IV. AII of the above

A. II and III
B. I only
C.IV
D. I and iI
16. In the following program which segment is the variable 'p' to be stored ?

#include <stdio.h>
int mainO{
char ch = 'a'; p = & a;
pri.ntf ("o|c", *p) ;
return 0;
)
A. Code/text segment
. B. Data segment
C. Stack segment
' D. BSS segment

17. Which of the following is a bottom-up approach to design a database by examining

rclationships among attributes ?

' A. Functional dependency

B. Database modelling
C. Normalization
D. Decomposition

L8. Empdtl(e'm'pcode,na'rne,street,c'ity,state,p'incode)is a schema. For any pincod,e, there

is only one city and state. AIso for a given street, city and state, there is just one
pincode. In normalization terms, empdtl is a relation in

A. 1NF oniy
B. 2NF and hence in lNF
C. 3NF.and hence also in 2NF and 1NF
D. BCNF and hence also in 3NF and 2NF and lNF

19. Which of the following is not associated with transaction processing

A. Cori{irrniiig an action or triggt:ring i} rcsponstl

B. Producing detail summary or exception report
M- 53
 Entrance Examination (2016) Ph.D. in Computer Science

C. Recording a business activity

D. Maintaining a data
20. The statement, INSERT INTO INSTRUCTOR VALUES (10211, 'Smith','Biology',66000)
is of type ?
A. Query
B. DML
C. Relational
D. DDL
21. The data models defined by a ANSI-SPARC database architecture are

A. Conceptual, physical and internal

B. Conceptual, view and external
C. Logicai, physical and internal
D. Logical, physical, view

22" Let Kn be the complete graph on n vertices. Then which of the following is not
true ?

A. Kn has 4f! edges

B. K. is Eulerian for all n) 5

C. Kn is Hamiltonian for all rz ) 5

_. D. Kn is Non-planar for all n ) 5

degree k. Then f?1Tfr *I)n1,:

A. 2015
B. 4032
c. 4030
D. 6046

24. Consider an undirected weighted complete graph G with 2016 vertices listed in a
set {'rr,'rr,..., uzoro} such that the weight on edge ('rn,'u) is 2 | i - j I The weight
of a minimum spanning tree of G is

A. 2015
.' B. 4030
c. 1008

D. None of the above

25. LetA be the adjacency matrix of an undirected unweighted graph G. The (i,,i)'n
entry of. Ak is equal to
A. Ihe number of simpie paths of length k fiom vertex z to j '

M-5-3
Entrance Examination (2016) Ph.D. in Cornputer Science

B. The number of waiks of length k from vertex i to j.

C. The length of shortest path from vertex i to i.
D. None of these
26. in a connected planar graph, every vertex has degree 3 and every region has degree
5 or 6. Let P be the numbcr of regions with clegree 5. Then P equals to

A. t2
B. 10
c. 11

D. 13

27. In a graph G, if the set of edges incident on each vertex of G is a cut-set, then the
graph G is

A. separable
B. nonseparablc
C. connected
D. Eulerian

28. The number of cut-vertices in a tree with n vertices and rn ieaves is

A. n*m
B.n
C, M,
T\
]). IL _'IIL

29. Which of the following can be sequences of degree of vertices in a simple connected
graph with 6 vertices.

A. 5,4,4,3,2,L
B. 5,4,4,3,2,2
c. 5,4,4,3,2,0
D. 7,5,1,4,2,2
30. If p is the number of active processes, and r is the number of resource types; the
time complexity of the Banker's algorithm used for deadlock avoidance is denoted
AS

A' o(pt)
B. O(r2)
C. O(p2r)
D. O(pr2)

31. Dining philosopher's probleni dcals with

A. Process synchronization

r-a
o lvt->-e
Entrance Examination (2016) Ph.D. in Computer Science

B. Dead-lock Prevention
C. Resource allocation
D. All of the above

32. The hit ratio of cache memory is the percentage of access (reads and writes)for which
data are found irr the cache. Write-through, Write-back are two main policies for
memory updation. write-allocation is a policy whereby a cache }ine is allocated and
loaded on a write miss. If it is assumed that write-allocation is always used, which
of the following is true.

A. Write-back usually results in a better hit ratio than write-through

B. Write through usually results in a better hit ratio than write-back
C. The percentage of write operations resulting in a main memory operation will
never be larger for Write-back than for Write-through
D. Write-through can only be employed in set-associative rnemory

33. The linux command "chnod 761 letter" is equivalent to

A. chmod u: 76 , g : 61, o : IL letter

B. chmod a:76\ l-etter
C. chmod 167 letter
D. chnod LL:ru)r, I:ru),0:r letter
34. An operating system kernei minimizes the frequency of disk access by keeping a pool
of internal clata buffers wiricir helps to increase the response time, this is known as
?

A. Buffer cache
B. Spooling
C. Pooling
D. Virtuai memorY
35. What is the minimum number of swaps that would take place, using Bubble sort
on a list of n numbers ?

A. (n-1)
B.t
c.0
D. Iogn

36. If in a.data structure, 1000 insertions were'interspersed with 1000 searches effi-
ciently, assuming data in this data structure is stored following a uniform random
distributiorr. Then the most appropriate type of data structure for D here is

A. A linked-list maintained in sorted order

B. A iinked-list of uusorted records

I l\./l
i
\ '\
\ - e1
Entrance Examination (2016) Ph.D. in Computer Science

C. A binary search tree

D. An array-based list maintained in sorted order
37. If u pr:o."r, is CPU-bound, which of the following statements is TRUE for better
CPU utilization ?

A. The process should be given higher priority for I/O

B. The process should should be given higher priority for CPU
C. The process should be given equal priority as the other process
D. Priority has no effect over the CPU utilization in this case
38. If the capacity of the Translation Look-aside Buffer (TLB) of a 32-bitprocessor is
5i2KB and each page table entry needs 48, what should be the size of the page for
the entire page table to fit into the TLB ?

A. 8KB
B. 16KB
C. 32KB
D. 4KB

39. An operating system uses dcmand paging and local replacement strategy. In such
a system, when no free frames are available then the number of frames allocated to
a process may be:

A. constant
B. nothing may be said of them
C. increased
D. decreased
40 Which of the following statements is NOT TRUE a.bout cornpile-time binding:

I. It's an efficient use of main memory.

IL It requires knowledge of the processor architecture and amount of main memory
in the system.
IIi It does not allow srvapping of the process.

A, (I) only
B. (I) and (II)
C. (I) and (III)
D. All of the above
41. A process moves from RUNNING to READY state when

A. an interrupt occurs
B. a page farrlt or:t:urs
t\, I r?)
t'\-)J
 Entrance Examination (2016) Ph.D. in Computer Science

C. a process goes for I/O

D. None of the above

42. If a 16MB file has to be stored in a file system with 8KB block size, how many
index blocks are required for this file if each block location entry requires 4B ?

4.2
8.4
c.3
D. 1

43. The language L : {ae I where p is any non-prime, non-negative integer} defined
over the alphabet | : {o} is

A. Context free
B. Regular
C. Nonregular and does not satisfy purnping Iemma for regular languages
D. Nonregular and but satisfies pumping lemma for regular languages
44. Which of the following statements are true:
I. Complement of a recursive language is always recursive
IL Courplement of a context free language is always context free
III. Concatenation of two recursively enumerable languages is always recursively
enumerable

A. (I) only
. B. (II) only
C. (I) and (III)
D. (II) and (III)
45. Which of the following regular expression is equivalent to (o* + b).(c + d) ?

A. a"(c + d) + b(c + d)
B. a.(c + d) + b(c + d)
C. (o. +b)c* (a. +b)d
D. (o * b).c + (a + b).d
46. Consider the following context free grammar where a is null string
. S-+aSblbsalSSle
' which of the following best characterises the language generated by above grammar

A. All palindromes over a and b

B. All strings with equal number of a's and b's
C. All even-length strings of a's and b's
D. All strings of the f.orm aiV ak such that i * i : k

e M-53
Entrance Examination (2016) Ph.D. in Computer Science

NOTE:: The questions are based upon the following information:

147-481
Consider a2Kbyte with an 8 byte block size, the cache is initially empty and
cache
is being addressed physically and also tagged physically; direct mapping approach
is used. Array A of 256 elements with 4 bytes each, and array B of 512 elements
with 4 bytes each are stored at physical address 4,096 and 8,192 respectively. The
following loop is then executed:

for (i=0; i<256; i++)

A [i] =A [i] +g [2*i] ;

47. During the execution of the loop, how many bytes will be written to memory if the .:
cache has a write-through policy ?

A.0
8.256
c. r,024
D. 2,049

48. During the execution of the loop, how many bytes will be written to memory if tlie
cache has a write-back policy ?

A.0
B. 256
C, I,024
D. 2,049
49. Two processors, M-5 and M-7 implement the same instruction set. Processor M-5
uses a 5-stage pipeline and a clock cycle of 10 nanoseconds. Processor M-7 uses a
7-stage pipeline and a clock cycle of 7.5 nanoseconds. Which of tile following are
true ?
I. M-7's pipeline has better maximum throughput than M-5's pipeline
II. The latency of a single instruction is shorter on M-7's pipeline than on M-5's
pipeline.
III. Programs executing on M-7 will always run faster than programs executing on
M-5.

A. I only
B. II only
C. I and III only
D. II anil III only
50. In a pipelined RISC computer where all arithmetic instructions have the same cy'
cles per instruction which of the following actions would improve the execution time
of a typical program ?
L lncreasing the clock cycle rate
II. Disallowing any forwarding in the pipeline

10
rY -s:
Entrance. Examination (2016) Ph.D. in Computer Science

III. Doubling the sizes of the instruction cache and the data cache without changing
the ciock cycle time

A. I only
B. III only
C. I and II only
D. I and III only
51. A virtual memory systern has an address space of 8K words, a memory space of
4K, and a page and block sizes of lK words. The following page reference changes
occur during a given time interval. (only pages with changes are listed. A page
already referenced is not listed again)

4 2 0 t 2 6 1 4 0 t 02 3 5 7

Determine the four pages that are resident in the main memory after the end of the
page reference changes if the replacernent algorithm used is LRU.

A. r,2,7,5
B. 0,2,7,5
c. 2,7,3,5
D. None of the above

52. A student is browsing the website wvw.youhoo.co.in She clicks on a URL which
is from the same website. Which of the following is a more accurate description of
the sequence of events that takes place after the click event

I. 3-wa5, TCP handshake event between client and server

II. HTTP get request evnnt
IIL DNS query and response event

A. III, I, II
B. I, II, III
C. III, II, I
D. None of these

53. Two programs A, B have the following sequences of socket calls

,4:socketO, bindO, listenO, acceptO, readO, writeO, closeo
B: socketO, sendtoO, recvfronO, close()
Which of the following most accurately represents the work being done by program
,4 and .B respectively ?

A. connectionless client and connectionless server

B. connection-oriented client and connectionless server
C. connection-oriented server and connectionless client

11 M-53
Entrance Examination in Computer Science

D. connection-oriented client and connectionless Server

NOTE: The questions upon the following information:

[S+-SS] are based
Automatic Repeat Request Protocol (ARQ) is used for reliable data transfer be-
tween two peeis. Stop-and,-Wait is one of the well known ARQ methods between a
network sender agent A and a receiver agent B. ARQ requires retransmission of the
previous frame or packet to take place when the retransmission timer is set after
the time limit eiapses.

54. Consider the foliowing scenario between A and B agents in a stop-and-wai't ARQ
protocol
1. Sending agent A transmits a frame numbered 0 and then waits for an acknowl-
edgment (ACK) frame from receiver B.
2. Flame 0 is receivecl by B without error. B transmits ACK frame to A. According
to this ARQ protocol, Agent A can transmit frame numbered 1 provided, which of
the following events take Place ?

A. ACK from B is received without error and retransmission timer at A is set

B. ACK from B is received without error and retransmission timer at A is off
(reset)
C. ACK from B is received with error and retransmission timer at A is off (reset)
D. ACK from B is not received and retransmission timer at A is set

55. The main problem with the Stop-and-Wai,t LRQ approach which needs improve-
ment lead.ing to Go-back N or Selectiae Repeat ARQ approaches is

A. Stop-and-Wait is not actually reliable

B, Stop-and-Wait cannot be used at transport layer level
C. Stop-and,-War't requires wireless transmission
D. Stop-and,-Wait is not at all eflfrcient at utilizing the transmission capacity of the
Iink

56. IP addresses are generally written in the dotted-decimal notation. Given the IP
address in binary is

1000000010000 11 10100010000000101

Using dotted decimal notation it is written as

A. 100.000001.00001.100
B. 80.87.66.05 "

c. 135.128.68.5
D. 128.135.68.5

57. Which of the following is not provided by UDP:

I. Source port IL Destination Port III. Reliable transport service IV. Count of
number of bytes in datagram

t2 M-53
Entrance Examination (2016) Ph.D. in Computer Science

A. III Only
B. IV only
C. II and IV
, D. III and IV
Read the passage beiow and then answer the questions (58 - 61).
Many difiering views have been expressed with regard to the relation of the state of
the brain to the phenomenon of consciousness. There is remarkably little consensus
of opinion for a phenomenon of such obvious importance. It is clear, however, that
all iarts of the brain are not equally involved in its manifestation. For exampie, as
hinled above, the cerebellum seems to be much more of an 'automaton' than the
cerebrum. Actions under cerebeilar control seem almost to take place by themselves
without one having to think about them. While one may consciously decide to walk
plan
from one place to another, one does not often become aware of the elaborate
of detailed muscle movements that would be necessary for controlled motion' The
same may be said of unconscious reflex actions, such as the removal of one's
hand
from a hot stove, which might be mediatecl not by the brain at all but by the upper
part of the spinal coiumn. Flom this, at least, one may be well inclined to infer
thut th. phenomenon of consciousness is likeiy to have more to do with the action
of the cerebrum than with the cerebellum or the spinal cord.
planned, are
bg. The actions that happen mostly by itself without being consciously
controlled by

A. Cerebrum control
B. Cerebellum control
C. Cerebellar control
D. Spinal cord control

59. consciousness is possibly more to do with the actions of

A. Cerebrum
B. Cerebellurn
C. Spinal cord
D. All the above
for individ-
60. Which of the statements trelow is correct I. Brain is solely responsible
ual's consciousness
II. Parts of a brain are equally invoived in making of one's consciousness

A. I
B. II
C. I and II
T). Nr.;ne of hhe at;crc

13

nn-(L
\v\ e€
 Entrance Examination (2016) Ph.D. in Computer Science

61. Unconscious reflex actions are the set actions planned by

A. Cerebrum
B. Cerebellum
C. Spinal cord
' D. Ail the above
62. Using the standard C library which of the following will return zero for a strict
equality testing of two arrays pointed by sl and s2?
I. int memcnp(const void xs1, const void *s2, size-t n))
II. array array-diff-assoc( array $s1, array $s2 );
IiI. int bcrnp(const void xs1, const void *s2, size-t n);

A. II oniy
B. i and II only
C. II and III only
D. I and III only
63. Consider the statements
I. int *func(int a, float b); and
IL int (*func) (int a, float b);
Which of the following is more correct regarding statements I and iI respectively 'l

A. they represent function returning pointer to int and pointer to function return-
ing int
B. both are equivalent and are returning int
C. both are equivalent and are returning a pointer to type int
D. neither of them is returning a pointer to type int
64. Which of the following standard C library functions is best used to find the last
occurrence of a character in a string ?

A. strnstro
B. strrchro
C. strstro
D. None of these is useful. Its better to use strcnpo
65. Let ? be a balanced tree with height 5. It is seen that e\,€ry internal node in ? at
depth k from the root node, has 25-k chiid nodes. The number of leaf nodes in ? :
is
':
A. 25
B. 26
c. 230

L4

\
r't <B
9'
Entrance Examination (20i6) Ph.D. in Computer Science

D. 215
66. In which of the following parameter passing mechanisms the actual parameters a,re
re-evaluated on each access ?

A. Call by Name
B. Call by Value
C. Call by Value Result
D. Call by Result
67" Time complexity of an algorithm is denoted by T(n), where n is the input size. For
a particular algorithm: T(n):T(n - 1) + lfn, rf n) l, also notethat ?(n) : t
otherwise. The time cornplexity of this algorithm is best approximated by

A. logn
B. ri
C. n2
D, n,"
68. Which of the following is the most accurate description of the Breadth-First graph
traversal approach ?

A. Tbaverses a single path of the graph until it visits a node with no successor
B. Finds the short past through the graph
C. Traverses all successors of a visited node before visiting any successors of any
of those successors
D. Tlaverses and visits nodes in a random order but ensures visiting every node

69. In the following C language function, Iet n ) m. How many recursive calls are
made by this firnction ?

int gcd(n,n)
{
if(n%m ==0) return m;
n=n%n;
return gcd(n,n)
)
A. O(log, n)
B. 0(n)
C. O(logr logrn,
D. o(/")
70. A B-Tree of order 4 is built from scratch by l0 successive insertions. Whdt is the
maximum number of node splitting operations that may take place ?
Ac
fa. .)

15
An
r !t7
Fa
!..-
 Ph.D. in ComPuter Science

B.6
c.4
D.3
of n elements
71., What is tlie time required to insert n more elements to a birrary heap
?

A. 0(nlog n)
8.0(logn)
C. 0(n2)
D. 0(n)
72. Aclustering index is defined on the fields which are of type
A. non-key and non-ordering
B. non-key and ordering
C. key and ordering
D. key and non-ordering
:
73. Let X be a binomial random variable with n 5 and P:0.5'
consider random
variabie l'rlefiuecl as Y : Xm'ocl2' Then Pr(Y:0) is
1
A.-32
'l

B.;I
c.- 1

2
D. 1

74. f'hc general expressiol fbr the sequence ar. where an: 4an-1t 5&n-2, or : 2 and
0z:6is
82
A. ;t" +;(-1)"
t2
-
". ;r"
82
5(-r)"
c. ;r" -;(1)"
-82 -
o. #r" i(-r)"
75. Choose the best data structure that can be used by a search engine ibr
ranking,
accumuiating score and presenting top ten results based on
their scores'

A. a binarY search tree

B. a heaP
C. a stack
D. a queue

16
xn
(-\l'J/
t(a