CS301 Data Structures-I
CS301Course details :
Course Category | Computer Science/Information Technology |
Course Level | Undergraduate |
Credit Hours | 3 |
Pre-requisites | CS201 |
Instructor | Dr. Sohail Aslam Ph.D Computer Science University of Illinois at Urbana-Champaign |
Introduction, The Array data type, The List abstract data type (ADT), Linked lists, Stacks, Queues, Trees, AVL Trees ,Huffman encoding , The Heap ADT, Priority queue implementation using the heap ADT, The Disjoint Sets ADT, The Table ADT, Implementation using arrays, Skip lists, Table ADT implementation using Hashing, Collision resolution in Hashing, Other uses of Hashing, Sorting, and Selection sort, Insertion sort, Bubble sort algorithms, Divide and conquer strategy: Merge sort, Quick sort. |
CS301Introduction to Programming | Related Material
CS301Short Notes
CS301 Data Structures-I
CS301Short Notes
CS201 Object Oriented programming handouts are provided by VU in every student’s accounts. These handouts can be downloaded from LMS account of the student. We will soon prepare CS301Short Notes with Highlighted text and short MCQs with Answers. Once the CS301short and highlighted notes will be updated will be uploaded for Free Downlead in PDF Format. You may check Our official VU Short Notes as Highlighted notes.