<<Back
26. Match the following with respect to the mobile computing technologies :
List – I List – II
a. GPRS i. An integrated digital radio standard
b. GSM ii. 3G wireless/Mobile technology
c. UMTS iii. Nine different schemes for modulation and error correction
d. EDGE iv. An emerging wireless service that offers a mobile data
Codes :
a b c d
(A) iii iv ii i
(B) iv i ii iii
(C) ii iii iv i
(D) ii i iv iii
27. Object Request Broker (ORB) is
I. A software program that runs on the client as well as on the application server.
II. A software program that runs on the client side only.
III. A software program that runs on the application server, where most of the components reside.
(A) I, II & III (B) I & II (C) II & III (D) I only
28. A software agent is defined as
I. A software developed for accomplishing a given task.
II. A computer program capable of acting on behalf of user in order to accomplish a given computational task.
III. An open source software for accomplishing a given task.
(A) I (B) II (C) III (D) All of the above
29. Match the following :
List – I List – II
a. Classification i. Principal component analysis
b. Clustering ii. Branch and Bound
c. Feature Extraction iii. K-nearest neighbour
d. Feature Selection iv. K-means
Codes :
a b c d
(A) iii iv ii i
(B) iv iii i ii
(C) iii iv i ii
(D) iv iii ii i
30. SET, an open encryption and security specification model that is designed for protecting credit card transactions on the internet, stands for
(A) Secure Electronic Transaction (B) Secular Enterprise for Transaction
(C) Security Electronic Transmission (D) Secured Electronic Termination
31. In a paged memory management algorithm, the hit ratio is 70%. If it takes 30 nanoseconds to search Translation Look-aside Buffer (TLB) and 100 nanoseconds (ns) to access memory, the
effective memory access time is
(A) 91 ns (B) 69 ns (C) 200 ns (D) 160 ns
32. Match the following :
List – I List – II
a. Multilevel feedback queue i. Time-slicing
b. FCFS ii. Criteria to move processes between queues
c. Shortest process next iii. Batch processing
d. Round robin scheduling iv. Exponential smoothening
Codes :
a b c d
(A) i iii ii iv
(B) iv iii ii i
(C) iii i iv i
(D) ii iii iv i
33. Consider a system with five processes P0 through P4 and three resource types R1, R2 and R3. Resource type R1 has 10 instances, R2 has 5 instances and R3 has 7 instances. Suppose that at time
T0, the following snapshot of the system has been taken :
Assume that now the process P1 requests one additional instance of type R1 and two instances of resource type R3. The state resulting after this allocation will be
(A) Ready state (B) Safe state (C) Blocked state (D) Unsafe state
34. Match the following :
List – I List – II
a. Contiguous allocation i. This scheme supports very large file sizes.
b. Linked allocation ii. This allocation technique supports only sequential files.
c. Indexed allocation iii. Number of disks required to access file is minimal.
d. Multi-level indexed iv. This technique suffers from max wastage of space in storing pointers.
Codes :
a b c d
(A) iii iv ii i
(B) iii ii iv i
(C) i ii iv iii
(D) i iv ii iii
35. Which of the following commands will output “one two three” ?
(A) for val; do echo-n $val; done < one two three
(B) for one two three; do echo-n-; done
(C) for n in one two three; do echo-n $n; done
(D) for n in one two three {echo –n $ n}
36. Mergesort makes two recursive calls. Which statement is true after these two recursive calls finish, but before the merge step ?
(A) The array elements form a heap.
(B) Elements in each half of the array are sorted amongst themselves.
(C) Elements in first half of the array are less than or equal to elements in second half of the array.
(D) All of the above
37. A text is made up of the characters a, b, g, d and s with the probability 0.12, 0.40, 0.15, 0.08 and 0.25 respectively. The optimal coding technique will have the average length of
(A) 1.7 (B) 2.15 (C) 3.4 (D) 3.8
38. Searching for an element in the hash table requires O(1) time for the ________ time, whereas for direct addressing it holds for the ________ time.
(A) worst-case, average (B) worst-case, worst-case (C) average, worst-case (D) best, average
39. An algorithm is made up of 2 modules M1 and M2. If time complexity of modules M1 and M2 are h(n) and g(n) respectively, the time complexity of the algorithm is
(A) min (h(n), g(n)) (B) max (h(n), g(n)) (C) h(n) + g(n) (D) h(n) * g(n)
40. What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis expression given by ( ( ) ( ( ) ) ( ( ) ) )
(A) 2 (B) 3 (C) 4 (D) 5
41. Match the following :
List – I List – II
a. Automatic storage class i. Scope of the variable is global.
b. Register storage class ii. Value of the variable persists between different function calls.
c. Static storage class iii. Value stored in memory& local to block in which variable is defined.
d. External storage class iv. Value stored in CPU registers.
Codes :
a b c d
(A) iii iv i ii
(B) iii iv ii i
(C) iv iii ii i
(D) iv iii i ii
42. When we pass an array as an argument to a function, what actually gets passed ?
(A) Address of the array (B) Values of the elements of the array
(C) Base address of the array (D) Number of elements of the array
43. While (87) printf(“computer”);
The above C statement will
(A) print “computer” 87 times (B) print “computer” 0 times
(C) print “computer” 1 times (D) print “computer” infinite times
44. A friend function can be used to
(A) avoid arguments between classes. (B) allow access to classes whose source code is unavailable.
(C) allow one class to access an unrelated class. (D) None of the above
45. Which of the following is the correct value returned to the operating system upon the successful completion of a program ?
(A) 0 (B) 1 (C) – 1 (D) Program do not return a value.
46. Manager’s salary details are hidden from the employee. This is called as
(A) Conceptual level data hiding (B) Physical level data hiding
(C) External level data hiding (D) Local level data hiding
47. Which of the following statements is false ?
(A) Any relation with two attributes is in BCNF.
(B) A relation in which every key has only one attribute is in 2NF.
(C) A prime attribute can be transitively dependent on a key in 3NF relation.
(D) A prime attribute can be transitively dependent on a key in BCNF relation.
48. A clustering index is created when _______.
(A) primary key is declared and ordered (B) no key ordered
(C) foreign key ordered (D) there is no key and no order
49. Let R ={A, B, C, D, E, F} be a relation schema with the following dependencies C -> F, E -> A, EC -> D, A -> B
Which of the following is a key for R ?
(A) CD (B) EC (C) AE (D) AC
50. Match the following :
List – I List – II
a. DDL i. LOCK TABLE
b. DML ii. COMMIT
c. TCL iii. Natural Difference
d. BINARY Operation iv. REVOKE
Codes :
a b c d
(A) ii i iii iv
(B) i ii iv iii
(C) iii ii i iv
(D) iv i ii iii
COMPUTER SCIENCE AND APPLICATIONS
Paper – II
List – I List – II
a. GPRS i. An integrated digital radio standard
b. GSM ii. 3G wireless/Mobile technology
c. UMTS iii. Nine different schemes for modulation and error correction
d. EDGE iv. An emerging wireless service that offers a mobile data
Codes :
a b c d
(A) iii iv ii i
(B) iv i ii iii
(C) ii iii iv i
(D) ii i iv iii
27. Object Request Broker (ORB) is
I. A software program that runs on the client as well as on the application server.
II. A software program that runs on the client side only.
III. A software program that runs on the application server, where most of the components reside.
(A) I, II & III (B) I & II (C) II & III (D) I only
28. A software agent is defined as
I. A software developed for accomplishing a given task.
II. A computer program capable of acting on behalf of user in order to accomplish a given computational task.
III. An open source software for accomplishing a given task.
(A) I (B) II (C) III (D) All of the above
29. Match the following :
List – I List – II
a. Classification i. Principal component analysis
b. Clustering ii. Branch and Bound
c. Feature Extraction iii. K-nearest neighbour
d. Feature Selection iv. K-means
Codes :
a b c d
(A) iii iv ii i
(B) iv iii i ii
(C) iii iv i ii
(D) iv iii ii i
30. SET, an open encryption and security specification model that is designed for protecting credit card transactions on the internet, stands for
(A) Secure Electronic Transaction (B) Secular Enterprise for Transaction
(C) Security Electronic Transmission (D) Secured Electronic Termination
31. In a paged memory management algorithm, the hit ratio is 70%. If it takes 30 nanoseconds to search Translation Look-aside Buffer (TLB) and 100 nanoseconds (ns) to access memory, the
effective memory access time is
(A) 91 ns (B) 69 ns (C) 200 ns (D) 160 ns
32. Match the following :
List – I List – II
a. Multilevel feedback queue i. Time-slicing
b. FCFS ii. Criteria to move processes between queues
c. Shortest process next iii. Batch processing
d. Round robin scheduling iv. Exponential smoothening
Codes :
a b c d
(A) i iii ii iv
(B) iv iii ii i
(C) iii i iv i
(D) ii iii iv i
33. Consider a system with five processes P0 through P4 and three resource types R1, R2 and R3. Resource type R1 has 10 instances, R2 has 5 instances and R3 has 7 instances. Suppose that at time
T0, the following snapshot of the system has been taken :
Assume that now the process P1 requests one additional instance of type R1 and two instances of resource type R3. The state resulting after this allocation will be
(A) Ready state (B) Safe state (C) Blocked state (D) Unsafe state
34. Match the following :
List – I List – II
a. Contiguous allocation i. This scheme supports very large file sizes.
b. Linked allocation ii. This allocation technique supports only sequential files.
c. Indexed allocation iii. Number of disks required to access file is minimal.
d. Multi-level indexed iv. This technique suffers from max wastage of space in storing pointers.
Codes :
a b c d
(A) iii iv ii i
(B) iii ii iv i
(C) i ii iv iii
(D) i iv ii iii
35. Which of the following commands will output “one two three” ?
(A) for val; do echo-n $val; done < one two three
(B) for one two three; do echo-n-; done
(C) for n in one two three; do echo-n $n; done
(D) for n in one two three {echo –n $ n}
36. Mergesort makes two recursive calls. Which statement is true after these two recursive calls finish, but before the merge step ?
(A) The array elements form a heap.
(B) Elements in each half of the array are sorted amongst themselves.
(C) Elements in first half of the array are less than or equal to elements in second half of the array.
(D) All of the above
37. A text is made up of the characters a, b, g, d and s with the probability 0.12, 0.40, 0.15, 0.08 and 0.25 respectively. The optimal coding technique will have the average length of
(A) 1.7 (B) 2.15 (C) 3.4 (D) 3.8
38. Searching for an element in the hash table requires O(1) time for the ________ time, whereas for direct addressing it holds for the ________ time.
(A) worst-case, average (B) worst-case, worst-case (C) average, worst-case (D) best, average
39. An algorithm is made up of 2 modules M1 and M2. If time complexity of modules M1 and M2 are h(n) and g(n) respectively, the time complexity of the algorithm is
(A) min (h(n), g(n)) (B) max (h(n), g(n)) (C) h(n) + g(n) (D) h(n) * g(n)
40. What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis expression given by ( ( ) ( ( ) ) ( ( ) ) )
(A) 2 (B) 3 (C) 4 (D) 5
41. Match the following :
List – I List – II
a. Automatic storage class i. Scope of the variable is global.
b. Register storage class ii. Value of the variable persists between different function calls.
c. Static storage class iii. Value stored in memory& local to block in which variable is defined.
d. External storage class iv. Value stored in CPU registers.
Codes :
a b c d
(A) iii iv i ii
(B) iii iv ii i
(C) iv iii ii i
(D) iv iii i ii
42. When we pass an array as an argument to a function, what actually gets passed ?
(A) Address of the array (B) Values of the elements of the array
(C) Base address of the array (D) Number of elements of the array
43. While (87) printf(“computer”);
The above C statement will
(A) print “computer” 87 times (B) print “computer” 0 times
(C) print “computer” 1 times (D) print “computer” infinite times
44. A friend function can be used to
(A) avoid arguments between classes. (B) allow access to classes whose source code is unavailable.
(C) allow one class to access an unrelated class. (D) None of the above
45. Which of the following is the correct value returned to the operating system upon the successful completion of a program ?
(A) 0 (B) 1 (C) – 1 (D) Program do not return a value.
46. Manager’s salary details are hidden from the employee. This is called as
(A) Conceptual level data hiding (B) Physical level data hiding
(C) External level data hiding (D) Local level data hiding
47. Which of the following statements is false ?
(A) Any relation with two attributes is in BCNF.
(B) A relation in which every key has only one attribute is in 2NF.
(C) A prime attribute can be transitively dependent on a key in 3NF relation.
(D) A prime attribute can be transitively dependent on a key in BCNF relation.
48. A clustering index is created when _______.
(A) primary key is declared and ordered (B) no key ordered
(C) foreign key ordered (D) there is no key and no order
49. Let R ={A, B, C, D, E, F} be a relation schema with the following dependencies C -> F, E -> A, EC -> D, A -> B
Which of the following is a key for R ?
(A) CD (B) EC (C) AE (D) AC
50. Match the following :
List – I List – II
a. DDL i. LOCK TABLE
b. DML ii. COMMIT
c. TCL iii. Natural Difference
d. BINARY Operation iv. REVOKE
Codes :
a b c d
(A) ii i iii iv
(B) i ii iv iii
(C) iii ii i iv
(D) iv i ii iii
No comments:
Post a Comment