Turing Prep | Previous Year Questions | UGC NET CSE - November 2017

Question : 1

In 8085 microprocessor which of the following flag(s) is (are) affected by an arithmetic operation ?

AC flag Only

CY flag Only

Z flag Only

AC, CY, Z flags

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 2

In 8085 microprocessor the address bus is of __________ bits.

4

8

16

32

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 3

In the architecture of 8085 microprocessor match the following :

$\begin{array}{clcl} \text{(a)} & \text{Processing unit} & \text{(i)} & \text{Interrupt} \\ \text{(b)} & \text{Instruction unit} & \text{(ii)} & \text{General purpose Register} \\ \text{(c)} & \text{Storage and Interface unit} & \text{(iii)} & \text{ALU} \\ && \text{(iv)} & \text{Timing and Control} \\ \end{array}$

Code :

(a)-(iv) (b)-(i) (c)-(ii)

(a)-(iii) (b)-(iv) (c)-(ii)

(a)-(ii) (b)-(iii) (c)-(i)

(a)-(i) (b)-(ii) (c)-(iv)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 4

Which of the following addressing mode is best suited to access elements of an array of contiguous memory locations ?

Indexed addressing mode

Base Register addressing mode

Relative address mode

Displacement mode

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 5

Which of the following is correct statement ?

In memory - mapped I/O, the CPU can manipulate I/O data residing in interface registers that are not used to manipulate memory words.

The isolated I/O method isolates memory and I/O addresses so that memory address range is not affected by interface address assignment.

In asynchronous serial transfer of data the two units share a common clock.

In synchronous serial transmission of data the two units have different clocks.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 6

A micro-instruction format has micro-ops field which is divided into three subfields F1, F2, F3 each having seven distinct micro-operations, condition field CD for four status bits, branch field BR having four options used in conjunction with address field ADF. The address space is of 128 memory locations. The size of micro-instruction is :

17 bits

20 bits

24 bits

32 bits

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 7

Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item X, denoted by r(X) and w(X) respectively. Which one of them is conflict serializable ?

S1 : r₁ (X); r₂ (X); w₁ (X); r₃ (X); w₂ (X)

S2 : r₂(X); r₁ (X); w₂ (X); r₃ (X); w₁ (X)

S3 : r₃ (X); r₂ (X); r₁ (X); w₂ (X); w₁ (X)

S4 : r₂ (X); w₂ (X); r₃ (X); r₁ (X); w₁ (X)

S₁

S₂

S₃

S₄

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 8

Suppose a database schedule S involves transactions T₁ , T₂ , .............,T_n . Consider the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule ?

Topological order

Depth - first order

Breadth - first order

Ascending order of transaction indices

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 9

If every non-key attribute is functionally dependent on the primary key, then the relation is in __________ .

First normal form

Second normal form

Third normal form

Fourth normal form

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 10

Consider a relation R (A, B, C, D, E, F, G, H), where each attribute is atomic, and following functional dependencies exist.

CH → G

A → BC

B → CFH

E → A

F → EG

The relation R is __________ .

in 1NF but not in 2NF

in 2NF but not in 3NF

in 3NF but not in BCNF

in BCNF

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 11

Given two relations R₁ (A, B) and R₂ (C, D), the result of following query

Select distinct A, B

from R₁ , R₂

is guaranteed to be same as R₁ provided one of the following condition is satisfied.

R₁has no duplicates and R₂ is empty.

R₁ has no duplicates and R₂ is non - empty.

Both R₁ and R₂ have no duplicates.

R₂ has no duplicates and R₁ is non - empty.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 12

Consider a schema R(A, B, C, D) and following functional dependencies.

A → B

B → C

C → D

D → B

Then decomposition of R into R₁ (A, B), R₂ (B, C) and R₃ (B, D) is __________ .

Dependency preserving and lossless join.

Lossless join but not dependency preserving.

Dependency preserving but not lossless join.

Not dependency preserving and not lossless join.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 13

