CEC 305 Data Structures and Algorithms CA 2024
About this paper
CEC 305: Block Continuous Assessment 2024/2025, 19/11/2024, 11:00-11:45 (course listed as CEC305), University of Buea: Question One, a linked-list-vs-array comparison, doubly-linked-list deletion, and a C string-comparison routine; Question Two, definitions of node level/tree height/path length, the four traversals (in-order, pre-order, post-order, level-order) of a 9-node binary tree (Figure 3) with several leaves drawn as empty placeholder boxes, and building a binary tree from a 16-element 1-indexed array using the standard index-2i/2i+1 child mapping; Question Three, 8 single-mark MCQs on postfix expression conversion, full binary tree leaf/internal-node counts, queues, array bounds, circular linked lists, postfix evaluation, and queues/stacks.
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
- a.
In less than ten lines compare the use of a linked list with arrays in the implementation of data structures. b) With the aid of diagrams explain how an item can be deleted from a doubly linked list. c) Using arrays and pointers, write short C code to compare two strings.
At a glance
- Course code
- CEC305 (CEC 305)
- Type
- CA
- Year
- 2024
- 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 2024 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?