Turing Prep | Previous Year Questions | UGC NET CSE - July 2018

Question : 1

The definitions in an XML document are said to be __________ when the tagging system and definitions in the DTD are all in compliance.

well-formed

reasonable

valid

logical

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 2

Consider the JavaScript Code:


var y=”12”

function f() {

    var y=”6”;

    alert (this.y);

    function g() {alert (y); }

    g();

}

f();

If 𝑀 is the number of alert dialog boxes generated by this JavaScript code and D1, D2, …, 𝐷_𝑀 represents the content displayed in the each of the 𝑀 dialog boxes, then:

M=3; D1 displays “12”; D2 displays “6”; D3 displays “12”

M=3; D1 displays”6”; D2 displays “12”; D3 displays “6”

M=2; D1 displays”6”; D2 displays “12”.

M=2; D1 displays”12”; D2 displays “6”

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 3

What is the output of the following JAVA program?


class simple

{

    public static void main(String[ ] args)

    {

        simple obj = new simple();

        obj.start();

    }

    void start()

    {

        long [] P = {3, 4, 5};

        long [] Q = method (P);

        System.out.print (P[0] + P[1] +P[2]+”:”);

        System.out.print (Q[0] + Q[1] + Q[2]);

    }

    long [ ] method (long [ ] R)

    {

        R[1] = 7;

        return R;

    }

} //end of class

12:15

15:12

12:12

15:15

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 4

What is the output of the following ‘C’ program? (Assuming little – endian representation of multi-byte data in which Least Significant Byte (LSB) is stored at the lowest memory address.)


#include<stdio.h>

#include<stdlib.h>

/* Assume short int occupies two bytes of storage */

int main ()

{

    union saving

    {

        short int one;

        char two[2];

    };

    union saving m;

    m.two [0] =5;

    m.two [1] =2;

    printf(“%d, %d, %d\n”, m.two[0], m.two[1], m.one);

}/* end of main */

5, 2, 1282

5, 2, 52

5, 2, 25

5, 2, 517

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 5

Given below are three implementations of the swap() function in C++ :

$\begin{array}{|l|l|l|} \hline \qquad \qquad \text{(a)} & \qquad \qquad \text{(b)} & \qquad \qquad \text{(c)} \\ \text{void swap (int a, int b)} & \text{void swap (int &a, int &b)} & \text{void swap (int *a, int *b)} \\ \text{\{} & \text{\{} & \text{\{} \\ \text{int temp;} & \text{int temp;} & \text{int *temp;} \\ \text{temp = a;} & \text{temp = a;} & \text{temp = a;} \\ \text{a = b;} & \text{a = b;} & \text{a = b;} \\ \text{b = temp;} & \text{b = temp;} & \text{b = temp;} \\ \text{\}} & \text{\}} & \text{\}} \\ \text{int main()} & \text{int main()} & \text{int main()} \\ \text{int p = 0,q = 1;} & \text{int p = 0, int q = 1;} & \text{int p = 0 , q = 1;} \\ \text{swap(p,q);} & \text{swap(p,q);} &\text{swap(p,q);} \\ \text{\}} & \text{\}} & \text{\}}\\\hline \end{array}$

Which of these would actually swap the contents of the two integer variables p and q?

(a) only

(b) only

(c) only

(b) and (c) only

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 6

In Java, which of the following statements is/are True ?
S1 : The ‘final’ keyword applied to a class definition prevents the class from being extended through derivation.
S2 : A class can only inherit one class but can implement multiple interfaces.
S3 : Java permits a class to replace the implementation of a method that it has inherited. It is called method overloading.
Code :

S1 and S2 only

S1 and S3 only

S2 and S3 only

All of S1, S2 and S3

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 7

Which of the following statements is/are True ?
P : C programming language has a weak type system with static types.
Q : Java programming language has a strong type system with static types.
Code :

P only

Q only

Both P and Q

Neither P nor Q

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 8

A graphic display system has a frame buffer that is 640 pixels wide, 480 pixels high and 1 bit of color depth. If the access time for each pixel on the average is 200 nanoseconds, then the refresh rate of this frame buffer is approximately :

