Scribd Logo
Upload

Welcome to Scribd!

  • 56 views

    DSC QB Ia-1 (2023-24)

    Uploaded by

    satyanarayanje5
    This document contains a question bank for an internal assessment test on the subject "Data Structures & Applications". It has 17 multiple choice and program based questions assessing different concepts related to data structures like arrays, stacks, queues, matrices etc. The questions are mapped to different course outcomes and cognitive levels ranging from remember to apply. Students are expected to write programs implementing various operations on data structures and solve problems related to conversion between infix, postfix and prefix notations.

    Copyright:

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

    DSC QB Ia-1 (2023-24)

    Uploaded by

    satyanarayanje5
    56 views3 pages
    This document contains a question bank for an internal assessment test on the subject "Data Structures & Applications". It has 17 multiple choice and program based questions assessing different concepts related to data structures like arrays, stacks, queues, matrices etc. The questions are mapped to different course outcomes and cognitive levels ranging from remember to apply. Students are expected to write programs implementing various operations on data structures and solve problems related to conversion between infix, postfix and prefix notations.

    Original Description:

    Dsgxfggbnj

    Original Title

    DSC QB IA-1 (2023-24)

    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 a question bank for an internal assessment test on the subject "Data Structures & Applications". It has 17 multiple choice and program based questions assessing different concepts related to data structures like arrays, stacks, queues, matrices etc. The questions are mapped to different course outcomes and cognitive levels ranging from remember to apply. Students are expected to write programs implementing various operations on data structures and solve problems related to conversion between infix, postfix and prefix notations.

    Copyright:

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

    DSC QB Ia-1 (2023-24)

    Uploaded by

    satyanarayanje5
    This document contains a question bank for an internal assessment test on the subject "Data Structures & Applications". It has 17 multiple choice and program based questions assessing different concepts related to data structures like arrays, stacks, queues, matrices etc. The questions are mapped to different course outcomes and cognitive levels ranging from remember to apply. Students are expected to write programs implementing various operations on data structures and solve problems related to conversion between infix, postfix and prefix notations.

    Copyright:

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

    H.K.E.

    Society’s
    Sir M. Visvesvaraya College of Engineering
    Department of Computer Science & Engineering
    (Affiliated to VTU - Belagavi, Approved by AICTE – New Delhi, Accredited by NAAC)
    Yeramarus camp, Raichur – 584135

    Subject: Data Structures & Applications Subject Code: BCS304

    Question Bank IA-1 (2023-24)


    Qn. Max CO RBT
    Question
    No. Marks Mapped Level
    1 Define data structures. Give the detailed explanation
    05 CO-1 L1, L2
    of its classification.
    2 Define structures? Write a C program to find average
    of a student in 3 tests. Read the values and display the 05 CO1 L1,L2,L3
    same.

    3 Differentiate between malloc and calloc functions. 05 CO1 L1,L2

    4 What is stack? Simulate the working of various


    05 CO-2 L1, L2
    operations of stack.

    Simulate the working of stack using dynamic arrays.


    5
    Convert the given infix to its postfix form.
    6 a) ((A+(B-C)*D)^E+F)
    b) X^Y^Z-M-N+P/Q 05 CO2 L3
    c) (A+(B-C)*D)
    d) (A+B)*(D-C)

    Convert the given infix to its prefix form.

    a) ((A+(B-C)*D)^E+F)
    7 b) X^Y^Z-M-N+P/Q 05 CO2 L3
    c) (A+(B-C)*D)
    d) (A+B)*(D-C)

    Convert the given infix to its postfix form using


    tracing table.
    8 a) A+(B-C)*d 05 CO2 L3
    b) (A+(B-C)*D)
    c) A-B/(C*D$E)

    9 Give the algorithm for evaluating postfix expression. 05 CO2 L1,L2

    10 Evaluate the following postfix expression using trace 05 CO2 L1,L2


    H.K.E. Society’s
    Sir M. Visvesvaraya College of Engineering
    Department of Computer Science & Engineering
    (Affiliated to VTU - Belagavi, Approved by AICTE – New Delhi, Accredited by NAAC)
    Yeramarus camp, Raichur – 584135

    Subject: Data Structures & Applications Subject Code: BCS304

    Question Bank IA-1 (2023-24)

    table:

    a) ABC-D*+E$F+ where A=6, B=3, C=2, D=5, E=1, F=7


    b) AB+C-BA+C$- where A=1,B=2,C=3

    11 Write a C program to simulate the working of 05 CO-2 L1, L2


    ordinary queue.
    Develop a Program in C for the following operations
    on Strings.
    a. Read a main String (STR), a Pattern String (PAT)
    and a Replace String (REP)
    12 b. Perform Pattern Matching Operation: Find and 05 CO-2 L3
    Replace all occurrences of PAT in STR with REP if PAT
    exists in STR. Report suitable messages in case PAT
    does not exist in STR.
    Support the program with functions for each of the
    above operations. Don't use Built-in functions.
    Develop a menu driven Program in C for the following
    operations on STACK of Integers
    (Array Implementation of Stack with maximum size
    MAX)
    a. Push an Element on to Stack
    13 b. Pop an Element from Stack 05 CO-2 L3
    c. Demonstrate Overflow and Underflow situations on
    Stack
    d. Display the status of Stack
    e. Exit
    Support the program with appropriate functions for
    each of the above operations
    Develop a Program in C for converting an Infix
    Expression to Postfix Expression. Program should
    14 support for both parenthesized and free 05 CO-2 L3
    parenthesized expressions with the operators: +, -, *,
    /, % (Remainder), ^ (Power) and alphanumeric
    operands.
    Develop a Program in C for the following Stack
    15 Applications 05 CO-2 L3
    a. Evaluation of Suffix expression with single digit
    operands and operators: +, -, *, /, %,^.
    16 Develop a menu driven Program in C for the following 05 CO-2 L3
    operations on Circular QUEUE of Characters (Array
    H.K.E. Society’s
    Sir M. Visvesvaraya College of Engineering
    Department of Computer Science & Engineering
    (Affiliated to VTU - Belagavi, Approved by AICTE – New Delhi, Accredited by NAAC)
    Yeramarus camp, Raichur – 584135

    Subject: Data Structures & Applications Subject Code: BCS304

    Question Bank IA-1 (2023-24)

    Implementation of Queue with maximum size MAX)


    a. Insert an Element on to Circular QUEUE
    b. Delete an Element from Circular QUEUE
    c. Demonstrate Overflow and Underflow situations on
    Circular QUEUE
    d. Display the status of Circular QUEUE
    e. Exit
    Support the program with appropriate functions for
    each of the above operations
    Define Sparse Matrix, Express the following matrix in
    triplet form and find its transpose.

    17 05 CO2 L2,L3

    Note:

    CO 1: Explain different data structures and their applications.


    CO 2: Apply Arrays, Stacks and Queue data structures to solve the given problems.

    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