CEC 305 Data Structures And Algorithms CA 2021
About this paper
CEC 305: Continuous Assessment, First Semester 2021/2022, University of Buea: a single-page paper reproducing the first 11 MCQs of Paper 1's Section A, plus a short-answer stack-push pseudocode question, doubly-linked-list deletion, and a C string-comparison routine.
Opens this paper in the app on your phone.
University of Buea
College of Technology - COT
Computer Engineering - CET
Data Structures And Algorithms
CA · 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
- CA
- Year
- 2021
- 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 2021 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?