16 frames per second

19 frames per second

21 frames per second

23 frames per second

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 9

Which of the following statements is/are True regarding the solution to the visibility problem in 3D graphics ?
S1 : The Painter’s algorithm sorts polygons by depth and then paints (scan - converts) each Polygon on to the screen starting with the most nearest polygon.
S2 : Backface Culling refers to eliminating geometry with backfacing normals.
Code :

S1 only

S2 only

Both S1 and S2

Neither S1 nor S2

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 10

Consider the matrix $M=\begin{bmatrix} 2 & 0 & 2 \\ 0 & 1 & 1 \\ 0 & 0 & 1 \end{bmatrix}$ representing a set of planar (2D) geometric transformations in homogeneous coordinates. Which of the following statements about the matrix M is True?

M represents first, a scaling of vector (2, 1) followed by translation of vector (1, 1)

M represents first, a translation of vector (1, 1) followed by scaling of vector (2, 1)

M represents first, a scaling of vector (3, 1) followed by shearing of parameters (−1, 1)

M represents first, a shearing of parameters (−1, 1) followed by scaling of vector (3, 1)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 11

Assume the following regarding the development of a software system P :
-     Estimated lines of code of P : 33, 480 LOC
-     Average productivity for P : 620 LOC per person-month
-     Number of software developers : 6
-     Average salary of a software developer : ₹ 50,000 per month
If E, D and C are the estimated development effort (in person-months), estimated development
time (in months), and estimated development cost (in ₹ Lac) respectively, then (E, D, C)
=_________.

(48, 8, 24)

(54, 9, 27)

(60, 10, 30)

(42, 7, 21)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 12

Match the following in Software Engineering :

$\begin{array}{clcl} &\textbf{List-I}& & \textbf{List-II} \\ \text{(a)}& \text{Product Complexity} & \text{(i)} & \text{Software Requirement Definition} \\ \text{(b)} &\text{Structured System Analysis} & \text{(ii)} & \text{Software Design} \\ \text{(c)}& \text{Coupling and Cohesion} & \text{(iii)} & \text{Validation Technique} \\ \text{(d)} &\text{Symbolic Execution} & \text{(iv)} & \text{Software Cost Estimation} \\ \end{array}$

$\textbf{Code :}$

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

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

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

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

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 13

Which one of the following is not typically provided by Source Code Management Software ?

Synchronisation

Versioning and Revision history

Syntax highlighting

Project forking

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 14

A software system crashed 20 times in the year 2017 and for each crash, it took 2 minutes to restart. Approximately, what was the software availability in that year ?

96.9924%

97.9924%

98.9924%

99.9924%

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 15

Match the 5 CMM Maturity levels/CMMI staged representations in List-I with their characterizations in List-II :

$\begin{array}{clcl} & \textbf{List-I} && \textbf{List-II} \\ \text{(a)} & \text{Initial} & \text{(i)} & \text{Processes are improved quantitatively} \\ &&& \text{and continually.} \\ \text{(b)} & \text{Repeatable} & \text{(ii)} & \text{The plan for a project comes from a} \\ &&& \text{template for plans.} \\ \text{(c)} & \text{Defined} & \text{(iii)} & \text{The plan uses processes that can be } \\ &&& \text{measured quantitatively.} \\ \text{(d)} & \text{Managed} & \text{(iv)} & \text{There may not exist a plan or it may } \\ &&& \text{be abandoned.} \\ \text{(e)} & \text{Optimizing} & \text{(v)} & \text{There’s a plan and people stick to it.}\\ \end{array} $

$Code:$

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

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

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

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 16

Coupling is a measure of the strength of the interconnections between software modules.
Which of the following are correct statements with respect to module coupling ?
P : Common coupling occurs when one module controls the flow of another module by passing it information on what to do.
Q : In data coupling, the complete data structure is passed from one module to another through parameters.
R : Stamp coupling occurs when modules share a composite data structure and use only parts of it.
Code :

P and Q only

P and R only

Q and R only

All of P, Q and R

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 17

A software design pattern often used to restrict access to an object is :

