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

Question : 1

For the 8 bit word 00111001,the check bits stored with it would we 0111. Suppose when the word is read from memory, the check bits are calculated to be 1101. What is the data word that was read from memory?

10011001

00011001

00111000

11000110

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 2

Consider a 32-bit microprocessor, with a 16-bit external data bus, driven by an 8 MHz input clock. Assume that this microprocessor has a bus cycle whose minimum duration equals four input clock cycles. What is the maximum data transfer rate for this microprocessor ?

8×10⁶ bytes/sec

4×10⁶ bytes/sec

16×10⁶ bytes/sec

4×10⁹ bytes/sec

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 3

The RST 7 instruction in 8085 microprocessor is equal to

CALL 0010 H

CALL 0034 H

CALL 0038 H

CALL 003C H

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 4

The equivalent hexadecimal notation for octal number 2550276 is

FADED

AEOBE

ADOBE

ACABE

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 5

The CPU of a system having 1 MIPS execution rate needs 4 machine cycles on an average for executing an instruction. The fifty percent of the cycles use memory bus. A memory read/write employs one machine cycle. For execution of the programs, the system utilizes 90% of the CPU time. For block data transfer, an IO device is attached to the system while CPU executes the background programs continuously. What is the maximum IO data transfer rate if programmed IO data transfer technique is used ?

500 Kbytes/sec

2.2 Mbytes/sec

125 Kbytes/sec

250 Kbytes/sec

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 6

The number of flip-flops required to design a modulo -272 counter is

8

9

27

11

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 7

Let 𝐸₁ and 𝐸₂ be two entities in E-R diagram with simple single valued attributes. 𝑅₁ and 𝑅₂ are two relationships between 𝐸₁ and 𝐸₂ where 𝑅₁ is one-many and 𝑅₂ is many-many. 𝑅₁ and 𝑅₂ do not have any attribute of their own. How many minimum number of tables are required to represent this situation in the Relational Model ?

4

3

2

1

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 8

The STUDENT information in a university stored in the relation STUDENT (Name, SEX, Marks, DEPT_Name).

Consider the following SQL Query:


SELECT DEPT_Name from STUDENT where SEX='M'

group by DEPT_Name having avg(Marks)>SELECT avg(Marks) from STUDENT

It returns the name of the department for which :

The average marks of male students is more than the average marks of students in the same department

The average marks of male students is more than the average marks of students in the university

The average marks of male students is more than the average marks of male students in the university

The average marks of students is more than the average marks of male students in the university

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 9

Which one of the following statements about normal forms is FALSE ?

Lossless, dependency-preserving decomposition into 3NF is always possible

Lossless, dependency-preserving decomposition into BCNF is always possible

Any relation with two attributes is in BCNF

BCNF is stricter than 3NF

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 10

The Relation
Vendor Order (V_no, V_ord_no, V_name, Qty_sup, unit_price)
is in 2NF because :

Non_key attribute V_name is dependent on V_no which is part of composite key

Non_key attribute V_name is dependent on Qty_sup

Key attribute Qty_sup is dependent on primary key unit_price

Key attribute V_ord_no is dependent on primary key unit_price

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 11

The relation schemas 𝑅1 and 𝑅2 form a Lossless join decomposition of 𝑅 if and only if

(a) $R_1 \cap R_2 \twoheadrightarrow (R_1-R_2)$

(b) $R_1 \rightarrow R_2$

(c) $R_1 \cap R_2 \twoheadrightarrow (R_2-R_1)$

(d) $R_2 \rightarrow R_1 \cap R_2$

Codes :

(a) and (b) happens

(a) and (d) happens

(a) and (c) happens

(b) and (c) happens

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 12

In the indexed scheme of blocks to a file, the maximum possible size of the file depends on :

The number of blocks used for index and the size of index

Size of Blocks and size of Address

Size of index

Size of block

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 13

Give the number of principal vanishing point(s) along with their direction for the standard prospective transformation :

Only one in the direction K

Two in the directions i and j

Three in the directions I, J and K

Only two in the directions J and K

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 14

Consider a triangle A(0,0), B(1, 1) and C(5, 2). The triangle has to be rotated by an angle of 45^𝑜 about the point P(-1, -1). What shall be the coordinates of new triangle ?

$A' = (1, \sqrt{2}-1), B' = (-1, 2\sqrt{2}-1) \text{ and } C'=\bigl(3 \sqrt{2} -1, \frac{9}{2} \sqrt{2}-1 \bigr)$

