CSE 203 + Lab: Data Structure

Offered Under: B.Sc. in Computer Science & Engineering (CSE)
Description

Data representation and storage in elementary data structures like arrays and linked lists (both singly linked lists and doubly linked lists). Abstract Data Types (ADT): Stack, Queue, Priority Queue. Comparative analysis of different implementations of ADTs (Array based and linked list based).  Binary Search Tree (including red/black trees), Heap, Efficient  Priority  Queue (Heap based).  Complexity analysis of dictionary operations (insertion/deletion/search) on ADTs. Use of data structures in the design and implementation of smart searching and sorting algorithms (Binary search, Heap sort). Graphs (Connectivity graph, Directed and Undirected graph).



Course Type Major
Credit Hour 4
Lecture Hour 60
Expected Outcome(s):
  • Navigate, organize, compile C++ projects of moderate complexity (many objects and dependencies)
  • Decompose a problem into its supporting data structures such as lists, stacks, queues, trees, etc.
  • Diagnose appropriate approaches or algorithms to solve problems involving graph search, tree traversal, optimization, data organization, etc., together with appropriate data structures.
  • Implement classic and adapted data structures and applications.
  • Analyze the efficiency of implementation choices.


Grading Policy:

Biweekly Quiz, Biweekly Programming Assignment, One Midterm Exam, One Final Exam

 


Letter Grade Marks Grade Point
A 90 - 100 4.00
A- 85 - 89 3.70
B+ 80 - 84 3.30
B 75 - 79 3.00
B- 70 - 74 2.70
C+ 65 - 69 2.30
C 60 - 64 2.00
C- 55 - 59 1.70
D+ 50 - 54 1.30
D 45 - 49 4.00
F 00 - 44 4.00