Seat No.

_________
SUB: COMPUTER ENGINEERING (CO)
Time:1 Hour 30 minutes

Instructions:
1. Ensure that all pages are printed.
2. Use Black ball pen only
3. Change in option is not allowed
4. There is no negative marking
5. Use of non -programmable scientific calculator is allowed

1. Only one of the two devices can transmit, the other can only receive is

A End device B Simplex Communication

C Duplex Communication D Multiple Communication

2. Set of rules that governs data communication which represents agreement between the
communicating devices is

A Performance B Jitter

C Protocol D Message

3. The bit rate of the physical layer is always expressed in

A Bytes per second B Bytes per minute

C Bits per minute D Bits per second

4. Point-to-point links often support data transmissions

A From sender to receiver B From receiver to sender

C In single direction D In both directions

5. Fully connected mesh network has n(n-1)/2 physical links to

A (n-1) devices B (n+1) devices

C n devices D 2n devices

6. The ________ serves as a boundary between hardware and software

A ISA instruction set architecture B Loader

C Linker D Compiler

7. The Clock which defines the regular time intervals is called as_____________.

A hertz B clock cycles

C clock period D clock rate

CO Page 1 of 12
8. I/o devices and memory share the same address space then the arrangement is called as
A Program-controlled I/O B Memory mapped I/O

C Data-Controlled I/O D Memory-memory mapped

9. Execution of the program starts when the _____ is set to the point to the first
instruction of the program.
A Program counter B Memory Address register
C Memory Data register D General Purpose register
10. The addressing mode in which the operand is explicitly given in the instruction is
___________.
A Absolute mode B Immediate mode
C Register mode D Indirect mode
11. The total to prepare a disk mechanism for a block of data to be read from it is

A Seek time B Latency

C Latency plus seek time D Transmission time
12. Malicious access are
A Unauthorized reading of data B Unauthorized modification of data
C Unauthorized destruction of data D All of these
13. Which is a network communication protocol designed to send data packets over the
Internet?
A Switch B FTP
C TELNET D TCP / IP
14. Which of the following TCP/IP protocol is used to monitor IP gateway and the network
storage to which they attached
A SGMP B FTP
C Telnet D none of these
15. Which layer of following layer is used to translate, encrypt and compress data in OSI
model?
A Application B Presentation
C Session D Transport
16. CSMA / CD
A is an important protocol B is IEEE 802.3 (Ethernet)
C both (a) and (b) D None of these
17. ARP is used to find ________ when its logical address is known.
A Physical address B Logical address
C Port address D Specific address

CO Page 2 of 12
18. In which direction communication can be possible for full-duplex data communication
system?
A forward direction B reverse direction
C both forward and reverse direction D communication is not possible
19. A field in the Ethernet message packet is
A Type B Data
C Address D all of these
20. What is a range of class B IP Address for the first byte?
A 0 – 63 B 64 – 127
C 128 – 191 D 192 – 223
21. The postfix equivalent of the prefix *+ab-cd is
A ab+cd-* B abcd+-*
C ab+cd*- D ab+-cd*
22. What is achieved by the following declaration in class structure
Void operator++()
{
C++;
}
A ++ overloaded B ++ over riding
C syntax error D invalid return type
23. What is the output of the following C program?
Main()
{
Print(“%c”,”abcdefgh”[4]);
}
A Error B D
C E D Abcdefgh
24. A pure virtual function in C++ can be declared as
A virtual void display() = 0; B pure virtual void display() = null

C virtual void display() = null; D pure virtual void display() = 0;

25. The function in C++ is expanded in the line when it is called

A macro function B friend function

C inline function D virtual function

26. The default arguments in a function may appear

A any place in argument list B middle of the argument list

C at the end of the argument list D at the beginning of the argument

list

CO Page 3 of 12
27. A static function in C++ can be called using
A name with return type B name without return type

C object name D class name

28. The line in C++, int A : :* ip = &A : : m will

