You are on page 1of 2

IMPORTANT QUESTIONS FOR PDS-1 UNIT TEST-II

Part-A
1. Mention any two error handling functions in files.
2. What is random file?
3. State the differences between binary file and text file.
4. Write a routine to sort the nodes in singly linked list.
5. What are the applications for Stack?
6. Define circular linked list.
7. Define ADT.
8. Write the routine for counting the number of nodes in a singly linked list.
9. Write the drawbacks of list ADT while implemented using array.
10. Convert the infix expression A+B*(C-D) into postfix expression.


Part-B

1. Explain the process of converting infix to postfix expression with an example.
2. Define Stack. Describe the operations involved in a stack with suitable routines.
3. Define Stack. Describe the operations involved in a linked stack with suitable routines.

4. What is a linked list? Explain with suitable routines for any four operations of a singly
linked list.
5. Write the routine for operations in array implementation of polynomial ADT.
6. What is a linked list? Explain with suitable routines for any four operations of a doubly
linked list.
7. Write the routine for operations in linked list implementation of polynomial ADT.
8. Write a C program to merge 2 linked lists.
9. Describe the concept of file handling in C with examples.
10. Write a C program to count no of lines, blank lines and comments in a file.
11. Write a C program to read last n characters from a file.
IMPORTANT QUESTIONS FOR PDS-1 UNIT TEST-II

Part-A
1. Mention any two error handling functions in files.
2. What is random file?
3. State the differences between binary file and text file.
4. Write a routine to sort the nodes in singly linked list.
5. What are the applications for Stack?
6. Define circular linked list.
7. Define ADT.
8. Write the routine for counting the number of nodes in a singly linked list.
9. Write the drawbacks of list ADT while implemented using array.
10. Convert the infix expression A+B*(C-D) into postfix expression.


Part-B

1. Explain the process of converting infix to postfix expression with an example.
2. Define Stack. Describe the operations involved in a stack with suitable routines.
3. Define Stack. Describe the operations involved in a linked stack with suitable routines.

4. What is a linked list? Explain with suitable routines for any four operations of a singly
linked list.
5. Write the routine for operations in array implementation of polynomial ADT.
6. What is a linked list? Explain with suitable routines for any four operations of a doubly
linked list.
7. Write the routine for operations in linked list implementation of polynomial ADT.
8. Write a C program to merge 2 linked lists.
9. Describe the concept of file handling in C with examples.
10. Write a C program to count no of lines, blank lines and comments in a file.
11. Write a C program to read last n characters from a file.