Fundamentals of

Download 9.46 Mb.

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

1 ... 49 50 51 52 53 54 55 56 57

21. Indentation is used to format

(A) Program source code

(B) Object code

⁽^C)^Execu^t^a^b^le^c^o^d^e

⁽^D^{) All}^of^t^h^e^a^b^o^ve

22. Consider the following statements regarding algorithms:

(a) Each instruction of an algorithm should be executed in a finite time

^{(b) One}^o^r^m^o^reⁱⁿ^s^tructⁱ^oⁿ^s^o^{f an}^al^g^o^rit^h^m^s^h^o^u^ldⁿ^o^t^b^e^re^p^ea^t^edⁱⁿ^fⁱⁿ^itely

^(c)^Aⁿ^y^p^r^o^g^r^a^m^is^an^al^g^o^rⁱ^thm
(A) A, B, C and D are true (B) Only A, Band D are true (C) Only B, C and D are true (D) Only A, Band C are true

23. Another name for pseudo code is

(A) Imitation code

^(B⁾^Fl^o^wc^h^art

⁽^C)^P^r^ogram

⁽^D^{) Alg}^o^ri^t^h^m

24. How many basic symbols are available to draw a flowchart?

(A) 4 (B) 6 (C) 8 (D) 7

25. Which of the following is not the way to represent an algorithm?

(A) As an executable code

(B) As a program

⁽^C)^As^a^f^low^c^h^a^r^t

⁽^D^{) As}^a^p^se^u^d^o^c^o^d^e

26. Consider the following statements and determine which of the following is correct?

(a) Indentation makes programs more readable and simpler to understand

^{(b) I}^nd^entatⁱ^oⁿ^is^c^o^m^pu^ls^o^ry^whi^l^e^w^ritiⁿ^g^a^pro^g^r^a^m
(A) Only (a) is true

(B) Only (b) is true

^(C)^B^o^{th (a)}^&⁽^b⁾^a^r^e^true

⁽^D⁾^B^o^th^(a)^&^(b)^{are fa}^l^se

27. The valid symbol(s) in flowchart is/are _

⁽^A)^Coⁿⁿ^ec^t^o^r

^(B)^T^er^mⁱⁿ^al^S^y^m^b^o^l

^(C)^P^r^o^c^essing^S^y^m^b^o^l

⁽^D^{) All}^{of a}^b^o^ve

28. The algorithm cannot be represented as

(A) A flowchart (B) a program (C) a process

⁽^D^{) a}^p^s^e^ud^o^c^o^d^e

29. A decision symbol can be used for

(A) A two way branch decision (B) A three way branch decision (C) Multiple way branch decision (D) All of the above

30. What is a Hungarian notation?

(A) Notation for writing Loops (B) Notation for Manipulating Pointers

^(C)^No^tatⁱ^oⁿ^f^o^r^w^ritiⁿ^g^Va^r^ia^b^{le Na}^m^es

⁽^D⁾^F^l^o^w^c^h^a^r^t^No^tatⁱ^oⁿ

31. Each step in an algorithm should be performed in a time.

⁽^A)^Fiⁿⁱ^t^e

⁽^C)^s^h^ort

^(B⁾^In^fⁱⁿⁱ^t^e

⁽^D^{) Lo}ⁿ^g.

32. Which of the following statement is not appropriate?

(A) Indentation improves the performance of the program.

^(B)^I^nd^entatⁱ^oⁿ^isⁿ^e^e^d^ed^t^o^m^a^k^e^the^pro^g^r^a^m^m^o^re^rea^d^a^b^le.

^(C)^I^nd^entatⁱ^oⁿ^hel^p^s^the^p^r^o^g^ram^t^o^disti^ngu^ish^c^oⁿ^t^r^o^{l st}^a^t^e^m^en^t^s.

⁽^D⁾^I^nd^ent^a^ti^oⁿ^m^a^k^e^s^the^p^r^o^g^ram^e^a^s^y^t^o^deb^ug^.

33. The structured programming languages are also known as languages.

⁽^A)^O^b^j^e^c^t^orⁱ^eⁿ^t^ed

^(B⁾^P^r^o^c^e^du^re^ori^eⁿ^t^ed

^(C)^M^o^du^lar^p^r^o^g^ra^m^mⁱⁿ^g

⁽^D^{) All}^t^h^e^a^b^ove