Which of the following is not a component of Memory tube display ?

Flooding gun

Collector

Ground

Liquid Crystal

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 14

Which of the following is not true in case of Oblique Projections ?

Parallel projection rays are not perpendicular to the viewing plane.

Parallel lines in space appear parallel on the final projected image.

Used exclusively for pictorial purposes rather than formal working drawings.

Projectors are always perpendicular to the plane of projection.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 15

With respect to CRT, the horizontal retrace is defined as :

The path an electron beam takes when returning to the left side of the CRT.

The path an electron beam takes when returning to the right side of the CRT.

The technique of turning the electron beam off while retracing.

The technique of turning the electron beam on/off while retracing.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 16

Find the equation of the circle $x^2+y^2=1$ in terms of $x'y'$ coordinates, assuming that the $xy$ coordinate system results from a scaling of 3 units in the $x'$ direction and 4 units in the $y'$ direction.

$3(x’)^2+4(y’)^2=1$

$\bigg( \dfrac{x’}{3} \bigg) ^2 + \bigg( \dfrac{y’}{4} \bigg) ^2 =1$

$(3x’)^2+ (4y’)^2=1$

$\dfrac{1}{3}(x’)^2 + \dfrac{1}{4}(y’)^2=1$

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 17

Find the normalization transformation that maps a window whose lower left corner is at (1, 1) and upper right corner is at (3, 5) onto a viewport that is the entire normalized device screen.

$\begin{pmatrix} \dfrac{1}{2} & 0 & \dfrac{-1}{2} \\ 0 & \dfrac{1}{4} & \dfrac{-1}{4} \\ 0 & 0 & 1 \end{pmatrix} \\$

$\begin{pmatrix} \dfrac{1}{2} & 0 & \dfrac{1}{2} \\ 0 & \dfrac{-1}{4} & \dfrac{1}{4} \\ 1 & 1 & 1 \end{pmatrix} \\$

$\begin{pmatrix} \dfrac{1}{2} & 0 & \dfrac{-1}{2} \\ 0 & \dfrac{1}{4} & \dfrac{1}{4} \\ 1 & 0 & 0 \end{pmatrix} \\$

$\begin{pmatrix} \dfrac{1}{2} & 0 & \dfrac{1}{2} \\ 0 & \dfrac{1}{4} & \dfrac{-1}{4} \\ 1 & 0 & 0 \end{pmatrix}$

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 18

The three aspects of Quantization, programmers generally concerned with are :

Coding error, Sampling rate and Amplification

Sampling rate, Coding error and Conditioning

Sampling rate, Aperture time and Coding error

Aperture time, Coding error and Strobing

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 19

The logic of pumping lemma is an example of __________ .

iteration

recursion

the divide and conquer principle

the pigeon - hole principle

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 20

Heap allocation is required for languages that :

use dynamic scope rules

support dynamic data structures

support recursion

support recursion and dynamic data structures

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 21

Pumping lemma for regular language is generally used for proving :

whether two given regular expressions are equivalent

a given grammar is ambiguous

a given grammar is regular

a given grammar is not regular

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 22

Which of the following problems is undecidable ?

To determine if two finite automata are equivalent

Membership problem for context free grammar

Finiteness problem for finite automata

Ambiguity problem for context free grammar

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 23

Finite state machine can recognize language generated by __________.

Only context free grammar

Only context sensitive grammar

Only regular grammar

any unambiguous grammar

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 24

The language L = {aⁱb cⁱ ? i / 0} over the alphabet {a, b, c} is :

a regular language.

not a deterministic context free language but a context free language.

recursive and is a deterministic context free language.

not recursive.

a regular language.

not a deterministic context free language but a context free language.

recursive and is a deterministic context free language.

not recursive.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 25

Suppose we want to download text documents at the rate of 100 pages per second. Assume that a page consists of an average of 24 lines with 80 characters in each line. What is the required bit rate of the channel ?

