Scribd Logo
Upload

Welcome to Scribd!

  • 36 views

    Assignment No. 1 DS

    Uploaded by

    Muhammad Ali
    This document contains 4 assignments for a Data Structures and Algorithms course. Each assignment contains questions testing knowledge of algorithms, data structures like stacks, queues, linked lists, trees, graphs and sorting algorithms like quicksort. Students are asked to define key terms, provide examples, draw data structures and trace algorithm steps. Assignments cover topics like traversal techniques, representation of graphs, expression conversions and sorting implementations.

    Copyright:

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

    Assignment No. 1 DS

    Uploaded by

    Muhammad Ali
    36 views4 pages
    This document contains 4 assignments for a Data Structures and Algorithms course. Each assignment contains questions testing knowledge of algorithms, data structures like stacks, queues, linked lists, trees, graphs and sorting algorithms like quicksort. Students are asked to define key terms, provide examples, draw data structures and trace algorithm steps. Assignments cover topics like traversal techniques, representation of graphs, expression conversions and sorting implementations.

    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 contains 4 assignments for a Data Structures and Algorithms course. Each assignment contains questions testing knowledge of algorithms, data structures like stacks, queues, linked lists, trees, graphs and sorting algorithms like quicksort. Students are asked to define key terms, provide examples, draw data structures and trace algorithm steps. Assignments cover topics like traversal techniques, representation of graphs, expression conversions and sorting implementations.

    Copyright:

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

    Assignment No. 1 DS

    Uploaded by

    Muhammad Ali
    This document contains 4 assignments for a Data Structures and Algorithms course. Each assignment contains questions testing knowledge of algorithms, data structures like stacks, queues, linked lists, trees, graphs and sorting algorithms like quicksort. Students are asked to define key terms, provide examples, draw data structures and trace algorithm steps. Assignments cover topics like traversal techniques, representation of graphs, expression conversions and sorting implementations.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 4

    Associate Degree/ Bachelors in Information Technology

    Course: Data Structures and Algorithms


    3rd Semester: Final Term Assignment No 1
    Course Code: CS 203 Max Marks: 15

    Q. No. 1. Briefly answer the following questions: [2x5=10]


    1. What is an Algorithm?
    2. What is FIFO? Explain with example.
    3. Define Linked List? Name its types.
    4. What is Asymptotic Notation?
    5. How do you insert a new element in a Binary Search Tree?
    Q. No. 2. Define Heap Tree. Define the insertion methods in Binary Heap Tree. Draw the binary
    max heap that results from inserting: 77, 22, 9, 68, 16, 34, 13, 8 in that order into an initially
    empty binary max heap. You are only required to show the final heap, although if you draw
    intermediate heaps, you will get extra credit.
    [5]
    Associate Degree/ Bachelors in Information Technology
    Course: Data Structures and Algorithms
    3rd Semester: Final Term Assignment No 2
    Course Code: CS 203 Max Marks: 15
    Q. No. 1. Briefly answer the following questions: [2x5=10]
    1. Name the operations that can be performed on a stack.
    2. Define graph data structure?
    3. Name the data structures used to implement graphs?
    4. What is merge sort?
    5. What is the difference between tree and graph data structure?
    Q. No. 2. For the tree given below, write down the Pre-order, In-order and Post-order traversal.
    [5]
    Associate Degree/ Bachelors in Information Technology
    Course: Data Structures and Algorithms
    3rd Semester: Final Term Assignment No 3
    Course Code: CS 203 Max Marks: 15
    Q. No.1 Describe infix, prefix and postfix notation with examples. Convert the following infix
    expression to postfix expression using Stack. Also draw the stack for the given problem. No
    marks will be given without stack explanation [5]
    (A+B/C*(D+E)-F)
    Q. No. 2. Perform breadth first and depth first traversal on the graph given below: [5+5=10]
    Associate Degree/ Bachelors in Information Technology
    Course: Data Structures and Algorithms
    3rd Semester: Final Term Assignment No 4
    Course Code: CS 203 Max Marks: 15
    Q. No. 1. Use the following graph for this problem. Where needed and not determined by the
    algorithm, assume that any algorithm begins at node A. Draw both the adjacency matrix and
    adjacency list representations of this graph. Be sure to specify which is which. [10]

    Q. No 2. Sort the following set of data using Quick Sort method (Divide and Conquer). Explain
    and mention all the intermediate steps as no marks will be given if the answer is incomplete [5]
    35 50 15 25 80 20 90 45

    You might also like