adapter

decorator

delegation

proxy

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 18

Reasons to re-engineer a software include :
P : Allow legacy software to quickly adapt to the changing requirements
Q : Upgrade to newer technologies/platforms/paradigm (for example, object-oriented)
R : Improve software maintainability
S : Allow change in the functionality and architecture of the software
Code :

P, R and S only

P and R only

P, Q and S only

P, Q and R only

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 19

Which of the following is not a key strategy followed by the clean room approach to software development ?

Formal specification

Dynamic verification

Incremental development

Statistical testing of the system

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 20

Which of the following statements is/are True ?
P : Refactoring is the process of changing a software system in such a way that it does not alter the external behavior of the code yet improves the internal architecture.
Q : An example of refactoring is adding new features to satisfy a customer requirement discovered after a project is shipped.
Code :

P only

Q only

Both P and Q

Neither P nor Q

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 21

The solution of the recurrence relation $T(m) = T(3m/4)+1$ is

$\Theta (\lg \: m)$

$\Theta (m)$

$\Theta (m\lg m)$

$\Theta (\lg\lg m)$

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 22

Consider the array A=. After building heap from the array A, the depth of the heap and the right child of max-heap are _________ and _________ respectively. (Root is at level 0).

3, 14

3, 10

4, 14

4, 10

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 23

A hash function h defined h(key)=key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the location of key 18 ?

3

4

5

6

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 24

Which of the following algorithms solves the single-source shortest paths ?

Prim’s algorithm

Floyd - Warshall algorithm

Johnson’s algorithm

Dijkstra’s algorithm

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 25

A text is made up of the characters A, B, C, D, E each occurring with the probability 0.08, 0.40, 0.25, 0.15 and 0.12 respectively. The optimal coding technique will have the average length of :

2.4

1.87

3.0

2.15

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 26

A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves :

cannot have more than 37 nodes

has exactly 37 nodes

has exactly 35 nodes

cannot have more than 35 nodes

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 27

Match the following with respect to algorithm paradigms :

$\begin{array}{clcl} & \textbf{List-I} & {} & \textbf{List-II} \\ \text{(a)} & \text{Merge sort} & \text{(i)} & \text{Dynamic programming} \\ \text{(b)} & \text{Huffman coding} & \text{(ii)} & \text{Greedy approach} \\ \text{(c)} & \text{Optimal polygon triangulation} & \text{(iii)} & \text{Divide and conquer} \\ \text{(d)} & \text{Subset sum problem} & \text{(iv)} & \text{Back tracking} \\ \end{array}$

$\textbf{Codes :}$

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

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

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

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 28

The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number) :

45

72

360

450

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 29

A 5-ary tree is tree in which every internal node has exactly 5 children. The number of left nodes in such a tree with 8 internal nodes will be :

30

33

45

125

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 30

Consider a Boolean function of ‘n’ variables. The order of an algorithm that determines whether the Boolean function produces a output 1 is :

Logarithmic

Linear

Quadratic

Exponential

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 31

Two finite state machines are said to be equivalent if they :

Have the same number of edges

Have the same number of states

Recognize the same set of tokens

Have the same number of states and edges

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 32

The finite state machine given in figure below recognizes :

any string of odd number of a’s

any string of odd number of b’s

any string of even number of a’s and odd number of b’s

any string of odd number of a’s and odd number of b’s

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 33

A pushdown automata behaves like a Turing machine when the number of auxiliary memory is :

0

1

1 or more

2 or more

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 34

Pushdown automata can recognize language generated by_________.

Only context free grammar

Only regular grammar

Context free grammar or regular grammar

Only context sensitive grammar

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 35

To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is :

2n - 1

2n

n + 1

n²

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 36

Consider the following two Grammars:

$G_1 \: : \: S \rightarrow SbS \mid a \\ G_2 : S \rightarrow aB \mid ab, \: A \rightarrow GAB \mid a, \: B \rightarrow ABb \mid b$

Which one of the folloeing options is correct?

Only 𝐺₁ is ambiguous

Only 𝐺₂is ambiguous

