Scribd Logo
Upload

Welcome to Scribd!

  • 8 views

    Dsa Iat 1

    Uploaded by

    Shruthi S
    DSA unit 1 questions

    Copyright:

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

    Dsa Iat 1

    Uploaded by

    Shruthi S
    8 views3 pages
    DSA unit 1 questions

    Original Title

    DSA IAT 1

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    DSA unit 1 questions

    Copyright:

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

    Dsa Iat 1

    Uploaded by

    Shruthi S
    DSA unit 1 questions

    Copyright:

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

    P.S.V.

    COLLEGE OF ENGINEERING AND TECHNOLOGY


    (An Autonomous Institution)
    (Approved by AICTE, New Delhi and Affiliated to Anna University, Chennai)
    Accredited by the NAAC with ‘A’ Grade
    (Inclusion Under Section 2(f) & 12(B) of the UGC Act, 1956)
    (An ISO 9001: 2015 Certified Institution)
    Bangalore –Chennai Highway (NH-46)
    Mittapalli, Balinayanapalli Post, Krishnagiri-635108.

    INTERNAL ASSESSMENT TEST- I


    SUBJECT: CD3291/ DATA STRUCTURES AND ALGORITHMS SEM/DEPT : III/ IT
    DURATION :3 hours (10:00 AM-1:00 PM) TOTAL MARKS :100
    Course Outcomes:

    CO1 To understand the concepts of ADTs

    CO2 To design linear data structures – lists, stacks, and queues

    CO3 To understand sorting, searching, and hashing algorithms

    ANSWER ALL THE QUESTIONS


    Q.No. Questions Marks BTL CO
    PART A (10*2=20 Marks)

    1 2 L2 CO
    What is the difference between ADT and Data structure?
    1
    2 What is the analysis of recursive algorithms? 2 L2 CO1
    3 Compare the order of growth of n(n-1)/2 and n2. 2 L2 CO1

    4 Define linear and non linear data structures with example 2 L1 CO1

    5 Write any two application of stack. 2 L2 CO2

    6 2 L1 CO
    What is the advantage of linked list over arrays?
    2
    7 Evaluate the following expression using stack 5 6 2+ * 8 4 / -. 2 L2 CO
    2
    8 2 L1 CO
    What is static linked list? State any two application of it.
    2
    9 How do you differentiate external and internal sorting. 2 L2 CO3

    10 2 L1 CO
    Mention any two sorting algorithms with their best time complexities
    3
    PART B (5*13=65 Marks)
    a) List out all object-oriented programming (OOPs) concept and explain in
    detail.
    11 Or 13 L2 CO1
    b) What is the purpose of asymptotic notation? Explain the asymptotic
    notation with example.
    12 a) Difference and explain in detail about the shallow and deep copy of a class 13 L2 CO1
    with suitable example.
    Or
    b) A click counter is small hand-held device that contains a push button and a
    count display. To increment the counter the button is pushed and the new
    count shows in the display. Clicker counters also contain a button that can be
    pressed to reset the counter to zero. design and implement the counter ADT
    that functions as your hand held clicker
    a) Define a stack. Write an algorithm to convert an infix expression to a
    postfix expression and apply the same to convert (A+B) – C * (D/E) + F to
    postfix expression.
    13 13 L2 CO1
    Or
    b) What is DEQUE? Explain the types and its operation with diagrammatic
    representations.
    a) i) Show the simulation using for the following expression to convert
    infix to postfix : p*q+(r-s/t).
    14 ii) Simulate the conversion of infix to postfix expression using stack for 13 L3 CO2
    the following expression: 3- (4/2) + (1*5) + 6.
    Or
    b) What is the algorithm for push and pop operation on stack using linked list.
    a) Write an algorithm to perform Quicksort and analyze the best case complexity of it
    15 apply it to sort 24,50,17,35,10,90,82,31. 13 L2 CO3
    Or
    b) Explain the process of selection Sort with an example.
    PART C (1*15=15 Marks)
    a) Sort the following numbers using merge sort algoritm 11,8,55,22,33,27,62,35,71.
    Obtain the worst case and average case time complexity.
    16 Or 15 L3 CO3
    b) Sort the following numbers using insertion sort. Show all passes
    50,10,78,40,30,02,04,15.

    CO Coverage:
    CO Particulars Total marks
    PART A [1,2,3,4] = 2*4= 8 Marks
    CO1 34
    PART B[11,12]=3*13=26 Marks
    PART A [6,7,8,9] = 4*2 =8 Marks
    CO2 34
    PART B[13,14]=2*13=26 Marks
    PART A [9,10] = 2*2 = 4 Marks
    CO3 PART B[15]=1*13= 13Marks 32
    PART C [16] = 1*15 = 15 Marks

    TOTAL 100 Marks

    Bloom's Level Wise Mark Course Outcome Wise


    Distribution Marks Distribution
    Level 1 34 34
    54% 8%
    Level 2
    Level 3 32

    79% CO1 CO2 CO3


    Course Instructor HoD Principal

    You might also like