Data Structures and Algorithms using Python
            Course Code: 20CSM1L1       L   T   P   C
                                       2     0     0     2
      CO1:Classify algorithmic analysis (L2)
      CO2:Apply the concept of linked lists (L3)
      CO3:Apply the concept of stacks and queues (L3)
       CO4:Utilize the techniques of searching and sorting(L3)
      CO5:Implement the algorithms for trees and graphs(L3)
      UNIT -1                          (6 Lectures)
      Algorithm Analysis: The Big-Oh Notation, Comparative Analysis, Examples of Algorithm
      Analysis, Recursion: Illustrative Examples, Analyzing Recursive Algorithms,
        ● Demonstrate Asymptotic notations(L2)
        ● Explain Algorithm analysis(L2)
        ● Illustrate Recursion techniques(L2)
      UNIT-II                          (6 Lectures)
      Introduction to Data Structures
      Basic data structures and objectives, types of data structures(Text Book2)
      Linked Lists: Singly Linked Lists, Circularly Linked Lists, Doubly Linked Lists, Sorting a
      Positional List , Link-Based vs. Array-Based Sequences, Applications
      Learning outcomes: At the end of the module, student able to
        ● Understand different types of linked lists (L2)
        ● Compare arrays and linked lists(L2)
        ● Apply linked lists to real time problems (L3)
       UNIT -III                       (8 Lectures)
                    Stacks: Stack ADT, Implementing the stack: Using a python list, using a linked list, stack
                applications: Evaluating postfix Expressions
                Queues: Queue Abstract Data Type, Implementing the Queue: Using a python list, using a
                circular array, using a linked list. Queue Applications
                Learning outcomes: At the end of the module, student able to
                    ● Describe Stack data structure (L2)
                    ● Describe Queue data structure and its types (L2)
                    ● Illustrate Applications of stacks and queues [L3]
                UNIT-IV                                                                         (6 Lectures)
                Searching : Sequential Search, Binary Search (Text Book-2)
                Sorting: Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort (Text Book-2)
                Learning outcomes: At the end of the module, student able to
                    ● Make use of different Searching techniques(L3)
                    ● Discuss different Sorting techniques (L2)
                    ● Compare time complexities of searching and sorting techniques(L2)
                UNIT-V                                                                                  (6 Lectures)
                Trees: General Trees, Binary Trees, Implementing Trees, Tree Traversal Algorithms, Binary
                Search Trees
                Graphs:Data Structures for Graphs, Graph Traversals
                Learning outcomes: At the end of the module, student able to
                    ● Discuss Tree terminologies(L2)
                    ● Solve problems based on tree traversals (L3)
                    ● Illustrate various graph traversals(L2)
                Text Books:
                    1.  Data Structures and Algorithms Using Python Rance D. Necaise Department of
                        Computer Science College of William and Mary , JOHN WILEY & SONS, INC.
                    2.  Problem Solving with Algorithms and Data Structures Release 3.0 Brad Miller, David
                        Ranum
                References:
                    1.  Data Structures and Algorithms in Python Michael T. Goodrich Department of Computer
                        Science University of California, Irvine Roberto Tamassia Department of Computer
                        Science Brown University Michael H. Goldwasser Department of Mathematics and
                        Computer Science Saint Louis University
                Web References:
                    1.  https://www.brianheinold.net/python/A_Practical_Introduction_to_Python_Programming
                        _Heinold.pdf