A define a pointer to class B define a pointer to member

C define a pointer to object D none of these
29. What is the following function doing?
Test(a,b)
Int a,b;
{
Int z=(abs(a)>=abs(b))? a:b;
Return(z);
}

A finds the maximum of a and b B returns the minimum of a and b

C returns the member whose absolute D none of above
value is largest
30. The sorting method which sorts the array elements by repeatedly moving the largest
element to the highest index position of the array is known as what?
A Insertion Sort B Selection Sort
C Bubble Sort D Heap Sort
31. When the job is completed, the output is gets printed. This type of processing is
______.

A Queuing B Spooling
C Batch D Caching
32. ________ is the time taken by the job fom submission of job to completion of job while
processing a job.
A Running Time B Average Time
C Completion Time D Turnaround Time
33. If more jobs are ready to run at the same time, then operating system must choose
among them. _______ is suitable for this situation.
A Job Scheduling B Queue Scheduling
C Process Scheduling D CPU Scheduling
34. Switching cpu frequently between process can leads to __________
A Multithreading B Multitasking

C Multiprogramming D All of the above

CO Page 4 of 12
35. If more than one process tries to access and change the same data value, and the
outcome of the execution is depends on the orer in which the process gets executed is
called as _______ .
A Dependency Latency B Race Condition

C Context Switch D Spooling

36. If a process tries to access a page which was not present in the main memory will cause
_______ .
A Trap B Fault

C Page-fault D Page-fault trap

37. If a process transaction gets _______ on a data P, then transaction it can read the data
but it can’t write the data.
A Shared lock B Exclusive lock

C Mutual exclusion D Bounded waiting

38. The size of main memory 64 mb and size of the virtual address space is 32-bit. if size of
a page is 4kb, then the size of a page table is ______ .
A 2 Mb B 4 Mb

C 6 Mb D 8 Mb

39. A computer system has 6 printers and n processes competing to access the printers.
Each process needs atmost 2 resources to complete its tasks. find the value of n which
could cause a deadlock.
A 1 B 2

C 3 D 4

40. Consider a cpu-bound processes with unequal cpu burst lengths enters into the cpu for
execution at the same time. Find the process scheduling algorithms that minimize the
average waiting time if the processes waits in the ready queue.

A FIFO B SJF

C FCFS D RR

41. Which of the following modifiers can be applied to a local class?

A public B c&d

C abstract D Final

42. Which of the following methods are static members of the Thread class?

A run B Sleep

C yield D (b) &(c)

43. The clean room strategy is based on which software process model?

CO Page 5 of 12
 A evolutionary B Incremental

C revolutionary D Spiral

44. Which box specification describes an abstraction, stimuli, and response?

A black box B clear box

C state box D white box

45. In terms of software engineering SRS means

A system requirement specification B software requirement specification

C source requirement specification D none of above

46. When requirements are not clearly stated and quality doesn’t mater at that time one
should go with _______________ process model

A prototype model B spiral model

C incremental model D none of above

47. In terms of software engineering CMM stands for

A convenient maturity model B capability maturity model

C cohesive maturity model D none of above

48. ODBC stands for

A Open database Connectivity B Open datasource connectivity

C Open dbase connection D none of these

49. Which tag is used for creating a layer in HTML?

A <div> B <frame>

C <table> D <form>

50. Which of the following is not a scripting language?

A HTML B XML

C Postscript D Javascript

51. Remember the page-replacement algorithms and can you predict those algorithms that
suffer from Belady’s anomaly.

A LRU B Optimal

C SJF D FIFO

52. The best case running time for binary search algorithm is _____________

A O(n log n) B O(n2)

CO Page 6 of 12
 C O(n) D O(log n)

53. The worst case behavior of Merge Sort Algorithm is _________________

A O(n2) B O(log n)

C O(n log n) D O(n)

54. _______________ number of edges are required to form Minimum Spanning Tree in a
given graph G = (V,E) with n vertices.

A N B n-2

C n+1 D n-1