$A' = (1, \sqrt{2}-1), B' = (2\sqrt{2}-1, -1) \text{ and } C'=\bigl(3 \sqrt{2} -1, \frac{9}{2} \sqrt{2}-1 \bigr)$

$A' = (-1, \sqrt{2}-1), B' = (-1, 2\sqrt{2}-1) \text{ and } C'=\bigl(3 \sqrt{2} -1, \frac{9}{2} \sqrt{2}-1 \bigr)$

$A' = (\sqrt{2}-1,-1) B' = (-1, 2\sqrt{2}-1) \text{ and } C'=\bigl(3 \sqrt{2} -1, \frac{9}{2} \sqrt{2}-1 \bigr)$

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 15

The process of dividing an analog signal into a string of discrete outputs, each of constant amplitude, is called :

Strobing

Amplification

Conditioning

Quantization

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 16

Which of the following is not a basic primitive of the Graphics Kernel System (GKS) ?

POLYLINE

POLYDRAW

FILL AREA

POLYMARKER

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 17

Which of the following statements is/are incorrect ?

(a) Mapping the co-ordinates of the points and lines that form the picture into the appropriate co-ordinates on the device or workstation is known as viewing transformation

(b) The right-handed cartesian co-ordinates system in whose co-ordinates we describe the picture is known as world co-ordinate system

(c) The co-ordinate system that corresponds to the device or workstation where the image is to be displayed is known as physical device co-ordinate system

(d) Left-handed co-ordinate system in which the display area of the virtual display device corresponds to the unit (∣𝑥∣) square whose lower left-hand corner is at the origin of the co-ordinate system, is known as normalized device co-ordinate system

Codes :

(a) only

(a) and (b)

(c) only

(d) only

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 18

Match the following :

$\begin{array}{clcl} & \textbf{List-I} & & \textbf{List-II}\\ \text{(a)} & \text{Flood Gun} & \text{(i)} & \text{An electron gun designed to flood the}\\ &&& \text{entire screen with electrons.} \\ \text{(b)} & \text{Collector} & \text{(ii)}& \text{Partly energized by flooding gun, stores} \\ &&&\text{the charge generated by the writing gun.} \\ \text{(c)} & \text{Ground} & \text{(iii)} & \text{Used to discharge the collector.} \\ \text{(d)} & \text{Phosphorous Grains} & \text{(iv)} & \text{Used in memory - tube display and similar} \\ &&&\text{to those used in standard CRT.} \\ \text{(e)} & \text{Writing Gun System} & \text{(v)} & \text{Used in memory - tube display and basically} \\&&& \text{the same as the electron gun used in a } \\ &&&\text{conventional CRT.} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 19

Minimal deterministic finite automaton for the language $L=\{0^n \mid n \geq 0, n \neq 4 \}$ will have :

1 final state among 5 states

4 final states among 5 states

1 final state among 6 states

5 final state among 6 states

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 20

The regular expression corresponding to the language L where

$L=\{ x \in \{0,1\}^* \mid x \text{ ends with 1 and does not contain substring 00 } \}$

(1+01)^* (10+01)

(1+01)^* 01

(1+01)^* (1+01)

(10+01)^* 01

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 21

The transition function for the language $L=\{w \mid n_a (w) \text{ and } n_b(w) \text{ are both odd} \}$ is given by:

𝛿(𝑞₀,𝑎)=𝑞₁	;	𝛿(𝑞₀,𝑏)=𝑞₂
𝛿(𝑞₁,𝑎)=𝑞₀	;	𝛿(𝑞₁,𝑏)=𝑞₃
𝛿(𝑞₂,𝑎)=𝑞₃	;	𝛿(𝑞₂,𝑏)=𝑞₀
𝛿(𝑞₃,𝑎)=𝑞₂	;	𝛿(𝑞₃,𝑏)=𝑞₁

The initial and final states of the automata are

𝑞₀ and 𝑞₀ respectively

𝑞₀ and 𝑞₁ respectively

𝑞₀ and 𝑞₂ respectively

𝑞₀ and 𝑞₃ respectively

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 22

The casual form of the disjunctive normal form ¬𝐴 ∨ ¬𝐵 ∨ ¬𝐶 ∨ 𝐷 is :

𝐴 ∧ 𝐵 ∧ 𝐶 ⇒ 𝐷

