T.J.S.

ENGINEERING COLLEGE
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

FACULTY RECRUITMENT TEST - APRIL -2017

1.Consider the following rooted tree with the vertex labeled P as the root.

The order in which the nodes are visited during an in-order traversal of the tree is

(A) SQPTRWUV (B) SQPTUWRV

(C) SQPTWUVR (D) SQPTRUWV

2.A max-heap is a heap where the value of each parent is greater than or equal to the value of its
children. Which of the following is a max-heap?
3.Which of the following statements is/are TRUE for undirected graphs?

P: Number of odd degree vertices is even.

Q: Sum of degrees of all vertices is even.

(A) P only (B) Q only

(C) Both P and Q (D) Neither P nor Q

4. A system uses 3 page frames for storing process pages in main memory. It uses the Least
Recently Used (LRU) page replacement policy. Assume that all the page frames are initially
empty. What is the total number of page faults that will occur while processing the page
reference string given below?
4, 7, 6, 1, 7, 6, 1, 2, 7, 2

___________________________________________

5.Given the language L-{ab, aa, baa}, which of the following strings are in L*?

1) abaabaaabaa 2) aaaabaaaa
3) baaaaabaaaab 4) baaaaabaa

(A) 1,2 and 3 (B) 2,3 and 4

(C) 1,2 and 4 (D) 1,3 and 4

6.Which of the following transport layer protocols is used to support electronic mail?

(A) SMTP (B) IP

(C) TCP (D) UDP

7.What will be the output of the following C program segment?

Char inChar = ‘A’ ;

switch (inChar ) {

case ‘A’ : printf (“Choice A\ n”);

case ‘B’ :

case ‘C’ : print f(“Choice B”);

case ‘D’ :

case ‘E’ :

default : printf (“No Choice”) ; }

(A) No choice (B) Choice A

(C) Choice A Choice B No choice (D) Program gives no output as it is erroneous

8.Which of the following is TRUE?

(A) Every relation is 3NF is also in BCNF

(B) A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on

every key of R

(C) Every relation in BCNF is also in 3NF

(D) No relation can be in both BCNF and 3NF

9.Consider the 3 process, P1, P2 and P3 shown in the table.

Process Arrival time Burst time

P1 0 5
P2 1 7
P3 3 4
The completion order of the 3 processes under the policies FCFS and RR2 (round robin
scheduling with CPU quantum of 2 time units) are

(A) FCFS: P1, P2, P3 RR2: P1, P2, P3

(B) FCFS: P1, P3, P2 RR2: P1, P3, P2
(C) FCFS: P1, P2, P3 RR2: P1, P3, P2
(D) FCFS: P1, P3, P2 RR2: P1, P2, P3

10.A system is in the safe state if

(A) the system can allocate resources to each process in some order and still avoid a deadlock

(B) there exist a safe sequence

(C) both (a) and (b)

(D) none of the mentioned

11.Physical memory is broken into fixed-sized blocks called ________.

(A) frames (B) pages

(C) backing store (D) None of these

12. ………………… is preferred method for enforcing data integrity

(A) Constraints (B) Stored Procedure
(C) Triggers (D) Cursors

13.To eliminate duplicate rows ……………… is used

(A) NODUPLICATE B) ELIMINATE
(C) DISTINCT (D) None of these
14. A simple cabling method, known as the ............ topology, allows about 30 computers on
a maximum cable length of about 600 feet.
(A) Star (B) Ring
(C) Bus (D) Tree

15.The ........................ layer is provided by the program that uses TCP/IP for
communication.
A) Transport B) Application
C) Internetwork D) Network interface

16.A/An .................... routing scheme is designed to enable switches to react to changing traffic
patterns on the network.

A) static routing B) fixed alternate routing

C) adaptive routing D) dynamic routing

17.Push down machine represents

A) Type 0 Grammar B) Type 1 Grammar
C) Type 2 Grammar D) Type 3 Grammar

18.All strings having equal number of a and b can be recognized by

A) DFA B) NDFA C) PDA D)All of these

19.write a C Program to find the Armstrong numbers from 1 to 1000.

20.Write a C program to swap two numbers without using third variable