Scribd
Upload
34 views

PDS Lab Important Questions

This document contains a list of 42 potential questions for a PDS Lab exam, covering a range of programming topics like data structures, algorithms, and operations on arrays, strings, matrices, and more. Some example questions include multiplication tables, binary tree traversal, matrix addition and subtraction, sorting algorithms like insertion and selection sort, determining if a number is a leap year, and searching and traversing different data structures.

Uploaded by

thanushabaskar
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
34 views

PDS Lab Important Questions

This document contains a list of 42 potential questions for a PDS Lab exam, covering a range of programming topics like data structures, algorithms, and operations on arrays, strings, matrices, and more. Some example questions include multiplication tables, binary tree traversal, matrix addition and subtraction, sorting algorithms like insertion and selection sort, determining if a number is a leap year, and searching and traversing different data structures.

Uploaded by

thanushabaskar
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

PDS Lab important questions

1. Multiplication table
2. Binary Tree Traversal.
3. Matrix subtraction
4. Insertion sort.
5. selection sort.
6. Leap year or not
7. Total and average of N student marks using structure.
8. linear search
9. Matrix addition
10. Breadth First Search
11. swap two number using pass by value and pass by reference
12. Divide and conquer technique (Quick sort or merge sort)
13. Transpose of a matrix
14. Linked List Implementation of LIFO(stack)
15. leap year or not
16. Array implementation of FIFO(queue)
17. factorial of a number using recursive function
18. bubble sort
19. String Length, String Concatenation, String Copy, String lower, String Upper and
String reverse using Library function.
20. array implementation of queue.
21. Palindrome or not
22. Finding element using sequential search.
23. Employee structure with name, employee id, name, age, designation and salary as
data members
24. Binary tree traversal.
25. concatenate four strings
26. Linked list implementation of Stack.
27. biggest of three numbers
28. breadth first search
29. even or odd
30. Binary Tree and its operations
31. area of a circle
32. binary search tree
33. Print nos between 1 and 100 which are divisible by 2 and are not divisible by 3 and 5.
34. square and cube of a number using a function
35. insertion and deletion on both sides of a list / application of queue ADT–DEQueue
36. Switch statement to display the name of the day, depending upon the number entered
from the keyboard.
37. graph traversal method (BFS or DFS)
38. Find minimum and maximum numbers in an array
39. sum of ‘N’ natural number using function
40. Print nos b/w 20 and 100 which are divisible by 2 and not divisible by3 and 5.

You might also like