Both 𝐺₁ and 𝐺₂ are ambiguous

Both 𝐺₁ and 𝐺₂ are not ambiguous

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 37

Context sensitive language can be recognized by a :

Finite state machine

Deterministic finite automata

Non-deterministic finite automata

Linear bounded automata

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 38

The set A = { 0ⁿ 1ⁿ 2ⁿ | n=1, 2, 3, ......... } is an example of a grammar that is :

Context sensitive

Context free

Regular

None of the above

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 39

A bottom-up parser generates :

Left-most derivation in reverse

Right-most derivation in reverse

Left-most derivation

Right-most derivation

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 40

Consider the following statements( ) :
S₁ : There exists no algorithm for deciding if any two Turing machines M1 and M2 accept the same language.
S₂ : The problem of determining whether a Turing machine halts on any input is undecidable.
Which of the following options is correct ?

Both S₁ and S₂are correct

Both S₁ and S₂ are not correct

Only S₁ is correct

Only S₂ is correct

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 41

A slotted ALOHA network transmits 200-bit frames using a shared channel with a 200 Kbps bandwidth. Find the throughput of the system, if the system (all stations put together) produces 250 frames per second :

49

368

149

151

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 42

The period of a signal is 100 ms. Its frequency is _________.

100³ Hertz

10⁻² KHz

10⁻³ KHz

10⁵ Hertz

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 43

The dotted-decimal notation of the following IPV4 address in binary notation is _________. 10000001 00001011 00001011 11101111

111.56.45.239

129.11.10.238

129.11.11.239

111.56.11.239

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 44

Which of the following statements are true ?
(a) Advanced Mobile Phone System (AMPS) is a second generation cellular phone system.
(b) IS - 95 is a second generation cellular phone system based on CDMA and DSSS.
(c) The Third generation cellular phone system will provide universal personnel communication.
Code :

(a) and (b) only

(b) and (c) only

(a), (b) and (c)

(a) and (c) only

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 45

Match the following symmetric block ciphers with corresponding block and key sizes:

$\begin{array} {} & \textbf{List-I} & & \textbf{List-II} \\ \text{(a)} & \text{}\text{DES} & \text{(i)} & \text{block size 64 and key size ranges between 32 and 448} \\ \text{(b)} & \text{IDEA} & \text{(ii)} & \text{block size 64 and key size 64} \\ \text{(c)} & \text{BLOW FISH} & \text{(iii)} & \text{block size 128 and key sizes 128, 192, 256} \\ \text{(d)} & \text{AES} & \text{(iv)} & \text{block size 64 and key size 128} \\ \end{array}$

$Code:$

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

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

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

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

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 46

Which of the following statements are true ?

(a) Three broad categories of Networks are

(i) Circuit Switched Networks

(ii) Packet Switched Networks

(iii) Message Switched Networks

(b) Circuit Switched Network resources need not be reserved during the set up phase.

(c) In packet switching there is no resource allocation for packets.

Code :

(a) and (b) only

(b) and (c) only

(a) and (c) only

(a), (b) and (c)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 47

In Challenge-Response authentication the claimant ________.

Proves that she knows the secret without revealing it

Proves that she doesn’t know the secret

Reveals the secret

Gives a challenge

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 48

Decrypt the message “WTAAD” using the Caesar Cipher with key=15

LIPPS

HELLO

OLLEH

DAATW

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 49

To guarantee correction of upto t errors, the minimum Hamming distance d_min in a block code must be ________.

t+1

t−2

2t−1

2t+1

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 50

Encrypt the Message "HELLO MY DEARZ" using Transposition Cipher with

$Key \begin{cases} \text{Plain Text} & 2 4 1 3 \\ \text{Cipher Text} &1 2 3 4 \end{cases}$

HLLEO YM AEDRZ

EHOLL ZYM RAED

ELHL MDOY AZER

ELHL DOMY ZAER

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 51

At a particular time of computation, the value of a counting semaphore is 10. Then 12 P operations and "x" V operations were performed on this semaphore. If the final value of semaphore is 7, x will be

8

9

10

11

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 52