192 kbps

512 kbps

1.248 Mbps

1.536 Mbps

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 26

Quadrature Amplitude Modulation means changing both :

Frequency and phase of the carrier.

Frequency and Amplitude of the carrier.

Amplitude and phase of the carrier.

Amplitude and Wavelength of the carrier.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 27

If a file consisting of 50,000 characters takes 40 seconds to send, then the data rate is __________.

1 kbps

1.25 kbps

2 kbps

10 kbps

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 28

Match the following :

$\begin{array}{clcl} & \textbf{List-I} && \textbf{List-II} \\ \text{(a)} & \text{Data Link Layer} & \text{(i)} & \text{Encryption} \\ \text{(b)} & \text{Network Layer} & \text{(ii)} & \text{Connection control} \\ \text{(c)} & \text{Transport Layer} & \text{(iii)} & \text{Routing} \\ \text{(d)} & \text{Presentation Layer} & \text{(iv)} & \text{Framing} \\ \end{array}$

Code :

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

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

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

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 29

The address of a class B host is to be split into subnets with a 6 - bit subnet number. What is the maximum number of subnets and maximum number of hosts in each subnet ?

62 subnets and 1022 hosts

64 subnets and 1024 hosts

62 subnets and 254 hosts

64 subnets and 256 hosts

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 30

Which of the following statements are true ?

(a) The fragmentation fields in the base header section of IPv4 have moved to the fragmentation extension header in IPv6.

(b) The authentication extension header is new in IPv6.

(c) The record route option is not implemented in IPv6. Code :
Code :

(a) and (b) Only

(b) and (c) Only

(a) and (c) Only

(a), (b) and (c)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 31

Consider a full binary tree with n internal nodes, internal path length i, and external path length e. The internal path length of a full binary tree is the sum, taken over all nodes of the tree, of the depth of each node. Similarly, the external path length is the sum, taken over all leaves of the tree, of the depth of each leaf.

Which of the following is correct for the full binary tree?

e = i + n

e = i + 2n

e = 2i + n

e = 2ⁿ+ i

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 32

You are given a sequence of $n$ elements to sort. The input sequence consists of $\dfrac{n}{k}$ subsequences, each containing $k$ elements. The elements in a given subsequence are all smaller than the elements in the succeeding subsequence and larger than the elements in the preceding subsequence. Thus, all that is needed to sort the whole sequence of length $n$ is to sort the $k$ elements in each of the $\dfrac{n}{k}$ subsequences.

The lower bound on the number of comparisons needed to solve this variant of the sorting problem is :

$\Omega (n)$

$\Omega \bigg( \dfrac{n}{k} \bigg)$

$\Omega(n \lg k)$

$\Omega \bigg( \dfrac{n}{k} \: \lg \: \dfrac{n}{k} \bigg)$

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 33

Consider the recurrence relation :

$\begin{array}{} T(n)& =8T \bigg( \dfrac{n}{2} \bigg) + Cn, \text{if } n>1 \\ & =b, \text{if } n=1 \end{array}$

Where b and c are constants. The order of the algorithm corrosponding to above recurrence relation is :

$n$

$n^2$

$n \lg n$

$n^3$

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 34

Consider the following two sequences :

    X = <B,C, D, C, A, B, C>

and 𝑌 = <𝐶,𝐴,𝐷,𝐵,𝐶,𝐵>

The length of longest common subsequence of X and Y is :

5

3

4

2

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 35

A text is made up of the characters a, b, c, d, e each occurring with the probability 0.11, 0.40, 0.16, 0.09 and 0.24 respectively. The optimal Huffman coding technique will have the average length of :

2.40

2.16

2.26

2.15

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 36

An undirected graph 𝐺(𝑉,𝐸) contains 𝑛(𝑛>2) nodes named 𝑣₁,𝑣2,…,𝑣𝑛. Two nodes 𝑣_𝑖and 𝑣_𝑗 are connected if and only if 0<∣𝑖−𝑗∣≤2. Each edge (𝑣_𝑖,𝑣_𝑗) is assigned a weight 𝑖+𝑗.

