Computer (Data Structure) 2
Q-1 Program development life cycle is divided in how many parts?(a) 6 (b) 5
(c) 4 (d) 3
Q-2 Program design is called …………
(a) Top- design program (b) top- down program design
(c) Down- top program design (d) none of these
Q-3 How many program design tools are described in program development life cycle?
(c) Down- top program design (d) none of these
Q-3 How many program design tools are described in program development life cycle?
(a) 7 (b) 6
(c) 5 (d) 4
Q-4 A step-by-step description of how to arrive at a solution is called--------------.
(a) Decision tables (b) Structure charts
(c) Flow charts (d) Algorithm
Q-5 A special kind of table, which is divided in to four parts by a pair of horizontal& vertical lines are called-------.
(a) Decision tables (b) Structure charts
(c) Flow charts (d) Algorithms
Q-6 A diagram that shows the logic of the program is called-------.
(a) Algorithm (b) Flow charts
(c) Decision table (d) None of these
Q-7 ----------- is an another tools to describe the way to arrive at a solution.
(a) Coding table (b) Testing and debugging
(c) Pseudo codes (d) Flow charts
Q-8 A finite set of steps defining the solution of a particular problem is called-----------?
(a) Data structure (b) Implementing the program
(c) Documenting (d) Algorithm
Q-9 The format for the formal presentation of the algorithm Consists of
how many parts?
(a) 2 (b) 3
(c) 4 (d) 5
Q-10 The comments begin with a-------and the explain the purpose of the instruction.
(a) Single slashes (b) Double slash
(c) ¹ Sign (d) None of these
Q-11 The assignments statement will use the notation as-----------.
(a) Set A ¹2 (b) Max¹ai
(c) Set A=3 (d) Int ¹c’
Q-12 Data may be input & assigned to variable by means of a -------------statement.
(a) Write (b) Open
(c) Save (d) Read
Q-13 The algorithm is completed with the execution of the------------------.
(a) Last instruction (b) First instruction
(c) Middle instruction (d) Statement block
Q-14 Structured Programming constructs how many following type of programming constructs?
(a) 4 (b) 3
(c) 2 (d) 1
Q-15 The steps are executes one after other is called-----------------?
(a) Selection programming (b) Iterative programming
(c) Sequential programming (d) None of these
Q-16 The structure which implement conditions and depending on the out Come of the conditions may select one of the alternatives is called?
(a) Double attentive (b) Single alternative
(c) Multiple alternative (d) If structure
Q-17 Selection programming constructs how many following types of Programming constructs?
(a) 3 (b) 2
(c) 1 (d) None of these
Q-18 Which of these following selections programming construct are used in programming construct?
(a) Single alternatives (b) Double alternative
(c) Multiple alternative (d) All the above
Q-19 The instructions that are executed repetitively constitute the body of the loop is called---------?
(a) Selection programming construct
(b) Iterative programming construct
(c) Multiple programming construct
(d) None of these
Q-20 Iterative programming constructs & falls in to how many following categories?
(a) 5 (b) 4
(c) 3 (d) 2
Q-21 Which of the following iterative programming construct used in Programming construct?
(a) For construct (b) While construct
(c) Do- while construct (d) All the above
Q-22 The choice of particular algorithm depends on which of the following considerations?
(a) Programming requirements (b) Memory requirements
(c) Performance requirements (d) All of these
Q-23 The space needed to store the executable version of the program and is fixed is called--------?
(a) Instruction space (b) Date space
(c) Record space (d) None of these
Q-24 An algorithm is the amount of time it needs to run to completion is called----------?
(a) Time space trade-off (b) Time complexity
(c) Expressing space trade-off (d) None of these
Q-25 A characterization scheme that allows to measure prosperities of algorithms such as performance and for memory in a general fashion is called-----------?
(a) Recursion (b) Depth recursion
(c) Big Of Notation (d) Minmax problem
ANSWERS:-
1 (a) 62 (b) top- down program design
3 (c) 5
4 (d) Algorithm
5 (a) Decision tables
6 (b) Flow charts
7 (c) Pseudo codes
8 (d) Algorithm
9 (a) 2
10 (b) Double slash
11 (c) Set A=3
12 (d) Read
13 (a) Last instruction
14 (b) 3
15 (c) Sequential programming
16 (d) If structure
17 (a) 3
18 (d) All the above
19 (b) Iterative programming construct
20 (c) 3
21 (d) All the above
22 (d) All of these
23 (a) Instruction space
24 (b) Time complexity
25 (c) Big Of Notation