Scribd Logo
Upload

Welcome to Scribd!

  • 120 views

    Data Structure Using C++ - Elective III

    Uploaded by

    sneha_ece
    This document outlines the syllabus for the 5th semester Data Structures using C++ course for the 2015-16 admitted batch of students in the Department of Electronics and Communication Engineering at the School of Engineering. The course aims to teach students C++ concepts and algorithms for data structures like queues, stacks, lists, trees and graphs. It will be a 3 credit course involving 3 hours of lectures per week. The syllabus is divided into 5 units that will cover C++ classes, algorithms, search trees, lists, functions, and text processing algorithms. Evaluation will be based on assignments, quizzes, and an exam. Suggested textbooks are also provided.

    Copyright:

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

    Data Structure Using C++ - Elective III

    Uploaded by

    sneha_ece
    120 views2 pages
    This document outlines the syllabus for the 5th semester Data Structures using C++ course for the 2015-16 admitted batch of students in the Department of Electronics and Communication Engineering at the School of Engineering. The course aims to teach students C++ concepts and algorithms for data structures like queues, stacks, lists, trees and graphs. It will be a 3 credit course involving 3 hours of lectures per week. The syllabus is divided into 5 units that will cover C++ classes, algorithms, search trees, lists, functions, and text processing algorithms. Evaluation will be based on assignments, quizzes, and an exam. Suggested textbooks are also provided.

    Original Description:

    data structures

    Original Title

    Data structure using C++ -Elective III

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines the syllabus for the 5th semester Data Structures using C++ course for the 2015-16 admitted batch of students in the Department of Electronics and Communication Engineering at the School of Engineering. The course aims to teach students C++ concepts and algorithms for data structures like queues, stacks, lists, trees and graphs. It will be a 3 credit course involving 3 hours of lectures per week. The syllabus is divided into 5 units that will cover C++ classes, algorithms, search trees, lists, functions, and text processing algorithms. Evaluation will be based on assignments, quizzes, and an exam. Suggested textbooks are also provided.

    Copyright:

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

    Data Structure Using C++ - Elective III

    Uploaded by

    sneha_ece
    This document outlines the syllabus for the 5th semester Data Structures using C++ course for the 2015-16 admitted batch of students in the Department of Electronics and Communication Engineering at the School of Engineering. The course aims to teach students C++ concepts and algorithms for data structures like queues, stacks, lists, trees and graphs. It will be a 3 credit course involving 3 hours of lectures per week. The syllabus is divided into 5 units that will cover C++ classes, algorithms, search trees, lists, functions, and text processing algorithms. Evaluation will be based on assignments, quizzes, and an exam. Suggested textbooks are also provided.

    Copyright:

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

    School of Engineering

    Department of Electronics and Communication Engineering


    B. Tech- 5th Semester

    SYLLABUS
    (Applicable for 2015-16 admitted batch)

    Subject Code Subject Name L T P Seminar C


    /Project
    15EC323 DATA STRUCTURE USING C++ 3 - -- - 3
    (Elective-I)
    Course 1. Understand Data structures using C++
    Objectives concepts.
    2. Study C++ Concepts, Algorithms, Queues
    Stacks, Lists, Trees, Graphs and functions.

    Course 1. Understand concepts in Data structures


    Outcomes using C++ concepts
    2. Develop skills to handle Algorithms,
    Queues and Stacks.
    3. Analyze functioning of Lists, Trees,
    Graphs and functions.
    4. Apply knowledge of lists, trees, graphs in
    coding with C++

    UNIT -1 C++ CLASS OVERVIEW (8 hours)


    Class Definition, Objects, Class Members, Access Control, Class Scope, Constructors and
    destructors, parameter passing methods, Inline functions, static class members, this pointer,
    friend functions, dynamic memory allocation and deallocation (new and delete), exception
    handling

    UNIT -2 ALGORITHMS, PERFORMANCE ANALYSIS (10 hours)


    Time complexity and space complexity. Review of basic data structures- The list, Stack, Queue,
    and Implementation using template classes in C++.
    Priority Queues: Definition, realizing a Priority Queue using Heaps, Definition, insertion,
    Deletion, External Sorting- Model for external sorting, Multiway merge, Polyphase merge.

    UNIT -3 SEARCH TREES (10 hours)


    Binary Search Trees, Definition, Operations- Searching, Insertion and Deletion, AVL Trees,
    Definition, Height of an AVL Tree, Operations - Insertion, Deletion and Searching. B-Trees, B-
    School of Engineering
    Tree of order m, height of a B-Tree, insertion, deletion and searching, Comparison of Search
    Trees
    Graphs: Basic terminology, representations of graphs, graph search methods DFS, BFS.

    UNIT -4 LISTS (10 hours)


    Dictionaries, linear list representation, skip list representation, operations insertion, deletion and
    searching, hash table representation, hash functions, collision resolution-separate chaining, open
    addressing-linear probing, quadratic probing, double hashing, rehashing, extendible hashing,
    comparison of hashing and skip lists.

    UNIT -5 FUNCTIONS (8 hours)


    Function over Loading, Operator Overloading, Generic Programming- Function and class
    templates, Inheritance basics, base and derived classes, inheritance types, base class access
    control, runtime polymorphism using virtual functions, abstract classes, streams I/O.
    Text Processing: Pattern matching Algorithms-Brute force, the Boyer Moore algorithm, the
    Knuth-Morris-Pratt algorithm, Standard Tries, Compressed Tries, Suffix tries.

    TEXT BOOKS:
    1. Data structures, Algorithms and Applications in C++, S. Sahni, University Press (India)
    Pvt. Ltd, 2nd edition, Universities Press Orient Longman Pvt. Ltd.
    2. Data structures and Algorithms in C++, Michael T. Goodrich, R. Tamassia and .Mount,
    Wiley student edition, John Wiley and Sons.

    REFERENCE BOOKS:

    1. Data structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education.
    Ltd., Second Edition.
    2. Data structures and algorithms in C++, 3rd Edition, Adam Drozdek, Thomson
    3. Data structures using C and C++, Langsam, Augenstein and Tanenbaum, PHI.
    4. Problem solving with C++, The OOP, Fourth edition, W.Savitch, Pearson education.

    You might also like