55. __________ algorithm solves the problems with overlapping subproblems

A Divide and Conquer B Dynamic Programming

C Greedy D Backtracking

56. The Floyd's Algorithm used to find _______________ .

A Minimum spanning tree Algorithm B All Pairs Shortest paths

C Shortest Path from the source node D Negative weight paths

57. ____________________ Problem starts and ends at the source node S, visits all the
other nodes once and forms a cycle.

A Travelling Salesman Problem B Hamiltonian Problem

C Minimum Spanning Graph D Floyd's Algorithm

58. The _______________ algorithm does not yield any optimal solution.
A Backtracking B Divide and Conquer
C Greedy Method D Dynamic Programming
59. ________________ tree is the set of all paths from root node to other nodes.
A Binary Search Tree B B+ Tree
C Optimal Binary Search Tree D State Space Tree
60. What is the time efficiency of N-Queens Problem?
A O(n2) B O(n3)
C O(n) D O(Log n)
61. What is the minimum number of time, the do…while loop is executed
A 0 B 1
C 2 D 3
62. Which of the following data structure allows random access to data?
A Stack B Linked List
C Queue D Arrays
CO Page 7 of 12
63. Recursive functions are executed in a
A LIFO order B FIFO order
C parallel fashion D all of the above
64. Average successful search time for sequential search for n items is
A n/2 B (n-1)/2
C (n+1)/2 D none of these
65. The expression which access the (ij)th entry of m X n matrix stored in column major
form is
A m*(j-1)+i B n*(i-1)+j
C m*(n-j)+j D n*(m-i)+j
66. Which of the following is not the characteristic of a Relational database model
A Tables B Tree like structure
C Complex logical relationships D Records
67. In a relation between the entities the type and condition of the relation should be
specified. That is called as ______ attribute.
A Descriptive B Derived
C Recursive D Relative
68. Consider the grammar shown below
S→CC
C→cC | d
The grammar is
A LL(1) B SLR(1) but not LL (1)

C LALR (1) but not SLR (1) D LR(1) but not LALR(1)

69. Consider the translation scheme given below

