Multiple Choice Questions...

1.Consider the following translation involving two bank accounts x and y

read(x); x := -50 ; write(x); read(y); y := y - 50; write(y)

The constraint that the sum of the accounts x and y should remain constant is that of

1.Atomicity

2.Consistency

3.Isolation

4.Durability

Consider the following two statements

S1: If a candidate is known to be corrupt, then he will not be elected.

S2: If a candidate is kind , he will be elected

Which one of the following statments follows from S1 and S2 as per sound inference rules of logic?

1.If a person is known to be corrupt, he is not kind

2.If a person is not known to be corrupt, he is not kind

3.If a person is kind , he is not known to be corrupt

4.If a person is not kind, he is not known to be corrupt

a software requirements specification (SRS) document should avoid discussing which

one of the following

1.User interface issues

2.Non-functional requirements

3.design specification

4.interfaces with third party software

which one of the following statements is NOT correct about HTTP cookies?

1.A cookie is a piece of code that has the potential to compromise the security of an internet user

2.A cookie gains entry to the user's work area through an HTTP header

3.A cookie has an expiry data and time

4.cookies can be used to track the browsing pattern of a particular site

In the context of abstract-syntax-tree (AST) and control flow graph (CFG) , which one of

the following is TRUE?

1.In both AST and CFG, let mode N2 be the successor of node N!. In the input program,

2.For any input program, neither AST nor CFG will contain a cycle

3.The maximum number of successors of a node in an AST and a CFG depends on the input program

4.Each node in AST and CFG corresponds to at most one statement in the input program

Let R be the relation on the set of positive integers such that aRb if and only if a and b

are distinct and have a common divisor other than 1. which one of the following statement about R is true

1.R is symmetric and reflexive but not transitive

2.R is reflexive but not symmetric and not transitive

3.R is transitive but not reflexive and not symmetric

4.R is symmetric but not reflexive and not transitive

Consider a complete binary tree where the left and the right subtrees of the root are maxheaps.

Click to buy Cosmo's UGC NET Computer Sceince Book

The lower bound for the number of operators to convert the tree to a heap is

1.Ω(log n)

2.Ω(n)

3.Ω(n log n)

4.Ω(n2)

which one of the following statements is NOT correct about HTTP cookies?

1.P-2, Q-3, R-1, S-4.

2.P-2, Q-1, R-4, S-3.

3.P-2, Q-4, R-1, S-3

4.P-2, Q-3, R-4, S-1.

Identify the correct order in which a server process must invoke the function calls accept,

blind, listen, and recv according to UNIX socket API.

1.Listen, accept, blind , recv

2.blind, listen, accept, recv

3.blind, accept, listen, recv

4.accept, listen, blind recv

Consider the following statements.

I. The complement of every turning decidable language is turning decidable.

II. There exists some language which is in NP but is not turning decidable

III.If L is a language in NP, L is Turning Decidable

Which of the above statements is/are true?

1.only II

2.only III

3.only I and II

4.only I and III

A graph is self-complementary if it is isomorphic to its complement, for all selfcomplementary

graphs on n vertices, n is

1.A multiple of A

2.Even

3.Odd

4.congruent 0 mod 4, or, 1 mod 4

Given below are some algorithms, and some algorithm design paradigms

1.Dijkstra’s shortest path i.Divide and conquer

2.Floyd-warshall algorithm to compute all ii.Dynamic programming

Pairs shortest path

3.Binary search on a sorted array iii.Greedy design

4.Backtracking search on a graph iv.Depth-first search

v. Breadth-first search

1.1-i,2-iii,3-i,4-v.

2.1-iii,2-iii,3-i,4-v.

3.1-iii,2-ii,3-i,4-iv.

4.1-iii,2-ii,3-i,4-v.

Which one of the following assertions concerning code inspection and code walkthrough

is true

1.code inspection is carried out once the code has been unit tested

2.code inspection and code walkthrough are synonyms

3.Adherence to coding standards is checked during code inspection

4.code walkthrough is usually carried out by an independent test team

In a connected graph, a bridge is an edge whose removal discounts a graph, which one of

the following statments is true

1.A tree has no bridges

2.A bridge can not be part of a simple cycle

3.Every edge of a clique with size

4.A graph with bridges cannot have a cycle

The cardinality of the power set of {0,1,2,……,10} is ____________

Ans : 2048