Scribd
Upload
20 views1 page

Practical List

Practical

Uploaded by

hiwol78570
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
20 views1 page

Practical List

Practical

Uploaded by

hiwol78570
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

SHREE SWAMI ATMANAND SARASWATI

INSTITUTE OF TECHNOLOGY
COMPUTER ENGINEERING DEPARTMENT

Sr. Page Date Sign


Practical List
No. No.
1. Introduction to pointers. Call by Value and Call by reference.
Introduction to Dynamic Memory Allocation. DMA functions
2.
malloc(), calloc(), free() etc.
Implement a program for stack that performs following operations
3. using array. (a) PUSH (b) POP (c) PEEP (d) CHANGE (e)
DISPLAY
Implement a program to convert infix notation to postfix notation
4.
using stack.
Write a program to implement QUEUE using arrays that performs
5. following operations
(a) INSERT (b) DELETE (c) DISPLAY
Write a menu driven program to implement following operations on
the singly linked list.
(a) Insert a node at the front of the linked list.
(b) Insert a node at the end of the linked list.
6. (c) Insert a node such that linked list is in ascending order.(according
to info. Field)
(d) Delete a first node of the linked list.
(e) Delete a node before specified position.
(f) Delete a node after specified position.
7. Write a program to implement stack using linked list.
8. Write a program to implement queue using linked list.
Write a program to implement following operations on the doubly
linked list.
(a) Insert a node at the front of the linked list.
9.
(b) Insert a node at the end of the linked list.
(c) Delete a last node of the linked list.
(d)Delete a node before specified position.
Write a program to implement following operations on the circular
linked list.
(a) Insert a node at the end of the linked list.
10.
(b) Insert a node before specified position.
(c) Delete a first node of the linked list.
(d) Delete a node after specified position.
11. Write a program which create binary search tree.
Implement recursive and non-recursive tree traversing methods
12.
inorder, preorder and postorder traversal.
13. Write a program to implement Queue Sort.
14. Write a program to implement Merge Sort.
15. Write a program to implement Bubble Sort.
16. Write a program to implement Binary Search..

You might also like