Logic - General Aptitude - General Aptitude (GA) Previous Year Questions

1

2012 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2012

Q.2 Which of the following is TRUE?

A

Every relation in 3NF is also in BCNF

B

A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R

C

Every relation in BCNF is also in 3NF

D

No relation can be in both BCNF and 3NF

Open complete paper

2

2012 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2012

Q.3 What will be the output of the following C program segment?
char inChar = 'A' ;
switch ( inChar ) {
case 'A' : printf ("Choice A\n") ;
case 'B' :
case 'C' : printf ("Choice B") ;
case 'D' :
case 'E' :
default : printf ( " No Choice" ) ; }

A

No Choice

B

Choice A

C

Choice A Choice B No Choice

D

Program gives no output as it is erroneous

Open complete paper

3

2012 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2012

Q.14 Given the basic ER and relational models, which of the following is INCORRECT?

A

An attribute of an entity can have more than one value

B

An attribute of an entity can be composite

C

In a row of a relational table, an attribute can have more than one value

D

In a row of a relational table, an attribute can have exactly one value or a NULL value

Open complete paper

4

2012 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2012

Q.15 Which of the following statements are TRUE about an SQL query?
P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause
Q : An SQL query can contain a HAVING clause only if it has a GROUP BY clause
R : All attributes used in the GROUP BY clause must appear in the SELECT clause
S : Not all attributes used in the GROUP BY clause need to appear in the SELECT clause

A

P and R

B

P and S

C

Q and R

D

Q and S

Open complete paper

5

2012 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2012

Q.20 Register renaming is done in pipelined processors

A

as an alternative to register allocation at compile time

B

for efficient access to function parameters and local variables

C

to handle certain kinds of hazards

D

as part of address translation

Open complete paper

6

2012 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2012

Which of the following graphs is isomorphic to

A

B

C

D

Open complete paper

7

2012 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2012

Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by Dijkstra’s shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex v is updated only when a strictly shorter path to v is discovered.

A

SDT

B

SBDT

C

SACDT

D

SACET

Open complete paper

8

2012 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2012

The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudocode below is invoked as height(root) to compute the height of a binary tree rooted at the tree pointer root.

int height(treeprt n)
{ if (n == NULL) return -1;
if (n → left == NULL)
if (n → right == NULL) return 0;
else return B1 ; // Box 1
else { h1 = height (n → left);
if (n → right == NULL) return (1+h1);
else { h2 = height (n → right);
return B2 ; // Box 2
}
}
}

The appropriate expressions for the two boxes B1 and B2 are

A

B1: (1+height(n → right))
B2: (1+max(h1,h2))

B

B1: (height(n → right))
B2: (1+max(h1,h2))

C

B1: height(n → right)
B2: max(h1,h2)

D

B1: (1+height(n → right))
B2: max(h1,h2)

Open complete paper

9

2015 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2015 [Session 1]

Match the following:
(P) Condition coverage      (i) Black-box testing
(Q) Equivalence class partitioning      (ii) System testing
(R) Volume testing      (iii) White-box testing
(S) Alpha testing      (iv) Performance testing

(A) P-ii, Q-iii, R-i, S-iv
(B) P-iii, Q-iv, R-ii, S-i
(C) P-iii, Q-i, R-iv, S-ii
(D) P-iii, Q-i, R-ii, S-iv

A

P-ii, Q-iii, R-i, S-iv

B

P-iii, Q-iv, R-ii, S-i

C

P-iii, Q-i, R-iv, S-ii

D

P-iii, Q-i, R-ii, S-iv

Open complete paper

10

2015 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2015 [Session 1]

Which of the following is/are correct inorder traversal sequence(s) of binary search tree(s)?
I.   3, 5, 7, 8, 15, 19, 25
II.   5, 8, 9, 12, 10, 15, 25
III.   2, 7, 10, 8, 14, 16, 20
IV.   4, 6, 7, 9 18, 20, 25

(A) I and IV only
(B) II and III only
(C) II and IV only
(D) II only

A

I and IV only

B

II and III only

C

II and IV only

D

II only

Open complete paper

11

2015 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2015 [Session 1]

