2. Software Architecture & Complexity By:- Pardesi Band Group www.ramkumarsjava.com

3. Programming language www.ramkumarsjava.com

4. @1.A programming language a>is a tool for instructing machines. b>a way of expressing relationships between concepts. c>allows a programmer to communicate with the machine h/w and control them. d>All of the above. Ans. D. www.ramkumarsjava.com

5. Q2. Assembly language uses ____ to translate assembly language statements into the target computer’s machine code. a>Translator b> Assembler c> compilers d>none of the above` Ans. B. www.ramkumarsjava.com

6. Q3. A typical machine that follows von Neumann architecture has: a>Processing unit b>Control unit c>Memory d>External mass Storage e> All of the above f> I am not sure Ans. e. www.ramkumarsjava.com

7. Q5.The wide spread use of programming language began with the arrival of ___. a>PASCAL b>COBOL c>ALGOL 60 d>FORTRAN e>NONE OF THESE f>I DON’T CARE Ans. D. www.ramkumarsjava.com

8. Q4. ___ is used to translate source code into machine language. a>Operating System b>Brower c>Compilers d>Assemblers Ans. C. www.ramkumarsjava.com

9. Language Implementation www.ramkumarsjava.com

10. A process where source code is translated into object code Interpretation Compilation www.ramkumarsjava.com

11. Interpretation process converts Intermediate object code – machine code Source code – machine code Source code - Intermediate object code www.ramkumarsjava.com

12. Cyclomatic Complexity www.ramkumarsjava.com

13. 1. No. Of linearly independent path 2. The no. Of path that one should test. 3. Both 1 and 2 4. Either 1 Or 2 www.ramkumarsjava.com

15. If Complexity = 10 then Minimum 10 cases will : 1. Cover all the code. 2. Test decision logic 3. Test the interaction between code construct 4. Test the UI www.ramkumarsjava.com

16. All except 4 www.ramkumarsjava.com

17. Cyclomatic Complexity is a metric s/w used to: 1. Measure the complexity of the program 2. Indicate the complexity of the Software 3. Only 1 4. Both 1 and 2 www.ramkumarsjava.com

19. Cyclomatic Complexity was developed by: 1. Thomas J. McCabe, Sr. In 1976 2. Sir Ravindra Jadeja in 1967 3. Sir Gabbar Singh in 1984 4. Sir Asaram Bapu in 2014 www.ramkumarsjava.com

20. Ans : u better know www.ramkumarsjava.com

21. The Complexity (M) is defined as : 1. M = E – N + 2P 2. M = E – N + P 3. M = N – E + 2P 4. M = N – P + 2E www.ramkumarsjava.com

22. Cyclomatic Complexity helps to : 1. Measure no. Of linearly independent path in a prog module. 2. It provides relative complexity of various design. 3. Compute complexity early in life cycle. 4. Guide the testing process by limiting the program logic during development. 5. All of the above. www.ramkumarsjava.com

23. Ans : 5 www.ramkumarsjava.com

24. M = 11 to 20 is ? 1. Low Complexity 2. High Complexity 3. Medium Complexity 4. Highly unstable www.ramkumarsjava.com

25. Ans : 3 www.ramkumarsjava.com

26. Cyclomatic Complexity help to : 1. Redesign complex modules 2. Allow more time for building and testing complex modules. 3. Assign more experienced personnel to the complex module. 4. Execute complicated people in your life. 5. 1, 2, 3 www.ramkumarsjava.com

27. Ans : Its obvious www.ramkumarsjava.com

28. When the determination is made that the class method are complex then the action justified are: 1. Re architect solution. 2. Split chosen methods into smaller chunks. 3. Generate detailed documentation. 4. Undergo extra reviews 5. All of the above www.ramkumarsjava.com

29. Ans : 5 www.ramkumarsjava.com

30. Advantage of Cyclomatic Complexity is? 1. Metric is directly related to maintainability and testabilty. 2. It can be computed immediately in the development cycle. 3. It warns the developer during the development itself where the code is complex. 4. Measures the minimum effort for testing. www.ramkumarsjava.com

31. Ans: All 4 www.ramkumarsjava.com

32. Tools available to compute Complexity are? 1. Acqt, Dqt (java) 2. Visual studio 2010/2008 (.Net) 3. Hammer 4. Axe www.ramkumarsjava.com

33. Ans: 1 & 2 www.ramkumarsjava.com

34. Accenture developed template to compute complexity by: 1. Manually 2. Automatically 3. Both www.ramkumarsjava.com

35. Ans : 1 www.ramkumarsjava.com

36. Programming Implementation And Paradigms www.ramkumarsjava.com

37. 1. Expression notations in a programming language can be written as? 1. Infix expression 2. Prefix expression 3. Postfix expression 4. Mixfix expression 5. All the above Ans 5 www.ramkumarsjava.com

38. 2. Choose the following: 1. Mixfix Expression 2. Infix Expression 3. Postfix Expression 4. Prefix Expression a. a b + c / b. a > b then a else b c. / * a c d. (a * b) + c * (d – e) 1.1-a, 2-b, 3-c, 4-d; 2.1-d, 2-c, 3-b, 4-a; 3.1-b, 2-d, 3-c, 4-a; 4.1-b, 2-d, 3-a, 4-c. www.ramkumarsjava.com

39. Ans 4 www.ramkumarsjava.com

40. 3. ____________ is an exception where all arithmetic operators have same precedence and are left associative. 1. C++ 2. Visual Basic 3. Smalltalk-80 4. C# www.ramkumarsjava.com

41. Ans 3 www.ramkumarsjava.com

42. 4. ____________ is the tree representation of the syntaxes of a language. 1. Program 2. Semantics 3. Abstract Syntax Tree 4. Syntax www.ramkumarsjava.com

43. Ans 3 www.ramkumarsjava.com

44. 5. The Paradigms into which Computer Programming languages are divided into: a. Procedural Programming b. Object-oriented Programming c. Functional Programming d. Logic Programming 1. a, b, c; 2. b, c, d; 3. a, b, c, d; 4. b and d. www.ramkumarsjava.com

45. Ans 3 www.ramkumarsjava.com

46. 6. The basic unit of Procedural Programming is: 1. data 2. action 3. code 4. bit www.ramkumarsjava.com

47. Ans 2 www.ramkumarsjava.com

48. 7. Choose the following: 1. Procedural Programming 2. Object-oriented 3. Functional 4. Logic a. LISP and Scheme b. FORTRAN, COBOL, C c. Prolog d. Smalltalk, C++, Java 1.1-d, 2-c, 3-b, 4-a; 2.1-b, 2-d, 3-a, 4-c; 3.1-b, 2-a, 3-d, 4-c; 4.1-a, 2-b, 3-c, 4-d. www.ramkumarsjava.com

49. Ans 2 www.ramkumarsjava.com

50. 8. Procedural paradigm is made up of: a. Declaration Segment b. Invocation Segment c. Definition Segment d. Procedure Segment 1. a, c, d; 2. b, c, d; 3. a, b, c; 4. a, b, c, d. www.ramkumarsjava.com

51. Ans 3 www.ramkumarsjava.com

52. 9. Advantages of Procedural programming are: 1. Sequential Computation 2. Static Programs, Dynamic Computations 3. Structured Programming 4. Syntax-Directed Control Flow 5. Memory leaks 6. 1,2,3,4 7. All the above www.ramkumarsjava.com

53. Ans 6 www.ramkumarsjava.com

54. 10. Choose the following: 1. Procedural Programming 2. Object-oriented Programming 3. Functional Programming 4. Logic Programming a. A program is considered a mathematical function. b. Uses principle of logical reasoning to answer queries. c. Is an active agent that uses passive objects that we refer to as data or data items. d. Deals with active objects instead of passive objects. 1.1-c, 2-b, 3-d, 4-a; 2.1-d, 2-a, 3-b, 4-c; 3.1-c, 2-d, 3-b, 4-a; 4.1-c, 2-d, 3-a, 4-b. www.ramkumarsjava.com

55. Ans 4 www.ramkumarsjava.com

56. 11. Features of Object-Oriented Programming: 1. Data Abstraction 2. Encapsulation 3. Inheritance 4. Polymorphism 5. All the above www.ramkumarsjava.com

57. Ans 5 www.ramkumarsjava.com

58. 12. Attributes of a good programming language are: 1. Simplicity 2. Conceptual Integrity 3. Portability 4. Robust 5. Reliability 6. Efficiency 7. Data Integrity, Object-Oriented 8. Security, 9. Dynamic binding and Reusability 10. All the above www.ramkumarsjava.com

59. Ans 10 www.ramkumarsjava.com

60. Thats All folks www.ramkumarsjava.com