POST GRADUATE COMMON ENTRANCE TEST - 2015

DATE & TIME COURSE SUBJECT

08-08-2015 ME / M.Tech/ M.Arch / Courses COMPUTER SCIENCE
10.30 AM TO 12.30 PM Offered by VTU / UVCE / UBDTCE ENGINEERING

MAXIMUM MARKS TOTAL DURATION MAXIMUM TIME FOR ANSWERING

100 150 MINUTES 120 MINUTES

MENTION YOUR PGCET NO. QUESTION BOOKLET

SERIAL NUMBER 353217
VERSION CODE A -1
DOs :
1. Check whether the PGCET No. has been entered and shaded in the respective circles on the OMR
answer sheet.
2. Ensure whether the circles corresponding to course and the specific branch have been shaded on the
OMR answer sheet.
3. This question booklet is issued to you by the invigilator after the 2nd bell i.e., after 10.25 am.
4. The serial number of this question booklet should be entered on the OMR answer sheet.
5. The version code of this question booklet should be entered on the OMR answer sheet and the
respective circles should also be shaded completely.
6. Compulsorily sign at the bottom portion of the OMR answer sheet in the space provided.
DON'Ts:
1. THE TIMING AND MARKS PRINTED ON THE OMR ANSWER SHEET SHOULD NOT BE DAMAGED /
MUTILATED / SPOILED.
2. THE 3RD BELL RINGS AT 10.30 AM, TILL THEN;
Do not remove the seal / staple present on the right hand side of this question booklet.
Do not look inside this question booklet.
Do not start answering on the OMR answer sheet.

IMPORTANT INSTRUCTIONS TO CANDIDATES

1. This question booklet contains 75 (items) questions and each question will have one statement and
four answers. (Four different options / responses.)
2. After the 3rd Bell is rung at 10.30 am, remove the seal / staple stapled on the right hand side of this
question booklet and check that this booklet does not have any unprinted or torn or missing pages or
items etc., if so, get it replaced by a complete test booklet. Read each item and start answering on the
OMR answer sheet.
3. During the subsequent 120 minutes:
Read each question (item) carefully.
Choose one correct answer from out of the four available responses (options / choices) given
under each question / item. In case you feel that there is more than one correct response, mark
the response which you consider the best. In any case, choose only one response for each item.
Completely darken / shade the relevant circle with a blue or black ink ballpoint pen against
the question number on the OMR answer sheet.
4. Use the space provided on each page of the question booklet for Rough Work. Do not use the OMR
answer sheet for the same.
5. After the last bell is rung at 12.30 pm, stop marking on the OMR answer sheet and affix your left
hand thumb impression on the OMR answer sheet as per the instructions.
6. Hand over the OMR answer sheet to the room invigilator as it is.
7. After separating the top sheet (KEA copy), the invigilator will return the bottom sheet replica (candidate's
copy) to you to carry home for self evaluation.
8. Preserve the replica of the OMR answer sheet for a minimum period of ONE year.
9. Only Non-programmable calculators are allowed.

MARKS DISTRIBUTION
PART - 1 50 QUESTIONS CARRY ONE MARK EACH (1 TO 50)
PART - 2 25 QUESTIONS CARRY TWO MARKS EACH (51 - 75)
;'frigt
 COMPUTER SCIENCE ENGINEERING
PART - 1
(50 X 1 = 50)
(Each question carries one mark)

1. What is the cardinality of the powerset of the 6. The average search time of hashing with
set {a, b, c, d) ? linear probing will be less if the load factor is:
a. 4 b. 16 a. Equal to one
c. 8 d. 12 la Is far less than one
c. Is far greater than one
2. If p : The sun has set d. None of the above
q : The moon has risen
then symbolically the statement, "the sun 7. Sparse matrices have
has not set!' or "the moon has not risen" is a. High dimensions
written as
b. Many non zero entries
a. — p A q b. — qv p
c. Many zero entries
c. PA--q d — pv --- q d. None of the above

3. Boolean algebra is different from ordinary 8. If we use merge sort to sort an array with 'n'
algebra in which way? elements, what is the worst case time
a. They are actually the same required to sort?

b Boolean algebra can describe upto 3 levels a. 0 ( log n2) b. 0 (n2)

of logic levels c. 0 (n log n) d. 0 (n)
c. Boolean algebra have only two discrete
levels 0 and 1
9. Which of the following algorithms is not a
cL Boolean algebra can represent more than greedy algorithm ?
1 discrete levels between 0 and 1
a. Dijkstra's algorithm
h Prims algorithm
4. [ — qA(P —>q)] -4---P is c. Kruskal algorithm
d. Heap sort
a. Contradiction b. Tautology
c. Contingency d Invalid
10. Stack cannot be used to
a. Allocating resources and scheduling
5. If A is any set, then
b. Reversing string
a. AUA I =0 b. An A' ,----- Z5 c. Implementation of recursion
c. AU A' =Z5 d. None of the above d. Evaluation of expression in port fix form