Which one of the following is TRUE at any valid state in shift-reduce parsing?
(A) Viable prefixes appear only at the bottom of the stack and not inside
(B) Viable prefixes appear only at the top of the stack and not inside
(C) The stack contains only a set of viable prefixes
(D) The stack never contains viable prefixes

A

Viable prefixes appear only at the bottom of the stack and not inside

B

Viable prefixes appear only at the top of the stack and not inside

C

The stack contains only a set of viable prefixes

D

The stack never contains viable prefixes

Open complete paper

12

2015 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2015 [Session 1]

For computers based on three-address instruction formats, each address field can be used to specify which of the following: (S1) A memory operand (S2) A processor register (S3) An implied accumulator register

A

Either S1 or S2

B

Either S2 or S3

C

Only S2 and S3

D

All of S1, S2 and S3

Open complete paper

13

2015 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2015 [Session 1]

Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection? I. If the sequence number of a segment is \( m \), then the sequence number of the subsequent segment is always \( m+1 \). II. If the estimated round trip time at any given point of time is \( t \) sec, the value of the retransmission timeout is always set to greater than or equal to \( t \) sec. III. The size of the advertised window never changes during the course of the TCP connection. IV. The number of unacknowledged bytes at the sender is always less than or equal to the advertised window.

A

III only

B

I and III only

C

I and IV only

D

II and IV only

Open complete paper

14

2015 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2015 [Session 1]

Which of the following statements is/are FALSE? I. XML overcomes the limitations in HTML to support a structured way of organizing content. II. XML specification is not case sensitive while HTML specification is case sensitive. III. XML supports user defined tags while HTML uses pre-defined tags. IV. XML tags need not be closed while HTML tags must be closed.

A

II only

B

I only

C

II and IV only

D

III and IV only

Open complete paper

15

2015 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2015 [Session 1]

SELECT operation in SQL is equivalent to

A

the selection operation in relational algebra

B

the selection operation in relational algebra, except that SELECT in SQL retains duplicates

C

the projection operation in relational algebra

D

the projection operation in relational algebra, except that SELECT in SQL retains duplicates

Open complete paper

16

2015 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2015 [Session 1]

Consider the following C program segment.
while(first <= last)
{
if (array[middle] < search)
first = middle + 1;
else if (array[middle] == search)
found = TRUE;
else last = middle - 1;
middle = (first + last)/2;
}
if (first > last) notPresent = TRUE;
The cyclomatic complexity of the program segment is ________.

Check answer

Open complete paper

17

2015 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2015 [Session 1]

Consider the NPDA (Q = {q0, q1, q2}, Σ = {0,1}, Γ = {0,1,⊥}, δ, q0, ⊥, F = {q2}), where (as per usual convention) Q is the set of states, Σ is the input alphabet, Γ is the stack alphabet, δ is the state transition function, q0 is the initial state, ⊥ is the initial stack symbol, and F is the set of accepting states. The state transition is as follows: [Diagram of NPDA] Which one of the following sequences must follow the string 101100 so that the overall string is accepted by the automaton?

A

10110

B

10010

C

01010

D

01001

Open complete paper

18

2015 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2015 [Session 1]

Let G = (V, E) be a simple undirected graph, and s be a particular vertex in it called the source. For x ∈ V, let d(x) denote the shortest distance in G from s to x. A breadth first search (BFS) is performed starting at s. Let T be the resultant BFS tree. If (u,v) is an edge of G that is not in T, then which one of the following CANNOT be the value of d(u) – d(v)?

A

-1

B

0

C

1

D

2

Open complete paper

19

2015 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2015 [Session 1]

The graph shown below has 8 edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight 36 and contains the edges: {(A, C), (B, C), (B, E), (E, F), (D, F)}. The edge weights of only those edges which are in the MST are given in the figure shown below. The minimum possible sum of weights of all 8 edges of this graph is __________.

Check answer

Open complete paper

20

2015 · General Aptitude (GA) · General Aptitude · Logic

Computer Science & Information Technology (CS) 2015 [Session 2]

Consider the following function written in the C programming language.
void foo(char *a) { if ( *a && *a != ' ') { foo(a+1); putchar(*a); } }
The output of the above function on input “ABCD EFGH” is

A

ABCD EFGH

B

ABCD

C

HGFE DCBA

D

DCBA

Open complete paper