𝐴 ∨ 𝐵 ∨ 𝐶 ∨ 𝐷 ⇒ 𝑡𝑟𝑢𝑒

𝐴 ∧ 𝐵 ∧ 𝐶 ∧ 𝐷 ⇒ 𝑡𝑟𝑢𝑒

𝐴 ∧ 𝐵 ∧ 𝐶 ∧ 𝐷 ⇒ 𝑓𝑎𝑙𝑠𝑒

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 23

Which of the following is false for the programming language PROLOG ?

A PROLOG variable can only be assigned to a value once

PROLOG is a strongly typed language

The scope of a variable in PROLOG is a single clause or rule

The scope of a variable in PROLOG is a single query

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 24

Which one of the following is true ?

The resolvent of two Horn clauses is not a Horn clause

The resolvent of two Horn clauses is a Horn clause

If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or non-null goal

If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or null goal

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 25

Which transmission technique guarantees that data packets will be received by the receiver in the same order in which they were sent by the sender ?

Broadcasting

Unicasting

Packet switching

Circuit switching

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 26

Which one of the following control fields in TCP header is used to specify whether the sender has no more data to transmit ?

FIN

RST

SYN

PSH

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 27

Which are two modes of IP security ?

Transport and certificate

Transport and tunnel

Certificate and tunnel

Preshared and transport

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 28

A message "COMPUTERNETWORK" encrypted (ignore quotes) using columnar transposition cipher with a key "LAYER". The encrypted message is :

CTTOEWMROPNRUEK

MROUEKCTTPNROEW

OEWPNRCTTUEKMRO

UEKPNRMROOEQCTT

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 29

Suppose a digitazed voice channel is made by digitizing 8 kHz bandwidth analog voice signal. It is required to sample the signal at twice the highest frequency (two samples per hertz). What is the bit rate required, if it is assumed that each sample required 8 bits ?

32 kbps

64 kbps

128 kbps

256 kbps

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 30

The minimum payload of a TCP segment is :

65,535

65,515

65,495

65,475

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 31

An all-pairs shortest-paths problem is efficiently solved using :

Dijkstra's algorithm

Bellman-Ford algorithm

Kruskal algorithm

Floyd-Warshall algorithm

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 32

The travelling salesman problem can be solved in :

Polynomial time using dynamic programming algorithm

Polynomial time using branch-and-bound algorithm

Exponential time using dynamic programming algorithm or branch-and-bound algorithm

Polynomial time using back tracking algorithm

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 33

Which of the following is asymptotically smaller ?

$lg(lg*n) $

$lg*(lgn) $

$lg(n!) $

$lg*(n!)$

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 34

Consider a hash table of size m = 100 and the hash function h(k) = floor (m(kA mod 1)) for $A=\frac{ (\sqrt{5}-1)}{2} = 0.618033$. Compute the location to which the key k = 123456 is placed in hash table.

77

82

88

89

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 35

Let $𝑓(𝑛)$ and $𝑔(𝑛)$ be asymptotically non-negative functions. Which of the following is correct ?

$𝜃(𝑓(𝑛)∗𝑔(𝑛))=𝑚𝑖𝑛(𝑓(𝑛),𝑔(𝑛)) $

$𝜃(𝑓(𝑛)∗𝑔(𝑛))=𝑚𝑎𝑥(𝑓(𝑛),𝑔(𝑛)) $

$𝜃(𝑓(𝑛)+𝑔(𝑛))=𝑚𝑖𝑛(𝑓(𝑛),𝑔(𝑛)) $

$𝜃(𝑓(𝑛)+𝑔(𝑛))=𝑚𝑎𝑥(𝑓(𝑛),𝑔(𝑛))$

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 36

The number of nodes in height h in any n-element heap is :

$h$

$z^h$

ceil $\biggl(\frac{n}{z^h} \biggr)$

ceil $\biggl(\frac{n}{z^{h+1}} \biggr)$

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 37

In Java, when we implement an interface method, it must be declared as :

Private

Protected

Public

Friend

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 38

The Servlet Response interface enables a servlet to formulate a response for a client using the method _________ .

void log(Exception e, String s)

void destroy()

int get ServerPort()

void set ContextType(String Type)

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 39

Which one of the following is correct ?

Java applets cannot be written in any programming language

An applet is not a small program

An applet can be run on its own

Applets are embedded in another applications

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 40

In XML we can specify the frequency of an element by using the symbols :

+*!

#*!

+*?

