Scribd
Upload
6 views1 page

Pointer and Linked List Programming Tasks

1. Initialize and traverse an array using pointers, find the smallest element, and pass the array to a function. 2. Initialize a two dimensional array to store course data and credits using pointers. 3. Dynamically allocate an array, specify the size by user input, and initialize it with pointers. 4. Create a menu driven program for linked list operations like create, insert, delete, traverse, and reverse.

Uploaded by

Kranthi Kiran Guduru
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views1 page

Pointer and Linked List Programming Tasks

1. Initialize and traverse an array using pointers, find the smallest element, and pass the array to a function. 2. Initialize a two dimensional array to store course data and credits using pointers. 3. Dynamically allocate an array, specify the size by user input, and initialize it with pointers. 4. Create a menu driven program for linked list operations like create, insert, delete, traverse, and reverse.

Uploaded by

Kranthi Kiran Guduru
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

LAB ASSIGNMENT I

1. Initialize Array by using pointer increment operation. 2. Traverse an array using pointer increment operation and find the smallest. Use function and pass the array to the function 3. Write a program to implement array of pointers 4. Initialize a two dimensional array considering Course as one dimension and its Credits as another dimension. 5. Use dynamic memory allocation, to create an array of elements, specified by user and then initialize it with pointers. 6. Write a menu driven program to perform following operation in link list a. Create list b. Insert (Beginning, before a node, after a node, end) c. Delete (Beginning, before a node, after a node, end) d. Traverse e. Reverse 7. Given a single circular linked list containing a set of data. Obtain the following from this data structure a. Reverse the direction of links b. For the given two elements in the lists, find the distance between them 8. Let A & B be two lists representing two polynomials. Find a. C = A+B, where C is a list representing a polynomial and is obtained by adding two polynomials A&B b. C = A - B c. C = A * B 9. A university has to maintain a list of all students, a list of all subjects and a record of which student has registered for which course. Give an idea as to how using the linked list structures, the above information can be maintained.

You might also like