Space For Rough Work

A-1 3 CS
 11. What is the worst case time complexity of a 16. The private work space dedicated to a
sequence of n multidequeue ( ) operations subroutine is called as
on an initially empty queue a. Heap b. Reserve space
a. 0 (n) b. 0(n+k) c. Stack d. Node

c. 0 (nk) d. 0(n2 ) 17. Consider the following sequence of

micro-operations
MBR E— PC
12. Which of these is not a type of fragmentation
MAR4— X
a. Code fragmentation
PC <—Y
b. External fragmentation
Memory 4— MBR
c. Data fragmentation
Which one of the following is a possible
d. Internal fragmentation operation performed by this sequence
a. Conditional branch
13. SCSI stands for b. Initiation of the interrupt service
a. Small Component System Interface c. Operand fetch
b. Small Computer System Interface d. Instruction fetch
c. Small Computer Signal Interface
d. Small Component Signal Interface 18. Which of the following statements is true?
a. If a languages is context free it can
always be accepted by a deterministic
14. The complete set of only those Logic gates push - down automation
designated as universal gates is b. The union of two context free languages
a. NOT, OR and AND gates is context free
b. NOR and NAND gates c. The intersection of two context free
languages is context free
c. XOR, NOR and NAND gates
d_ The complement of a context free
d_ XNOR, NOR and NAND gates languages is context free

15. Increasing the RAM of a computer typically 19. The PDA is called non-deterministic PDA
improves performance because when there are more than one outgoing
edges from which state ?
a. Virtual memory increases
a. START or READ
b. Fewer segmentation faults occur
b. POP or REJECT
c. Larger RAM'S are faster
c. READ or POP
d. Fewer page faults occur d. PUSH or POP
Space For Rough Work

A-1 4 CS
20. Let w be any string of length n in {0,1}. Let 26. Type checking is normally done during?
L be the set of all substrings of w . What
a. Lexical analysis
is the minimum number of states in a
non deterministic finite automation that b. Syntax analysis
accepts L ?
c. Syntax directed translation
a. n - 1 b. n
c. n+ 1 d 2n- 1 d Code generation

21. Which of the following is true?

27. YACC resolves conflicts of type
a. Every subset of a regular set is regular
b. Every finite subset of a non regular set is a. Reduce - Reduce b. Shift - Reduce
regular c. Shift - Shift d. a and b
c. The union of two non- regular sets is not
regular
d. Infinite union of finite sets is regular 28. Piece of code that only one thread can execute
at a time is called

22. The smallest finite automation which a. Synchronization

accepts the language {x/length of x is
divisible by 3} has: b. Mutual exclusion

a. 2 states b. 3 states c. Critical section

c. 4 states d. 5 states d All of the above

23. Bottom up passing involves

29. A page fault occurs when
a. Shift reduce
a. The dead lock happens
b. Handle pressuring
c. Operator check b. The segmentation starts
d a and b c. The page is found in the memory
d The page is not found in the memory
24. Which of the following system software
resides in main memory always?
a. Text editor b. Assembler 30. In Round Robin CPU scheduling as the time
quantum is increased, the average turn
c. Linker d Loader around time
a. Increases
25. Which of the following software tool is a
passer generator? b. decreases
a. Lex b. YACC c. Remains constant
c. Both a & b d None of the above
d Varies irregularly
Space For Rough Work

A-1 5 CS
31. To avoid the race condition, the number of 36. If every non-prime attribute of R is
Processes that may be simultaneously inside non-transitively dependent on every super
their critical section is key of R then that table is in
a. 8 b. 1 a. 1 NF b. 2 NF
c. 16 d 0 c. 3 NF d. 4 NF

32. In which one of the following page 37. A composite attribute is converted to
replacement policies, Belady's anamoly may individual attributes in which normal from?
occur?
a. First b. Second
a. FIFO b. Optimal
c. Third d Fourth
c. LRU d. MRU

33. The program which interacts with the inner 38. A type of query that is placed within
part of the Kernel is called a "WHERE" or "HAVING" clause of another
query is called
a. Compiler b. Shell
a. Super query b. Sub query
c. Device driver d. Protocol
c. query d Master query

34. Given the basic ER and relational models,

which of the following is INCORRECT? 39. Functional dependencies are the types of
a. An attribute of an entity can be composite constraints that are based on
b. In a row of a relational table, an attribute a. superset key
can have more than one value b. key
c. An attribute of an entity can have more
than one value c. key revisited

