CSC 301 Data structure and algorithm CA 2022
About this paper
CSC 301: First Semester 2022/2023 Continuous Assessment, 1hr, University of Buea, Faculty of Science, Dept of Computer Science: source carries handwritten circled MCQ answers, none of which is used as the source of correctness (one item -- the sorting-method-for-a-nearly-sorted-list question -- is independently derived as Insertion Sort, explicitly flagged as differing from the source's circled Quick Sort); a 10-item MCQ (Bubble Sort interchange-count trace, postfix-from-prefix conversion) plus Section B's union-vs-struct C bug-explanation question with corrected code/output and struct+typedef variable declarations; the source's own marks annotation is flagged as inconsistent with its visible scored components.
Opens this paper in the app on your phone.
University of Buea
Faculty of Science - FS
Computer Science - CSC
Data structure and algorithm
CA · First Semester · Level 300
From this paper
- 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
- CSC301 (CSC 301)
- Type
- CA
- Year
- 2022
- Level
- Level 300
- Semester
- First Semester
- Proposed solution
- Included
Where it's from
University
University of BueaFaculty
Faculty of Science - FSDepartment
Computer Science - CSC
Read CSC301 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?