Turing Prep | Previous Year Questions | UGC NET CSE - August 2016

Question : 1

The Boolean function \([\sim (\sim p \wedge q)\wedge \sim(\sim p \wedge \sim q)] \vee (p \wedge r)\) is equal to the Boolean function :

\(q\)

\(p \wedge r\)

\(p \vee q\)

\(p\)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 2

Let us assume that you construct ordered tree to represent the compound proposition \((\sim (p \wedge q)) \leftrightarrow (\sim p \vee \sim q)\).

Then, the prefix expression and post-fix expression determined using this ordered tree are given as _____ and ______ respectively.

\(\leftrightarrow \sim \wedge pq \vee \sim \sim pq, pq \wedge \sim p \sim q \sim ∨ \leftrightarrow\)

\(\leftrightarrow \sim \wedge pq \vee \sim p \sim q, pq \wedge \sim p \sim q \sim \vee \leftrightarrow\)

\(\leftrightarrow \sim \wedge pq \vee \sim \sim pq, pq \wedge \sim p \sim \sim q \vee \leftrightarrow\)

\(\leftrightarrow \sim \wedge pq \vee \sim p \sim q, pq\wedge \sim p \sim \sim q \vee \leftrightarrow\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 3

Let \(𝐴\) and \(𝐵\) be sets in a finite universal set \(𝑈\). Given the following : \(|A - B|, |A \bigoplus B|, |A| + |B|\) and \(|A \cup B|\) Which of the following is in order of increasing size ?

\(|A - B| < |A \bigoplus B| < |A| + |B| < |A \cup B|\)

\(|A \bigoplus B| < |A - B| < |A \cup B| < |A| + |B|\)

\(|A \bigoplus B| < |A| + |B| < |A - B| < |A \cup B|\)

\(|A - B| < |A \bigoplus B| < |A \cup B| < |A| + |B|\)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 4

What is the probability that a randomly selected bit string of length 10 is a palindrome ?

\(\frac 1 {64}\)

\(\frac 1 {32}\)

\(\frac 1 8\)

\(\frac 1 4\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 5

Given the following graphs :

Which of the following is correct ?

G₁ contains Euler circuit and G₂ does not contain Euler circuit.

G₁ does not contain Euler circuit and G₂ contains Euler circuit.

Both G₁ and G₂ do not contain Euler circuit.

Both G₁ and G₂ contain Euler circuit.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 6

The octal number 326.4 is equivalent to

(214.2)₁₀ and (D6.8)₁₆

(212.5)₁₀ and (D6.8)₁₆

(214.5)₁₀ and (D6.8)₁₆

(214.5)₁₀ and (D6.4)₁₆

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 7

Which of the following is the most efficient to perform arithmetic operations on the numbers ?

Sign-magnitude

1’s complement

2’s complement

9’s complement

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 8

The Karnaugh map for a Boolean function is given as

The simplified Boolean equation for the above Karnaugh Map is

\(AB + CD + A\bar{B} + AD\)

\(AB + AC + AD + BCD\)

\(AB + AD + BC + ACD\)

\(AB + AC + BC + BCD\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 9

Which of the following logic operations is performed by the following given combinational circuit ?

EXCLUSIVE-OR

EXCLUSIVE-NOR

NAND

NOR

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 10

Match the following :

\(\begin{array}{clcl} & \textbf{List-I} && \textbf{List-II} \\ \text{a.} & \text{Controlled inverter} & \text{i.} & \text{a circuit that can add 3 bits} \\ \text{b.} & \text{Full adder} & \text{ii.} & \text{a circuit that can add two binary numbers} \\ \text{c.} & \text{Half adder} & \text{iii.} & \text{a circuit that transmits a binary word or} \\ &&& \text{its 1’s complement} \\ \text{d.} & \text{Binary adder} & \text{iv.} & \text{a logic circuit that adds 2 bits} \\ \end{array}\)

Codes :

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

a-ii, b-iv, c-i, d-ii

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

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 11

Given \(𝑖=0,𝑗=1,𝑘=−1\)

\( x = 0.5, y = 0.0\)

What is the output of given \(‘C’\) expression?

x * 3 & & 3 || j | k

- 1

0

1

2

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 12

The following ‘C’ statement :

int * f[ ]( ) ;

declares :

A function returning a pointer to an array of integers.

Array of functions returning pointers to integers.

A function returning an array of pointers to integers.

An illegal statement.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 13

If a function is friend of a class, which one of the following is wrong ?

A function can only be declared a friend by a class itself.

Friend functions are not members of a class, they are associated with it.

Friend functions are members of a class.

It can have access to all members of the class, even private ones.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 14

In C++, polymorphism requires :

Inheritance only

Virtual functions only

References only

Inheritance, Virtual functions and references

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 15

A function template in C++ provides _____ level of generalization.

4

3

2

1

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 16

DBMS provides the facility of accessing data from a database through

DDL

DML

DBA

Schema

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 17

Relational database schema normalization is NOT for :

reducing the number of joins required to satisfy a query.

eliminating uncontrolled redundancy of data stored in the database.

eliminating number of anomalies that could otherwise occur with inserts and deletes.

ensuring that functional dependencies are enforced.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 18

Consider the following statements regarding relational database model :

(a) NULL values can be used to opt a tuple out of enforcement of a foreign key.

(b) Suppose that table T has only one candidate key. If Q is in 3NF, then it is also in BCNF.

(c) The difference between the project operator (Π) in relational algebra and the SELECT keyword in SQL is that if the resulting table/set has more than one occurrences of the same tuple, then Π will return only one of them, while SQL SELECT will return all.

One can determine that :

(a) and (b) are true.

(a) and (c) are true.

(b) and (c) are true.

(a), (b) and (c) are true.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 19

Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram :

If different symbols stand for different values (e.g., t 1 is definitely not equal to t2 ), then

which of the above could not be the relationship set for the E-R diagram ?

I only

I and II only

II only

I, II and III

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 20

Consider a database table R with attributes A and B. Which of the following SQL queries is illegal ?

SELECT A FROM R;

SELECT A, COUNT(*) FROM R;

SELECT A, COUNT(*) FROM R GROUP BY A;

SELECT A, B, COUNT(*) FROM R GROUP BY A, B;

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 21

Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the following operation can not be implemented in O(1) time ?

Insertion at the front of the linked list.

Insertion at the end of the linked list.

Deletion of the front node of the linked list.

Deletion of the last node of the linked list.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 22

Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j) | 1 < i < 12, 1 < j < 12}. There is an edge between (a, b) and (c, d) if |a – c| < 1 or | b – d | < 1. The number of edges in this graph is

726

796

506

616

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 23

The runtime for traversing all the nodes of a binary search tree with n nodes and printing them in an order is

\(O(lg \ n) \)

\(O(n \ lg \ n) \)

\(O(n)\)

\(O(n^2)\)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 24

Consider the following statements :

S₁ : A queue can be implemented using two stacks.

S₂ : A stack can be implemented using two queues.

Which of the following is correct ?

S₁ is correct and S₂ is not correct.

S₁ is not correct and S₂ is correct.

Both S₁ and S₂ are correct.

Both S₁ and S₂ are not correct.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 25

Given the following prefix expression :

* + 3 + 3 ↑ 3 + 3 3 3

What is the value of the prefix expression ?

2178

2199

2205

2232

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 26

Which of the following statements is not true with respect to microwaves ?

Electromagnetic waves with frequencies from 300 GHz to 400 THz.

Propagation is line-of-sight.

Very high-frequency waves cannot penetrate walls.

Use of certain portions of the band requires permission from authorities.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 27

In a fast Ethernet cabling, 100 Base-TX uses ____ cable and maximum segment size is _____.

twisted pair, 100 metres

twisted pair, 200 metres

fibre optics, 1000 metres

fibre optics, 2000 metres

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 28

A network with bandwidth of 10 Mbps can pass only an average of 12,000 frames per minute with each frame carrying an average of 10,000 bits. What is the throughput of this network ?

1 Mbps

2 Mbps

10 Mbps

12 Mbps

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 29

Match the following :

\(\begin{array}{clcl} & \textbf{List-I} && \textbf{List-II} \\ \text{a.} & \text{Session layer} & \text{i.} & \text{Virtual terminal software} \\ \text{b.} & \text{Application layer} & \text{ii.} & \text{Semantics of the information transmitted} \\ \text{c.} & \text{Presentation layer} & \text{iii.} & \text{Flow Control} \\ \text{d.} & \text{Transport Layer} & \text{iv.} & \text{Manage dialogue Control} \\ \end{array}\)

Codes :

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

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

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

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

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 30

Which of the following protocols is used by email server to maintain a central repository that can be accessed from any machine ?

POP3

IMAP

SMTP

DMSP

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 31

The number of strings of length 4 that are generated by the regular expression (0⁺ 1⁺ | 2⁺ 3⁺ )^*, where | is an alternation character and {+, *} are quantification characters, is :

08

09

10

12

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 32

The content of the accumulator after the execution of the following 8085 assembly language program, is

MVI A, 35H

MOV B, A

STC

CMC

RAR

XRA B

00H

35H

EFH

2FH

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 33

In compiler optimization, operator strength reduction uses mathematical identities to replace slow math operations with faster operations. Which of the following code replacements is an illustration of operator strength reduction ?

Replace P + P by 2 * P or Replace 3 + 4 by 7.

Replace P * 32 by P < < 5

Replace P * 0 by 0

Replace (P < <4) – P by P * 15

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 34

Which of the following are the principles tasks of the linker ?

I. Resolve external references among separately compiled program units.

II. Translate assembly language to machine code.

III. Relocate code and data relative to the beginning of the program.

IV. Enforce access-control restrictions on system libraries.

I and II

I and III

II and III

I and IV

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 35

Which of the following is FALSE ?

The grammar S → aS|aSbS|∈, where S is the only non-terminal symbol, and ∈ is the null string, is ambiguous.

An unambiguous grammar has same left most and right most derivation.

An ambiguous grammar can never be LR(k) for any k.

Recursive descent parser is a top-down parser.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 36

Consider a system with seven processes A through G and six resources R through W. Resource ownership is as follows :

process A holds R and wants T

process B holds nothing but wants T

process C holds nothing but wants S

process D holds U and wants S & T

process E holds T and wants V

process F holds W and wants S

process G holds V and wants U

Is the system deadlocked ? If yes, ______ processes are deadlocked.

No

Yes, A, B, C

Yes, D, E, G

Yes, A, B, F

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 37

Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, _____ number of page faults occur with the reference string.

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

11

12

10

9

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 38

Consider a system having ‘m’ resources of the same type. These resources are shared by three processes P₁ , P₂ and P₃ which have peak demands of 2, 5 and 7 resources respectively. For what value of ‘m’ deadlock will not occur ?

70

14

13

7

Correct Answer : A or B or C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 39

Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All jobs entered in Ready queue at time zero. They must run in _____ order to minimize average response time if 3 < x < 5.

B, A, D, E, C

C, E, D, B, A

E, D, C, B, A

C, B, A, E, D

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 40

Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) algorithm, then _____ context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted).

