Important Questions (C Programming and Data Structures)

 UNIT-I 1

1.Explain about the structure of a C-program 

2.Explain about the data types in C-language 

3.Explain about different operators in C-language 

4. Explain about Decision making statements in C-language 

5.Explain about loop control statements in C-language 

6.Define an Array and explain about the types of Arrays. 

7. Write a C-program to find the largest and smallest element in an array. 

8. Write a C-program to find the Product of two given matrices

9. Write a C-program to compute the Factorial of given number

UNIT-II 

1. Define a Function. Explain about the types of functions. 

2.Explain about different storage classes in C-language 

3. Differentiate between a Structure and an Union with synatax 

4. Define a Pointer. Explain about arithmetic operations on Pointers. 

5. Explain about the pointer to a function with an example. 

6.Define a String and explain about string handling Functions. 

7.Explain about Command Line Arguments PROGRAMS 

8. Write a C-program to create a Structure named student with Rollno, Name and Marks as member variables and create a variable for the structure. Accept the values for the member variables and print them. 

 9. Write a C-program to check whether the given string is Palindrome or not 

UNIT-III 

1.Define Data structure. Explain about different types of Data structures with examples 

2. Define a Stack. Explain about the operations on Stack using an Array. 

3. Define a Queue. Explain about the operations of Queue using an Array. 

4. Write an algorithm for converting an Infix expression to Postfix expression with an example. 

5. Write an algorithm for evaluating a Postfix expression with an example. 8. Write an algorithm for checking whether the given expression is balanced or not. 

6. Differentiate between Linear Queue and Circular Queue.

 UNIT-IV 

1.Define a Linked List. Explain about the types of Linked List. 

2. Define a Single Linked List. Explain about Insert and Delete operation on Single Linked List 

3. Define a Double Linked List. Explain about the operations on Double Linked List. 

4. Define a Circular Linked List. Explain about the operations on circular Linked List. 

5. Differentiate between Static Memory allocation and Dynamic Memory allocation. 

UNIT - V

1.Define a tree and explain about the basic tree terminology. 

2.Explain about the representation of a Binary tree. 

3.Explain about binary tree traversal techniques. 

4. Define a Graph and explain basic terminology of Graphs. 

6.Explain about the representation of a Graph. 

7. Explain about Breadth First Search with an example. 

8. Explain about Depth First Search with an example. 

9. Define a Spanning tree. Explain about the construction of a Spanning tree suing Prim's algorithm. 

10. Explain about Sequential search with an example 

11.Explain about Binary Search with an example. 16. Write a C-program for implementing Linear Search using Recursion

12.Explain about Bubble sort with an example. 

13.Explain about Selection sort with an example 

14. Explain about Insertion sort with an example.