Turing Prep | Previous Year Questions | UGC NET CSE - June 2015

Question : 1

How many strings of 5 digits have the property that the sum of their digits is 7 ?

66

330

495

99

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 2

Considering an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die ?

\(\dfrac{22}{36} \\\)

\(\dfrac{12}{36} \\\)

\(\dfrac{14}{36} \\\)

\(\dfrac{6}{36}\)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 3

In how many ways can 15 indistinguishable fish be placed into 5 different ponds, so that each pond contains at least one fish ?

1001

3876

775

200

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 4

Consider the following statements:

(a) Depth-first search is used to traverse a rooted tree

(b) Pre-order, Post-order and Inorder are used to list the vertices of an ordered rooted tree.

(c) Huffman's algorithm is used to find an optimal binary tree with given weights

(d) Topological sorting provides a labelling such that the parents have larger labels than their children

Which one of the above statements is true?

(a) and (b)

(c) and (d)

(a), (b) and (c)

(a), (b), (c) and (d)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 5

Consider a Hamiltonian Graph(G) with no loops and parallel edges. Which of the following is true with respect to this graph (G)?

(a) \(\deg (v) \geq n/2\) for each vertex of \(G\)

(b) \(\mid E(G) \mid \geq 1/2 (n-1)(n-2)+2\) edges

(c) \(\deg(v) + \deg(w) \geq n\) for every \(𝑣\) and \(𝜔\) not connected by an edge

(a) and (b)

(b) and (c)

(a) and (c)

(a), (b) and (c)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 6

Consider the following statements:

(a) Boolean expressions and logic gates networks correspond to labelled acyclic digraphs

(b) Optimal boolean expressions may not correspond to simplest networks.

(c) Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression

Which of these statement(s) is/are correct?

(a) only

(b) only

(a) and (b)

(a), (b) and (c)

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 7

Consider a full-adder with the following input values :

(a) 𝑥 = 1,𝑦 = 0 and 𝐶_𝑖(carry input) = 0

(b) 𝑥 = 0,𝑦 = 1 and 𝐶_𝑖= 1

Compute the value of S(sum) and 𝐶_𝑜 (carry output) for the above input values :

𝑆=1,𝐶_𝑜=0 and 𝑆=0,𝐶_𝑜=1

𝑆=0,𝐶_𝑜=0 and 𝑆=1,𝐶_𝑜=1

𝑆=1,𝐶_𝑜=1 and 𝑆=0,𝐶_𝑜=0

𝑆=0,𝐶_𝑜=1 and 𝑆=1,𝐶_𝑜=0

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 8

"If my computations are correct and I pay the electric bill, then I will run out of money. If I don't pay the electric bill, the power will be turned off. Therefore, If I don't run out of money and the power is still on then my computations are incorrect."

Convert this argument into logical notations using the variables \(𝑐,𝑏,𝑟,𝑝\) for propositions of computations, electric bills, out of money and the power respectively. (Where ¬ means NOT).

\(\text{if } (c \wedge b) \rightarrow r \text{ and } \neg b \rightarrow \neg p, \text{ then } (\neg r \wedge p) \rightarrow \neg c\)

\(\text{if } (c \vee b) \rightarrow r \text{ and } \neg b \rightarrow \neg p, \text{ then } (r \wedge p) \rightarrow c\)

\(\text{if } (c \wedge b) \rightarrow r \text{ and } \neg p \rightarrow \neg b, \text{ then } (\neg r \vee p) \rightarrow \neg c\)

\(\text{if } (c \vee b) \rightarrow r \text{ and } \neg b \rightarrow \neg p, \text{ then } (\neg r \wedge p) \rightarrow \neg c\)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 9

Match the following :

