0% found this document useful (0 votes)
23 views

Index: S.No. List of Programs P. No Teacher's Sign

The document provides a list of 21 programming problems or exercises numbered 1 through 21. The problems cover topics like arithmetic operations, arrays, strings, structures, pointers, matrices, linked lists, binary trees, and sorting algorithms. The problems are grouped under different topics and include tasks like summing digits, generating Fibonacci terms, finding prime numbers, calculating factorials, matrix operations, linked list operations, binary tree operations, and sorting algorithms like heap sort, merge sort, and quick sort.

Uploaded by

Saurabh Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
23 views

Index: S.No. List of Programs P. No Teacher's Sign

The document provides a list of 21 programming problems or exercises numbered 1 through 21. The problems cover topics like arithmetic operations, arrays, strings, structures, pointers, matrices, linked lists, binary trees, and sorting algorithms. The problems are grouped under different topics and include tasks like summing digits, generating Fibonacci terms, finding prime numbers, calculating factorials, matrix operations, linked list operations, binary tree operations, and sorting algorithms like heap sort, merge sort, and quick sort.

Uploaded by

Saurabh Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

INDEX

S.No. List of Programs P. No 1 2 Teachers Sign. 1. To find the sum of individual digits of a positive integer 2. To generate the first N terms of the Fibonacci series

3. To generate all the prime numbers between 1 and n. 4. To find the factorial of a given integer using non-recursive functions 5. Factorial using recursive function 6. To find GCD of two given integers using non-recursive functions

3 4

5 6

7. To Add two Matrices 8. To Multiply two Matrices

7 8

9. To print the address of a variable 10. Implementing call by reference by showing swapping of two variables 11. To illustrate arithmetic operation on pointers 12. To print array elements using Pointer

9 10

11 12

13. To find if a string is Palindrome 14. To count the number if characters, spaces, words text

13 14

15. To find the salary of employee and display details (using structures) 16. To pass structure as an argument to a function and calculate total marks of 5 subjects.

15

16

17. To read an array of records, display the student Data and sort the students on Test Score. 18. Input a decimal number and convert it into binary number to perform bitwise AND, OR and XOR on it. 19. Dynamically Allocation of memory to integer array. 20. Dynamically Allocation of memory to integer array (through structures) 21. Addition of two Polynomial using arrays.

17

18

20 21

22

22. To perform addition, transpose and multiplication of sparse matrices 23. To implement link list of products and perform various functions like insertion, deletion, traversal and searching. 24. To implement Queue using linked list

24

28

30

25. To make a Binary tree 26. To calculate the number of Binary tree possible

33 34

27. To implement a Binary Search Tree with insertion, deletion and traversal of nodes. 28. To perform Heap Sort on array elements. 29. Merge Sort

35

40 42

30. Quick Sort

44

You might also like