Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 70 views

    L T P C School Total Number of Contact Hours Date of Approval Pre-Requisites

    Uploaded by

    madhav
    This document provides information on the course "Data Structures and Algorithms" including course code, school, date of approval, total contact hours, prerequisites, course outcomes, instructional objectives, catalog description, textbooks, and unit-wise topics. The course has 4 credits and includes 5 units covering introduction to algorithms and data structures, sorting and searching algorithms, list, stack and queue ADT, tree and hashing, and graph ADT. The document lists topics in each unit along with the number of lecture hours for each.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    L T P C School Total Number of Contact Hours Date of Approval Pre-Requisites

    Uploaded by

    madhav
    70 views2 pages
    This document provides information on the course "Data Structures and Algorithms" including course code, school, date of approval, total contact hours, prerequisites, course outcomes, instructional objectives, catalog description, textbooks, and unit-wise topics. The course has 4 credits and includes 5 units covering introduction to algorithms and data structures, sorting and searching algorithms, list, stack and queue ADT, tree and hashing, and graph ADT. The document lists topics in each unit along with the number of lecture hours for each.

    Original Description:

    Dsa

    Original Title

    Data Structures

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides information on the course "Data Structures and Algorithms" including course code, school, date of approval, total contact hours, prerequisites, course outcomes, instructional objectives, catalog description, textbooks, and unit-wise topics. The course has 4 credits and includes 5 units covering introduction to algorithms and data structures, sorting and searching algorithms, list, stack and queue ADT, tree and hashing, and graph ADT. The document lists topics in each unit along with the number of lecture hours for each.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    70 views2 pages

    L T P C School Total Number of Contact Hours Date of Approval Pre-Requisites

    Uploaded by

    madhav
    This document provides information on the course "Data Structures and Algorithms" including course code, school, date of approval, total contact hours, prerequisites, course outcomes, instructional objectives, catalog description, textbooks, and unit-wise topics. The course has 4 credits and includes 5 units covering introduction to algorithms and data structures, sorting and searching algorithms, list, stack and queue ADT, tree and hashing, and graph ADT. The document lists topics in each unit along with the number of lecture hours for each.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    CSE-2002 Data Structures and Algorithms L T P C

    Version School SCSE Date of Approval 1-Jul-19 3 0 2 4


    Total Number of Contact Hours L 35 T 0 P 10
    Pre-requisites

    Alternate Exposure <Text>

    Co-requisites
    Apply the fundamental knowledge of various data structures and algorithms to analyse, design, formulate and
    1
    implement algorithm for any real time problem.
    Apply current techniques in data structures and algorithmic principles for modelling and developing software
    2
    systems.
    Course Outcomes
    3 To acquire knowledge of data structures and algorithms for implementing various real-world problems.

    4 Identify suitable algorithm and data structures for real-world problems.

    1 To understand the importance of data structures and algorithms

    Specific 2 To understand various types of fundamental data structures


    Instructional
    Objectives 3 To learn fundamental sorting and searching algorithms

    4 To learn basics of List, Stack, Queue, Tree and Graph ADT and usage.

    Students will understand the realtionship between algorithm, data structure and program. Students will learn the basic
    Catalog
    of data structures and its types. Students will learn the basic sorting and searching algorithm and its usage. Students
    Description
    will learn understand and how to use the linear and non linear data structures like list, stack, queue, tree and graph.

    Mark A. Weiss,Data Structures and Algorithm Analysis in C++, 4th Edition, Pearson, 2014
    1

    2
    Text Books
    3

    Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , Clifford Stein, Introduction to Algorithms, 3rd Edition,
    1
    MIT Press, 2009.
    Aaron M. Tenenbaum, YeedidyahLangsam, Moshe J. Augenstein, ‘Data structures using
    2 C’, Pearson Education, 2010.
    Reference Books
    D. E. Knuth, Art of computer programming, Volume 1: Fundamental algorithms,
    3 Addison Wesley, 2011.

    Signature of BOS Chairman Approved by ____ Academic Council


    Introduction to Algorithm and Data Structures Number of Lecture Hours 5
    Unit 1 Algorithm: Introduction - Algorithm Design – Complexity- Asymptotic notations. Data Structures: Introduction-
    Classification of Data structure -Abstract Data Type (ADT).
    Scaleup Lecture
    Pedagogy tools

    Sorting and Searching Number of Lecture Hours 7

    Unit 2 Brute force approach: General method -Sorting ( bubble, selection, insertion) – Searching (Sequential/Linear)
    Divide and Conquer approach: General method - Sorting ( merge, quick) – Searching (Binary Search).

    Scaleup Lecture
    Pedagogy tools

    List, Statck and Queue ADT Number of Lecture Hours 11

    Linked List: Array Vs Linked List - Singly Linked List, Doubly Linked Lists – Circular Linked Lists-implementation -
    Unit 3 application.
    Stack and Queue: Introduction – implementation (static and dynamic) – application – Circular queues-application.

    Scaleup Lecture
    Pedagogy tools

    Tree
    LinearADT and Hashing
    Vs Non-Linear Number of-Binary
    Data Structures -General Tree – Terminologies LectureTree
    Hours
    – Expression Tree - Traversals12
    - Binary
    Search Tree – AVL Tree – Red block Tree – Splay Tree – B Tree. - Hashing: Introduction – Hash Function-Methods-
    Unit 4 Collision Resolution.

    Scaleup Lecture
    Pedagogy tools

    Graph ADT Number of Lecture Hours 10


    Graph: Introduction – Representations – Traversals - Topological Sorting – Connected and Bi-Connected Components –
    Unit 5
    Articulation Point - Shortest-path algorithms (Dijkstra’s and Floyd’s algorithms) - Minimum spanning tree (Prim’s and
    Kruskal’s algorithms).
    Scaleup Lecture
    Pedagogy tools

    Signature of BOS Chairman Approved by ____ Academic Council

    You might also like