\(\begin{array}{clcl} & \textbf{List-I} && \textbf{List-II} \\ \text{(a)}&(p \rightarrow q) \Leftrightarrow (\neg q \rightarrow \neg p) & \text{(i)} & \text{Contrapositive} \\ \text{(b)}& [(p \wedge q) \rightarrow r] \Leftrightarrow [p \rightarrow (q \rightarrow r)]& \text{(ii)} & \text{Exportation law} \\ \text{(c)} & (p \rightarrow q) \Leftrightarrow [(p \wedge \neg q) \rightarrow o] & \text{(iii)} & \text{Reduction as absurdum} \\ \text{(d)} & (p \leftrightarrow q) \Leftrightarrow [(p \rightarrow q) \wedge (q \rightarrow p)]& \text{(iv)} & \text{Equivalence} \\ \end{array}\)

Codes :

(a)-(i), (b)-(ii), (c)-(iii), (d)-(iv)

(a)-(ii), (b)-(iii), (c)-(i), (d)-(iv)

(a)-(iii), (b)-(ii), (c)-(iv), (d)-(i)

(a)-(iv), (b)-(ii), (c)-(iii), (d)-(i)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 10

Consider a proposition given as:

\(𝑥 ≥ 6\), if \(𝑥^2≥25\) and and its proof as:

If \(𝑥 ≥ 6\), then \(𝑥^2=𝑥.𝑥≥6.6=36≥25\)

Which of the following is correct with respect to the given proposition and its proof?

(a) The proof shows the converse

(b) The proof starts by assuming what is to be shown

(c) The proof is correct and there is nothing wrong

(a) only

(c) only

(a) and (b)

(b) only

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 11

What is the output of the following program: (Assume that the appropriate preprocessor directives are included and there is not syntax error)


main( )

    {   char S[]="ABCDEFGH";

        printf("%C", *(&S[3]));

        printf("%s", S+4);

        printf("%u", S);

    /*Base address of S is 1000 */

    }

ABCDEFGH1000

CDEFGH1000

DDEFGHH1000

DEFGH1000

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 12

Which of the following, in C++, is inherited in a derived class from base class?

constructor

destructor

data members

virtual methods

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 13

Given that 𝑥 = 7.5, 𝑗 = −1.0, 𝑛 = 1.0, 𝑚 = 2.0

the value of −−𝑥+𝑗==𝑥>𝑛>=𝑚 is:

0

1

2

3

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 14

Which of the following is incorrect in C++?

when we write overloaded function we must code the function for each usage

when we write function template we code the function only once

it is difficult to debug macros

templates are more efficient than macros

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 15

When the inheritance is private, the private methods in base class are _____ in the derived class (in C++).

inaccessible

accessible

protected

public

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 16

An Assertion is predicate expressing a condition we wish database to always satisfy. The correct syntax for Assertion is:

CREATE ASSERTION 'ASSERTION Name' CHECK 'Predicate'

CREATE ASSERTION 'ASSERTION Name'

CREATE ASSERTION, CHECK 'Predicate'

SELECT ASSERTION

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 17

Which of the following concurrency protocol ensues both conflict serializability and freedom from deadlock ?

(a) 2-phase locking

(b) Time phase ordering

Both (a) & (b)

(a) only

(b) only

Neither (a) nor (b)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 18

Drop Table cannot be used to drop a Table referenced by _______ constraint.

(a) Primary key (b) Sub key (c) Super key (d) Foreign key

(a)

(a), (b) and (c)

(d)

(a) and (d)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 19

Database application were directly built on top of file system to overcome the following drawbacks of using file-systems:

(a) Data redundancy and inconsistency

(b) Difficulty in accessing data

(c) Data isolation

(d) Integrity problems

(a)

(a) and (d)

(a), (b) and (c)

(a), (b), (c) and (d)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 20

For a weak entity set to be meaningful, it must be associated with another entity set in combination with some of their attribute values, is called as:

Neighbour Set

Strong Entity Set

Owner Entity Set

Weak Set

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 21

Consider the given graph

Its Minimum Cost Spanning Tree is ______

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 22

The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively. The post-order Traversal is ___________ .

dbefacg

debfagc

dbefcga

debfgca

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 23

Level order Traversal of a rooted Tree can be done by starting from root and performing :

Breadth First Search

Depth First Search

Root Search

Deep Search

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 24

The average case occurs in Linear Search Algorithm when :

