DS LAB EXTRAQUESTIONS

SET 1 : STACK 1. Stack using arrays 2. Stack using linked list(Linked stack) 3. Stack using doubly linked list 4. Implement m stacks using array of size n SET 2:QUEUES 1. ueue using arrays 2. ueue using linked list(Linked !ueue) 3. ueue using doubly linked list 4. "e!ueue using array #. "e!ueue using linked list $. %riority !ueue using array &. %riority !ueue using linked list '. (ircular !ueue using array ). (ircular linked list ( (ircular !ueue using linked list) 1*. Implement circular de!ueue using array 11. Implement !ueue using 2 stacks 12. Implement m !ueues using array of size n 13. Implement m priority !ueues using array of size n 14. +e,erse a !ueue using a stack 1#. Implement circular de!ueue using linked list 1$. Implement circular de!ueue using doubly linked list SET 3: LINKED LIST AND DOUBLY LINKED LIST 1. program to insert a node to t-e left of it- node in a singly linked linear list 2. Singly linked list . insertion and deletion 3. %repare an ascending order linked list 4. Sort elements of linked list #. +e,erse a linked list $. /erge 2 lists into a single list 0 t-e t1o lists being sorted once &. Searc- an element in a linked list '. +eplace a 1ord in linked list 1it- anot-er 1ord ). (-eck 1-et-er t-e names in linked list are palindromes2not. If yes0 count t-e no3 of palindromes in t-e list 1*. "oubly linked list . Insertion and deletion 11. (ircular doubly linked list 12. Sort elements of a doubly linked list 13. +e,erse a doubly linked list 14. In,ert a singly linked circular list 1#. Insert a node in t-e middle of a doubly linked linear list 1$. +e,erse eac- 1ord in t-e linked list 1&. /a4imum and minimum of a linked list 1'. Searc- and replace an element in a linked list

SET 4 : POLYNOMIAL MANIPULATION 1. %olynomial addition of a single ,ariable using array 2. %olynomial addition of a single ,ariable using linked list 3. %olynomial addition of a single ,ariable using doubly linked list 4. %olynomial addition of 2 ,ariables using array #. %olynomial addition of 2 ,ariables using linked list $. %olynomial addition of 2 ,ariables using doubly linked list &. %olynomial multiplication of a single ,ariable using array '. %olynomial multiplication of a single ,ariable using linked list ). %olynomial multiplication of a single ,ariable using doubly linked list 1*. %olynomial multiplication of 2 ,ariables using array 11. %olynomial multiplication of 2 ,ariables using linked list 12. %olynomial multiplication of 2 ,ariables using doubly linked list 13. %erform (5 6 7) (5 . 7) 1-ere 507 are polynomials 14. %erform %5 6 7 1-ere %0 0507 are polynomials SET 5: SPARSE MATRIX MANIPULATION 1. Sparse matri4 addition using array 2. Sparse matri4 addition using linked list. 3. Sparse matri4 multiplication using array. 4. Sparse matri4 multiplication using linked list. #. 8ind t-e transpose of a sparse matri4. $. (-eck 1-et-er t-e gi,en sparse matri4 is a diagonal matri4 or not. &. (-eck 1-et-er t-e gi,en sparse matri4 is an upper triangular matri4 or not. '. (-eck 1-et-er t-e gi,en sparse matri4 is an lo1er triangular matri4 or not. SET 6: POLISH NOTATION CONVERSION AND EVALUATION 1. Infi4 to postfi4 2. Infi4 to prefi4. 3. %ostfi4 to prefi4. 4. %refi4 to postfi4 #. %refi4 to infi4. $. Infi4 e,aluation &. (on,ert t-e e4pression to re,erse polis- notation f9(26#)($(36#:2)) '. %refi4 e,aluation. SET 7: DYNAMIC MEMORY MANAGEMENT 1. ;ou are gi,en a free list containing 1* nodes. Implement a memory management sc-eme to insert and delete elements of t-e list. SET : TREE 1. 7inary tree creation : using stack : using !ueue : using array : <it-out using stack2!ueue.

2. 7inary tree creation : for infi4 e4pression : for postfi4 e4pression : for prefi4 e4pression 3. =,aluation of infi40 postfi40 prefi4 e4pression using binary tree. 4. (alculate t-e follo1ing in a 7inary tree : total no3 of nodes : leaf node : internal nodes : nodes -a,ing one c-ild : nodes -a,ing 2 c-ildren #. Searc- an item in a tree $. 8ind t-e copy of a tree &. (-eck 1-et-er 2 trees are 1) similar 2) copies 3) mirror similar '. >on:recursi,e (iterati,e) tra,ersal of : Inorder : %reorder : %ostorder ). 7inary searc- tree creation0 deletion 1*. 7inary searc- tree : ?eig-t : /a4imum item : /inimum item : Searc-ing an element 11. Implement priority !ueue using 7inary Searc- @ree. 12. Implement tree using -eap sort 13. 8ind -eig-t of binary searc- tree(recursi,e manner) 14. Implement priority !ueue using binary searc- tree 1#. Implement priority !ueue using binary tree 1$. Implement priority !ueue using ?eap. SET !: GRAPH 1. Arap- creation using : 5dBacency matri4 : Linked list(adBacency list) : 5dBacency multilist 2. Arap: (onnected or not : 5rticulation point e4ists or not : (yclic2not 3. S-ortest pat- bet1een 2 cities 4. (ycles in a grap-

#. $. &. '.

Arap- tra,ersal (78S C "8S) /inimum (ost spanning tree >o3 of pat-s bet1een 2 nodes 8ind pat- matri4 of a grap-

SET 1": PATTERN MATCHING 1. %arent-esis matc-ing of an e4pression 2. %arent-esis matc-ing of a program 3. String %attern /atc-ing. SET 11:SEARCHING 1. Linear Searc2. 7inary SearcSET 12: SORTING 1. 7ubble Sort 2. Selection Sort 3. Insertion Sort 4. S-ell Sort. #. 5ddress (alculation Sort $. ?eap Sort &. /erge Sort '. +adi4 Sort ). uick Sort 1*. 7inary @ree Sort