8/13/2019 DS LABmodel Questions R408

1/4

DS LAB EXTRAQUESTIONS

SET 1 : STACK

1. Stack using arrays

2. Stack using linked list(Linked stack)

3. Stack using doubly linked list4. 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 list4. "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 array11. Implement !ueue using 2 stacks

12. Implement m !ueues using array of size n

13. Implement m priority !ueues using array of size n14. +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 list2. Singly linked list insertion and deletion3. %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 to lists being sorted once

&. Searc- an element in a linked list

'. +eplace a ord in linked list it- anot-er ord. -eck -et-er t-e names in linked list are palindromesnot. If yes0 count t-e no

of palindromes in t-e list

1*. "oubly linked list Insertion and deletion

11. ircular doubly linked list12. Sort elements of a doubly linked list

13. +e,erse a doubly linked list

14. In,ert a singly linked circular list1#. Insert a node in t-e middle of a doubly linked linear list

1$. +e,erse eac- ord in t-e linked list

1&. /aimum and minimum of a linked list1'. Searc- and replace an element in a linked list

8/13/2019 DS LABmodel Questions R408

2/4

SET 4 : POLYNOMIAL MANIPULATION

1. %olynomial addition of a single ,ariable using array

2. %olynomial addition of a single ,ariable using linked list3. %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 list13. %erform (5 6 7) (5 7) -ere 507 are polynomials

14. %erform %5 6 7 -ere %00507 are polynomials

SET 5: SPARSE MATRIX MANIPULATION1. Sparse matri addition using array

2. Sparse matri addition using linked list.3. Sparse matri multiplication using array.

4. Sparse matri multiplication using linked list.

#. 8ind t-e transpose of a sparse matri.$. -eck -et-er t-e gi,en sparse matri is a diagonal matri or not.

&. -eck -et-er t-e gi,en sparse matri is an upper triangular matri or not.

'. -eck -et-er t-e gi,en sparse matri is an loer triangular matri or not.

SET 6: POLISH NOTATION CONVERSION AND EVALUATION

1. Infi to postfi

2. Infi to prefi.3. %ostfi to prefi.

4. %refi to postfi

#. %refi to infi.$. Infi e,aluation

&. on,ert t-e epression to re,erse polis- notation f9(26#)($(36#:2))

'. %refi 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

:

8/13/2019 DS LABmodel Questions R408

3/4

2. 7inary tree creation

: for infi epression

: for postfi epression: for prefi epression

3. =,aluation of infi0 postfi0 prefi epression using binary tree.

4. alculate t-e folloing in a 7inary tree: total no 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 -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 deletion1*. 7inary searc- tree

: ?eig-t

: /aimum item

: /inimum item: Searc-ing an element

11. Implement priority !ueue using 7inary Searc- @ree.

12. Implement tree using -eap sort13. 8ind -eig-t of binary searc- tree(recursi,e manner)

14. Implement priority !ueue using binary searc- tree

1#. Implement priority !ueue using binary tree1$. Implement priority !ueue using ?eap.

SET !: GRAPH

1. Arap- creation using

: 5dBacency matri

: Linked list(adBacency list): 5dBacency multilist

2. Arap-

: onnected or not: 5rticulation point eists or not

: yclicnot

3. S-ortest pat- beteen 2 cities

4. ycles in a grap-

8/13/2019 DS LABmodel Questions R408

4/4

#. Arap- tra,ersal (78S C "8S)

$. /inimum ost spanning tree

&. >o of pat-s beteen 2 nodes'. 8ind pat- matri of a grap-

SET 1": PATTERN MATCHING1. %arent-esis matc-ing of an epression

2. %arent-esis matc-ing of a program

3. String %attern /atc-ing.

SET 11:SEARCHING

1. Linear Searc-

2. 7inary Searc-

SET 12: SORTING

1. 7ubble Sort

2. Selection Sort3. Insertion Sort

4. S-ell Sort.#. 5ddress alculation Sort

$. ?eap Sort

&. /erge Sort'. +adi Sort

. uick Sort

1*. 7inary @ree Sort