The item to be searched is in some where middle of the Array

The item to be searched is not in the array

The item to be searched is in the last of t he array

The item to be searched is either in the last or not in the array

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 25

To determine the efficiency of an algorithm the time factor is measured by :

Counting micro seconds

Counting number of key operations

Counting number of statements

Counting kilobytes of algorithm

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 26

Which of the following protocols is an application layer protocol that establishes, manages and terminates multimedia sessions ?

Session Maintenance Protocol

Real-time Streaming Protocol

Real-time Transport Control Protocol

Session Initiation Protocol

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 27

Match the following port numbers with their uses:

\(\begin{array}{} & \textbf{List – I} & & \textbf{List – II} \\ \text{(a)} & 23 & (i) & \text{World wide web} \\ \text{(b)} & 25 & (ii) & \text{Remote login} \\ \text{(c)} & 80 & (iii) & \text{USENET news} \\ \text{(d)} & 119 & (iv) & \text{E-mail} \\ \end{array}\)

Codes :

\((a) - (iv), (b) - (i), (c) - (ii), (d) - (iii)\)

\((a) - (ii), (b) - (i), (c) - (iv), (d) - (iii)\)

\((a) - (ii), (b) - (iv), (c) - (iii), (d) - (i)\)

\((a) - (ii), (b) - (iv), (c) - (i), (d) - (iii)\)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 28

Which of the following is not associated with the session layer ?

Dialog control

Token management

Semantics of the information transmitted

synchronization

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 29

What is the size of the 'total length' field in 𝐼𝑃𝑣4 diagram ?

4 bits

8 bits

16 bits

32 bits

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 30

Which of the following is/are restriction(s) in classless addressing ?

The number of addresses needs to be a power of 2

The mask needs to be included in the address to define the block

The starting address must be divisible by the number of addresses in the block

All of the above

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 31

Match the following:

\(\begin{array}{} \text{(a)} & \text{Forelward Reference Table} & (i) & \text{Assembler directive} \\ \text{(b)}& \text{Mnemonic Table} &(ii) & \text{Uses array data structure} \\ \text{(c)} & \text{Segment Register Table} &(iii) & \text{Contains machine OP code} \\ \text{(b)}& \text{EQU} &(ii) & \text{Uses linked list data structure} \\ \end{array}\)

Codes :

\((a) - (ii), (b) - (iii), (c) - (iv), (d) - (i)\)

\((a) - (iii), (b) - (iv), (c) - (ii), (d) - (i)\)

\((a) - (iv), (b) - (i), (c) - (iii), (d) - (ii)\)

\((a) - (iv), (b) - (iii), (c) - (ii), (d) - (i)\)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 32

The translator which performs macro calls expansion is called :

Macro processor

Micro pre-processor

Macro pre-processor

Dynamic linker

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 33

If all the production rules have single non-terminal symbol on the left side, the grammar defined is :

Context free grammar

Context sensitive grammar

Unrestricted grammar

Phase grammar

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 34

Which one of the following is false ?

LALR parser is Bottom-Up parser

A parsing algorithm which performs a left to right scanning and a right most deviation is RL(1)

LR parser is Bottom-Up parser

In LL(1), the 1 indicates that there is a one symbol look-ahead

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 35

Which phase of compiler generates stream of atoms ?

Syntax Analysis

Lexical Analysis

Code Generation

Code Optimization

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 36

A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cylinders 12,26,24,4,42,8 and 50 in that order. The driver is currently serving a request at a cylinder 24. A seek takes 6 msec per cylinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm ?

0.984 sec

0.396 sec

0.738 sec

0.42 sec

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 37

Let \(𝑃−𝑖\) and \(𝑃_𝑗\) two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes \(𝑝_𝑖\) and \(𝑃_𝑗\) which of the conditions are not true?

\(R(P_i) \cap W(P_j) = \Phi\)

\(W(P_i) \cap R(P_j) = \Phi\)

\(R(P_i) \cap R(P_j) = \Phi\)

\(W(P_i) \cap W(P_j) = \Phi\)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 38