-*?

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 41

In XML, DOCTYPE declaration specifies to include a reference to _______ file.

Document type Definition

Document type declaration

Document transfer definition

Document type language

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 42

Modulo design is used to maximize cohesion and minimize coupling. Which of the following is the key to implement this rule ?

Inheritance

Polymorphism

Encapsulation

Abstraction

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 43

Verification:

refers to the set of activities that ensure that software correctly implements a specific function

gives answer to the question - Are we building the right product

requires execution of software

both A and B

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 44

Which design matric is used to measure the compactness of the program in terms of lines of code ?

Consistency

Conciseness

Efficiency

Accuracy

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 45

Requirements prioritization and negotiation belongs to :

Requirements validation

Requirements elicitation

Feasibility study

Requirements reviews

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 46

Adaptive maintenance is a maintenance which _____ .

correct errors that were not discovered till testing phase

is carried out to port the existing software to a new environment

improves the system performance

both B and C

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 47

A Design Concept Refinement is a :

Top-down approach

Complementary of abstraction concept

process of elaboration

All of the above

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 48

A software design is highly modular if :

cohesion is functional and coupling is data type

cohesion is coincidental and coupling is data type

cohesion is sequential and coupling is content type

cohesion is functional and coupling is stamp type

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 49

Match the following for operating system techniques with the most appropriate advantage :

$\begin{array}{clcl} & \textbf{List-I} && \textbf{List-II}\\ \text{(a)} & \text{Spooling} & \text{(i)} & \text{Allows several jobs to improve CPU utilization} \\ \text{(b)} & \text{Multiprogramming} & \text{(ii)}& \text{Access to shared resources among geographically}\\ &&& \text{dispersed computers in a transparant way} \\ \text{(c)} & \text{Time sharing} & \text{(iii)} & \text{Overlapping I/O and computations} \\ \text{(d)} & \text{Distributed computing}& \text{(iv)} & \text{Allows many users to share a computer} \\ &&& \text{simultaneously by switching processor frequently} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 50

Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm ?

Queues have different priorities

Each queue may have different scheduling algorithm

Processes are permanently assigned to a queue

This algorithm can be configured to match a specific system under design

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 51

What is the most appropriate function of Memory Management Unit (MMU) ?

It is an associative memory to store TLB

It is a technique of supporting multiprogramming by creating dynamic partitions

It is a chip to map virtual address to physical address

It is an algorithm to allocate and deallocate main memory to a process

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 52

Dining Philosopher's problem is a :

Producer - consumer problem

Classical IPC problem

Starvation problem

Synchronization primitive

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 53

In _____ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy.

Index

Linked

Contiguous

Bit Map

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 54

A unix file may be of the type :

Regular file

Directory file

Device file

Any one of the above

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 55

Match the following :

$\begin{array}{clcl} & \textbf{List-I} && \textbf{List-II} \\ \text{(a)} & \text{Intelligence} & \text{(i)} & \text{Contextual, tacit, transfer needs learning} \\ \text{(b)} & \text{Knowledge} & \text{(ii)} & \text{Scattered facts, easily transferrable} \\ \text{(c)} & \text{Information} & \text{(iii)} & \text{Judgemental} \\ \text{(d)} & \text{Data} & \text{(iv)} & \text{Codifiable, endorsed with relevence and purpose} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 56

Match the following knowledge representation techniques with their applications :

$\begin{array}{clcl} & \textbf{List – I} & &\textbf{List – II} \\ \text{(a)} & \text{Frames} & \text{(i)} & \text{Pictorial representation of objects, their } \\ &&& \text{attributes and relationships} \\ \text{(b)} &\text{Conceptual } & \text{(ii)} & \text{To describe real world stereotype events} \\ & \text{dependencies} \\ \text{(c)} & \text{Associative} & \text{(iii)} & \text{Record like structures for grouping} \\ &\text{networks} && \text{closely related knowledge} \\ \text{(d)} & \text{Scripts} & \text{(iv)} & \text{Structures and primitives to } \\& && \text{represent sentences} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 57

In propositional language 𝑃 ↔ 𝑄 is equivalent to (where ∼ denotes NOT) :

∼(𝑃∨𝑄)∧∼(𝑄∨𝑃)

(∼𝑃∨𝑄)∧(∼𝑄∨𝑃)

(𝑃∨𝑄)∧(𝑄∨𝑃)

∼(𝑃∨𝑄)→∼(𝑄∨𝑃)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 58

