0% found this document useful (0 votes)
66 views2 pages

SCS101 Revision Notes and Questions

The document outlines the syllabus and key topics for an introductory computer programming course (SCS101), covering programming principles, the program development cycle, algorithm development, C programming basics, control structures, functions, data structures, and program documentation. It includes a question bank divided into four portions for exam preparation, focusing on concepts such as compilers vs interpreters, flowcharts, control structures, and pointers. Practical problem-solving and the importance of documentation are emphasized throughout the course content.

Uploaded by

cpine0223
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
66 views2 pages

SCS101 Revision Notes and Questions

The document outlines the syllabus and key topics for an introductory computer programming course (SCS101), covering programming principles, the program development cycle, algorithm development, C programming basics, control structures, functions, data structures, and program documentation. It includes a question bank divided into four portions for exam preparation, focusing on concepts such as compilers vs interpreters, flowcharts, control structures, and pointers. Practical problem-solving and the importance of documentation are emphasized throughout the course content.

Uploaded by

cpine0223
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

SCS101 – Introduction to Computer Programming

Revision Notes & Full Question Bank

Week Short Notes

Week 1 Intro: Programming principles, translators (compiler, interpreter, assembler), levels (machine, assembly
Week 2 Program development cycle: definition → design → coding → testing → maintenance. Design strategie
Week 4 Algorithm development: pseudocode, flowcharts, decision trees/tables.
Week 5 C basics: structure (#include, main), data types (int, float, char), variables, constants.
Week 7 Expressions: operations (arithmetic, relational, logical), operands, input/output (scanf, printf).
Week 8 Control structures: sequential, selection (if, switch), iteration (for, while, do-while).
Week 9 Functions: declaration, definition, library vs user-defined, modularity, parameter passing.
Week 11 Data structures: arrays, structures, unions, pointers.
Week 12 Program documentation: comments, user manuals, technical docs.
Week 13 Practical problem-solving with C programming.

Portion 1 (Weeks 1–2, CAT 1 Prep)


1. Differentiate between a compiler and an interpreter.
2. Explain three levels of programming languages with examples.
3. Briefly discuss the evolution of programming languages.
4. Define program development cycle with suitable steps.
5. Compare top-down and bottom-up design strategies.
6. List and explain three types of programming errors.
7. Discuss the role of algorithms in programming.
8. Define a translator and give two examples.
9. Explain why modular programming is important.
10. Describe the relationship between source code and object code.

Portion 2 (Weeks 4–5, CAT 2 Prep)


1. Write pseudocode for finding the largest of three numbers.
2. Differentiate between a flowchart and a decision tree.
3. Draw a flowchart to calculate the area of a rectangle.
4. Explain the basic structure of a C program.
5. Define variables and constants with examples in C.
6. Discuss the importance of data types in C.
7. Write a simple C program to add two integers.
8. Differentiate between syntax and logical errors.
9. Explain program documentation importance during development.
10. Write pseudocode for computing the factorial of a number.
Portion 3 (Weeks 7–9, CAT 3 Prep)
1. Differentiate between relational and logical operators with examples.
2. Write a C program that uses if-else to check if a number is even or odd.
3. Explain three types of control structures in C with examples.
4. Write a C program to display numbers 1–10 using a for loop.
5. Explain the difference between while and do-while loops.
6. Define a function in C and explain its importance.
7. Differentiate between library functions and user-defined functions.
8. Write a function in C that calculates the square of a number.
9. Discuss parameter passing in functions.
10. Write a program to calculate the sum of digits of a number using a function.

Portion 4 (Weeks 11–13, Final Exam Prep)


1. Differentiate between arrays and structures in C.
2. Write a C program that reads 5 integers into an array and prints them.
3. Explain the difference between structures and unions with examples.
4. Define pointers and explain their use in C.
5. Write a program to demonstrate the use of a pointer variable.
6. Discuss the importance of program documentation.
7. Differentiate between internal and external documentation.
8. Explain the concept of memory allocation in arrays and pointers.
9. Write a program that defines a structure for storing student records.
10. Discuss how practical problem-solving enhances programming skills.

You might also like