34. A Symbol is used in a flowchart to represent arithmetic and data movement instructions.

⁽^A)^{Flow li}ⁿ^es

^(C)^I^npu^t^/^o^u^tp^u^t

^(B⁾^P^r^o^c^essiⁿ^g

⁽^D^{) Ter}^mⁱⁿ^al.

35. The with arrowheads are used to indicate the flow of an operation, that is, the exact Sequence in which the instructions are to be executed.

⁽^A)^{Flow li}ⁿ^es^(B⁾^P^r^o^c^essiⁿ^g

⁽^C)^D^ecision⁽^D^{) Ter}^mⁱⁿ^al.

36. The use of an algorithm is not intended for

(A) Modularizing the programs

^(B⁾^D^o^c^u^ment^atⁱ^oⁿ

⁽^D⁾^D^e^b^u^ggiⁿ^g

37. Which of the following is a low level language?

⁽^A)^C

^(B⁾^LISP

^(C)^M^ac^hⁱⁿ^e^L^e^v^el^L^a^ngu^a^g^e

⁽^D^{) JA}^V^A

38. Which of the following language is best suited for system-level programming?

(A) BASIC (C) LISP

^(B⁾^C

⁽^D^{) JA}^V^A

39. Which of the following sequence is correct?

(A) Source code - compiler - object code - linker - executable code (B) Source code -linker - object code compiler - executable code (C) Object code - compiler - source code - linker - executable code

⁽^D⁾^Object^c^o^d^e^-liⁿ^k^e^r^-^s^ou^rce^c^o^d^e^-^c^o^m^p^iler^-^e^x^e^c^u^tab^l^e^c^o^d^e

40. The computer software has been classified into two categories. They are _

(A) Hardware & Software

^(B)^I^npu^t^&^O^u^tp^u^t

^(C)^Sy^s^t^e^m^S^o^ft^w^a^r^e^&^A^pp^licati^oⁿ^s^o^f^t^ware

⁽^D^{) Li}ⁿ^k^er^{& L}^o^a^d^er

41. A 'C' program is portable means it

(A) Can run on any machine

^(B)^Can^write^oⁿ^aⁿ^y^m^ac^hⁱⁿ^e

^(C)^Can^r^{ead fr}^o^m^as^w^ell^a^s^w^ri^t^e^t^o^any^m^ac^hⁱⁿ^e

⁽^D^{) All}^o^f^t^h^e^a^b^ove

42. Which programming language is machine independent?

(A) Machine level language (B) Assembly level language (C) High level language

⁽^D⁾^B^o^t^h^A^aⁿ^d^B

43. A program that aids in effective execution of user programs is called

(A) Application program

^(B)^Sy^s^t^e^m^p^r^o^g^ram

^(C)^B^o^{th S}^y^st^e^m^and^A^pp^li^c^ati^oⁿ^p^r^o^g^ram

(D) N either System nor Application program

44. instruct the assembler to perform certain actions during the assembly of programs

(A) Assembler directives

^(B)^C^om^pⁱ^l^er^d^ire^c^ti^v^es

^(C)^D^eclaratⁱ^v^e^s^t^a^t^e^m^en^t^s

⁽^D⁾^I^m^p^er^a^ti^v^e^st^a^t^e^m^ents

45. is an example of a High Level language.

(A) C ++ (C) Java

(B) Assembly language.

(D) Both A & C

46. Low level languages are _

(A) Machine level language (B) Assembly level language (C) High level language

⁽^D⁾^B^o^t^h^A^aⁿ^d^B

47. Language is understood by a computer without using translation as

Assembly language

^(B⁾^Sym^b^{olic la}ⁿ^g^u^age

⁽^C)^M^achiⁿ^e^l^aⁿ^g^u^a^g^e

⁽^D⁾^H^ig^h^{er lev}^e^l^l^aⁿ^g^u^age

48. Application software can be for _

⁽^A)^O^p^er^atⁱⁿ^g^s^y^s^t^em

^(B⁾^Traⁿ^sla^t^or

^(C)^Geⁿ^eral-^pu^r^p^o^se^ap^p^li^c^ati^oⁿ^&^A^pp^licatⁱ^oⁿ^specifⁱ^c^s^o^l^u^tⁱ^oⁿ^s

⁽^D^{) All}^o^f^t^h^e^a^b^ove

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 ... 49 50 51 52 53 54 55 56 57