Which of the following statements is true for Branch-and-Bound search ?

Underestimates of remaining distance may cause deviation from optimal path

Overestimates can't cause right path to be overlooked

Dynamic programming principle can be used to discard redundant partial paths

All of the above

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 59

Match the following with respect to heuristic search techniques :

$\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{(a)} & \text{Steepest-acccent Hill} & \text{(i)} & \text{Keeps track of all partial paths which can} \\ & \text{Climbing}&&\text{be candiadate for further explaination} \\ \text{(b)} & \text{Branch-and-bound} & \text{(ii)} & \text{Discover problem state(s) that satisfy } \\ & \text{}&&\text{a set of constraints} \\ \text{(c)} & \text{Constraint satisfaction} & \text{(iii)} & \text{Detects difference between current state} \\ & \text{}&&\text{and goal state} \\ \text{(d)} & \text{Means-end-analysis} & \text{(iv)} & \text{Considers all moves from current state} \\ & \text{}&&\text{and selects best move} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 60

Match the following :

$\begin{array}{clcl} & \textbf{List-I} & & \textbf{List-II} \\ \text{(a)} & \text{Joint Application} & \text{(i)} & \text{Delivers functionality in rapid iteration} \\ & \text{Design (JAD)} && \text{measured in weeks and needs frequent} \\ &&&\text{communication, development, testing and} \\ &&& \text{delivery} \\ \text{(b)} & \text{Computer Aided} & \text{(ii)} & \text{Reusable applications generally with one} \\ & \text{Software} && \text{ specific function. It is closely linked with}\\ &\text{Engineering}&& \text{ idea of web services and service oriented} \\ &&& \text{architecture} \\ \text{(c)} & \text{Agile development} & \text{(iii)} & \text{Tools to automate many tasks of SDLC} \\ \text{(d)} & \text{Component} & \text{(iv)} & \text{A group based tool for collecting user} \\ &\text{Based}&& \text{ requirements and creating system design.} \\ & \text{Technology} && \text{Mostly used in analysis and design stages} \\ &&& \text{of SDLC} \\ \end{array}$

Codes :

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

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

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

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

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 61

A context free grammar for $L=\{w \mid n_0 (w) > n_1 (w)\}$ is given by :

$𝑆→0∣0𝑆∣1𝑆𝑆 $

$𝑆→0𝑆∣1𝑆∣0𝑆𝑆∣1𝑆𝑆∣0∣1 $

$𝑆→0∣0𝑆∣1𝑆𝑆∣𝑆1𝑆∣𝑆𝑆1 $

$𝑆→0𝑆∣1𝑆∣0∣1$

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 62

Given the following two statements:

𝑆₁: If 𝐿1 and 𝐿2 are recursively enumerable languages over Σ, then 𝐿₁∪ 𝐿₂ and 𝐿₁∩ 𝐿₂ are also recursively enumerable.

𝑆₂: The set of recursively enumerable languages is countable.

Which of the following is true ?

𝑆₁ is correct and 𝑆₂ is not correct

𝑆₁ is not correct and 𝑆₂ is correct

Both 𝑆₁ and 𝑆₂ are not correct

Both 𝑆₁ and 𝑆₂ are correct

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 63

Given the following grammars:

𝐺₁	𝑆→𝐴𝐵∣𝑎𝑎𝐵
	𝐴→𝑎𝐴∣𝜖
	𝐵→𝑏𝐵∣𝜖
𝐺₂:	𝑆→𝐴∣𝐵
	𝐴→𝑎𝐴𝑏∣𝑎𝑏
	𝐵→𝑎𝑏𝐵∣𝜖

Which of the following is correct ?

𝐺₁ is ambiguous and 𝐺₂ is unambiguous grammars

𝐺₁ is unambiguous and 𝐺₂ is ambiguous grammars

both 𝐺₁ and 𝐺₂ are ambiguous grammars

both 𝐺₁ and 𝐺₂ are unambiguous grammars

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 64

Given the symbols A, B, C, D, E, F, G and H with the probabilities

$\frac{1}{30}, \frac{1}{30}, \frac{1}{30}, \frac{2}{30}, \frac{3}{30}, \frac{5}{30}, \frac{5}{30}$ respectively. The average Huffman code size in bits per symbol is :

$\frac{67}{30}$

$\frac{70}{34}$

$\frac{76}{30}$

$\frac{78}{30}$

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 65

