CS-301 Data Structures
Q & A
Online Test
Course Category: Computer Science/Information Technology
Course Level: Imdregraduate
Credit Hours: 3
Pre-requisites: CS201
Course Contents:
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.
 CS301 - Mid Term Past Papers  CS301 FINALTERM SOLVED MCQS WITH REFERENCE  CS301 Mega File For Mid Term  CS301 Mid Papers More than 10 Papers  CS301 Mid Term  CS301 MID TERM  CS301 supreme file for MidTerm  CS301_02_mid_spring2010  CS301_FAQ_glossary_past_assigngiga_file  CS301_Final_Term_Spring_2010_08_1  CS301_Final_Term_Spring_2010_13  CS301_MID_FALL2003_S2_SOL  CS301_MID_FALL2003_S3_SOL  CS301_MID_FALL2003_SOL  CS301_MID_FALL2004  CS301_MID_FALL2006_S3  CS301_MID_SPRING2003  CS301_MID_SPRING2003_S2  CS301_MID_SPRING2004_S1_SOL  CS301_MID_SPRING2004_S2_SOL  CS301_MID_SPRING2007_S1  CS301_MID_SPRING2007_S4  CS301_MID_SUMMER2003  CS301_MID_SUMMER2003_S2  CS301_MID_SUMMER2007_S1  CS301_midterm_26_11_2011  CS301_midterm_spring_2010_5  CS301_Quiz_1_Fall_2011_solved  CS301-MIDTERM PAPERS(VUHELP4U)  CS301-MIDTERM SOLVED MCQS  CS301-MIDTERM SUBJECTIVE SOLVED  CS301-MID-TERM-Mega-FILE  CS301_MID_TERM_SOLVED_MCQS_WITH_REF  CS301-midterm-spring-2011-paper-5  CS301_MID_TERM_SUBJECTIVE_SOLVED
Course Instructor

Dr. Sohail Aslam
PhD Computer Science
University of Illinois
at Urbana-Champaign

Data Structures and Algorithm Analysis in C++
by Mark Allen Weiss