Data Structures and Algorithms for BS program

 Introduction to Data Structures and Algorithms is an important core course in which you will know how you can manage your data memory and other important structures.Data structure covers basic to advance level problem solving techniques such as how to create a function,how recursive functions work,how stack works,what is the order of stack and queue.
It also covers how to create linked lists of different types.Basically its all about managing your data and memory.  

Things you will cover in this  course: 

• Introduction to Data Structures and Algorithms
• Complexity Analysis
• Arrays
• Sorting Algorithms
• Insertion Sort
• Selection Sort
• Bubble Sort
• Shell Sort
• Heap Sort
• Quick Sort
• Merge Sort
• Radix Sort
• Bucket Sort
• Linked Lists
• Singly Linked Lists
• Doubly Linked Lists
• Circular List
• Stacks
• Queues
• Priority Queue
• Recursion
• Function call and Recursion Implementation
• Tail Recursion
• Non-tail Recursion
• Indirect Recursion
• Nested Recursion
• Backtracking. Trees
• Binary Trees
• Binary Heap
• Binary Search
• Tree Traversal ,Insertion, Deletion, and Balancing a Tree
• Heap
• B-Tree
• Spanning
• Splay Trees
• Graphs Representation, Traversal, Shortest Path
• Cycle Detection
• Isomorphic Graphs
• Graph Traversal Algorithms
• Hashing
  Memory Management and Garbage Collection.

Reference material:

1. Data Structures and Algorithm Analysis, Mark Allen Weiss, Florida International University, Addison-Wesley (latest Edition)
2. Algorithms, Robert Sedgewick, Princeton University Publisher: Addison- Wesley Professional (latest Edition)
3. Data Structures: Abstraction and Design Using Java, Koffman and Wolfgang, Wiley; 2nd Edition (or latest Edition), 201022
4. Data Structures and Algorithms in C++, Adam Drozdek, Course
Technology; 4th Edition, 2012.

Other Information:

Course code:  CMP-3113

Prerequisites:  Programming Fundamentals

Credit Hours: 4

Lectures: 3

Labs:      1