CSC 301 Data structure and algorithm CA 2021
About this paper
CSC 301: Continuous Assessment Test, 26/11/2021, 45min, Dr. Denis Nkweteyim \& Dr. Nyanga Bernard, University of Buea, Faculty of Science, Dept of Computer Science: a 12-item theory MCQ (postfix-form derivation, queue/stack/array/linked-list properties) plus Section B's stack push-statement, doubly-linked-list node deletion with a diagram, a pointer-based C string-compare function, and a pseudocode running-time analysis yielding O(n^2).
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
- 2.
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
- 4.
In a circular linked list A) components are all linked together in some sequential manner B) there is no beginning and no end C) components are arranged hierarchically D) forward and backward traversal within the list is permitted
At a glance
- Course code
- CSC301 (CSC 301)
- Type
- CA
- Year
- 2021
- 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 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?