lect35.pptVIP

CSE1301Computer Programming:Revision Topics Type of questions What do you need to know? About the exam Exam technique Sample questions Types of Questions Sample Exam solution posted on the web, and on the notice boards (see 1st year notice board on Ground Floor, Bldg. 63) Tutorial Sheets What Do You Need to Know? Overview Computer Systems Basic Concepts Structs, Pointer Basics Algorithms Functions Input/Output Software Engineering Lists Searching and Sorting Computer Systems Gates AND, OR, NOT Binary representation bit, byte, word integer: 2’s complement, float: IEEE standard precision, under/overflow operations Components Software Networks Basic Concepts 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 Basic Concepts Pointer Basics when to use and * Structures definition vs. instance accessing members/elements pointers to structs array of structures structures within structures Algorithms Flow of control Flow diagrams Iteration while, for, break nested loops Selection if...else Functions Definition Parameters arrays, structs Return values Variable scope Recursion Prototypes Input/Output Streams stdio, stderr, stdout printf()and scanf() Format specifier Return values The operator Files fopen(), fclose(), fprintf(), fscanf() Software Engineering Development Process Design: top-down, bottom-up Structure Chart: Control and Data Coupling Dataflow Diagrams Test Data Transcation Processing Documentation Prototyping (not included: Bingo) Lists A list as an array (lectures 30 to 32) Operations addition, deletion, search not included: Linked list (lectures 33, 34) Searching and Sorting Searching linear search binary search Sorting insertion sort selection sort Complexity About the Exam 10 minutes reading time 3 hours duration 180 total marks No calculators. Exam Technique Don’t Panic. Make use of reading time.