Scribd Logo
Upload

Welcome to Scribd!

  • 38 views

    Workbook DSU

    Uploaded by

    MohammadMoiz
    This document contains student worksheets for chapters 1-7 of the textbook "Data Structures Using C". The worksheets contain questions for students to answer related to key concepts in each chapter such as data structures, algorithms, sorting, searching, stacks, queues, linked lists, trees, and graphs. Some questions ask students to provide examples, explanations, or code for common data structure operations and algorithms. The worksheets are meant to help students reinforce their understanding of fundamental data structures topics.

    Copyright:

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

    Workbook DSU

    Uploaded by

    MohammadMoiz
    38 views44 pages
    This document contains student worksheets for chapters 1-7 of the textbook "Data Structures Using C". The worksheets contain questions for students to answer related to key concepts in each chapter such as data structures, algorithms, sorting, searching, stacks, queues, linked lists, trees, and graphs. Some questions ask students to provide examples, explanations, or code for common data structure operations and algorithms. The worksheets are meant to help students reinforce their understanding of fundamental data structures topics.

    Original Title

    workbook DSU

    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 student worksheets for chapters 1-7 of the textbook "Data Structures Using C". The worksheets contain questions for students to answer related to key concepts in each chapter such as data structures, algorithms, sorting, searching, stacks, queues, linked lists, trees, and graphs. Some questions ask students to provide examples, explanations, or code for common data structure operations and algorithms. The worksheets are meant to help students reinforce their understanding of fundamental data structures topics.

    Copyright:

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

    Workbook DSU

    Uploaded by

    MohammadMoiz
    This document contains student worksheets for chapters 1-7 of the textbook "Data Structures Using C". The worksheets contain questions for students to answer related to key concepts in each chapter such as data structures, algorithms, sorting, searching, stacks, queues, linked lists, trees, and graphs. Some questions ask students to provide examples, explanations, or code for common data structure operations and algorithms. The worksheets are meant to help students reinforce their understanding of fundamental data structures topics.

    Copyright:

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

    Data Structures Using C (22317)

    Chapter 01: Introduction to Data Structure


    Student Work sheet

    NAME

    1. What is data structure? Why do we need data structure ?

    2. Give classification of Data structure ? Give its example.

    .
    .

    3. Describe Big ‘O’ Notation used in algorithm.


    .

    .
    .

    4. Explain different approaches to design an algorithm.

    .
    .

    .
    5 . Compare time complexity and space complexity with respect to algorithm. .

    .
    6. What are Linear and Non Linear data structure ? Give 2 Examples.

    .
    7. Describe various types of operations that can be performed on data structure ?

    Subject Teacher HOD


    Data Structures Using C (22317)
    Chapter 02: Sorting and Searching
    Student Work sheet

    NAME

    1. Explain binary search algorithm and also give its advantages?

    .
    2. Sort the given number in ascending order using Radix sort .
    348 ,14 ,614 , 5381 , 47
    3. Write algorithm for insertion sort and arrange the given number in ascending order using
    insertion sort
    77 , 33 , 44 , 11 , 88 , 22 , 66 , 55

    .
    .

    .
    4. Describe principle of selection sort with example.

    .
    .

    5. Explain Linear search algorithm ? Also give its limitations

    .
    .

    .
    .

    6. What is Searching and Sorting ? Enlist different methods.

    .
    .

    7. Describe Bubble sort with example

    .
    .

    Subject Teacher HOD


    Data Structures Using C (22317)
    Chapter 03: Stacks
    NAME

    1. State Principle of Stack with basic operations.

    .
    2. Define term Overflow and Underflow with respect to stack.

    .
    3. Translate the given Infix expression to postfix expression using stack and show the details

    stack at each step.


    ((A+B)*D)^(E–F)

    .
    4. Write down applications of stack.

    .
    5. Convert the following arithmetic expression P in postfix notation into infix:
    P :- 5 , 6 , 2 , + , * , 12 , 4 , / , -
    also evaluate P for final value.

    .
    Data Structures Using C (22317)
    Chapter 04: Queues
    WORKSHEET
    NAME

    1. Explain principal of queue with example.

    .
    2. Write the procedure for inserting and deleting an element from queue .

    .
    3. Describe Priority queues.

    .
    4. Define circular queue. Also explain advantages of circular queue over linear
    queue with example.

    .
    5. Explain with diagram Queue full and queue empty condition for circular queue.

    .
    6. State any two applications of queue.

    .
    7. Difference between Stack and Queue with minimum 4 points?
    Stack Queue

    Subject Teacher HOD


    Data Structures Using C (22317)
    Chapter 05: Linked List
    Student Work sheet
    1. Define terms Empty list, Node, Address, Null Pointer and Next pointer for linked
    list.

    .
    2. List type of linked list and state operations performed on linked list.

    .
    3. Write a algorithm to insert node at beginning at middle position and at the end of
    a "Singly" linked list.

    .
    4. Describe Structure of Circular linked list

    .
    Data Structures Using C (22317)
    Chapter 06: Tree
    Student Work sheet
    1. Explain a searching a value in binary search tree with example.

    2. Define terms related to Binary Tree:- Level, Depth, Leaf Node, Root Node ,siblings.
    .

    .
    .

    3. Enlist types of Binary tree and give their meaning

    .
    .

    4. Construct the Binary search tree from the given list of letter inserted in order into
    an empty binary search tree:-
    J,R,D,G,T,E,M,H,P,A,F,Q
    .
    5. Define tree traversal along with Preorder , Inorder and Post order algorithm.
    Draw the tree structure of the expression given below.
    Z*(A+B)*C/D

    .
    .

    Subject Teacher HOD


    Data Structures Using C (22317)
    Chapter 07: Graph
    Student Work sheet

    NAME

    1. Describe in brief the term related to Graph : Vertices , edges , Directed graph
    ,Undirected graph

    .
    2. Define:- Successor , Predecessor ,Weighted graph , in degree ,out-degree.

    .
    3. Describe application of graph in data structure.

    .
    4. What is graph? Explain adjacency matrix representation of graph with suitable example.

    Subject Teacher HOD

    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