[vc_row el_class=”inner-body-content” css=”.vc_custom_1666777589439{padding-top: 30px !important;padding-bottom: 20px !important;}”][vc_column][vc_custom_heading text=”Pre-requisite(s)” font_container=”tag:h2|font_size:20px|text_align:left” use_theme_fonts=”yes” css=”.vc_custom_1666777576425{margin-top: 0px !important;}”][vc_column_text]Object Oriented Programming (CS-1143)[/vc_column_text][vc_custom_heading text=”Recommended Book(s)” font_container=”tag:h2|font_size:20px|text_align:left” use_theme_fonts=”yes”][vc_column_text]Object Oriented Data Structures Using C++, By K S Easwarakumar
Data Structures Using C++, By D. S. Malik
Data Structures And Algorithm Analysis In C++, By Mark Allen Weiss
Benjamin/Cummings Publishing Company, Inc.[/vc_column_text][vc_custom_heading text=”Reference Book(s)” font_container=”tag:h2|font_size:20px|text_align:left” use_theme_fonts=”yes”][vc_column_text]Data Structures And Algorithm In C++ , By Adam Drozdek, 2nd Edition[/vc_column_text][vc_custom_heading text=”COURSE OBJECTIVES” use_theme_fonts=”yes”][vc_column_text]Main objective of this course is to enable students to understand and implement common data structures and algorithms to manipulate those data structures using C++ techniques. Emphasis will be on a lot of practice in writing codes to implement all the major data structures.[/vc_column_text][vc_custom_heading text=”COURSE LEARNING OUTCOMES (CLO)” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]Course Objectives[/vc_column_text][vc_custom_heading text=”COURSE CONTENTS” use_theme_fonts=”yes”][vc_custom_heading text=”Introduction to the course and course objectives” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]
- What is Data Structures?
- Why it is important to study data structures?
[/vc_column_text][vc_custom_heading text=”Linear data structures” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]
- Stack
- What is stack?
- Common stack examples.
- Implementation of stack both static and dynamic
- Applications of stack
- Linked List
- What is linked list?
- Advantages of linked list over static list.
- Implementation of linked list.
- Singly linked list
- Double linked list
- Circular doubly linked list
- Queue
- What is a queue?
- Implementation of Queue both static and dynamic
- Circular queue
- Priority queue
- Deques
[/vc_column_text][vc_custom_heading text=”Recursion” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]
- What is recursion?
- How to implement a recursion?
- Basic Rules of Recursion
[/vc_column_text][vc_custom_heading text=”Non Linear Data Structures” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]
- Trees
- What are trees?
- Implementation of following type of trees.
- Binary trees
- Binary search Trees
- AVL trees
- Splay trees
- B trees
[/vc_column_text][vc_custom_heading text=”Graphs” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]
- What are graphs?
- Implementation of graphs?
- Depth first search
- Breadth first search
[/vc_column_text][vc_custom_heading text=”Tables and Hashing” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]
- What are tables?
- Index function and index table.
- Inverted Tables
- Hash tables
- Hash function
- Collision resolving techniques
[/vc_column_text][vc_custom_heading text=”Heaps” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]
- What is heap?
- Priority Queue
- Implementation of heap?
- Heap Sort
[/vc_column_text][vc_custom_heading text=”Some searching and sorting algorithms (if time permits)” font_container=”tag:h3|text_align:left” use_theme_fonts=”yes”][vc_column_text]
- Basic Search
- Binary Search
- Quick Sort
- Selection Sort
[/vc_column_text][vc_custom_heading text=”MAPPING OF CLOs TO ASSESSMENT MODULES” font_container=”tag:h2|font_size:20px|text_align:left” use_theme_fonts=”yes”][vc_column_text css=”.vc_custom_1666777563426{margin-bottom: 0px !important;}”]
| Final Exam |
| Assignments |
| Surprise Tests/Quizzes |
| Project |
| Midterm Exam |
[/vc_column_text][/vc_column][/vc_row]