A LRU page replacement is used with 4 page frames and eight pages. How many page faults will occur with the reference string 0172327103 if the four frames are initially empty ?

6

7

5

8

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 39

What does the following command do?

grep -vn "abc" x

It will print all of the lines in the file x that match the search string "abc"

It will print all of the lines in file x that do not match the search string "abc"

It will print the total number of lines in the file x that match the search string "abc"

It will print the specific line numbers of the file x in which there is a match for string "abc"

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 40

The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure ?

File descriptor table

System call state

Scheduling parameters

Kernel stack

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 41

Match the following:

\(\begin{array}{} \text{(a)} & \text{Size-oriented} &(i) & \text{uses number of external interfaces as one of} \\ &\text{metrics}&& \text{the measurement parameters} \\ \text{(b)} & \text{Function-oriented} &(ii) & \text{originally designed to be applied to} \\ & \text{metrics} && \text{business information systems} \\ \text{(c)} & \text{Extended function} &(iii)& \text{derived by normalizing quality and/or productivity} \\ & \text{point metrics} && \text{measures by considering the size of the software} \\ \text{(d)} & \text{Function point} &(iv) & \text{uses algorithm characteristics as one of} \\ & && \text{the measurement parameter} \\ \end{array}\)

Codes :

\((a) - (iii),(b) - (iv),(c) - (i),(d) - (ii)\)

\((a) - (ii),(b) - (i),(c) - (iv),(d) - (iii)\)

\((a) - (iv),(b) - (ii),(c) - (iii),(d) - (i)\)

\((a) - (iii),(b) - (i),(c) - (iv),(d) - (ii)\)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 42

Which of the testing strategy requirements established during requirements analysis are validated against developed software ?

validation testing

integration testing

regression testing

system testing

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 43

Which process model is also called as classic life cycle model ?

Waterfall model

RAD model

Prototyping model

Incremental model

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 44

Cohesion is an extension of :

Abstraction concept

Refinment concept

Information hiding concept

Modularity

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 45

Which one from the following is highly associated activity of project planning ?

Keep track of the progress

Compare the actual and planned progress and costs

Identify the activities, milestones and deliverables produced by a project

Both B and C

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 46

In the case of parallelization, Amdahl's law states that if \(𝑃\) is the proportion of a program that can be made parallel and \((1−𝑃)\) is the proportion that cannot be parallelized, then the maximum speed-up that can be achieved by using \(𝑁\) processors is:

\(\dfrac{1}{(1-P)+N.P} \\\)

\(\dfrac{1}{(N-1)P+P} \\\)

\(\dfrac{1}{(1-P)+\frac{P}{N}} \\\)

\(\dfrac{1}{P+\frac{(1-P)}{N}}\)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 47

Which of the following statements is incorrect for Parallel Virtual Machine (PVM)?

The PVM communication model provides asynchronous blocking send, asynchronous blocking receive, amd non-blocking receive function

Message buffers are allocated dynamically

The PVM communication model assumes that any task can send a message to any order PVM task and that there is no limit to the size or number of such messages

In PVM model, the message order is not preserved

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 48

Which of the following algorithms sort 𝑛 integers, having the range \(0\) to \((𝑛^2−1)\), in ascending order in \(𝑂(𝑛)\) time?

Selection sort

Bubble sort

Radix sort

Insertion sort

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 49

Which of the following statements is false about weak entity set ?

Weak entities can be deleted automatically when their strong entity is deleted

Weak entity set avoids the data duplication and consequent possible inconsistencies caused by duplicating the key of the string entity

A weak entity set has no primary keys unless attributes of the strong entity set on which it depends are included

Tuples in a weak entity set are not partitioned according to their relationship with tuples with a strong entity set

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 50

Which of the following is not valid with reference to Message Passing Interface(MPI) ?

MPI can run on any hardware platform

The programming model is a distributed memory model

All parallelism is implicit

MPI- Comm - Size returns the total number of MPI processes in specified communication

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

UGC NET CSE - June 2015 | PAPER - II