d In a row of a relational table, an attribute d. None of these

can have exactly one value or a null value

40. One of the header fields in an IP datagram is

35. Which of the following concurrency controls the Time to Live (TTL) Field. Which of the
protocols ensure both conflict serializability following statements best explains the need
and freedom from dead-lock? of this field?
I. Two phase locking
a. It can be used to prioritize packets
II. Time stamp ordering
b. It can be used to reduce delays
a. I only
c. It can be used to optimize throughput
b. II only
d. It can he used to prevent packet looping
c. Both I and II
d Neither I nor II
e
Space For Rough Work

A-1 6 CS
41. An organization has a class B network and 46. Which function may be used to send
wishes to form subnets for 64 departments. messages to users requesting for text input
The subnet mask would be in a Javascript application ?
a. 255.255.0.0 a. Alert ( ) b. Get Input ( )
h 255.255.252.0
c. Prompt ( ) d. Confirm ( )
c. 255.255.128.0
d. 255.255.64.0
47. Which method is used to specify a containers
Layout in JSP?
42. What does the port number in a TCP
connection specify? a. Layout ( )
a. The quality of data transmitted b. Container layout ( )
b. The quality of data connection c. Set con layout ( )
c. Communication process on the two end
systems d. Set layout ( )

d. The size of the data

48. In ASP, which function returns a Boolean

43. What in the natural mask of a class C value that indicates whether a specified
network? expression can be evaluated as a number ?

a. 255.255.255.255 a. IS Numberic ( )
b. 255.255.255.0 b. IS Number ( )
c. 1.1.1.0
c. ISNU ( )
d. 255.255.0.0
d. None of the above

44. Which of the following provides reliable

communication? 49. Address 192.5.48.2 belongs to
a. TCP b. UDP
a. Class A b. Class C
c. IP cL All of the above
c. Class B d. Class D

45. Which one of the following allows a user at

one site to establish a connection to another 50. Which one of the following uses the greatest
site and then pass keystrokes from local host number of layers in the OSI model ?
to remote host?
a. DNS b. TELNET a. Bridge b. Repeater
c. HTTP FTP c. Router d. Gateway
Space For Rough Work

A-1 7 CS
 PART - 2
(Each question carries two marks)
(25 X 2 = 50)

51. A medical treatment has a success rate of 55. In a survey of 120 people, it was found that
0.8. Two patients will be treated with this
65 read Newsweek magazine
treatment. Assuming the results are
independent for the two patients, what is the 45 read Time
probability that neither one of them will be 42 read Fortune
successfully cured? 20 read both Newsweek and Time
a. 0.5 b. 0.36 25 read both Newsweek and Fortune
15 read both Time and Fortune
c. 0.2 d. 0.04
8 read all these magazines
Find the number of people who read exactly
one magazine
52. If you flip a coin 10 times, what is the
probability you will get exactly two heads?
a. 45 b. 25
a. 0.0107 b. 0.9893
c. 48 d 56
c. 0.0439 d. 0.0098

56. The In order and Pre order traversal of a

53. The mean of ten numbers is 58. If one of the binary tree are
numbers is 40, what is the mean of the other
nine? 4,2,5, 1,3,6, and 1,2,4,5,3,6

a. 11 b. 60 The Post order traversal of the binary tree is

c. 162 d 540 a. 4,5,2,6,3,1 h 1,5,2,4,6,3

c. 4,5,6,3,2,1 d. 1,2,5,6,4,3
54. Which of the following statement is a
tautology?
57. Let G be connected undirected graph of 100
a. ((—q)Ap)Aq vertices and 300 edges. The weight of a
minimum spanning tree of G is 500. When
the weight of each edge of G is increased by
b. (-- q A p)A(pn-- - p) 5, the weights of a minimum spanning tree
becomes
c. (— q A p)v(pv — p) a. 2000 b. 1000