The cost of the minimum spanning tree of such a graph with 10 nodes is

88

91

49

21

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 37

An XML document that adheres to syntax rules specified by XML 1.0 specification in that it must satisfy both physical and logical structured, is called :

Well - formed

Reasonable

Valid

Sophisticated

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 38

Which of the following statement(s) is/are TRUE regarding Java Servelets ?

(a) A Java Servelet is a server-side component that runs on the web server and extends the capabilities of a server.

(b) A Servelet can use the user interface classes like AWT or Swing.

Code :

Only (a) is TRUE.

Only (b) is TRUE.

Both (a) and (b) are TRUE.

Neither (a) nor (b) is TRUE.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 39

Consider the following HTML table definition :

<tr>

</tr>

<tr>

<td>zText C </td>

</tr>

<tr>

<td> rowspan =2> Text D </td>

</tr>

<tr>

</tr>

</table>

The above HTML code would render on screen as :

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 40

Which of the following statements is/are TRUE ?

(a) In HTML, character entities are used to incorporate external content into a web page, such as images.

(b) Once a web server returns a cookie to a browser, the cookie will be included in all future requests from the browser to the same server.

Code :

Only (a) is TRUE.

Only (b) is TRUE.

Both (a) and (b) are TRUE.

Neither (a) nor (b) is TRUE.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 41

Which of the following statements is/are TRUE regarding JAVA ?

(a) Constants that cannot be changed are declared using the ‘static’ keyword.

(b) A class can only inherit one class but can implement multiple interfaces.

Code :

Only (a) is TRUE.

Only (b) is TRUE.

Both (a) and (b) are TRUE.

Neither (a) nor (b) is TRUE.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 42

What is the output of the following JAVA program ?

Class Test

