Data Structures and Algorithms

Home

• Announcements Forum
• Course introduction is here.

  Overview

  Prerequisites

  • FPL I and FPL II

  Course Objectives

  • To understand the standard and abstract data representation methods. 
  • To acquaint with the structural constraints and advantages in usage of the data. 
  • To understand the memory requirement for various data structures. 
  • To operate on the various structured data. 
  • To understand various data searching and sorting methods with pros and cons. 
  • To understand various algorithmic strategies to approach the problem solution.
    

  Course Outcomes

  On completion of the course, student will be able to:
  

  • To discriminate the usage of various structures in approaching the problem solution. 
  • To design the algorithms to solve the programming problems. 
  • To use effective and efficient data structures in solving various Computer Engineering domain problems. 
  • To analyze the problems to apply suitable algorithm and data structure. 
  • To use appropriate algorithmic strategy for better efficiency

• Syllabus and Notes

• Unit 1

  Unit 2

  Unit 3

  Unit 4

  Unit 5

  Unit 6

  Unit 1

  ×

  Introduction to Algorithm and Data Structures

  Algorithms

  Problem Solving, Introduction to Algorithms, Characteristics of algorithms, Algorithm design tools: Pseudo code and flowchart, Analysis of Algorithms, Complexity of algorithms- Space complexity, Time complexity, Asymptotic notation- Big-O, Theta and Omega, standard measures of efficiency. 

  Data Structures

  Data structure, Abstract Data Types (ADT), Concept of linear and Non-linear, static and dynamic, persistent and ephemeral data structures, and relationship among data, data structure, and algorithm, From Problem to Program. 

  Algorithmic Strategies

  Introduction to algorithm design strategies- Divide and Conquer, and Greedy strategy. 

  Recurrence relation

  Recurrence Relation, Linear Recurrence Relations, With constant Coefficients, Homogeneous Solutions. Solving recurrence relations
  

  Close

  Unit 2

  ×

  Linear Data Structures Using Sequential Organization

  Sequential Organization, Linear Data Structure Using Sequential Organization, Array as an Abstract Data Type, Memory Representation and Address Calculation

  Inserting an element into an array, Deleting an element

  Multidimensional Arrays, Two-dimensional arrays, n- dimensional arrays

  Concept of Ordered List, Single Variable Polynomial, Representation using arrays, Polynomial as array of structure, Polynomial addition, Polynomial multiplication, Sparse Matrix, Sparse matrix representation, Sparse matrix addition, Transpose of sparse matrix, String Manipulation Using Array. 

  Case Study- Use of sparse matrix in Social Networks and Maps
  

  Close

  Unit 3

  ×

  Linked Lists

  Concept, Comparison of sequential and linked organizations, Primitive operations

  Realization of Linked Lists, Realization of linked list using arrays, Dynamic Memory Management, Linked list using dynamic memory management

  Linked List Abstract Data Type, Linked list operations, Head pointer and header node

  Types of linked list

  Linear and circular linked lists, Doubly Linked List and operations, Circular Linked List, Singly circular linked list, Doubly circular linked list, 

  Polynomial Manipulations

  Polynomial addition, Multiplication of two polynomials using linked list

  Generalized Linked List (GLL)

  GLL concept, representation of polynomial and sets using GLL

  Case Study

  Garbage Collection
  

  Close

  Unit 4

  ×

  Stacks

  Stacks

  Concept, Primitive operations, Stack Abstract Data Type, Representation of Stacks Using Sequential Organization, stack operations, Multiple Stacks, Applications of Stack- Expression Evaluation and Conversion, Polish notation and expression conversion, Need for prefix and postfix expressions, Postfix expression evaluation, Linked Stack and Operations. 

  Recursion

  Concept, variants of recursion- direct, indirect, tail and tree, Backtracking algorithmic strategy, use of stack in backtracking. 

  Case Study

  4 Queens problem, Androidmultiple tasks/multiple activities and back stack
  

  Close

  Unit 5

  ×

  Queues

  Concept, Queue as Abstract Data Type, Realization of Queues Using Arrays , Circular Queue, Advantages of using circular queues, Multi-queues, Deque, Priority Queue, Array implementation of priority queue, Linked Queue and operations. 

  Case study- Priority queue in bandwidth management.
  

  Close

  Unit 6

  ×

  Sorting and Searching

  Searching

  Search Techniques, Sequential search, variant of sequential search- sentinel search, Binary search, Fibonacci search

  Case Study

  Use of Fibonacci search in non-uniform access memory storage and in Optimization of Unimodal Functions

  Sorting

  Types of sorting-Internal and external sorting, General sort concepts-sort order, stability, efficiency, number of passes, Sorting methods- Bubble sort, Insertion sort, Selection sort, Quick sort, Heap sort, Shell sort, Bucket sort, Radix sort, Comparison of All Sorting Methods. 

  Case Study

  Timsort as a hybrid stable sorting algorithm
  

  Close
• Previous Years' Exams
  

  Question Papers

  April 2019October 2018April 2018October 2017April 2017

• Have Doubts?

• Forum

  Ask your doubts regarding the subject here. Discuss exam strategies, scores and latest trends in this forum.