Scribd Logo
Upload

Welcome to Scribd!

  • 36 views

    To Efficiently Implement Solutions For Specific Problems

    Uploaded by

    Adal Arasan
    This document outlines the aim, objectives, and units of study for the course EC 135 Data Structures and C++. The aim is to provide in-depth knowledge of problem solving techniques and data structures. The objectives are to learn systematic problem solving, understand organizing large amounts of data, learn C++ programming, and efficiently implement data structures and solutions to specific problems. The five units cover principles of object-oriented programming in C++, advanced OOP, data structures and algorithms, non-linear data structures, and sorting and searching algorithms.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd

    To Efficiently Implement Solutions For Specific Problems

    Uploaded by

    Adal Arasan
    36 views3 pages
    This document outlines the aim, objectives, and units of study for the course EC 135 Data Structures and C++. The aim is to provide in-depth knowledge of problem solving techniques and data structures. The objectives are to learn systematic problem solving, understand organizing large amounts of data, learn C++ programming, and efficiently implement data structures and solutions to specific problems. The five units cover principles of object-oriented programming in C++, advanced OOP, data structures and algorithms, non-linear data structures, and sorting and searching algorithms.

    Original Description:

    Original Title

    ECE Syl

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines the aim, objectives, and units of study for the course EC 135 Data Structures and C++. The aim is to provide in-depth knowledge of problem solving techniques and data structures. The objectives are to learn systematic problem solving, understand organizing large amounts of data, learn C++ programming, and efficiently implement data structures and solutions to specific problems. The five units cover principles of object-oriented programming in C++, advanced OOP, data structures and algorithms, non-linear data structures, and sorting and searching algorithms.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    36 views3 pages

    To Efficiently Implement Solutions For Specific Problems

    Uploaded by

    Adal Arasan
    This document outlines the aim, objectives, and units of study for the course EC 135 Data Structures and C++. The aim is to provide in-depth knowledge of problem solving techniques and data structures. The objectives are to learn systematic problem solving, understand organizing large amounts of data, learn C++ programming, and efficiently implement data structures and solutions to specific problems. The five units cover principles of object-oriented programming in C++, advanced OOP, data structures and algorithms, non-linear data structures, and sorting and searching algorithms.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    of 3

    EC 135 Data Structures and C++ AIM

    0032

    To provide an in-depth knowledge in problem solving techniques and data structures. OBJECTIVES To learn the systematic way of solving problems To understand the different methods of organizing large amounts of data To learn to program in C++ To efficiently implement the different data structures

    To efficiently implement solutions for specific problems

    UNIT I PRINCIPLES OF OBJECT ORIENTED PROGRAMMING 9 Introduction- Tokens-Expressions- control Structures Functions in C++, classes and objects, constructors and destructors ,operators overloading and type conversions . UNIT II ADVANCED OBJECT ORIENTED PROGRAMMING 9 Inheritance, Extending classes, Pointers, Virtual functions and polymorphism, File Handling, Manipulating strings. UNIT III DATA STRUCTURES & ALGORITHMS 9 Algorithm, Analysis, Lists, Stacks and queues, Priority queues-Binary Heap-Application, Heaps hashing UNIT IV NONLINEAR DATA STRUCTURES 9 Trees-Binary trees, search tree ADT, AVL trees, Graph Algorithms-Topological sort, shortest path algorithm network flow problems-minimum spanning tree UNIT V SORTING AND SEARCHING 9 Sorting Insertion sort, Bubble sort, Heap sort, Merge sort, Quick sort, Introduction to Algorithm Design Techniques Greedy algorithm (Minimum Spanning Tree), Divide and Conquer (Merge Sort), Dynamic Programming (All pairs Shortest Path Problem). Total : 45 Periods TEXT BOOKS: 1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, 3rd ed, Pearson Education Asia, 2006. 2. E. Balagurusamy, Object Oriented Programming with C++, McGraw Hill Company Ltd., 2007. REFERENCES: 1. Michael T. Goodrich, Data Structures and Algorithm Analysis in C++, Wiley student edition, 2007. 2. Sahni, Data Structures Using C++, The McGraw-Hill, 2006. 3. Seymour, Data Structures, The McGraw-Hill, 2007. 4. Jean Paul Tremblay & Paul G.Sorenson, An Introduction to data structures with applications, Tata McGraw Hill edition, II Edition, 2002. 5. John R.Hubbard, Schaums outline of theory and problem of data structure with C++, McGraw-Hill, New Delhi, 2000. 6. Bjarne Stroustrup, The C++ Programming Language, Addison Wesley, 2000 7. Robert Lafore, Object oriented programming in C++, Galgotia Publication

    EC 139 DATA STRUCTURES AND C++ LAB 0 0 3 2 1. Basic Programs for C++ Concepts a. Program using constructor and destructor b. Program using operator overloading c. Program using inheritance d. Program using virtual function 2. Array implementation of List Abstract Data Type (ADT) 3. Linked list implementation of List ADT 4. Stack ADT - Array and linked list implementations The next two exercises are to be done by implementing the following source files (a) Program source files for Stack Application 1 (b) Array implementation of Stack ADT (c) Linked list implementation of Stack ADT (d) Program source files for Stack Application 2 An appropriate header file for the Stack ADT should be #included in (a) and (d) 5. Implement any Stack Application using array implementation of Stack ADT (by implementing files (a) and (b) given above) and then using linked list implementation of Stack ADT (by using files (a) and implementing file (c)) 6. Queue ADT Array and linked list implementations 7. Search Tree ADT - Binary Search Tree 8. Heap Sort 9. Quick Sort LIST OF EQUIPMENTS AND COMPONENTS FOR A BATCH OF 30 STUDENTS ( 1 per Batch) S.No Name of the equipments / Components Quzntity Required Remarks 1 P IV Computer Variable DC Power Supply 30 Nos 2 C and C++ Compiler 30 Users Consumables (Minimum of 25 Nos. each) Nil

    You might also like