1 CSE1301 Computer Programming: Revision

2 Topics Type of questions What do you need to know? About the exam Exam technique Staff consultation Revision Drop-in Centre Sample questions

3 Types of Questions Tutorial Sheets –solutions posted on the notice board opposite Room 116 in Building 26. –Warning: Avoid being dependent on the sample solution. You need to be able to do the exercises yourself without looking at the sample solution. Practical Sheets –solutions not available

4 Types of Questions (continued) Mid-Semester Test –multiple-choice questions –coding/programming questions Sample Past Exam –short-answer questions (e.g. Questions 2 and 8) –coding/programming questions (e.g. Questions 4 to 7) –sample solutions on the web, but you should aim to answer the questions without the sample solution. –(no True/False questions)

5 What Do You Need to Know? Coverage: All lectures, practicals, tutorials and readings.

6 Overview Gates –AND, OR, NOT Binary representation –bit, byte, word –integer: decimal to binary, unsigned, signed magnitude, 2’s complement, excess-k –float: IEEE standard –precision, under/overflow –arithmetic operations

7 Overview Values Variables Types –char, int, float, const, typedef, struct –arrays (multi-dim), strings, int for “Boolean” Operations –initialization –arithmetic, Boolean expressions, precedence –string library functions

8 Overview Pointer Basics –when to use & and * Structures –definition vs. instance –accessing members/elements –pointers to structs –array of structures –structures within structures

9 Overview Flow of control –Flow diagrams/charts Iteration –while, for, break, continue –nested loops Selection –if...else –nested selection –cascaded selection

10 Overview Functions –Prototypes –Definition –Parameters actual, formal, arrays, structs, pointers –Return values –Variable scope –Recursion

11 Overview Streams –stdio, stderr, stdout printf() and scanf() –Format specifier –Return values –The & and * operators Files –fopen(), fclose(), fprintf(), fscanf()

12 Overview Software Engineering –Development Process –Design: top-down, bottom-up –Structure Chart: Control and Data Coupling –Dataflow Diagrams –Test Data –(not included: Bingo)

13 Overview Lists –A list as an array –Linked lists –Operations addition, deletion, search

14 Overview Searching –linear search –binary search Sorting –insertion sort –selection sort –bubble sort Complexity –Big-O notation

15 About the Exam 10 minutes reading time 3 hours duration 180 total marks No calculators, books, notes, etc.

16 Don’t Panic. Make use of reading time. Go for the marks Attempt the questions in the order that gives the best result Don’t spend too much time on any question. –Approximately 1 minute per mark. Clearly indicate what question you are attempting. Don’t forget to write your name and ID! Exam Technique

17 Staff Consultation 1st June (Friday) - no lecture –9-10 am - Joey –12nn-1 pm - Joey –1-2 pm - Ingrid 5th June (Tuesday) –2-3 pm - Joey –4-5 pm - Joey 6th June (Wednesday) –2-3 pm - Ingrid 8th June (Friday) –1-2 pm - Ingrid Joey’s office: Room 130, Building 26. Ingrid’s office: Room G11, Building 63.

18 Revision Drop-In Centre 7th June (Thursday) –2pm to 5pm 8th June (Friday) –10am to 1pm –2pm to 5pm Venue: t.b.a. –Bring your questions, notes, books, exercise sheets, water bottle, snack,....

19