Exam Details
Subject | programming principles | |
Paper | ||
Exam / Course | b.voc software development | |
Department | ||
Organization | Mar Ivanios College | |
Position | ||
Exam Date | November, 2016 | |
City, State | kerala, thiruvananthapuram |
Question Paper
(Pages 1649
P.T.O.
MAR IVANIOS COLLEGE (AUTONOMOUS)
THIRUVANANTHAPURAM
Reg. No. :.………………… Name :………………….
First Semester B.Voc. Degree Examination, November 2016
First Degree Programme under CSS
Skill Course II: (for Software Development)
AUSD172: Programming Principles
Common for Regular 2016 Admn. and Improvement 2015 Admn.
Time: 3 Hours Max. Marks: 80
SECTION A
Answer ALL questions in one or two sentences.
1. What is solution architecture
2. What is software maintenance
3. What are the types of software
4. Define interpreter.
5. Define inheritance.
6. List the three ways to represent an algorithm.
7. What is meant by structured programming
8. What is recursive function
9. Define algorithm.
10. Define debugging.
(10 1 10 Marks)
SECTION B
Answer any EIGHT questions, not exceeding a paragraph of 50 words.
11. What is solution refinement
12. Define stress testing.
13. What is the need for documentation
1649
2
14. Write the examples of high level languages
15. What are the advantages of high level language
16. What are the disadvantages of machine language
17. What are the types of action keywords
18. What are the stages of programming life cycle
19. What are the characteristics of a good computer program
20. Define recursive algorithm and its types.
21. What is space complexity
22. What is profilling
2 16 Marks)
SECTION C
Answer any SIX questions, in a page of 100 words.
23. Explain testing life cycle.
24. What is solution design documentation
25. Differentiate compiler and interpreter.
26. Explain the features of object oriented programming.
27. Compare the features of top down and bottom up approaches.
28. Draw the basic flow chart shapes and explain.
29. How to validate and analyze the algorithm
30. Explain time complexity with example.
31. How to analyze asymptotic complexity
4 24 Marks)
SECTION D
Answer any TWO questions, not exceeding four pages.
32. What are different testing strategies
33. Explain the different types of programming languages.
34. Explain algorithms and its representations.
35. Explain in detail about asymptotic notations with theorem.
15 30 Marks)
P.T.O.
MAR IVANIOS COLLEGE (AUTONOMOUS)
THIRUVANANTHAPURAM
Reg. No. :.………………… Name :………………….
First Semester B.Voc. Degree Examination, November 2016
First Degree Programme under CSS
Skill Course II: (for Software Development)
AUSD172: Programming Principles
Common for Regular 2016 Admn. and Improvement 2015 Admn.
Time: 3 Hours Max. Marks: 80
SECTION A
Answer ALL questions in one or two sentences.
1. What is solution architecture
2. What is software maintenance
3. What are the types of software
4. Define interpreter.
5. Define inheritance.
6. List the three ways to represent an algorithm.
7. What is meant by structured programming
8. What is recursive function
9. Define algorithm.
10. Define debugging.
(10 1 10 Marks)
SECTION B
Answer any EIGHT questions, not exceeding a paragraph of 50 words.
11. What is solution refinement
12. Define stress testing.
13. What is the need for documentation
1649
2
14. Write the examples of high level languages
15. What are the advantages of high level language
16. What are the disadvantages of machine language
17. What are the types of action keywords
18. What are the stages of programming life cycle
19. What are the characteristics of a good computer program
20. Define recursive algorithm and its types.
21. What is space complexity
22. What is profilling
2 16 Marks)
SECTION C
Answer any SIX questions, in a page of 100 words.
23. Explain testing life cycle.
24. What is solution design documentation
25. Differentiate compiler and interpreter.
26. Explain the features of object oriented programming.
27. Compare the features of top down and bottom up approaches.
28. Draw the basic flow chart shapes and explain.
29. How to validate and analyze the algorithm
30. Explain time complexity with example.
31. How to analyze asymptotic complexity
4 24 Marks)
SECTION D
Answer any TWO questions, not exceeding four pages.
32. What are different testing strategies
33. Explain the different types of programming languages.
34. Explain algorithms and its representations.
35. Explain in detail about asymptotic notations with theorem.
15 30 Marks)
Other Question Papers
Subjects
- advanced java
- animation softwares
- aptitude & logical reasoning
- business informatics
- business statistics
- c programming
- computer hardware & maintenance
- database administration
- entrepreneurship development
- environmental studies
- financial accounting
- free and open source software
- human resource development
- introduction to information security
- introduction to it
- it & society
- listening and speaking skills
- management information systems
- managerial economics
- mathematics – i
- mathematics i
- mathematics ii
- mobile application development
- network administration
- networks & internet applications
- networks and internet applications
- object oriented programming
- operating systems
- principles of management
- programming in java
- programming principles
- software engineering
- software testing
- system analysis and design
- visual tools
- web application & development
- word processing & image editing
- word processing and image editing
- writing and presentation skills