{

public static void main (String [] args)

{

Test obj=new Test ();

obj.start ();

}

void start()

{

String stra="do";

String strb=method (stra);

System.out.print(":" +stra +strb);

}

String method (String stra)

{

stra=stra+"good";

System.out.print(stra);

return "good";

}

dogood : dogoodgood

dogood : gooddogood

dogood : dodogood

dogood : dogood

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 43

Statistical software quality assurance in software engineering involves __________ .

using sampling in place of exhaustive testing of software.

surveying customers to find out their opinions about product quality.

tracing each defect to its underlying cause, isolating the vital few causes, and moving to correct them.

tracing each defect to its underlying causes, and using the Pareto principle to correct each problem found.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 44

Which of the following statements is/are FALSE with respect to software testing ?

S1 : White-box tests are based on specifications; better at telling whether program meets specification, better at finding errors of ommission.

S2 : Black-box tests are based on code; better for finding crashes, out of bounds errors, file not closed errors.

S3 : Alpha testing is conducted at the developer’s site by a team of highly skilled testers for software that is developed as a product to be used by many customers.

Only S1 and S2 are FALSE.

Only S1 and S3 are FALSE.

Only S2 and S3 are FALSE.

All of S1, S2, and S3 are FALSE.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 45

A signal processor software is expected to operate for 91.25 days after repair, and the mean software repair time is expected to be 5 minutes. Then, the availability of the software is :

96.9862%

97.9862%

98.9962%

99.9962%

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 46

Consider the method mcq ();

int mcq (boolean a, boolean b, boolean c, boolean d)

{

int ans=1;

if (a) {ans=2;}

else if (b) {ans=3;}

else if (c) {

if (d) {ans=4;}

}

return ans;

}

If

𝑀1= Number of tests to exhaustively test mcq();

𝑀2= Minimum number of tests to achieve full statement coverage for mcq (); and

𝑀3= Minimum number of tests to achieve full branch coverage for mcq ( );

then (𝑀1,𝑀2,𝑀3) = ______________ .

(16,3,5)

(8,5,3)

(8,3,5)

(16,4,4)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 47

A simple stand - alone software utility is to be developed in ’C’ programming by a team of software experts for a computer running Linux and the overall size of this software is estimated to be 20,000 lines of code. Considering (a, b) = (2.4, 1.05) as multiplicative and exponention factor for the basic COCOMO effort estimation equation and (c, d)=(2.5, 0.38) as multiplicative and exponention factor for the basic COCOMO development time estimation equation, approximately how long does the software project take to complete ?

10.52 months

11.52 months

12.52 months

14.52 months

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 48

In Software Configuration Management (SCM), which of the following is a use-case supported by standard version control systems ?

(a) Managing several versions or releases of a software

(b) Filing bug reports and tracking their progress

(c) Allowing team members to work in parallel

(d) Identifying when and where a regression occurred

Code :

Only (a), (c), and (d)

Only (a), (b), and (c)

Only (a), (b), and (d)

Only (b), (c), and (d)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 49

Consider the following four processes with the arrival time and length of CPU burst given in milliseconds :

$\begin{array}{ccc} \textbf{Process} & \textbf{Arrival Time} & \textbf{Burst Time} \\ P_1 & 0 & 8 \\ P_2 & 1 & 4 \\ P_3 & 2 & 9 \\ P_4 & 3 & 5 \end{array}$

The average waiting time for preemptive SJF scheduling algorithm is ____________

6.5 ms

7.5 ms

6.75 ms

7.75 ms

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 50

Consider a virtual page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Suppose a demand paged virtual memory system running on a computer system such that the main memory has 3 page frames. Then __________ page replacement algorithm has minimum number of page faults.

FIFO

LIFO

LRU

Optimal

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 51

User level threads are threads that are visible to the programmer and are unknown to the kernel. The operating system kernel supports and manages kernel level threads. Three different types of models relate user and kernel level threads.

Which of the following statements is/are true ?

(a)

(i) The Many - to - one model maps many user threads to one kernel thread

(ii) The one - to - one model maps one user thread to one kernel thread

(iii) The many - to - many model maps many user threads to smaller or equal kernel threads

(b)

(i) Many - to - one model maps many kernel threads to one user thread

(ii) One - to - one model maps one kernel thread to one user thread

(iii) Many - to - many model maps many kernel threads to smaller or equal user threads

Code :

(a) is true; (b) is false

(a) is false; (b) is true

Both (a) and (b) are true

Both (a) and (b) are false

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 52

Consider a system with five processes P₀ through P₄ and three resource types A, B and C. Resource type A has seven instances, resource type B has two instances and resource type C has six instances suppose at time T₀ we have the following allocation.

If we implement Deadlock detection algorithm we claim that system is ________

Semaphore

Deadlock state

Circular wait

Not in deadlock state

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 53

Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67. Suppose SSTF disk scheduling algorithm implemented to meet the requests then the total number of head movements are __________ if the disk head is initially at 53.

224

248

236

240

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 54

The Bounded buffer problem is also known as __________.

Producer - consumer problem

Reader - writer problem

Dining Philosophers problem

Both (2) and (3)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 55

In Artificial Intelligence (AI), which agent deals with happy and unhappy state ?

Simple reflex agent

Model based agent

Learning agent

Utility based agent

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 56

If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search ?

O (b + m)

O (bm)

O(b^m)

O(m^b)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 57

Let P, Q, R and S be Propositions. Assume that the equivalences P ⇔ (Q ∨ ¬ Q) and Q ⇔ R hold. Then the truth value of the formula (P ∧ Q) ⇒ ((P ∧ R) ∨ S) is always :

True

False

Same as truth table of Q

Same as truth table of S

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 58

“If X, then Y unless Z” is represented by which of the following formulae in propositional logic ?

(X ∧ Y) → ¬ Z

(X ∧ ¬ Z) → Y

X → (Y ∧ ¬ Z)

Y → (X ∧ ¬ Z)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 59

Consider the following two well-formed formulas in prepositional logic.

F1 : P ⇒ ¬ P

F2 : (P ⇒ ¬ P) ∨ (¬ P ⇒ P)

Which of the following statements is correct ?

F1 is Satisfiable, F2 is valid

F1 is unsatisfiable, F2 is Satisfiable

F1 is unsatisfiable, F2 is valid

F1 and F2 both are Satisfiable

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 60

Standard planning algorithms assume environment to be __________.

Both deterministic and fully observable

Neither deterministic nor fully observable

Deterministic but not fully observable

Not deterministic but fully observable

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 61

Which of the following statements is not correct ?

Every recursive language is recursively enumerable.

L = {0ⁿ 1 n 0ⁿ ? n=1, 2 , 3, ....} is recursively enumerable.

Recursive languages are closed under intersection.

Recursive languages are not closed under intersection.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 62

Context free grammar is not closed under :

Concatenation

Complementation

Kleene Star

Union

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 63

Consider the following languages :
$L_1 = \{a^m b^n | m ≠ n\} \\ L_2 = \{a^m b^n | m = 2n+1\} \\ L_3 = \{a^m b^n | m ≠ 2n\}$

Which one of the following statement is correct ?

Only $L_1$ and $L_2$ are context free languages

Only $L_1$ and $L_3$ are context free languages

Only $L_2$ and $L_3$ are context free languages

$L_1$ , $L_2$ and $L_3$ are context free languages

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 64

A 4×4 DFT matrix is given by

$\dfrac{1}{2} \begin{bmatrix} 1 & 1 & 1 & 1 \\ 1 & x & -1 & y \\ 1 & -1 & 1 & -1 \\ 1 & -j & -1 & j \end{bmatrix} \\ j^2 = -1$

Where the values of 𝑥 and 𝑦 are ______, _____ respectively.

1,−1

−1,1

−𝑗,𝑗

𝑗,−𝑗

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 65

Entropy of a discrete random variable with possible values {𝑥₁,𝑥₂,…,𝑥_𝑛} and probability density function 𝑃(𝑋) is

$H(X) = \: – \sum\limits_{i=1}^{n}P(x_i) \log _bP(x_i)$

The value of 𝑏 gives the units of entropy. The unit for 𝑏 = 10 is

bits

bann

nats

deca

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 66

For any binary $(n, h)$ linear code with minimum distance $(2t+1)$ or greater $n-h \geq \log_2 \bigg[ \sum \limits_{i=0}^{\alpha} \begin{pmatrix} n \\ i \end{pmatrix} \bigg]$ where α is :

$2t+1$

$t+1$

$t−1$

$t$

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 67

Which of the following is a valid reason for causing degeneracy in a transportation problem ? Here m is no. of rows and n is no. of columns in transportation table.

When the number of allocations is m + n − 1.

When two or more occupied cells become unoccupied simultaneously.

When the number of allocations is less than m + n − 1.

When a loop cannot be drawn without using unoccupied cells, except the starting cell of the loop.

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 68

Consider the following LPP:

Max $Z=15x_1+10 x_2$

Subject to the constraints

$4x_1 +6x_2 \leq 360 \\ 3x_1+0x_2 \leq 180 \\ 0x_1+5x_2 \leq 200 \\ x_1, x_2 \geq 0$

The solution of the LPP using Graphical solution technique is

𝑥1=60,𝑥2=0 and 𝑍=900

𝑥1=60,𝑥2=20 and 𝑍=1100

𝑥1=60,𝑥2=30 and 𝑍=1200

𝑥1=50,𝑥2=40 and 𝑍=1150

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 69

Consider the following LPP:

Min $Z=2x_1+x_2+3x_3$

Subject to:

$x_1 – 2x_2+x_3 \geq 4 \\ 2x_1+x_2+x_3 \leq 8 \\ x_1-x_3 \geq 0 \\ x_1, x_2, x_3 \geq 0$

The solution of this LPP using Dual Simplex Method is

𝑥1=0,𝑥2=0,𝑥3=3 and 𝑍=9

𝑥1=0,𝑥2=6,𝑥3=0 and 𝑍=6

𝑥1=4,𝑥2=0,𝑥3=0 and 𝑍=8

𝑥1=2,𝑥2=0,𝑥3=2 and 𝑍=10

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 70

Consider a Takagi-Sugeno – Kang (TSK) Model consisting of rules of the form:

If $𝑥_1$ is $A_{i1}$ and … and $𝑥_𝑟$ is $A_{ir}$

THEN $y=f_i(x_1, x_2, \dots , x_t)=b_{i0} + b_{i1} x_1 + \dots + b_{ir}x_r$

assume, $\alpha _i$ is the matching degree of rule 𝑖, then the total output of the model is given by:

$y=\sum \limits_{i=1}^L \alpha_i f_i (x_1, x_2, \dots , x_r)$

$y=\dfrac{\sum \limits_{i=1}^L \alpha_i f_i (x_1, x_2, \dots , x_r)}{\sum \limits_{i=1}^L \alpha _i}$

$y=\dfrac{\sum \limits_{i=1}^L f_i (x_1, x_2, \dots , x_r)}{\sum \limits_{i=1}^L \alpha _i}$

$y=\underset{i}{\text{max}} [\alpha _i f_i (x_1, x_2, \dots , x_r)]$

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 71

Consider a single perceptron with sign activation function. The perceptron is represented by weight vector [0.4 −0.3 0.1]^t and a bias θ=0. If the input vector to the perceptron is X=[0.2 0.6 0.5] then the output of the perceptron is :

1

0

- 0.05

- 1

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 72

he Sigmoid activation function 𝑓(𝑡) is defined as

$\dfrac{1}{\text{exp} (t) + \text{exp} (-t)}$

$t \text{ exp}(-t)$

$\dfrac{1}{1+ \text{exp} (t)}$

$\dfrac{1}{1+ \text{exp} (-t)}$

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 73

Consider the following statements :
(a) UNIX provides three types of permissions
    * Read
    * Write
    * Execute
(b) UNIX provides three sets of permissions
    * permission for owner
    * permission for group
    * permission for others
Which of the above statement/s is/are true ?

Only (a)

Only (b)

Both (a) and (b)

Neither (a) nor (b)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 74

Which of the following routing technique / techniques is / are used in distributed systems ?

(a) Fixed Routing

(b) Virtual Routing

(c) Dynamic Routing

Code :

(a) only

(a) and (b) only

(c) only

All (a), (b), (c)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 75

Match the following WINDOWS system calls and UNIX system calls with reference to process control and File manipulation.

$\begin{array}{llll} & \textbf{Windows} & & \textbf{UNIX} \\ (a) & \text{Create – process ( )} & (i) & \text{Open ( )} \\ (b) & \text{WaitForSingleObject ( )} & (ii) & \text{Close ( )} \\ (c) & \text{CreateFile ( )} & (iii) & \text{Fork ( )} \\ (d) & \text{CloseHandle ( )} & (iv) & \text{Wait ( )} \end{array}$

Code :

(𝑎)−(𝑖𝑖𝑖)(𝑏)−(𝑖𝑣)(𝑐)−(𝑖)𝑑−(𝑖𝑖)

(𝑎)−(𝑖𝑣)(𝑏)−(𝑖𝑖𝑖)(𝑐)−(𝑖)𝑑−(𝑖𝑖)

(𝑎)−(𝑖𝑣)(𝑏)−(𝑖𝑖𝑖)(𝑐)−(𝑖𝑖)𝑑−(𝑖)

(𝑎)−(𝑖𝑖𝑖)(𝑏)−(𝑖𝑣)(𝑐)−(𝑖𝑖)𝑑−(𝑖)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

UGC NET CSE - November 2017 | PAPER - III