Scribd
Upload
8 views

AIGS DS LAB PROGRAMS LIST

The document outlines a series of programming exercises for a Data Structures Lab course at Acharya Institute of Graduate Studies. It includes tasks related to binary search, sorting algorithms (quick sort, merge sort, heap sort), linked lists, stacks, queues, string manipulation, infix to postfix conversion, and binary trees. Each part consists of specific programming challenges aimed at reinforcing data structure concepts.

Uploaded by

ml.nagaraju77
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

AIGS DS LAB PROGRAMS LIST

The document outlines a series of programming exercises for a Data Structures Lab course at Acharya Institute of Graduate Studies. It includes tasks related to binary search, sorting algorithms (quick sort, merge sort, heap sort), linked lists, stacks, queues, string manipulation, infix to postfix conversion, and binary trees. Each part consists of specific programming challenges aimed at reinforcing data structure concepts.

Uploaded by

ml.nagaraju77
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

ACHARYA INSTITUTE OF GRADUATE STUDIES

DEPARTMENT OF MASTER OF COMPUTER APPLICATIONS


1MCA7: DATA STRUCTURES LAB

PART-A

A1. Given {4, 7, 3, 2, 7, 7, 9, 0} find the location of 7 using Binary search and also display its
first occurrence.

A2. Given {5, 3, 1, 6, 0, 2, 4} order the numbers in ascending order using quick sort.

A3. Perform the Merge sort on the input {75, 8, 1, 16, 48, 3, 7, 0} and display the output in
descending order.

A4. Write a program to insert the elements 6l, l6, 8, 27 into singly linked list and delete 8, 61,
27 from the list. Display your list after each insertion and deletion.

A5. Write a program to add 6x3 + 10x2 + 0x + 5 and 4x2 + 2x + l using linked list.

A6. Write a program to push 5, 9, 34, 17, 32 into stack and pop 3 times from the stack, also
display the popped numbers.

A7. Write a recursive program to find GCD of 4, 6, 8.

PART-B

B1. Write a program to inert the elements {5, 7, 0, 6, 3, 9} into circular queue and delete 6, 9
and 5 from it (using linked list implementation).

B2. Given: S1 = {"Flowers"} ; S2 = {"are beautiful"}


a) Find the length of S1.
b) Concatenate S1 and S2.
c) Extract the sub-string "low" from S1.
d) Find "are" in S2 and replace it with "is".

B3. Write a program to convert an infix expression x ^ y / (5 * z) + 2 to its postfix expression.

B4. Write a program to evaluate a postfix expression 5 3 + 8 2 - *.

B5. Write a program to create a binary tree with the elements 18, 15, 40, 50, 30, 17, 41 after
creation insert 45 and 19 into tree and delete 15, 17 and 4l from tree. Display the tree on
each insertion and deletion operation.

B6. Write a program to create binary search tree with the elements {2, 5, 1, 3, 9, 0, 6} and
perform inorder, preorder and post order traversal.

B7. Write a program to Sort the following elements using heap sort {9, 16, 32, 8, 4, 1, 5, 8, 0}

You might also like