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.

Thursday, 12 October 2017

Kerala SET Computer Science Paper II 2010 - Part 6

101.       Consider the following nested representation of binary trees:(X Y Z) indicates Y and Z are the left and right sub trees, respectively of node X. Note that Y and Z may be NULL, or further nested. Which of the following represents a valid binary tree?
(A) (12(4 5 6 7))
(B) (1(2 3 4)5 6)7)
(C) (1(2 3 4) (5 6 7))
(D) (1(2 3 NULL) (4 5))
Answer: C
102.       B+ trees are preferred to binary trees in data bases because
(A) Disk capacities are greater than memory capacities
(B) Disk access is much slower than memory access
(C) Disk data transfer rates are much less than memory data transfer rates
(D) Disks are more reliable than memory
Answer: D
103.       Given an arbitrary non-deterministic finite automation (NFA) with N states, the maximum number of states in an equivalent minimised DFA is at least
(A) N2
(B) 2N
(C) 2N
(D) N!
Answer: C
104.       In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
(A) log2n
(B) n/2
(C) log2n-1
(D) n
Answer: D
105.       The smallest finite automation which accepts the language {x| length of x is divisible by 3} has
(A) 2 states
(B) 3 states
(C) 4 states
(D) 5 states
Answer: C
106.       JavaScript code, embedded in a Web page runs from
(A) Client machine
(B) Server machine
(C) Both (A) and (B)
(D) None of these
Answer: A
107.       CGI enables
(A) A script/program to be run in the server to produce html output for http request.
(B) A script/program to be run in the client for producing dynamism
(C) Java Script program to be run from browsers
(D) None of the above
Answer: A
108.       Multiple inheritance is
1. Possible in C++
2. Not directly possible in Java
3. Not possible in C++ or Java
(A) 1 and 3 only
(B) 2 and 3 only
(C) 3 only
(D) 1 and 2 only
Answer: D
109.       Which of the following is not a storage class supported by C++?
(A) Register
(B) Auto
(C) Mutable
(D) Dynamic
Answer: D
110.    Which of the following method in Exception class is used to get the error message for the exception that was thrown?
(A) Print Message
(B) Extract Message
(C) Throw Message
(D) To String
Answer: D

111.    To promote encapsulation, Java provides an access modifier
(A) Public
(B) Private
(C) Static
(D) None of these
Answer: B
112.    Consider the words u=a2ba3b2 and v=bab2 What is |uv| ?
(A) 8
(B) 4
(C) 12
(D) 18
Answer: C
113.    In SQL, which command is used to select only one copy of each set of duplicate rows.
(D) All of the above
Answer: A
114.    In asynchronous transmission
(A) Inter-character gap is fixed
(B) Inter-character gap is variable
(C) Inter-character gap is always zero
(D) All of the above
Answer: B
115.    Which of the following device copies electrical signals from one Ethernet to another?
(A) Bridge
(B) Repeater
(C) Hub
(D) Passive Hub
Answer: B
116.    Aliasing in the context of programming languages refers to
(A) Multiple variables having the same memory location
(B) Multiple variables having the same value
(C) Multiple variables having the same identifier
(D) Multiple uses of the same variable
Answer: A
117.    Consider the following decision problems:
(P1) Does a given finite state machine accept a given string
(P2) Does a given context free grammar generate an infinite number of strings
Which of the following statements is true?
(A) Both (P1) and (P2) are decidable
(B) Neither (P1) and (P2) are decidable
(C) Only (P1) is decidable
(D) Only (P2) is decidable
Answer: A
118.    The value of j at the end of execution of the following C program is
int incr(int i)
static int count =0;
int i, j;
(A) 10
(B) 4
(C) 6
(D) 7
Answer: A
119.    Consider a machine with 64MB physical memory and a 32bit virtual address space. If the page size is 4KB, what is the approximate size of the page table?
(A) 16MB
(B) 8 MB
(C) 2 MB
(D) 24 MB
Answer: C
120.    Maximum number of edges in a n node undirected graph without self loops is
(A) n2
(B) n(n-1)/2
(C) n-1
(D) (n+1)(n)/2
Answer: B

No comments:

Post a Comment