CSCD 216 — Data Structures & Algorithms
Computer Science · UG
This course will study the analysis of algorithms and the effects of data structures on them. Algorithms selected from areas such as sorting, searching, shortest paths, greedy algorithms, backtracking, divideand-conquer, and dynamic programming. Data structures include heaps and search, splay, and spanning trees. Analysis techniques include asymptotic worst case, expected time, amortized analysis, and reductions between problems. Include Generic types , Linked lists , Stacks and queues , Binary trees, Balanced binary trees , Multi-way trees , B- trees and B+-trees, File organization , Searching and sorting , Hashing . Running time analysis of algorithms and their implementations, one-dimensional data structures, trees, heaps, additional sorting algorithms, binary search trees, hash tables, graphs, directed graphs, weighted graph algorithms, additional topics.
- Credits
- 3
- Level
- Level 200
Other courses on this programme
- CSCD 201 — Information Systems
- CSCD 202 — Programming II (with Java)
- CSCD 205 — Programming I (with C ++)
- CSCD 207 — Numerical Methods
- CSCD 211 — Computer Organization and Architecture
- CSCD 212 — Computer Ethics
- CSCD 214 — Digital Electronics
- CSCD 218 — Data Communication & Networking I
- CSIT 201 — Professional, Legal, Moral and ethical issues in IT
- CSIT 202 — Introduction to Computer Networks
- CSIT 203 — Computer Hardware Fundamentals
- CSIT 204 — Introduction to Information Security
Practising CSCD 216 with Questora
Upload your own slides, notes and past papers for CSCD 216 and Questora builds mock exams, practice questions and a revision plan from them.
Start freeCourse details from University of Ghana Volume 3 Handbook for the Bachelor's Degree: Course Descriptions for Programmes in the Sciences (2017).