Scribd Logo
Upload

Welcome to Scribd!

  • 21 views

    Front H

    Uploaded by

    aswalh0707
    This document contains the term work submission of Himanshu Singh Aswal for the course Data Structures using C (PCS-302) for the third year of B.Tech CSE at Graphic Era Hill University Dehradun Campus for the year 2023-24. It includes a certificate signed by the teacher certifying the completion of the term work as per the curriculum. It also includes an acknowledgment thanking the guide and teacher for their help and guidance in completing the term work successfully and on time. The index lists 11 questions related to data structures and algorithms that have been answered as part of the term work.

    Copyright:

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

    Front H

    Uploaded by

    aswalh0707
    21 views5 pages
    This document contains the term work submission of Himanshu Singh Aswal for the course Data Structures using C (PCS-302) for the third year of B.Tech CSE at Graphic Era Hill University Dehradun Campus for the year 2023-24. It includes a certificate signed by the teacher certifying the completion of the term work as per the curriculum. It also includes an acknowledgment thanking the guide and teacher for their help and guidance in completing the term work successfully and on time. The index lists 11 questions related to data structures and algorithms that have been answered as part of the term work.

    Original Title

    FRONT_H

    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 term work submission of Himanshu Singh Aswal for the course Data Structures using C (PCS-302) for the third year of B.Tech CSE at Graphic Era Hill University Dehradun Campus for the year 2023-24. It includes a certificate signed by the teacher certifying the completion of the term work as per the curriculum. It also includes an acknowledgment thanking the guide and teacher for their help and guidance in completing the term work successfully and on time. The index lists 11 questions related to data structures and algorithms that have been answered as part of the term work.

    Copyright:

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

    Front H

    Uploaded by

    aswalh0707
    This document contains the term work submission of Himanshu Singh Aswal for the course Data Structures using C (PCS-302) for the third year of B.Tech CSE at Graphic Era Hill University Dehradun Campus for the year 2023-24. It includes a certificate signed by the teacher certifying the completion of the term work as per the curriculum. It also includes an acknowledgment thanking the guide and teacher for their help and guidance in completing the term work successfully and on time. The index lists 11 questions related to data structures and algorithms that have been answered as part of the term work.

    Copyright:

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

    DEHRADUN CAMPUS

    TERM WORK

    DATA STRUCTURES USING ‘C’

    PCS - 302

    B.TECH CSE

    III

    2023 - 24

    DEPARTMENT OF COMPUTER SCIENCE


    AND ENGINEERING

    Submitted By : Submitted To :

    Name : HIMANSHU SINGH ASWAL


    University Roll No. : 2218858 Department of Computer Science
    Class Roll No. : 30 and Engineering,
    Course/Section: B.TECH / A2 Graphic Era Hill University DDN.
    DEHRADUN CAMPUS

    CERTIFICATE

    UNIVERSITY ROLL NO. : 2218858 CLASS ROLL NO. : 30

    THIS IS TO CERTIFY THAT MR. HIMANSHU SINGH ASWAL OF


    B.TECH CSE 2nd YEAR HAS SATISFACTORILY COMPLETED HIS
    TERM WORK AS PER THE CURRICULUM DESIGNED BY
    GRAPHIC ERA HILL UNIVERSITY DEHRADUN CAMPUS FOR
    THE BATCH 2022-2026.
    DEHRADUN CAMPUS

    ACKNOWLEDGEMENT

    I WOULD LIKE TO CONVEY MY THANKS TO MY GUIDE MR.


    ASHISH GARG AND DR. AJAY SHUKLA FOR THEIR IMMENSE
    HELP AND GUIDANCE IN THE COMPLETION OF MY TERM WORK.
    IT IS ONLY POSSIBLE DUE TO THEIR EFFORTS THAT MY TERM
    WORK COULD BE COMPLETED SUCCESSFULLY WELL ON TIME.
    THEY GLADLY ACCEPTED ALL THE PAINS IN GOING THROUGH
    AND PARTICIPATED IN ENLIGHTENING AND MOTIVATING
    DISCUSSIONS, WHICH WERE EXTREMELY FRUITFUL.
    INDEX

    S. QUESTION DESCRIPTION STUDENT TEACHER


    NO. SIGN. SIGN.

    01. Write a C program to Insert and Delete elements from a


    Queue using linked list, each node should have the
    following information about a product Product_Id(char) ,
    Product_Name(string) , Total_sale(integer) ,
    Product_Grade(Char).

    02. Let A and B be two structures of type Linked List. Write


    a ‘C ’ program to create a new Linked List ‘S’ that
    contains elements alternately from A and B beginning
    with the first element of A. If you run out of elements in
    one of the lists, then append the remaining.

    03. Write a C program to create a single linked list then


    input a value V, partition it such that all nodes less than
    V come before nodes greater than or equal to V.

    04. Write a C program to create two single linked lists, and


    then write another function to subtract two numbers
    represented as linked lists.
    List1->; 8->9->7->NULL (First Number: 897)
    List2->: 1->4->5->NULL (Second Number: 145)
    Output->:752

    05. Write a C program to create a single linked list, like L0-


    >L1->… ->Ln-1->Ln. Write another C function to
    rearrange the nodes in the list so that the new formed
    list is : L0 -> Ln -> L1 -> Ln-1 -> L2 -> Ln-2 .You are
    required to do this in place without altering the nodes’
    values.

    06. Write a C program to create two link lists positive and


    negative from Original linked list, so that the positive
    linked list contains all positive elements and the negative
    linked list contains negative elements. Positive and
    negative linked lists should use the node of the existing
    original linked list.

    07. W.A.P. to create a binary search tree and perform


    following operations:
    1) Search for a particular key.
    2) Delete a node from the tree.
    3) Find the total number of leaf nodes.
    4) Find the height of a binary search tree.
    5) Count total numbers of nodes from right hand side of
    root node 6) Kth largest element without doing any
    modification in Binary Search Tree.

    08. Write a program to add two polynomials of degree n,


    using a linked list.
    For example,

    p1 = first polynomial
    p2 = second polynomial
    Find out p3= p1+p2.

    09. Write a C program to sort a sequence of characters given


    by the user in an array, using Quick sort technique.

    10. Using a circular linked list, allocate time slots of 10ms


    for given processes in the time sharing Environment and
    then print which process will be completed in how much
    time.

    11. Write a C program to store the details of a directed


    weighted graph (Use array of pointers concept).

    12. Write a C program to implement BFS.

    You might also like