## APPSC-2012-DL-CS

 Question 1
The storage place that holds data and instruction temporarily within CPU is
 A Accumulator B Bus C Register D Addresses
Computer-Organization       Types-of-Memory
Question 1 Explanation:
Register holds both data and instruction temporarily within the CPU .
Note that Accumulator holds only data and not the instruction.
 Question 2
Which of the following supports the concept of multiple inheritance?
 A C++ B Java C Both C++ and Java D None
OOPS       C++
Question 2 Explanation:
C++ supports multiple inheritance whereas java does not.
 Question 3
Which of the following statements is false?
 A A tree contains a cycle B Every tree is a graph C A tree with N nodes contain N-1 edges D All the above
Engineering-Mathematics       Graph-Theory
Question 3 Explanation:
A tree does not contain a cycle. A tree with n vertices contains n-1 edges. And every tree is a graph.
 Question 4

Match the following typical example problems with suitable algorithm-design paradigms

A: Minimal Spanning Tree

B: Binary Search Algorithm

C: Depth-First Search

D: Optimization

I: Divide and Conquer

II: Greedy Method

III: NLP

IV: Backtracking
 A A-II, B-I, C-IV, D-III B A-III, B-II, C-IV, D-I C A-III, B-I, C-IV, D-II D A-IV, B-I, C-II, D-III
Question 4 Explanation:
A. Minimal spanning tree is a greedy algorithm.
B. Binary Search algorithm is a divide and conquer strategy.
C. Depth first search algorithm is a backtracking method.
D. Optimization is a NLP method.
 Question 5

What is the output of the following Pascal program segment?

{c: array [1..10] of integer;

m, n, temp : integer;

procedure r (k, j : integer)

begin

k :=k+1; j :=j+2;

end r;

m :5; n := 3;

r(m, n)

temp;=m; m:=n; n:temp;

write m, n;

}
 A 3, 5 B 5, 3 C Either 3, 5 or 5, 3 D Unpredictable E Answer the above question with explanation
Programming       Arrays
 Question 6
Which of the following statements is false?
 A An unambiguous grammar has the same leftmost and rightmost derivation B An LL(1) parser is a top-down parser C LALR is more powerful than SLR D An unambiguous grammar can never be LR(k) for any k
Compiler-Design       Parsers
Question 6 Explanation:
1 is false because unambiguous grammar need not have the same leftmost and rightmost derivation.
4 is false because the correct statement is an ambiguous grammar can never be LR(K) for any k.
 Question 7
With respect to paging, which of the following is false
 A It is based on a linear logical memory addressing concept. B Entire program need not be loaded into memory before execution C It suffers from both internal and external fragmentations D Page table is not required once a program is loaded
Operating-Systems       Memory-Management
Question 7 Explanation:
paging does not suffers from external fragmentation because space allocated to a process need not be contiguous. But paging suffers from internal fragmentation because on an average half of the last page of process gets wasted.
 Question 8
Relation R with an associated set of functional dependencies F is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is
 A Zero B More than Zero but less than that of an equivalent 3NF C Proportional to the size of F+ D Indeterminate
Database-Management-System       Normalization
Question 8 Explanation:
Redundancy in the resulting set of relations decomposed BCNF is zero.
 Question 9
A wire frame model is
 A visual presentation of an electronic representation of a 3D physical object B exploits hidden line removal via cutting planes C allows visualization of the underlying design structure of a 3D model D all the above
 Question 10
In which layer of the OSI model, DBMS and email software are found
 A Presentation Layer B Transport layer C Application Layer D Sessional layer
Computer-Networks       ISO-OSI-layers
Question 10 Explanation:
Both the end user and the application layer interact with the software applications.
 Question 11
The consistency model supported in IVT (Integrated shared virtual memory at yale) is
 A Sequential Consistency B General Consistency C Strict Consistency D Weak Consistency E Update it
Operating-Systems       Memory-Management
 Question 12
____________ is the assurance that the application will perform its intended function with the required precision over an extended period of time
 A Compatibility B Reliability C Maintainability D portability E Update it
 Question 13
Which sorting method is best suited for external sorting?
 A Quick Sort B Heap Sort C Merge sort D All the above
Algorithms       Sorting
Question 13 Explanation:
External sorting is a term for a class of sorting algorithms that can handle massive amounts of data. External sorting is required when the data being sorted do not fit into the main memory of a computing device (usually RAM) and instead they must reside in the slower external memory (usually a hard drive). External sorting typically uses a hybrid sort-merge strategy. In the sorting phase, chunks of data small enough to fit in main memory are read, sorted, and written out to a temporary file. In the merge phase, the sorted sub-files are combined into a single larger file.
 Question 14
Which of the following is a symmetric key algorithm?
 A Blowfish B IDEA C AES D All the above
Computer-Networks       Network-Security
Question 14 Explanation:
Blowfish,IDEA,AES all are private key or symmetric key encryption algorithms.
 Question 15
Which of the following is a random access (primary) memory?
 A Disk B Tape C ROM D None
Digital-Logic-Design       RAM
Question 15 Explanation:
Disk ,Tape ,ROM are all permanent storage memory.
 Question 16
The main difference between a CISC and a RISC processor is/are that a RISC processor typically has
 A Has fewer instructions and addressing modes B Has more registers C Easy to implement using hardwired control logic D All of the above
Computer-Organization       RISC-and-CISC
Question 16 Explanation:
All of the above statements are the characteristics of RISC processor.
 Question 17
What is the proper way of defining a class named A so that it cannot be subclassed?
 A class A{ } B abstract final class A { } C class A {final;} D final class A { }
 Question 18
BFS uses the following data structure to hold nodes that are waiting to be processed
 A Queue B Stack C File D All the above
Data-Structures       Queues-and-Stacks
Question 18 Explanation:
BFS uses Queue data structure. DFS uses Stack data structure.
 Question 19
Which of the following is not a right paradigm for solving the 0/1-knapsack problem?
 A Dynamic Programming B Branch and Bound C Greedy Approximation D Divide and Conquer
Algorithms       Dynamic-Programming
Question 19 Explanation:
0/1-knapsack problem is a dynamic programming paradigm.
 Question 20
__________ is the enforcement of a clear separation between the abstract properties of a data type and the concrete details of its implementation.
 A Control Abstraction B Data Abstraction C Abstract Data Type (ADT) D None of the above
 Question 21
Type checking is normally done during
 A Lexical Analysis B Syntax-directed Translation C Syntax Analysis D Code Optimization
Compiler-Design       Compilers
Question 21 Explanation:
Type checking is normally done during syntax-directed translation.
 Question 22
System call is a
 A A mechanism used by a program to request service from the OS B A mechanism used by a programmer to request service from the administrator. C A mechanism used by a programmer to request service from the I/O devices. D All the above
Operating-Systems       System-Calls
Question 22 Explanation:
System call is a mechanism used by a program to request service from OS.
There are 22 questions to complete.

Register Now