CEC 305 Data Structures and Algorithm Exam 2022
About this paper
CEC 305: First Semester Examination, 21/01/2022 (instructor Nyanga Bernard), University of Buea: Section A, 24 four-option MCQs on sorting algorithms, stacks/queues, recursion, trees and binary search trees, and graph terminology; Section B, 23 True/False statements on trees, stacks, queues and arrays; Section C, three long-answer questions choosing suitable data structures/graph representations for six scenarios (road network, chessboard, assembly dependencies, Scrabble dictionary, Java class hierarchy, browser history), doubly-linked-list deletion with a C string-comparison routine and an array-based queue ADT implementation, and spanning-tree/minimum-spanning-tree definitions.
Opens this paper in the app on your phone.
University of Buea
College of Technology - COT
Computer Engineering - CET
Data Structures and Algorithm
Exam · First Semester · Level 300
From this paper
Section A: Circle the letter with the correct Answer. Each Question carries 1 mark.
1.You have to sort a list L consisting of a sorted list followed by a few “random” elements. Which of the following sorting methods would be especially suitable for such a task? (A) Bubble sort (B) Selection sort (C) Quick sort (D) Insertion sort
- 3.
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a (A) queue. (B) stack. (C) tree. (D) linked list.
At a glance
- Course code
- CEC305 (CEC 305)
- Type
- Exam
- Year
- 2022
- Level
- Level 300
- Semester
- First Semester
- Proposed solution
- Included
Where it's from
University
University of BueaFaculty
College of Technology - COTDepartment
Computer Engineering - CET
Read CEC305 2022 in Shoracy.
- Every page, with zoom for diagrams and small print
- The proposed solution, one tap away
- Stays on your phone after the first open, even offline
Don't have the app yet?