c. 1995 d. 995
d. (— pAq)A(N —(p AO
Space For Rough Work

A-1 8 CS
58. The recurrence relation capturing the 62. Regular expression for all strings that starts
optimal time of the Tower of Hanoi problem with a b and ends with b b a is
with n disk is
a. aba* b* bba
a. T(n)= 2T (n — 2) + 2
b. ab(ab)* bba
b. T(n)= 2T (n —1)+ n
c. ab(a + b)* bba
c. T(n)= 2T (n 1 2)+1 d. All of the above

d. T(n)= 2T (n —1)+1
63. Consider the following regular expression
a* (ab)* (abc)*
59. Write the Postfix expression form for the
given infin expression: Which of the following regular expression
denote the same language as the above
A +B * (C+D) / F+ D * E
regular expression ?
a. ABCD + * F /+ DE * +
a. (a + ab+ abc)*
h AB + CD * F/+ DE *
c. ABCD + * / F + DE * b. a*(a+b)*(a+b+c)*
d. AB + CD * F/ + D * E
c. a* (e +ab)* (0 + abc)*

60. The IPC of a program that executes 35000 d. a* +(ab)* +(abc)*

instructions and requires 17000 cycles to
complete is
a. 2.00 b. 2.06 64. Consider the following Finite state
automation. The language accepted by this
c. 1.00 d. 1.06
automation is given by the regular
expression

61. The simplified SOP (Sum of Product) form of

the Boolean expression

(A+B'+C')•(A+B'+C)•(A+B+c') is
a

a. (A'..B+C") b. (i1+Bi C ')

a. b* ab* ab* ab* b. (a + b)*

c. (A'•B+C) a_ (A•B+C)
c. b*a (a + b)* cl b* ab* ab*

Space For Rough Work

A-1 9 CS
65.- Consider three processes ( process id 0,1,2 68. Consider the following schedule for
respectively ) with compute time bursts 2,4 transactions T1, 12 and T3
and 8 time units. All processes arrive at time
zero. Consider the longest remaining time
T1 T2 T3
first (LRTF) Scheduling algorithm. In LRTF
Read (X)
ties are broken by giving priority to the Read (Y)
Read (Y)
processes with the lowest process id. The Write (Y)
average turn around time is:
Write (X) Write (X)
a. 13 units b. 14 units Read (Y)
Write (X)
c. 15 units d. 16 units

Which one of the schedules below is the

66. A CPU generates 32-bit virtual addresses. correct serialization of the above ?
The page size is 4KB. The processor has a
translation look aside buffer (TLB) which can a. T2 --> T, --> T3
hold a total of 128 page table entries and is
4-way set associative. The minimum size of h T2 —> 7; —>
the TLB tag is:
a. 11 bits b. 13 bits c. T, T3 —) T2
c. 15 bits d. 20 bits
d. 7-;

67. Consider the following set of Processes, the

length of CPU burst time given in mill seconds 69. Consider the following four schedules due to
three transactions using read and write on
Process Burst time
data item x, denoted by r(x) and w (x) . Which
P1 6 one of them is conflict serializable ?
P2 8
P3 7 a. r (x); r2 (x); (x); r3 (x); w2 (x)

P4 3
Assuming the above process is being b. r2 (x); r (x); w2 (x); r3 (x); w1 (x)
scheduled with the SJF Scheduling
algorithm, the waiting time for P2 is c. r2 (x); w2 (x); r3 (x); r (x); w1 (x)
a. 16 ms b. 9 ms
d r3 (x); r2 (x); r1 (x); w2 (x); wi (x)
c. 3ms d. 0 ms
Space For Rough Work

A-1 10 CS
70. Consider the following Log Sequence of two 72. Suppose the round trip propagation delay for
transactions on a bank account with initial a 10 Mbps ethernet having 48 - bit jamming
balance 12000. To transfer 2000 to a signal is 46.4 ms. The minimum frame size
mortgage payment and then apply a 5% is :
interest.
a. 94 b. 416
1. T1 start
c. 464 d. 512
2. T1 B old = 12000 new =10000
3. T1 M old = 0 new = 200
73. Usually, it takes 10 bits to represent one
4. Ti Commit character. How many characters can be
5. T2 Start transmitted at a speed of 1200 bps?
6. T2 B2 old = 10000 new = 10500 a. 10
7. T2 Commit h 12
Suppose the database system crashes just c. 120
before log record 7 is written and when the
system is restarted, which one statement is d. None of the above
true of the recovery procedure?

a. We must redo log record 6 to set B to

74. What is the correct HTML for adding a
10500
background color?
b. We must undo log record 6 to set B to a. < body colour = "yellow" >
1000 and then redo log records 2 and 3
b. < body bgcolour = "yellow" >
c. We can apply redo and undo operations
in arbitrary order because they are c. < background> < yellow </background >
independent
d. < body background = "yellow" >
d. We need not redo log records 2 and 3
because transaction T1 has committed
75. Setting the following properties for object in
ASP. Net results in
Response.Buffer = True Response.
71. In a token ring network the transmission Expires Absolute = wow ( ).
speed is 107 bps and the propagation speed
Subtract/New Time Span (1,0,0,0)
in 200 metres/micro second. The 1- bit delay Response.Expires = 0
in this network is equivalent to
Response.cache control = "no cache";
a. 500 meters of cable Which is the most probable explanation
a. Avoid page to be cached
b. 20 meters of cable
b. Clears the buffer area
c. 50 meters of cable
c. The session expires
d 200 meters of cable d None of the above
Space For Rough Work

A-1 11 CS