This document contains instructions for a 3 hour exam with 75 total marks. It is divided into 3 parts. Part A contains 10 short answer questions worth 2 marks each. Part B contains 5 longer answer questions worth 5 marks each. Part C contains 3 even longer answer questions worth 10 marks each. The questions cover topics like scope resolution operators, reference variables, inline functions, objects, constructors, file I/O functions, composite data types, ordered lists, arithmetic expressions, stacks vs queues, binary trees, subgraphs, tokens, operator functions, formatted I/O, file stream classes, arrays, circular queues, converting forests to binary trees, control structures, inheritance, command line arguments, linked lists, and Dijkstra's
This document contains instructions for a 3 hour exam with 75 total marks. It is divided into 3 parts. Part A contains 10 short answer questions worth 2 marks each. Part B contains 5 longer answer questions worth 5 marks each. Part C contains 3 even longer answer questions worth 10 marks each. The questions cover topics like scope resolution operators, reference variables, inline functions, objects, constructors, file I/O functions, composite data types, ordered lists, arithmetic expressions, stacks vs queues, binary trees, subgraphs, tokens, operator functions, formatted I/O, file stream classes, arrays, circular queues, converting forests to binary trees, control structures, inheritance, command line arguments, linked lists, and Dijkstra's
This document contains instructions for a 3 hour exam with 75 total marks. It is divided into 3 parts. Part A contains 10 short answer questions worth 2 marks each. Part B contains 5 longer answer questions worth 5 marks each. Part C contains 3 even longer answer questions worth 10 marks each. The questions cover topics like scope resolution operators, reference variables, inline functions, objects, constructors, file I/O functions, composite data types, ordered lists, arithmetic expressions, stacks vs queues, binary trees, subgraphs, tokens, operator functions, formatted I/O, file stream classes, arrays, circular queues, converting forests to binary trees, control structures, inheritance, command line arguments, linked lists, and Dijkstra's