Computer Science Study Materials for Competitive Exams

Sample Questions, Previous Year Solved Papers, Study Materials For Competitive Examinations Like UGC NET, SET And GATE Computer Science.

Tuesday, 28 February 2017

1.       The statement (¬p) (¬q) is logically equivalent to which of the statements below?
I. p⇒q
II. q⇒p
III. (¬q) p
IV. (¬p) q
(A) I only
(B) I and IV only
(C) II only
(D) II and III only
Answer: D
2.       Consider the first-order logic sentence F: x(yR(x,y)). Assuming non-empty logical domains, which of the sentences below are implied by F?
I. y(xR(x,y))
II. y(xR(x,y))
III. ∀y(xR(x,y))
IV. ¬∃x(∀y¬R(x,y))
(A) IV only
(B) I and IV only
(C) II only
(D) II and III only
Answer: B
3.       Let c1,...,cn be scalars, not all zero, such that
where ai are column vectors in Rn.
Consider the set of linear equations
Ax=b
where A=[a1,...,an] and
The set of equations has
(A) a unique solution at x=Jn where Jn denotes a n-dimensional vector of all 1
(B) no solution
(C) infinitely many solutions
(D) finitely many solutions
Answer: C
4.       Consider tile following functions from positive integers to real numbers:
10, √n, n, log2n, 100/n
The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is:
(A) log2n, 100/n, 10, √n, n
(B) 100/n, 10, log2n, √n, n
(C) 10, 100/n, √n, log2n, n
(D) 100/n, log2n, 10, √n, n,
Answer: B
5.       Consider the following table:
Match the algorithms to the design paradigms they are based on.
(A) (P)↔(ii), (Q)↔(iii), (R)↔(i)
(B) (P)↔(iii), (Q)↔(i), (R)↔(ii)
(C) (P)↔(ii), (Q)↔(i), (R)↔(iii)
(D) (P)↔(i), (Q)↔(ii), (R)↔(iii)
Answer: C

6.       Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are:
Note: The height of a tree with a single node is 0.
(A) 4 and 15 respectively
(B) 3 and 14 respectively
(C) 4 and 14 respectively
(D) 3 and 15 respectively
Answer: B
7.       The n-bit fixed-point representation of an unsigned real number X uses f bits for the fraction part. Let i = n-f. The range of decimal values for X in this representation is
(A) 2-f to 2i
(B) 2-f to (2i – 2-f)
(C) 0 to 2i
(D) 0 to (2i – 2-f)
Answer: D
8.       Consider the C code fragment given below.
typedef struct node {
int data;
node* next;
} node;
void join(node* m, node* n){
node* p = n;
while(p ->next != NULL) {
p = p->next;
}
p->next = m;
}
Assuming that m and n point to valid NULL-terminated linked lists, invocation of join will
(A) append list m to the end of list n for all inputs.
(B) either cause a null pointer dereference or append list m to the end of list n.
(C) cause a null pointer dereference for all inputs.
(D) append list n to the end of list m for all inputs.
Answer: B
9.       When two 8-bit numbers A7...A0 and B7...B0 in 2’s complement representation (with A0 and B0 as the least significant bits) are added using a ripple-carry adder, the sum bits obtained are S7...S0 and the carry bits are C7...C0. An overflow is said to have occurred if
Answer: C
10.    Consider the following context-free grammar over the alphabet ∑ = (a, b, c) with S as the start symbol:
S→abScT | abcT
T→bT | b
Which one of the following represents the language generated by the above grammar?
(A) {(ab)n(cb)n | n≥1)
(B) {(ab)ncbm1cbm2 ... ,cbmn | n, m1, m2, ..., mn ≥ 1)
(C) ((ab)n (cbm)n | m, n ≥ 1 }
(D) {(ab)n(cbn)m | m, n ≥ 1 }
Answer: B

Pages   2   3   4   5 

Monday, 27 February 2017

41.       Which one of the following ISO standard is used for software process?
(A) ISO 9000
(B) ISO 9001
(C) ISO 9003
(D) ISO 9000-3
Answer: D
42.       Which of the following is used for test data generation?
(A) White box
(B) Black box
(C) Boundary-value analysis
(D) All of the above
Answer: C
43.       Reverse engineering is the process which deals with:
(A) Size measurement
(B) Cost measurement
(C) Design recovery
(D) All of the above
Answer: C
44.       The spacing between character pairs is called:
(A) Kerning
(B) x-height
(C) intercap
(D) serif
Answer: A
45.       When compared with analog cellular systems, an advantage of digital TDMA cellular system is that:
(A) it is less complicated
(B) it requires less of computer memory
(C) it conserves spectrum bandwidth
(D) it costs less
Answer: C