In a paged memory, the page hit ratio is 0.40. The time required to access a page in secondary memory is equal to 120 ns. The time required to access a page in primary memory is 15 ns. The average time required to access a page is ________.

105

68

75

78

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 53

In a multi-user operating system, 30 requests are made to use a particular resource per hour, on an average. The probability that no requests are made in 40 minutes, when arrival pattern is a poisson distribution, is _________.

e⁻¹⁵

1−e⁻¹⁵

1−e⁻²⁰

e⁻²⁰

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 54

Normally user programs are prevented from handling I/O directly by I/O instructions in them. For CPUs having explicit I/O instructions, such I/O protection is ensured by having the I/O instructions privileged. In a CPU with memory mapped I/O, there is no explicit I/O instruction. Which one of the following is true for a CPU with memory mapped I/O ?

I/O protection is ensured by operating system routines.

I/O protection is ensured by a hardware trap.

I/O protection is ensured during system configuration.

I/O protection is not possible.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 55

Which UNIX/Linux command is used to make all files and sub-directories in the directory “progs” executable by all users ?

chmod− R a+x progs

chmod −R 222 progs

chmod−X a+x progs

chmod −X 222 progs

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 56

Which of the following statements are true ?
(a) External Fragmentation exists when there is enough total memory space to satisfy a request but the available space is contiguous.
(b) Memory Fragmentation can be internal as well as external.
(c) One solution to external Fragmentation is compaction.
Code :

(a) and (b) only

(a) and (c) only

(b) and (c) only

(a), (b) and (c)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 57

Page information in memory is also called as Page Table. The essential contents in each entry of a page table is/are _________.

Page Access information

Virtual Page number

Page Frame number

Both virtual page number and Page Frame Number

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 58

Consider a virtual page reference string 1, 2, 3, 2, 4, 2, 5, 2, 3, 4. Suppose LRU page replacement algorithm is implemented with 3 page frames in main memory. Then the number of page faults are_________.

5

7

9

10

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 59

Consider the following three processes with the arrival time and CPU burst time given in milliseconds :

The Gantt Chart for preemptive SJF scheduling algorithm is _________.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 60

In which of the following scheduling criteria, context switching will never take place ?

ROUND ROBIN

Preemptive SJF

Non-preemptive SJF

Preemptive priority

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 61

In RDBMS, which type of Join returns all rows that satisfy the join condition ?

Inner Join

Outer Join

Semi Join

Anti Join

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 62

Consider a relation book (title, price) which contains the titles and prices of different books. Assuming that no two books have the same price, what does the following SQL query?


Select title

from book as B

