CSE 326, Data Structures Sample Final Exam Instructions : The exam is closed book, closed notes. Unless otherwise stated, N denotes the number of elements in the data structure under consideration. Answer each problem in the space provided. Show your work to ensure partial credit. Time: 110 minutes Problem Max Points Score 1 14 (2x7) 2 18 (3x6)
Practice Final Exam. This exam consists of three parts. Part I has 10 multiple-choice questions that you must complete. Part II consists of 4 multi-part problems, of which you must complete 3, and Part III consists of a single multi-part problem that you must complete. Show your work
A 2d-tree contains ten points (denoted A, B, ... J). The tree is shown in Figure 1 and the points are shown in Figure 2. A. Points W, X, Y, and Z with the coordinates shown in Figure 2 are inserted into the tree in that order. Show where the four new points will be inserted by filling in the blanks below. (Write ‘left’
Questions below refer to the Binary Tree pictured in “Information for the Final Exam”. 4a. [3 pts] Give a preorder traversal of this tree. 4b. [3 pts] Give an inorder traversal of this tree. 4c. [3 pts] Give a postorder traversal of this tree. 4d. [6 pts] Is this tree strongly balanced? Circle your answer, and explain why. YES NO Explanation: 3
Final EXAM Perfect UGRD-ITE6202B Data Structure and Algorithms …
A data structure requires a large amount of space for each data item stores and a large amount of time to perform a single operation and a certain amount of programming effort. Select one:
CS 3303 Data Structures Final Exam Review - A tree data
A tree data structure whose shape obeys the following definition, o A node contains one or two keys o Every internal node has either 2 children if it contains 1 key or 3 children if it contains two keys o All leaves are at the same level in the tree
- Reviews: 6
CS218-Data Structures Final Exam | PDF | Algorithms - Scribd
This document contains details of an exam for the course Data Structures including: 1. Seven questions assessing concepts like time complexity analysis, string manipulation algorithms, graph algorithms, and tree traversals.
Data Structures Past Papers Exam Questions – T4Tutorials.com
Dec 27, 2023 · Explain the Perfect Binary Tree, Balanced Binary Tree, degenerate (or pathological) tree with the help of examples. Q2: Implement the doubly link list and show the insertion and deletion in double link list.
Data Structures and Algorithms: Final Exam (PDF)
Final exam for CS315: Data Structures and Algorithms. PDF version. Course description: In CS 315, Algorithm Design and Analysis, you learn how to design and analyze algorithms.
Final Exam Data Structures and Algorithms | PDF - Scribd
The document contains the final examination for a Data Structures and Algorithms course. It consists of 6 parts testing algorithms for sets, arrays, sorting, searching, linked lists, and binary trees.
- Some results have been removed