S→TR
R→+T{print(‘+’);} R | є
T→num{(print(num.val);}
Here num is a tokan that represents an integer and num.val represents the corresponding
integer value for an input string ‘9+5+2’ this translation scheme will print

A 9+5+2 B 95+2+

C 952++ D ++95

70. The regular expression 0 * (10*)* denotes the same set as

A (1*0) * 1* B 0 + (0 + 10) *

C (0 + 1) * 10 (0 + 1) * D None of the above

71. IP Address 210.16.37.32 belongs to which class?

CO Page 8 of 12
 A Class A B Class B

C Class C D Class D

72. The system that can be used in both priority and non-priority mode is

A Carrier sense system B TDM

C Register insertion D all of these

73. The variable which can be accessed by all modules in a program are known as

A local variables B internal variables

C external variables D global variable

74. What do you call the tree if each node in a tree has value greater than every value in its
left subtree and has value less than every value in its right subtree?

A Complete Tree B Full Binary Tree

C Binary Search Tree D AVL Tree

75. The time required to insert an element in a stack with linked implementation is

A O(1) B O(log2n)

C O(n) D O(n log2n)

76. Which of the following sorting algorithm has the worst time complexity of n log n?
A quick sort B heap sort
C shell sort D bubble sort
77. The minimum number of comparison required to sort 5 element is
A 6 B 10
C 15 D 14
78. Which of the following data structure allows inserting data elements at rear and deleting
from front?
A Stack B Dequeue
C Queue D Binary Search Tree
79. Which of the following best describes sorting?
A accessing and processing each record B finding the location of record with a
exactly once given key
C arranging the data in some given D adding a new record to data
order structure
80. Which of the following is a prefix conversion of an expression A * (B + C) / D?
A ABC+*D/ B AB*CD/+
C *A+B/CD D /*A+BCD

CO Page 9 of 12
81. The function 𝑓(𝑧) of complex variable 𝑧 = 𝑥 + 𝑖𝑦, where 𝑖 = √−1 is given by
𝑓(𝑧) = 𝑥 2 − 𝑦 2 + 𝑖𝑣(𝑥, 𝑦). For this function to be analytic 𝑣(𝑥, 𝑦) should be
A 2𝑥𝑦 + constant B −2𝑥𝑦 + constant
C 𝑦 2 − 𝑥 2 + constant D 2𝑥𝑦 + (𝑦 2 /4) + constant
82. The series ∑∞ 𝑧 𝑛, for 𝑧 = 75 + 100𝑖, is
𝑛=0 𝑛!

A divergent B convergent
C oscillatory finitely D oscillatory infinitely
83. A student appearing in PGCET has probability 0.5 to qualify and the probability to
qualify for both PGCET and GATE is 0.3. What is the probability for a student of
qualify for GATE, if she has qualified for PGCET?
A 0.3 B 0.4
C 0.5 D 0.6
84. For a random variable 𝑋 with mean 𝜇 and standard deviation 𝜎, which of the
following is a correct Chebyshev’s inequality?
A 𝑃(|𝑋 − 𝜇| ≥ 𝑘𝜎) ≤ 1 − 𝑘 −2 B 𝑃(|𝑋 − 𝜇| ≤ 𝑘𝜎) ≤ 1 − 𝑘 −2
C 𝑃(|𝑋 − 𝜇| ≥ 𝑘𝜎) ≤ 𝑘 −2 D 𝑃(|𝑋 − 𝜇| ≤ 𝑘𝜎) ≤ 𝑘 −2
85. For the beta function 𝐵(𝑚 + 1, 𝑛) = _______

A 𝑚𝐵(𝑚, 𝑛)/𝑛 B 𝑚𝐵(𝑚, 𝑛)/(𝑚 + 𝑛)

C 𝑛𝐵(𝑚, 𝑛)/(𝑚 + 𝑛) D 𝑛𝐵(𝑚, 𝑛)/𝑚
86. For the inverse Laplace transform 𝐿−1 { 1 } = ______
𝑠2 −𝑤 2

A 𝑤 −1 cos(𝑤𝑡) B 𝑤 −1 sin(𝑤𝑡)
C 𝑤 −1 sinh(𝑤𝑡) D 𝑤 −1 cosh(𝑤𝑡)
87. 1; 0≤𝑡 ≤2
For function 𝑓(𝑡) = { 𝑡 ; 2 < 𝑡 ≤ 4 , its Heaviside unit step function
𝑡2; 𝑡>4
representation is
A (𝑡 2 − 𝑡)𝐻(𝑡 − 4) + (1 − 𝑡)𝐻(𝑡 − 2) − 𝐻(𝑡)
B (𝑡 2 + 𝑡)𝐻(𝑡 − 4) + (1 − 𝑡)𝐻(𝑡 − 2) − 𝐻(𝑡)
C (𝑡 2 + 𝑡)𝐻(𝑡 − 4) + (𝑡 − 1)𝐻(𝑡 − 2) + 𝐻(𝑡)
D (𝑡 2 − 𝑡)𝐻(𝑡 − 4) + (1 − 𝑡)𝐻(𝑡 − 2) + 𝐻(𝑡)
88. Which of the following measure of central tendency divides data equally in two
parts?
CO Page 10 of 12
 A Median B Mean
C Quartile D Mode
89. The particular integral of 𝑦 ′′ + 𝑦 = sin 𝑥 is,

A cos 𝑥 B sin 𝑥
C (−𝑥 cos 𝑥)/2 D (𝑥 cos 𝑥)/2
90. Using the separable variable method, the general solution of the partial differential
equation 𝑢𝑥 + 𝑢𝑡 + 𝑢(𝑥, 𝑡) = 0 is,

A 𝑢 = 𝑐𝑒 −𝑘𝑥 𝑒 (𝑘−1)𝑡 B 𝑢 = 𝑐𝑒 𝑘𝑥 𝑒 (𝑘−1)𝑡

C 𝑢 = 𝑐𝑒 𝑘𝑡 𝑒 (𝑘−1)𝑥 D 𝑢 = 𝑐𝑒 −𝑘𝑥 𝑒 −(𝑘−1)𝑡
91. For the integral 𝐼 = ∫ [(𝑥 2 − 𝑦 2 )𝑑𝑥 + (𝑥 2 + 𝑦 2 )𝑑𝑦], where 𝐶 is the triangle
𝐶
with vertices (0,0), (1,0) and (1,1), then 𝐼 = _______

A 1 1 B 1 1
∫ ∫ 2(𝑥 + 𝑦)𝑑𝑦 𝑑𝑥 ∫ ∫ 2(𝑥 − 𝑦)𝑑𝑦 𝑑𝑥
0 𝑥 0 𝑥

C 1 1 D 1 1
∫ ∫ 2(𝑥 − 𝑦)𝑑𝑥 𝑑𝑦 ∫ ∫ 2(𝑥 + 𝑦)𝑑𝑥 𝑑𝑦
0 𝑦 0 𝑦

92. 1 0 0
For the matrix [0 2 3], the eigenvalues are
0 1 4
A 1,2,4 B 1,2,3
C 1,1,5 D 0,1,3
93. For an (𝑚 × 𝑛) −matrix 𝐴 and (𝑛 × 𝑝) − matrix 𝐵,

A (𝐴𝐵)−1 = 𝐵 −1 𝐴−1 B 𝐴𝐵 is an (𝑚 × 𝑝) −matrix

C (𝐴𝐵)𝑇 = 𝐴𝑇 𝐵 𝑇 D 𝐵𝐴 is an (𝑚 × 𝑝) −matrix
94. The value of lim 1−𝑒 −2(1−𝑥) is
1−𝑥𝑒 −2(1−𝑥)
𝑥→1

A 2 B 3
C 2 D 3
3 2
95. The number of points at which the function 𝑓(𝑥, 𝑦) = 𝑥 3 − 𝑥2
−
𝑦2
has local
3 2 2
maxima is
A 1 B 2

C 3 D 0

CO Page 11 of 12
96. For the forward difference operator ∆, the backward difference operator ∇ and the
shift operator 𝐸, ∆ + ∇= _____
A 𝐸−1 B 1−𝐸

C 𝐸 + 𝐸 −1 D 𝐸 − 𝐸 −1

97. For the function 𝑓(𝑥) to have a local minima at a point ′𝑎′,
A 𝑓 ′ (𝑎) = 0 and 𝑓 ′′ (𝑎) = 0
B 𝑓 ′ (𝑎) = 0 and 𝑓 ′ (𝑎) changes sign from negative to positive
C 𝑓 ′ (𝑎) = 0 and 𝑓 ′ (𝑎) changes sign from positive to negative
D 𝑓 ′′ (𝑎) < 0
98. For 𝑢 = 𝑒 𝑥 2 −𝑦 2 at 𝑥 = 𝑦 = 1, 𝜕2𝑢 = _______
𝜕𝑥 2
A 1 B 2
C 4 D 6
99. For 𝑢 = sin−1(𝑥 + 𝑦), 𝑥𝑢𝑥 + 𝑦𝑢𝑦 = _______
A 1 B tan 𝑢
C tan 𝑢 (sec 2 𝑢 − 1) D 0

100. Let 𝐹⃗ (𝑥, 𝑦, 𝑧) = 𝑎𝑧𝑖̂ + 𝑏𝑦𝑗̂ − 𝑐𝑥𝑘̂ be a vector field, whose curl is zero. Then
necessarily
A 𝑎+𝑏−𝑐 =0 B 𝑎 = 𝑏 = −𝑐

C 𝑎 = −𝑐 D 𝑎=𝑐

CO Page 12 of 12