Scribd
Upload
230 views

DS Lab Questions 2

The document lists 22 questions related to implementing various data structures and algorithms using concepts like stacks, queues, linked lists, trees, etc. Some examples include: 1. Implement a stack using two queues. 2. Implement a queue using two stacks. 3. Implement operations on a priority queue like insertion and removal of highest priority element. 4. Write programs to perform operations on linked lists like adding, deleting, modifying nodes and searching/matching substrings. 5. Implement binary trees and evaluate expressions. Perform operations like copying, determining depth, counting nodes.

Uploaded by

m_durai
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
230 views

DS Lab Questions 2

The document lists 22 questions related to implementing various data structures and algorithms using concepts like stacks, queues, linked lists, trees, etc. Some examples include: 1. Implement a stack using two queues. 2. Implement a queue using two stacks. 3. Implement operations on a priority queue like insertion and removal of highest priority element. 4. Write programs to perform operations on linked lists like adding, deleting, modifying nodes and searching/matching substrings. 5. Implement binary trees and evaluate expressions. Perform operations like copying, determining depth, counting nodes.

Uploaded by

m_durai
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

S4 CS-Data Structures & Programming Methodologies Project Questions 1. 2. 3. 4. 5. 6.

Implement a stack using two queues Implement a queue using two stacks Implement a deque (short for "double ended queue") using two stacks Implement two stacks using a single array Implement a delimiter matching algorithm. Implement a queue and order all elements in the queue using ~ Two additional queue ~ One additional queue 7. Implement a queue and reverse the order of the queue using ~ Two additional stack ~ One additional queue ~ One additional stack and some additional variables. 8. Implement a priority Queue and perform the following operations ~ ~ ~ Create an Empty Priority Queue, Insert an element having a certain priority to the Priority Queue, Remove the highest priority element.

9. Write a program to store the details of patients (room no and name of the patient) in a hospital (room-wise) using linked list. Write a procedure to a) add b) delete 3) modify the details. 10. Implement an input restricted deque. Write procedure for necessary operations. 11. Write a program using linked list which search for a substring in a main string. Each character is represented by a node. 12. Implement two linked list LI and L2 and find the following a) LI U L2 b) Ll n L2 13. Write a program to find (A+B)*(A-B), where A and B are polynomials. a) using Linked list b) using Arrays 14. Implement a singly linked list and perform the following ~ Remove all duplicate elements from the list ~ Make a copy of the given list ~ Remove the first and last occurrence of the given element from the list 15. Implement two singly linked list and perform the following

> -Concatenate two lists > -Form a list containing the union of elements of the two lists.
16. Implement a singly linked list and perform the following

> -Delete every second element from the list > -Place the elements of a list in increasing order ~
Return the sum of integers in a list 17. Write a program to create a binary tree and determine the following

> -The number of nodes in the tree > -The sum of contents of all nodes in the tree > The depth of the tree 18. Write a program to create a binary tree and determine whether the left or right child from the root is big and by how much. 19. Implement an Expression tree. Also evaluate the expression. 20. Write a program to make the copy of a binary tree. 21. Write a program to create the mirror image of the tree. 22. Write a program to create a binary tree and determine the following

> -Count the number of leaf nodes > -Count the number of nodes in the left sub tree >Count the number of nodes in the right sub tree

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