Scribd Logo
Upload

Welcome to Scribd!

  • 650 views

    2CSE302: Data Structures (4 0 4 6) : Learning Outcomes

    Uploaded by

    Akashdeep Bhattacharjee
    This document outlines the syllabus for a course on data structures. The course aims to help students differentiate between various data structure types, select appropriate data structures for solving problems, and apply sorting and searching algorithms to large datasets. The syllabus covers linear data structures like stacks, queues, and linked lists, nonlinear structures like trees and graphs, and sorting/searching algorithms like bubble sort, quick sort, and binary search. Reference books on data structures using C/C++ are also provided.

    Copyright:

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

    2CSE302: Data Structures (4 0 4 6) : Learning Outcomes

    Uploaded by

    Akashdeep Bhattacharjee
    650 views2 pages
    This document outlines the syllabus for a course on data structures. The course aims to help students differentiate between various data structure types, select appropriate data structures for solving problems, and apply sorting and searching algorithms to large datasets. The syllabus covers linear data structures like stacks, queues, and linked lists, nonlinear structures like trees and graphs, and sorting/searching algorithms like bubble sort, quick sort, and binary search. Reference books on data structures using C/C++ are also provided.

    Original Description:

    Data structure using c

    Original Title

    Data Structure

    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 outlines the syllabus for a course on data structures. The course aims to help students differentiate between various data structure types, select appropriate data structures for solving problems, and apply sorting and searching algorithms to large datasets. The syllabus covers linear data structures like stacks, queues, and linked lists, nonlinear structures like trees and graphs, and sorting/searching algorithms like bubble sort, quick sort, and binary search. Reference books on data structures using C/C++ are also provided.

    Copyright:

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

    2CSE302: Data Structures (4 0 4 6) : Learning Outcomes

    Uploaded by

    Akashdeep Bhattacharjee
    This document outlines the syllabus for a course on data structures. The course aims to help students differentiate between various data structure types, select appropriate data structures for solving problems, and apply sorting and searching algorithms to large datasets. The syllabus covers linear data structures like stacks, queues, and linked lists, nonlinear structures like trees and graphs, and sorting/searching algorithms like bubble sort, quick sort, and binary search. Reference books on data structures using C/C++ are also provided.

    Copyright:

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

    2CSE302: Data Structures [4 0 4 6]

    Learning Outcomes:
    On successful completion of this course, students will be able to:
     Differentiate between the types of Data Structures. 
      Select an appropriate data structure for solving typical computing problems. 
     Apply sorting and searching algorithms to the small and large data sets. 

    Syllabus:

    Unit No Topics
    Introduction to Data Structure:
    1 Data Management concepts, Data types – primitive and non-primitive,
    Types of Data Structures- Linear & Non Linear Data Structures.
    Linear Data Structure:
    Stack: Concepts and representation, Operations, Applications. Polish
    Expression, Reverse Polish Expression And Their Compilation,
    Recursion, Tower of Hanoi.
    Queue: Concept and Representation, Operations, Types viz. simple,
    circular, priority, double ended. Applications of queue.
    2
    Linked List: Concept and Representation. Operations: Insertion at
    beginning, at the end and at any point, Deletion at the beginning, at the
    end and at any point.
    Types of Linked lists: Singly Linked List, Doubly Linked list, Circular
    linked list, Linked implementation of Queue. Applications and
    Advantages of Linked Lists.
    Nonlinear Data Structure:
    3 Tree : Definitions and Concepts, Representation of binary tree, Binary
    tree traversal (In order, post order, preorder), Threaded binary tree,
    Binary search trees, Conversion of General Trees To Binary Trees,
    Applications Of Trees- Some balanced tree mechanism, eg. AVL trees,
    2-3 trees, Height Balanced, Weight Balance.
    Graph:
    Basic Concept of Graph Theory and its Properties, Matrix Representation
    4 Of Graphs, Elementary Graph operations, Breadth First Search, Depth
    First Search, Spanning Trees, Shortest path, Minimal spanning tree.
    Sorting & Searching:
    Performance Analysis and Management - Time and space analysis of
    algorithms – Average, best and worst case analysis.
    5
    Sorting – Bubble Sort, Selection Sort, Quick Sort, Merge Sort, Insertion
    sort, Heap sort.
    Searching – Sequential Search and Binary Search
    Hashing:
    6 Symbol Table, Hashing fun, Collision Resolution – Techniques.
    Reference Books:
    1. Data Structures using C & C++ -By Ten Baum Publisher – Prenctice-Hall International.
    2. Fundamentals of Computer Algorithms by Horowitz, Sahni,Galgotia Pub. 2001 ed.
    3. Fundamentals of Data Structures in C++-By Sartaj Sahani.
    4. Data Structures: A Pseudo-code approach with C -By Gilberg & Forouzan
    Publisher- Thomson Learning.
    5. An Introduction to Data Structures with Applications. by Jean-Paul Tremblay
    & Paul G. Sorenson Publisher-Tata McGraw Hill

    You might also like