10MCA27 Data Structures Using C Laboratory syllabus for MCA


Unit-1 Write a C Program to construct a stack of integers 0 hours

Write a C Program to construct a stack of integers and to perform the following operations on it:a. Pushb. Popc. DisplayThe program should print appropriate messages for stack overflow, stack underflow, and stack empty.

Unit-2 Write a C Program to convert and print 0 hours

Write a C Program to convert and print a given valid parenthesized infix arithmetic expression to postfixexpression. The expression consists of single character operands and the binary operators + (plus), -(minus), * (multiply) and / (divide).

Unit-3 Write a C Program to evaluate a valid suffix/postfix expression 0 hours

Write a C Program to evaluate a valid suffix/postfix expression using stack. Assume that the suffix/postfixexpression is read as a single line consisting of non-negative single digit operands and binary arithmeticoperators. The arithmetic operators are + (add), - (subtract), * (multiply) and / (divide).

Unit-4 Write a C program using recursive function 0 hours

Write a C program using recursive function for the following:a. To calculate GCD and LCM of 2 integer numbers.b. To solve Towers of Hanoi problem.c. To search an element in a list using binary search

Unit-5 Write a C Program to simulate the working of a queue of integers 0 hours

Write a C Program to simulate the working of a queue of integers using an array. Provide the followingoperations:a. Insertb. Deletec. Display

Unit-6 Write a C Program to simulate the working of a circular queue of integers 0 hours

Write a C Program to simulate the working of a circular queue of integers using an array. Provide thefollowing operations:a. Insertb. Deletec. Display

Unit-7 Write a program to design a priority queue 0 hours

Write a program to design a priority queue which is maintained as a set of queues (assume a maximum of 3queues). The elements are inserted based upon the given priority. The deletion of an element is to be donestarting from the 1st queue, if it is not empty. If it is empty, the elements from the 2 nd queue will be deletedand so on.

Unit-8 Write a C Program using dynamic variables and pointers 0 hours

Write a C Program using dynamic variables and pointers, to construct a singly linked list consisting of thefollowing information in each node: student id (integer), student name (character string) and semester(integer). The operations to be supported are:a. The insertion operationi. At the front of a listii. At the back of the listiii. At any position in the listb. Deleting a node based on student id. If the specified node is not present in the list an errormessage should be displayed. Both the options should be demonstrated.c. Searching a node based on student id and update the information content. If the specifiednode is not present in the list an error message should be displayed. Both situations should bedisplayed.d. Displaying all the nodes in the list.(Note: Only either (a, b and d) or (a, c and d) may be asked in the examination)

Unit-9 Write a C Program using dynamic variables and pointers 0 hours

Write a C Program using dynamic variables and pointers, to construct an ordered (ascending) singly linkedlist based on the rank of the student, where each node consists of the following information : student id(integer), student name (character string) and rank (integer).

Unit-10 Write a C Program using dynamic variables and pointers to construct a stack of integers 0 hours

Write a C Program using dynamic variables and pointers to construct a stack of integers using singly linkedlist and to perform the following operations:a. Pushb. Popc. DisplayThe program should print appropriate messages for stack overflow and stack empty.

Unit-11 Write a C Program to support the following operations 0 hours

Write a C Program to support the following operations on a doubly linked list where each node consists ofintegers:a. Create a doubly linked list by adding each node at the front.b. Insert a new node to the left of the node whose key value is read as an input.c. Delete the node of a given data, if it is found, otherwise display appropriate message.d. Display the contents of the list.(Note: Only either (a, b and d) or (a, c and d) may be asked in the examination)

Unit-12 Write a C Program 0 hours

Write a C Programa. To construct a binary search tree of integers.b. To traverse the tree using all the methods i.e., inorder, preorder and postorder.c. To display the elements in the tree.

Unit-13 Write a C Programs for searching an element 0 hours

Write a C Programs for searching an element on a given list of integers using thea. Binary Search.b. Linear search

Unit-14 Write a C program to sort a list 0 hours

Write a C program to sort a list of N integers using the quick sort algorithm.

Unit-15 Write a C program to traverse the nodes 0 hours

Write a C program to traverse the nodes in a graph using Breadth First Search.

Last Updated: Tuesday, January 24, 2023