where (select count(*)

    from book as T

    where T.price > B. price < 7

Titles of the six most expensive books

Title of the sixth most expensive books

Titles of the seven most expensive books

Title of the seventh most expensive books

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 63

In a Hierachical database, a hashing function is used to locate the ________.

Collision

Root

Foreign Key

Records

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 64

Relations produced from E - R Model will always be in ________.

1 NF

2 NF

3 NF

4 NF

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 65

Consider following schedules involving two transactions:

$S_{1}: \: r_{1}(X);r_{1}(Y);r_{2}(X);r_{2}(Y);w_{2}(Y);w_{1}(X) \\ S_{2}: \: r_{1}(X);r_{2}(X);r_{2}(Y);w_{2}(Y);r_{1}(Y);w_{1}(X)$

Which one of the following statements is correct with respect to above ?

Both 𝑆₁ and 𝑆₂ are conflict serializable.

𝑆₁ is conflict serializable and 𝑆₂ is not conflict serializable

𝑆₁ is not conflict serializable and 𝑆₂ is conflict serializable

Both 𝑆₁ and 𝑆₂ are not conflict serializable

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 66

For a database relation R(a, b, c, d) where the domains of a, b, c and d include only atomic values, and only the following functional dependencies and those that can be inferred from them hold :

a → c

b → d

The relation is in _________.

First normal form but not in second normal form

Second normal form but not in third normal form

Third normal form

BCNF

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 67

A many-to-one relationship exists between entity sets r₁ and r₂ . How will it be represented using functional depedencies if Pk(r) denotes the primary key attribute of relation r ?

Pk(r₁ ) → Pk(r₂ )

Pk(r₂) → Pk(r₁ )

Pk(r₂ ) → Pk(r₁ ) and Pk(r₁ ) → Pk(r₂ )

Pk(r₂ ) → Pk(r₁ ) or Pk(r₁) → Pk(r₂ )

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 68

Database systems that store each relation in a separate operating system file may use the operating system’s authorization scheme, instead of defining a special scheme themselves. In this case, which of the following is false ?

The administrator enjoys more control on the grant option.

It is difficult to differentiate among the update, delete and insert authorizations.

Cannot store more than one relation in a file.

Operations on the database are speeded up as the authorization procedure is carried out at the operating system level.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 69

Let R₁ (a, b, c) and R₂ (x, y, z) be two relations in which a is the foreign key of R₁that refers to the primary key of R₂ . Consider following four options.

(a) Insert into R₁ (b) Insert into R₂

(c) Delete from R₁ (d) Delete from R₂

Which of the following is correct about the referential integrity constraint with respect to above ?

Operations (a) and (b) will cause violation.

Operations (b) and (c) will cause violation.

Operations (c) and (d) will cause violation.

Operations (d) and (a) will cause violation.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 70

Consider a hash table of size seven, with starting index zero, and a hash function (7x+3) mod 4. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing ? Here “__” denotes an empty location in the table.

3, 10, 1, 8, __ , __ , __

1, 3, 8, 10, __ , __ , __

1, __ , 3, __ , 8, __ , 10

3, 10, __ , __ , 8, __ , __

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 71

In Artificial Intelligence (AI), an environment is uncertain if it is ________.

Not fully observable and not deterministic

Not fully observable or not deterministic

Fully observable but not deterministic

Not fully observable but deterministic

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 72

In Artificial Intelligence (AI), a simple reflex agent selects actions on the basis of_________.

current percept, completely ignoring rest of the percept history.

rest of the percept history, completely ignoring current percept.

both current percept and complete percept history.

both current percept and just previous percept.

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 73

In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible heuristics h₁ .......h_m is available for a problem and none of them dominates any of the others, which should we choose ?

h(n)=max{h₁ (n),....,h_m(n)}

h(n)=min{h₁ (n),....,h_m(n)}

h(n)=avg{h₁(n),....,h_m(n)}

h(n)=sum{h₁ (n),....,h_m(n)}

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 74

Consider following sentences regarding A^_*, an informed search strategy in Artificial Intelligence (AI).
(a) A^* expands all nodes with f(n) < C^*.
(b) A^* expands no nodes with f(n) /C^*.
(c) Pruning is integral to A^*.
Here, C^* is the cost of the optimal solution path.
Which of the following is correct with respect to the above statements ?

Both statement (a) and statement (b) are true.

Both statement (a) and statement (c) are true.

Both statement (b) and statement (c) are true.

All the statements (a), (b) and (c) are true.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 75

Consider a vocabulary with only four propositions A, B, C and D. How many models are there for the following sentence ?

B w C

10

12

15

16

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 76

Consider the following statements :

(a) False =? True

(b) If $\alpha \models (\beta \wedge \gamma \text{ then } \alpha \models \gamma$

Which of the following is correct with respect to the above statements ?

Both statement a and statement b are false

Statement a is true and statement b is false

Statement a is false and statement b is true

Both statement a and statement b are true

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 77

Consider the following English sentence:

"Agra and Gwalior are both in India".

A student has written a logical sentence for the above English sentence in First-Order Logic using predicate IN(x, y), which means x is in y, as follows.

In(Agra, India) ∨ In(Gwalior, India)

Which one of the following is correct with respect to the above logical sentence?

It is syntactically valid but does not express the meaning of the English sentence

It is syntactically valid and expresses the meaning of the English sentence also

It is syntactically invalid but expresses the meaning of the English sentence

It is syntactically invalid and does not express the meaning of the English sentence

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 78

Consider the following two sentences :

(a) The planning graph data structure can be used to give a better heuristic for a planning problem.

(b) Dropping negative effects from every action schema in a planning problem results in a relaxed problem.

Which of the following is correct with respect to the above sentences ?

Both sentence (a) and sentence (b) are false.

Both sentence (a) and sentence (b) are true.

Sentence (a) is true but sentence (b) is false.

Sentence (a) is false but sentence (b) is true.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 79

A knowledge base contains just one sentence, ∃x AsHighAs (x, Everest). Consider the following two sentences obtained after applying existential instantiation.

(a) AsHighAs (Everest, Everest)

(b) AsHighAs (Kilimanjaro, Everest)

Which of the following is correct with respect to the above sentences ?

Both sentence (a) and sentence (b) are sound conclusions.

Both sentence (a) and sentence (b) are unsound conclusions.

Sentence (a) is sound but sentence (b) is unsound.

Sentence (a) is unsound but sentence (b) is sound.

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 80

Consider the set of all possible five-card poker hands dealt fairly from a standard deck of fifty-two cards. How many atomic events are there in the joint probability distribution ?

2, 598, 960

3, 468, 960

3, 958, 590

2, 645, 590

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 81

E is the number of edges in the graph and f is maximum flow in the graph. When the capacities are integers, the runtime of Ford-Fulberson algorithm is bounded by :

O (E∗f)

O (E²∗f)

O (E∗f ² )

O (E²∗f ² )

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 82

Which of the following statements is false about convex minimization problem ?

If a local minimum exists, then it is a global minimum

The set of all global minima is convex set

The set of all global minima is concave set

For each strictly convex function, if the function has a minimum, then the minimum is unique

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 83

The following LLP

$\text{Maximize } z=100x_1 +2x_2+5x_3$

Subject to

$14x_1+x_2-6x_33+3x_4=7 \\ 32x_1+x_2-12x_3 \leq 10 \\ 3x_1-x_2-x_3 \leq 0 \\ \ \ \ \ \ \ \ \ \ \ \ \ \ x_1, x_2, x_3, x_4 \geq 0$

has

Solution : $x_1=100, \: x_2=0, \: x_3=0$

Unbounded solution

No solution

Solution : $x_1=50, \: x_2=70, \: x_3=60$

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 84

Digital data received from a sensor can fill up 0 to 32 buffers. Let the sample space be $S=\{ 0, 1, 2, \dots , 32\}$ where the sample $𝑗$ denote that $𝑗$ of the buffers are full and $p(i) = \frac{1}{562}(33-i)$. Let A denote the event that the even number of buffers are full. Then $𝑃(𝐴) $ is

0.515

0.785

0.758

0.485

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 85

The equivalence of

$¬ ∃ x \ Q (x)$ is :

$∃ x \ ¬ Q (x)$

$\forall \: x \: \neg \: Q \: (x)$

$¬ ∃ x \ ¬ Q (x)$

$\forall \: x \: Q \: (x)$

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 86

If $A_i = \{-i, \dots , -2, -1, 0, 1, 2, \dots , i \}$

then $\cup_{i=1}^\infty A_i$ is :

Z

Q

R

C

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 87

Match the following in List-I and List-II, for a function $𝑓$ :

$\begin{array}{clcl} \text{} & \textbf{List-I} & & \textbf{List-II} \\ \text{(a)} & \text{$\forall \: x \: \forall \: y \: (f(x)=f(y) \rightarrow x=y)$} & \text{(i)} & \text{Constant} \\ \text{(b)} & \text{$\forall \: y \: \exists \: x \: (f(x) =y)$} & \text{(ii)} & \text{Injective} \\ \text{(c)} & \text{$\forall \: x \: f(x)=k$} & \text{(iii)} &\text{Surjective} \\ \end{array}$

$Code :$

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

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

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

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 88

Which of the relations on {0, 1, 2, 3} is an equivalence relation ?

{ (0, 0) (0, 2) (2, 0) (2, 2) (2, 3) (3, 2) (3, 3) }

{ (0, 0) (1, 1) (2, 2) (3, 3) }

{ (0, 0) (0, 1) (0, 2) (1, 0) (1, 1) (1, 2) (2, 0) }

{ (0, 0) (0, 2) (2, 3) (1, 1) (2, 2) }

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 89

Which of the following is an equivalence relation on the set of all functions from Z to Z ?

$\{ f, \:g) \mid f(x) - g(x) =1 \: \forall \: x \in \: Z \}$

$\{ f, \:g) \mid f(0) = g(0) \text{ or } f(1) = g(1) \}$

