1 Exam Guide CSIT121 Summer-I 2001 Exam-II (Final Examination) Thursday June 28th 9:30AM

2 Topics The following topics are included in exam: (1 ) File Input and Output (2) Arrays and Structures (3) Classes [4] Recursion

3 Exam Style Exam-II is similar in style and structure to Exam-I There are 15 MCQ type questions. In these questions, you will have to fill in the blanks, select one out of many choices, give a short answer or indicate true or false Each of these short questions carries one mark

4 Exam Style The remaining 15 marks are distributed in 5 long questions. These questions may have one or more of the following: Writing a program Detecting logical mistakes in a program Detecting typing mistakes in a program Converting one program into another

5 Exam Topics File I/O We learned about sequential file handling in our programs #include is required for file handling input file: ifstream file_handle_name output file: ofstream file_handle_name

6 Exam Topics Arrays and Structures We use arrays to group several related data items under a common name. All items must be of same data type We pass arrays to functions by reference. However, we can use keyword const to protect arrays that should not be modified

7 Exam Topics For grouping different types of data under a common name, we use structs. Arrays of structs serve the purpose of creating an information repository about several objects such as books, students etc. Unions recycle the memory space by keeping only one member active

8 Exam Topics Classes Classes are templates for defining objects Objects provide a public interface to their functions hiding implementation details Objects protect the private data from non- member functions thus making debugging easier

9 Exam Topics User defined classes We can define our own classes in header files and implement member functions in a separate program file A client program is written separately that declares objects belonging to classes and uses the objects to carry out required work

10 Recursion Recursion is a really neat way of solving a class of problems A function may call itself to cause recursion Recursion can become infinite if care is not taken in writing the recursive call Always write the base case and general case. Then implement recursive solution