Scribd
Upload
3 views

DSLAB

The document outlines a lab lesson plan for a Data and File Structure course at Guru Nanak Institute of Management, detailing practical exercises across various data structures including arrays, linked lists, stacks, queues, binary trees, and graphs. Each section includes specific operations to be performed, such as traversing, searching, sorting, and implementing algorithms. The plan emphasizes hands-on programming experience with different data structures and their applications.

Uploaded by

Vani Sharma
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
3 views

DSLAB

The document outlines a lab lesson plan for a Data and File Structure course at Guru Nanak Institute of Management, detailing practical exercises across various data structures including arrays, linked lists, stacks, queues, binary trees, and graphs. Each section includes specific operations to be performed, such as traversing, searching, sorting, and implementing algorithms. The plan emphasizes hands-on programming experience with different data structures and their applications.

Uploaded by

Vani Sharma
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

DATA AND FILE STRUCTURE LAB LESSON PLAN

MCA 162

GURU NANAK INSTITUTE OF MANAGEMENT

S.NO TOPICS PRACTICAL EXERCISES

1 ARRAYS Perform various operations on arrays :


a. Traversing
b. Insertion
c. Deletion

d. Reversing

2. ARRAYS Perform the following Search Operations using


(i) Recursion
(ii) Non recursion
a. Linear Search

b. Binary Search

3. ARRAYS Perform the following Sorting Operations:


a. Selection Sort
b. Bubble Sort
c. Insertion Sort
d. Quick Sort

e. Merge Sort

4. LINKED LIST Write a program to perform the following


operations on singly Linked list:
a. Creation
b. Insertion at
i. First Position
ii. Last Position
iii. Between any two nodes
c. Deletion from
i. First Position
DATA AND FILE STRUCTURE LAB LESSON PLAN
ii. Last Position
iii. Between any two nodes

d. Traversal

5. LINKED LIST Write a program to perform the following


operations on doubly Linked list:
a. Creation
b. Insertion at
i. First Position
ii. Last Position
iii. Between any two nodes
c. Deletion from
i. First Position
ii. Last Position
iii. Between any two nodes

d. Traversal

6. LINKED LIST Write a program to implement circular linked


list (insertion & deletion).

7. STACK Write a program that implement Stack


operations using:
a. Arrays

b. Pointers

8. STACK Write a program that uses Stack operations to


perform the following:
a. Converting infix expression into
postfix expression
b. Evaluating the postfix expression

9. QUEUE Write a program that implement Queue


operations using:
a. Arrays

b. Pointers

10. QUEUE Write a program that implement Circular queue.


DATA AND FILE STRUCTURE LAB LESSON PLAN

11. QUEUE Write a program to add two polynomials.

12. BINARY TREE Write a program to Create a binary tree.

13. BINARY TREE Write a program for the Traversal


of a binary tree.
(i) In order
(ii) Pre order

(iii) Post order

14. GRAPH Write a program to implement a shortest path


algorithm (DIJ’SKTRA).

15. GRAPH Write a program to implement minimum


spanning tree (PRIM’S, KRUSKAL’S).

16. FILE Write a program which copies one file to another.


HANDLING

Nilesh Kumar Dokania.

Faculty (MCA)

You might also like