CPE 212 Fall 2024 Final Exam Review PDF

Final Exam Review CPE 212 – Fall 2024 Final Exam Date: Monday, December 9th Time: 3 – 5:30 PM, 150 minutes Location: ENG 246 Closed notes, books and neighbors. Calculator is allowed. Answer sheet will be provided and is the only thing used for grading. Question Types 10 * Tr...

Final Exam Review CPE 212 – Fall 2024 Final Exam Date: Monday, December 9th Time: 3 – 5:30 PM, 150 minutes Location: ENG 246 Closed notes, books and neighbors. Calculator is allowed. Answer sheet will be provided and is the only thing used for grading. Question Types 10 * True or False = 10 points 20 * Multiple Choice = 40 points Each topic will have at least one question. 7 * Fill in the Blank = 15 points 4 * Short Answers = 35 points Covered Topics – 1 Everything talked in all lectures. No syllabus-related questions. C++ Basic Basic code control: if-else, loop, switch Function parameter: pass by value vs. pass by reference Pointer: declaration, initialization, usage Exception handling Covered Topics – 2 C++ Polymorphism Class inheritance: code understanding, access permission on members Virtual function: definition, how to use Software Testing different testing approaches Generic Programming Overloading: function + operator – how to implement Template: definition, how to implement Covered Topics – 3 Recursion Issues of infinite recursion How to implement Sequential Data Structures List: array, linked list (single + double) Stack Queue: circular queue Their definition, basic properties and operations, how to implement Time complexity of insertion/deletion/searching in the worst case Covered Topics – 4 Trees Height/Level calculation + Nodes counting Binary Tree: full, complete, skewed, balanced Binary Search Tree Property 3 types of traversal: pre-, in-, post- Time complexity of operations Covered Topics – 5 Graph Vertex and Edges Weight Representations: Adjacency Matrix, Adjacency List, their comparison and complexity BFS vs. DFS Greedy Algorithm Shortest path Covered Topics – 6 Searching Binary Search: workflow, implementation Hashing Sorting: all algorithms workflow features comparison time complexity: best, average, worst Covered Topics – 7 STL vector set and multiset map and multimap Tools Linux Command Line Arguments Make Valgrind Preparation Lecture Slides Panopto Recording Project Assignments Previous Quizzes and Exams Short lecture on Dec 4th, then Q&A session Office Hours until Dec 11th