$\{ f, \:g) \mid f(0) = g(1) \text{ and } f(1) = g(0) \}$

$\{ f, \:g) \mid f(x) - g(x) =k \text{ for some } k \in Z \}$

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 90

Which of the following statements is true ?

(𝑍,≤) is not totally ordered

The set inclusion relation ⊆ is a partial ordering on the power set of a set S

(𝑍,≠) is a poset

The directed graph is not a partial order

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 91

CMOS is a Computer Chip on the motherboard, which is :

RAM

ROM

EPROM

Auxillary storage

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 92

In RS flip-flop, the output of the flip-flop at time (t+1) is same as the output at time t, after the occurance of a clock pulse if :

S=R=1

S=0, R=1

S=1, R=0

S=R=0

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 93

Match the terms in List-I with the options given in List-II :

$\begin{array}{clcl} & \textbf{List-I} & & \textbf{List-II}\\ \text{(a)} & \text{Decoder} &\text{(i)} & \text{1 line to $2^n$ lines} \\ \text{(b)} & \text{Multiplexer} & \text{(ii)} & \text{n lines to $2^n$ lines} \\ \text{(c)} & \text{De multiplexer} & \text{(iii)} &\text{$2^n$ lines to 1 line} \\ &&\text{(iv)}& \text{$2^n$ lines to $2^{n-1}$ lines} \\ \end{array}$