The redundancy in images stems from :

pixel decolleration

pixel colleration

pixel quantization

image size

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 66

In a binary Hamming Code the number of check digits is r then number of message digits is equal to :

2^𝑟−1

2^𝑟−𝑟−1

2^𝑟−𝑟+1

2^𝑟+𝑟−1

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 67

In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of :

rows or columns

rows + columns

rows + columns -1

rows + columns +1

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 68

Consider the following transportation problem :

The initial basic feasible solution of the above transportation problem using Vogel's Approximation method (VAM) is given below :

The solution of the above problem :

is degenerate solution

is optimum solution

needs to improve

is infeasible solution

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 69

Given the following statements with respect to linear programming problem:

S1: The dual of the dual linear programming problem is again the primal problem

S2: If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution

S3: If either the primal or the dual problem has a finite optimal solution, the other one also possess the same, and the optimal value of the objective functions of the two problems are equal.

Which of the following is true ?

S1 and S2

S1 and S3

S2 and S3

S1, S2 and S3

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 70

Consider the two class classification task that consists of the following points :

Class 𝐶₁	: [1 1.5]	[1 -1.5]
Class 𝐶₂	: [-2 2.5]	[-2 -2.5]

The decision boundary between the two classes using single perceptron is given by :

𝑥₁+ 𝑥₂+ 1.5 = 0

𝑥₁+ 𝑥₂− 1.5 = 0

𝑥₁+ 1.5 = 0

𝑥₁− 1.5 = 0

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 71

Let A and B be two fuzzy integers defined as:

A = {(1.0.3), (2, 0.6), (3, 1), (4, 0.7), (5, 0.2)}

B = {(10, 0.5), (11, 1), (12, 0.5)}

Using fuzzy arithmetic operation given by

$\mu_{A+B^{(Z)}} = \underset{x+y=z}{\oplus} (\mu_A (x) \otimes \mu_B(y))$

$f(A+B)$ is _____ . $\left[ \text{Note :} \quad \begin{array}{c} \oplus \equiv \max \\ \otimes \equiv \min \end{array} \right] $

{(11, 0.8), (13, 1), (15, 1)}

{(11, 0.3), (12, 0.5), (13, 1), (14, 1), (15, 1), (16, 0.5), (17, 0.2)}

{(11, 0.3), (12, 0.5), (13, 0.6), (14, 1), (15, 1), (16, 0.5), (17, 0.2)}

{(11, 0.3), (12, 0.5), (13, 0.6), (14, 1), (15, 0.7), (16, 0.5), (17, 0.2)}

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 72

Suppose the function y and a fuzzy integer number around - 4 for x are given as $y=(x-3)^2 + 2$.

Around - 4 ={(2, 0.3), (3, 0.6), (4, 1), (5, 0.6), (6, 0.3)} respectively. Then f(Around-4) is given by :

{(2, 0.6), (3, 0.3), (6, 1), (11, 0.3)}

{(2, 0.6), (3, 1), (6, 1), (11, 0.3)}

{(2, 0.6), (3, 1), (6, 0.6), (11, 0.3)}

{(2, 0.6), (3, 0.3), (6, 0.6), (11, 0.3)}

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 73

Match the following for UNIX system calls :

$\begin{array}{clcl} &\textbf{List-I} && \textbf{List-II} \\ \text{(a)} & \text{exec} & \text{(i)} & \text{Creates new process} \\ \text{(b)} & \text{brk} & \text{(ii)} & \text{Invokes another program overlaying memory} \\&&& \text{space with a copy of an executable file.}\\ \text{(c)} & \text{wait} & \text{(iii)} & \text{To increase or decrease the size of data region} \\ \text{(d)} & \text{fork} & \text{(iv)} & \text{A process synchronizes with termination of} \\ &&&\text{child process}\\ \end{array}$

Codes :

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

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

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

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

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 74

WOW32 is a :

Win 32 API library for creating processes and threads.

Special kind of file system to the NT name space.

Kernel-mode objects accessible through Win 32 API.

Special execution environment used to run 16 bit Windows applications on 32-bit machines.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 75

The unix command :

$ vi file1 file2

Edits file1 and stores the contents of file1 in file2

Both files i.e., file1 and file2 can be edited using 'ex' command to travel between the files

Both files can be edited using 'mv' command to move between the files

Edits file1 first, saves it and then edits file2

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

UGC NET CSE - June 2015 | PAPER - III