Fundamentals of

Download 9.46 Mb.

Page	30/57
Date	09.01.2017
Size	9.46 Mb.
	#8172

1 ... 26 27 28 29 30 31 32 33 ... 57

structures.

32. Which name is best suited to a module that calculates overtime pay?

⁽^A)^Cal^c^oO^(B⁾^CoO

^(C)^Calc^u^la^t^e^o^v^ertⁱ^m^eO⁽^D⁾^Calcu^l^at^e^o^v^ertⁱ^m^e^O

33. The------- can be a useful tool when a program must be modified months or years after the original

writing.

⁽^A)^Flow^c^h^art^(B⁾^H^ie^r^arc^h^y^chart⁽^C)^Ps^eud^o^c^o^d^e⁽^D^{) Vari}^ab^l^e^d^eclara^tⁱ^on

34. In a program, the user sees a screen and can typically make Selections using a mouse or other

pointing device.

⁽^A)^Re^u^sa^b^le^(B⁾^M^o^d^u^lar⁽^C)^G^U^I⁽^D^{) Comma}ⁿ^d^-^liⁿ^e

_{35. Wh}_i_ch_s_t_{ep o}_c_curs_f_i_r_s_t_?

(A) Understanding user's needs

(B) Clarifying requirements

(D) Developing program logic

36. Variable declarations are made in the section of a program,

(A) Main loop (B) End-of-job routine (C) Housekeeping

37. Declaring a variable involves selecting a name and a

⁽^A)^Si^z^e^(B⁾^Leⁿ^g^t^h

⁽^C)^S^t^y^l^e⁽^D^{) Type}
(D) File opening

38. Some use a variable-naming convention called notation, in which a variable's data type or other information is stored as part of the name. For example, a numeric field might always start with the prefix num.

⁽^A)^P^r^ef^ix^(B⁾^Am^e^rican⁽^C)^P^o^lish⁽^D⁾^H^un^garⁱ^aⁿ

39. A group of variables is often called a .

⁽^A)^Liⁿ^k^ed^gr^o^u^p^(B⁾^D^a^t^a^s^t^r^u^ct^u^re⁽^C)^D^a^t^a^o^b^j^e^c^t⁽^D⁾^M^o^d^u^le

40. When a variable is it is both declared and initialized.

⁽^A)^Set^(B^{) Ins}^t^a^ntⁱ^a^t^ed⁽^C)^D^e^fⁱⁿ^e^d⁽^D⁾^D^o^c^u^m^eⁿ^t^ed

41.The time factor when determining the efficiency of algorithm is measured by

⁽^A)^co^untⁱⁿ^g^microsec^on^d^s

^(B)^C^o^un^tiⁿ^g^t^h^eⁿ^u^m^b^er^o^f^k^ey^o^p^eratⁱ^oⁿ^s

⁽^D⁾^C^o^un^tiⁿ^g^t^h^e^kⁱ^l^o^b^y^t^es^o^{f al}^g^o^rit^h^m

42. The space factor when determining the efficiency of algorithm is measured by

⁽^A)^Co^untⁱⁿ^g^T^h^e^M^axi^m^u^m^M^e^m^ory^N^e^e^d^ed^B^y^T^h^e^A^lgo^rⁱ^t^h^m

^(B)^C^o^un^tiⁿ^g^T^h^e^Mⁱⁿⁱ^m^u^m^M^e^m^o^ry^Need^e^d^By^The^A^l^g^o^rit^h^m

⁽^C)^Co^untⁱⁿ^g^T^h^{e Aver}^a^g^e^M^e^m^ory^N^e^e^d^ed^B^y^T^h^e⁽^A)lgori^t^h^m

(D) Counting the maximum disk space needed by the algorithm

43. Which of the following case does not exist in complexity theory

⁽^A)^Best^c^ase^(B⁾^Worst^c^a^se⁽^C)^Aver^a^ge^c^ase^D⁾^Nu^l^l^c^ase

44. The Worst case occur in linear search algorithm when

⁽^A)^I^t^em^is^s^o^mewh^e^reⁱⁿ^t^h^e^mⁱ^dd^le^of^t^h^e^arr^a^y

^(B)^It^e^mⁱ^{s n}^o^tⁱⁿ^t^h^e^arr^a^y^at^all

