Scribd Logo
Upload

Welcome to Scribd!

  • 14 views

    Data Structures and Applications - 17-3-2023

    Uploaded by

    pegena7848
    This document contains the questions from the Data Structures and Applications exam for semester 3 of the B.Tech Information Technology program. It includes 5 sections with 2 questions each, covering a range of concepts from different data structures like stacks, queues, trees, and graphs. Students are instructed to attempt any 2 questions from each section, with the level of understanding and course outcome for each question provided in parentheses. Questions test various cognitive levels including knowledge, understanding, application, analysis and creation. Students are expected to illustrate concepts, solve problems, explain algorithms and draw examples to demonstrate their understanding of data structures and algorithms.

    Copyright:

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

    Data Structures and Applications - 17-3-2023

    Uploaded by

    pegena7848
    14 views2 pages
    This document contains the questions from the Data Structures and Applications exam for semester 3 of the B.Tech Information Technology program. It includes 5 sections with 2 questions each, covering a range of concepts from different data structures like stacks, queues, trees, and graphs. Students are instructed to attempt any 2 questions from each section, with the level of understanding and course outcome for each question provided in parentheses. Questions test various cognitive levels including knowledge, understanding, application, analysis and creation. Students are expected to illustrate concepts, solve problems, explain algorithms and draw examples to demonstrate their understanding of data structures and algorithms.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains the questions from the Data Structures and Applications exam for semester 3 of the B.Tech Information Technology program. It includes 5 sections with 2 questions each, covering a range of concepts from different data structures like stacks, queues, trees, and graphs. Students are instructed to attempt any 2 questions from each section, with the level of understanding and course outcome for each question provided in parentheses. Questions test various cognitive levels including knowledge, understanding, application, analysis and creation. Students are expected to illustrate concepts, solve problems, explain algorithms and draw examples to demonstrate their understanding of data structures and algorithms.

    Copyright:

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

    Data Structures and Applications - 17-3-2023

    Uploaded by

    pegena7848
    This document contains the questions from the Data Structures and Applications exam for semester 3 of the B.Tech Information Technology program. It includes 5 sections with 2 questions each, covering a range of concepts from different data structures like stacks, queues, trees, and graphs. Students are instructed to attempt any 2 questions from each section, with the level of understanding and course outcome for each question provided in parentheses. Questions test various cognitive levels including knowledge, understanding, application, analysis and creation. Students are expected to illustrate concepts, solve problems, explain algorithms and draw examples to demonstrate their understanding of data structures and algorithms.

    Copyright:

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

    DR.

    BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE


    Winter Examination–2022
    Course: B. Tech. Branch :Information Technology Semester :III
    Subject Code &Name: BTITC305, Data Structures and Applications
    Max Marks: 60 Date:17/03/2023 Duration: 3 Hr.
    Instructions to the Students:
    1. All the questions are compulsory.
    2. The level of question/expected answer as per OBE or the Course Outcome (CO) on
    which the question is based is mentioned in ( ) in front of the question.
    3. Use of non-programmable scientific calculators is allowed.
    4. Assume suitable data wherever necessary and mention it clearly.
    (Level/CO) Marks
    Q. 1 Solve Any Two of the following. 12
    A) Illustrate the classification of Data Structures with an example of each Apply 6
    class. CO1
    B) Describe Time and Space complexity related to an algorithm. Understand 6
    CO1
    C) Write an algorithm for the following statements. Create 6
    i) To check whether a given number is prime CO1
    ii)To find Factorial of a number

    Q.2 Solve Any Two of the following. 12


    A) Evaluate the given postfix expression using stack by assuming values Evaluate 6
    given below: CO2
    P=2, Q=4, R=6, S=8, T=12, U=12, V=2, W=6, X=6
    PQ+RS*T/-UV*WX+/+
    B) Draw and explain in detail the circular queue with an example. Understand 6
    CO2
    C) Design a procedure which finds number NUM of times a given ITEM Create 6
    occurs in a linked list. CO2

    Q. 3 Solve Any Two of the following. 12


    A) Explain preorder traversal of a binary tree with an example. Understand 6
    CO3
    B) Construct a tree for given expression. Create 6
    2 5 5 3
    (10a +5b) +(3a-4b ) CO3
    C) What is a binary tree? Write any three types of binary tree with an Knowledge 6
    example. CO3
    Q.4 Solve Any Two of the following. 12
    A) Explain Breadth First Search (BFS) technique along with an algorithm. Understand 6
    CO4
    B) Find the minimum spanning tree using Kruskal’s algorithm for the Evaluate 6
    given graph. CO4

    C) How the graphs are represented in a memory? Explain with an Understand 6


    example. CO4

    Q. 5 Solve Any Two of the following. 12


    A) Write an algorithm for linear search in an array. Understand 6
    CO5
    B) Sort the following list using Merge Sort. Write its complexity. Apply 6
    12, 8, 2, 6, 25, 5, 4, 9 CO5
    C) Write and explain Quick Sort algorithm to sort a given array. Create 6
    Understand
    CO5
    *** End ***

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy