Scribd
Upload
10 views2 pages

C & DS Assignment 1, 2

The document outlines two assignments consisting of programming tasks and theoretical questions related to data structures and algorithms. Topics include Fibonacci series, searching algorithms, structures, linked lists, matrix operations, arrays, sorting algorithms, stack and queue ADTs, binary trees, hash functions, and various sorting methods. Each task requires both programming implementations and explanations of key concepts.

Uploaded by

Kavipriya K Asst.Professor
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
10 views2 pages

C & DS Assignment 1, 2

The document outlines two assignments consisting of programming tasks and theoretical questions related to data structures and algorithms. Topics include Fibonacci series, searching algorithms, structures, linked lists, matrix operations, arrays, sorting algorithms, stack and queue ADTs, binary trees, hash functions, and various sorting methods. Each task requires both programming implementations and explanations of key concepts.

Uploaded by

Kavipriya K Asst.Professor
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/ 2

Assignment – 1:

1. Write a program of Fibonicci Series using Recursive Function.


2. Write a program to Search a number from a n numbers.
3. Explain the Concept of Structure within a structure. Write a program
for it.
4. Explain the Implementation of Linked list.

1. Write a program for Factorial using Recursive Function.


2. Explain the operations of Matrix.
3. What is Enumerate Data Type, explain it.
4. Write a program of file operations.

1. What is Array, explain with a program.


2. Explain the concepts of Decision making and Conditional Statement.
3. Explain the concept of sequential file organization.
4. Write a program of Structure using Array.

1. Write the program to sort a number of elements.


2. What are the Operations of ADT.
3. Write the Difference between Structure and Function.
4. What is List ADT and Explain it with a program.

Assignment – 2:

1. Explain the Implementation of Stack ADT. Write an example program


for it.
2. Describe the concepts about Binary tree and develop a program for it.
3. What is Hash Function. Explain briefly.
4. Explain the Working of Insertion sort. Create a program for it.

1. Explain the Implementation of Queue ADT. Write an example program


for it.
2. What is Tree Traversal. Explain it Briefly.
3. What is Collision Handling and how to Handel the collisions.
4. Explain the working of Quick Sort. Write an Program.
1. What is Infix to Postfix Conversion and how it works.
2. Describe the concepts about Binary Search tree and develop a program
for it.
3. Write the Applications of Hashing.
4. Explain the Working of Heap sort. Create a program for it.

1. Explain about Priority Queue and mention it’s Types.


2. What is Expression Tree and Explain it.
3. What are the properties of Good Hashing Functions.
4. What is Searching and mention the types of Searching. Write an
Example for each.

You might also like