^(C)^It^e^mⁱ^s^t^h^e^last^el^e^m^ent^{in the arr}^a^y

(D) Item is the last element in the array or is not there at all

45. The Average case occur in linear search algorithm (A) When Item is somewhere in the middle of the array (B) When Item is not in the array at all

⁽^C)^W^h^{en I}^t^em^is^t^h^e^last^el^e^mentⁱⁿ^th^e^arr^a^y

⁽^D⁾^{When I}^t^em^is^t^h^e^last^e^l^e^m^{ent in t}^h^e^ar^r^a^y^o^{r is}ⁿ^o^t^t^h^ere^at^all

46. --------is used to write the algorithms.

(A) Computer Language 'C' (B) Computer Language 'C++'

47. There is no symbol for expressing while drawing a flowchart or writing an algorithm.

⁽^A)As^s^er^t^ion

⁽^C⁾^N^ega^t^ion

^(B)^Com^p^aris^oⁿ

⁽^D⁾^N^o^Ac^tⁱ^on

_{48. A}_progr_a_m_d_e_s_i_{gn to}_o_l_i_n_w_hi_c_h_s_t_an_d_{ard g}_r_ap_hi_cal_s_y_m_b_o_l_s_a_re_u_s_ed_t_o_r_epre_s_ent_t_he_l_og_i_cal_fl_o_w_o_f

data is called as a

(A)Flowchart

_

^(B)^Ps^eud^o^c^o^d^e⁽^C⁾^Alg^o^ri^th^m⁽^D⁾^Str^u^{ctured C}^h^a^r^t

49. Which of the following is 8.n iterative control structure?

⁽^A)Decision^M^a^kⁱⁿ^g⁽^B⁾^Se^qu^eⁿ^t^ial⁽^C⁾^J^u^mp

50. Which of the following structures are used in computer

_progr_a_m_s
(D)loop

⁽^A)Se^qu^eⁿ^t^ial
_A_N_S_W_ERS

^(B)^D^ecision⁽^{C) It}^e^ra^t^ive⁽^D⁾^All^{of a}^b^ove

1.A	2.C	3.C	4.D	5.B	6.B	7.A	8.A	9.B	10.C
¹¹^.^A	¹²^.^C	¹³^.^B	¹⁴^.^C	¹⁵^.^D	¹^6.C	¹⁷^.D	¹⁸^.B	¹⁹^.C	²⁰^.A
²¹^.A	²²^.C	²³^.A	²⁴^.B	²⁵^.A	²⁶^.A	²⁷^.A	²⁸^.C	²⁹^.D	³⁰^.C
³¹^.A	³²^.D	³³^.C	³⁴^.C	³⁵^.A	³⁶^.D	³⁷^.D	³⁸^.D	³⁹^.B	⁴⁰^.C
⁴¹^.B	⁴²^.A	⁴³^.D	⁴⁴^.D	⁴⁵^.A	⁴⁶^.D	⁴⁷^.D	⁴⁸^.A	⁴⁹^.D	⁵⁰^.D

1. Which of the following scenario is correct?

(A) flowchart->algorithm- > programming language (B) flowchart->programming language->algorithm (C) algorithm->flow chart->programming language (D) algorithm->programming language->flow chart

2. Instructions in algorithms should be

⁽^A)^P^r^e^c^ise^(B)^Uⁿ^a^m^bⁱ^gu^o^u^s

^(C)^P^r^eci^s^e^&^Unambi^g^u^o^u^s⁽^D⁾^N^oⁿ^e^o^f^a^b^ove

^3.As compared to a flowchart, it is easier to modify the of a program logic when program

Directory: downloads
downloads -> Northern England’s set-jetting locations
downloads -> Dynatest 3031 lwd light Weight Deflectometer
downloads -> Forth coming competitive exams
downloads -> Brush High School Morning Announcements Friday, September 05, 2014 all school
downloads -> Year 9 The Arts — Music
downloads -> Years 7 and 8 standard elaborations — Australian Curriculum: Music draft
downloads -> Chris Young sets 2016 “I’m Comin’ Over” Tour headlining dates
downloads -> Slavery and Abolition: the Plymouth Connection Introduction
downloads -> Summer Assignment

Download 9.46 Mb.

Share with your friends:

1 ... 26 27 28 29 30 31 32 33 ... 57