46.       E-commerce includes:
(A) B2C
(B) B2B
(C) C2C
(D) All of the above
Answer: D
47.       A clustering technique that permits a convenient graphical display is:
(A) partition based clustering
(B) probabilistic model based clustering
(C) hierarchical clustering
(D) agglomerative clustering
Answer: C
48.       After sending a message, the sender should not be able to, at a later date, deny having sent the message, is referred to as:
(A) Authenticity
(B) Non-Repudiability
(C) Auditability
(D) Repudiability
Answer: B
49.       The device which connects dissimilar LANs of different topologies using different sets of communication protocols so that information can flow from one to another is called:
(A) Router
(B) Bridge
(C) Gateway
(D) Switch
Answer: C
50.    We cannot delete the .................. icon but we can made it invisible.
(A) Recycle
(B) My Computer
(C) Internet explorer
(D) None of the above
Answer: A

Pages   2   3   4   5 

Sunday, 26 February 2017

31.       Usually information security in a network is achieved by:
(A) Layering
(B) Cryptography
(C) Grade of service
(D) None of the above
Answer: B
32.       The linker:
(A) is similar to interpreter
(B) uses source code as its input
(C) is required to create a load module
(D) none of the above
Answer: C
33.       In which addressing mode the operand is given explicitly in the instruction itself?
(A) Absolute mode
(B) Immediate mode
(C) Indirect mode
(D) Index mode
Answer: B
34.       A compiler that runs on one machine and produces code for a different machine is called:
(A) Cross compilation
(B) One pass compilation
(C) Two pass compilation
(D) None of the above
Answer: A
35.       Any syntactic construct that can be described by a regular expression can also be described by a:
(A) Context sensitive grammar
(B) Non context free grammar
(C) Context free grammar
(D) None of the above
Answer: C

36.       Find the odd man out:
(A) tail
(B) cut
(C) wart
(D) sed
Answer: C
37.       Which of the following changes permission to deny write permission to group and others?
(A) Chmod go-w filex
(B) Chmod go w filex
(C) Chmod go=w filex
(D) None of the above
Answer: A
38.       Variable partition memory management technique with compaction results in:
(A) Reduction of fragmentation
(B) Minimal wastage
(C) Segment sharing
(D) None of the above
Answer: A
39.       Capability Maturity Model is meant for:
(A) Product
(B) Process
(C) Product and Process
(D) None of the above
Answer: B
40.     In the light of software engineering software consists of:
(A) Programs
(B) Data
(C) Documentation
(D) All of the above
Answer: D

Pages   2   3   4   5 

Saturday, 25 February 2017

21.       Which construct in SQL is used to test whether a subquery has any tuples in its result?
(A) UNIQUE
(B) EXISTS
(C) GROUP BY
(D) EXCEPT
Answer: B
22.       ORACLE supports:
(A) inner join and outer join only
(B) outer join and semi join only
(C) inner join, outer join , semi join only
(D) inner join, outer join, semi join and anti join
Answer:
23.       Which two of the following are equivalent for an undirected graph G?
(i) G is a tree
(ii) There is at least one path between any two distinct vertices of G
(iii) G contains no cycles and has (n-1) edges
(iv) G has n edges
(A) (i) and (ii)
(B) (i) and (iii)
(C) (i) and (iv)
(D) (ii) and (iii)
Answer: B
24.       In a B tree of order m with p nodes the average number of splits is at most:
Answer: B
25.       The prepositional formula given by the tree:
is:
(A) ˄˅x2˅x1¬x1¬x1
(B) (x2˅¬x2)˄(x1˅x2)
(C) (¬x1˅x2)˄(¬x1˅x2)
(D) None
Answer: C

26.       Queue is a ............. list.
(A) LIFO
(B) LILO
(C) FILO
(D) FIFO
Answer: D
27.       In a full binary tree of height k, there are ................. internal nodes.
(A) 2k-1
(B) 2k-1
(C) 2k     
(D) 2k+1
Answer: A
28.       A binary tree is said to have heap property if the elements along any path:
(A) from leaf to root are non-increasing
(B) from leaf to root are non-decreasing
(C) from root to leaf are non-decreasing
(D) from root to leaf are non-increasing
Answer: D
29.       X.25 protocol consists of:
(A) Physical and Frame levels
(B) Frame and Packet levels
(C) Physical, Frame and Packet levels
(D) None of the above
Answer: C
30.    GSM/CDMA systems:
(A) are limited to very low speed data
(B) require no local loop wires
(C) are predominantly used for voice
(D) all of the above
Answer: D

Pages   2   3   4   5