3

4

2

5

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 41

Which of the following is used to determine the specificity of requirements ?

(a) \(\frac {n_1} {n_2}\) (b) \(\frac {n_2} {n_1}\)

(c) \(n_1 + n_2\) (c) \(n_1 - n_2\)

Where \(n_1\) is the number of requirements for which all reviewers have identical interpretations, \(n_2\) is number of requirements in a specification.

(a)

(b)

(c)

(d)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 42

The major shortcoming of waterfall model is

the difficulty in accommodating changes after requirement analysis.

the difficult in accommodating changes after feasibility analysis.

the system testing.

the maintenance of system.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 43

The quick design of a software that is visible to end users leads to _____.

iterative model

prototype model

spiral model

waterfall model

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 44

For a program of k variables, boundary value analysis yields ______ test cases.

4k – 1

4k

4k + 1

2^k – 1

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 45

The extent to which a software performs its intended functions without failures, is termed as

Robustness

Correctness

Reliability

Accuracy

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 46

An attacker sits between the sender and receiver and captures the information and retransmits to the receiver after some time without altering the information. This attack is called as _____.

Denial of service attack

Masquarade attack

Simple attack

Complex attack

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 47

_______ is subject oriented, integrated, time variant, nonvolatile collection of data in support of management decisions.

Data mining

Web mining

Data warehouse

Database Management System

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 48

In Data mining, classification rules are extracted from _______.

Data

Information

Decision Tree

Database

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 49

Discovery of cross sales opportunities is called as _____.

Association

Visualization

Correlation

Segmentation

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 50

In Data mining, ______ is a method of incremental conceptual clustering.

STRING

COBWEB

CORBA

OLAD

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

UGC NET CSE - August 2016 | PAPER - II