Scribd Logo
Upload

Welcome to Scribd!

  • Data Structures Using C++: EC 457 (Elective - III)

    Uploaded by

    Salma Rasheed
    22 views1 page
    This document outlines the course details for the elective course "Data Structures using C++" offered beginning in the 2005-2006 academic year. The course is divided into 5 units covering topics such as linear lists, stacks, queues, trees, sorting algorithms, graphs, and B-trees. Students will receive 2 periods of instruction per week, a 2 period university examination, and be evaluated based on a university exam worth 75 marks and a sessional component worth 25 marks. Suggested reading materials for the course are also provided.

    Original Description:

    Original Title

    EC457

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines the course details for the elective course "Data Structures using C++" offered beginning in the 2005-2006 academic year. The course is divided into 5 units covering topics such as linear lists, stacks, queues, trees, sorting algorithms, graphs, and B-trees. Students will receive 2 periods of instruction per week, a 2 period university examination, and be evaluated based on a university exam worth 75 marks and a sessional component worth 25 marks. Suggested reading materials for the course are also provided.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    22 views1 page

    Data Structures Using C++: EC 457 (Elective - III)

    Uploaded by

    Salma Rasheed
    This document outlines the course details for the elective course "Data Structures using C++" offered beginning in the 2005-2006 academic year. The course is divided into 5 units covering topics such as linear lists, stacks, queues, trees, sorting algorithms, graphs, and B-trees. Students will receive 2 periods of instruction per week, a 2 period university examination, and be evaluated based on a university exam worth 75 marks and a sessional component worth 25 marks. Suggested reading materials for the course are also provided.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    With effect from the academic year 2005 - 2006

    EC 457
    Data Structures using C++
    (Elective – III)

    Instruction 2 periods for Theory


    Duration of University Examination 2 Periods for Practical
    University examination 75 Makrs
    Sessional 25 Marks

    UNIT –I
    Data representation: Introduction, linear Lists, formula based representation, indirect addressing,
    simulating pointers, comparisons and applications, arrays, matrices, special and Sparse matrices

    UNIT –II
    Stacks: Definitions, operations and applications, array and lined representation of stacks. Queues:
    Definitions and operations. Array and linked representation of queues. Applications.

    UNIT –III
    Trees: Definitions and properties, representation of binary trees, operations. Binary tree traversal,
    Binary search trees.

    UNIT – IV
    Sorting: Merge sort, quick sort, selection sort, heap sort, complexity analysis, sequential search, binary
    search.

    UNIT – V
    Graphs: Definitions and representation of graphs, graph search methods, applications and
    B-trees.

    Suggested Reading
    1. S. Sahani, Data Structures, Algorithms and Applications in C++, McGraw Hill, 1998.
    2. Mark Allen Weiss, Data Structures & Algorithms in C++,
    3. Bruno, Preiss, Design Patterns & Algorithms,
    4. Tannenbaum, Data Structures in C++, PHI,
    5. Kutti/Padnye, Data Structures in C++, Prentice Hall of India,

    You might also like