$Code :$

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

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

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

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

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 94

What does the following logic diagram represent ?

Synchronous Counter

Ripple Counter

Combinational Circuit

Mod 2 Counter

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 95

The hexadecimal equivalent of the binary integer number 110101101 is :

D24

1 B D

1 A E

1 A D

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 96

Perform the following operation for the binary equivalent of the decimal numbers (−14)₁₀+ (−15)₁₀

The solution in 8 bit representation is :

11100011

00011101

10011101

11110011

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 97

Match the items in List-I and List-II :

$\begin{array}{clcl} {} & {\textbf{List-I}} & {} & {\textbf{List-II}} \\ \text{(a)} & \text{interrupts which can be delayed when a much} & \text{(i)} & \text{Normal}\\ & \text{highest priority interrupt has occurred} \\ \text{(b)} & \text{Unplanned interrupts which occur while executing} & \text{(ii)} & \text{Synchronous}\\&\text{a program } \\ \text{(c)} & \text{Source of interrupt is in phase with the system} & \text{(iii)} & \text{Maskable} \\ & \text{clock}\\ & \text{ } & \text{(iv)} & \text{Exception}\\ \end{array}$

$Code :$

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

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

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

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 98

Which of the following mapping is not used for mapping process in cache memory ?

Associative mapping

Direct mapping

Set-Associative mapping

Segmented - page mapping

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 99

Simplify the following using K-map :
$F (A, B, C, D) = Σ (0, 1, 2, 8, 9, 12, 13) \\ d (A, B, C, D) = Σ (10, 11, 14, 15)$

$d$ stands for don’t care condition

$A+\bar{B} \bar{D} +BC$

$A+\bar{B} \bar{D} + \bar{B} \bar{C}$

$\bar{A} + \bar{B} \bar{C}$

$\bar{A} + \bar{B} \bar{C} + \bar{B} \bar{D}$

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 100

In 8085 microprocessor, what is the output of following program ?

LDA 8000H

MVI B, 30H

ADD B

STA 8001H

Read a number from input port and store it in memory

Read a number from input device with address 8000H and store it in memory at location 8001H

Read a number from memory at location 8000H and store it in memory location 8001H

Load A with data from input device with address 8000H and display it on the output device with address 8001H

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

UGC NET CSE - July 2018 | PAPER - II