Scribd Logo
Upload

Welcome to Scribd!

  • 10 views

    Software Engineering

    Uploaded by

    anilallamudialc

    Copyright:

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

    Software Engineering

    Uploaded by

    anilallamudialc
    10 views3 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

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

    Software Engineering

    Uploaded by

    anilallamudialc

    Copyright:

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

    Andhra Loyola College (Autonomous):: Vijayawada-8

    II BCA, - COMPUTER SCIENCE


    COURSE 6: DATA STRUCTURES- (Syllabus)

    OBJECTIVES:
     The objective of the course is to make a student to implement data structures and organize
    and manage data, based on data structures for efficient access.

    COURSE OUTCOMES (COs):

     Identify data structures suitable to solve any specific problem.


     Identifying various data structures and their real-time applications
     Identifying the use of Time and Space Complexity.
     Implementing different sorting & searching techniques.

    Unit-I
    Introduction and Overview- Elementary Data Organization, Data Structures classification, Data
    Structure Operations, Algorithms: Complexity, Time-Space Tradeoff.
    Preliminaries-Mathematical Notation and Functions, Algorithmic Notation, Control Structures used
    in algorithms, Complexity of Algorithms. Other Asymptotic Notations, Sub algorithms, Variables,
    Data Types.

    UNIT -II (10 Hrs)


    Arrays, Records and Pointers – Linear Arrays, Representation and Traversing Linear Arrays,
    Inserting and Deleting. Passing an array to function, Pointer & Arrays, Multidimensional Arrays,
    Sparse Matrices.

    UNIT – III (10 Hrs)


    Linked Lists – Representation, Dynamic Memory Allocation, Traversing, Searching, Insertion,
    Deletion, Header Linked Lists, Two-Way Lists
    Stacks- Stacks, Operations on stacks, Array representation of stacks, Linked List representation of
    stacks, Arithmetic Expressions, Polish notation, Recursion.

    UNIT – IV (10 Hrs)


    Queues, Linked representation of Queues, Deques, Priority Queues.
    Sorting - Insertion Sort, Bubble Sort, Selection sort, Quick Sort, Merge sort, Heap Sort,
    Searching – Linear Search, Binary Search.
    UNIT – V (10 Hrs)
    Trees- Binary trees, Representing and traversing binary trees, Traversal algorithms using stacks.
    Binary Search Trees, Searching, Insertion and Deletion in Binary Search Trees,
    Graphs- Terminology, Sequential representation of Graphs, Linked representation of Graphs,
    Operations on Graphs, Traversing a Graph.

    TEXT BOOK:
    1. Data Structures by Seymour Lipschutz, McGraw Hill(Schaum’s Outlines).
    2. Data Structures using C , Second edition , Dr. Reema Thareja, Oxford University
    Press.

    REFERENCES:
    1. Data Structures & Algorithms Using C, Khanna Publishers
    2. Theory and Problems of Data Structures by Seymour Lipschutz, McGraw Hill
    (Schaum’s Outlines)
    3. Data Structures & Algorithms in C by M.A.Weiss, Addison Wisley.
    4. Data Structures Using C, Reema Thareja, oxford.
    DATA STRUCTURES
    MODEL QUESTION PAPER
    SECTION – A
    I. Answer all the following questions 5×16 = 80 M

    1. a) Explain the Data Structures classification. Discuss Data Structure Operations.


    OR
    b). Explain Time-Space Tradeoff in detail.

    2. a) Define Array and explain Array Operation insert and delete with programs. .
    OR
    b) Discuss the importance of requirement pointers in Array with a program.

    3. a) Explain the Types of Linked List with diagrams.

    OR
    b) Discuss Linked list implementation of stack in detail.
    .

    5. a) Discuss the Linked representation of Queues


    OR
    b) Discuss Quick Sort, Merge sort sorting methods.
    5. a) Explain the Insertion and Deletion in Binary Search Trees.
    OR
    b) Discuss Traversing a Graph.
    SECTION - B
    II. Answer all the following question 10×2 = 20 M
    6. Explain Control Structures used in algorithms.
    7. Write the Data Structure Operations
    8. Explain Multidimensional Arrays with example.
    9. explain Passing an array to function.
    10. Define Dynamic Memory Allocation
    11. Discuss Array representation of stacks.
    12. Define Queue. Mention its types.
    13. What is the difference between Linear Search, Binary Search.
    14. Define Graphs and. mention its types.
    15. What is Binary tree?

    ******************

    You might also like