Scribd
Upload
15 views2 pages

Pps Descriptive Bank 2024-25

The document outlines various programming tasks and concepts related to C programming, focusing on problem-solving techniques. It includes topics such as file handling, sorting algorithms, recursion, dynamic memory allocation, and function communication. Each task requires the implementation of C programs and explanations of the underlying principles.

Uploaded by

abhinaysandiri13
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
15 views2 pages

Pps Descriptive Bank 2024-25

The document outlines various programming tasks and concepts related to C programming, focusing on problem-solving techniques. It includes topics such as file handling, sorting algorithms, recursion, dynamic memory allocation, and function communication. Each task requires the implementation of C programs and explanations of the underlying principles.

Uploaded by

abhinaysandiri13
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

Academic Year 2024-25 (J-23)

PROGRAMMING FOR PROBLEM SOLVING

DESCRIPTIVE BANK

1. Write a C program that demonstrates the use of fseek, ftell, and rewind to perform random access
on a file. Show how to read from and write to different parts of the file.

2. Compare and contrast call by value and call by reference in terms of their impact on the original
variables. How does each method affect memory usage and the result of function calls?

3. Evaluate the advantages of using recursion over iteration for a Fibonacci series.

4. Describe how dynamic memory allocation works and explain why it is important in managing
memory during program execution.

5. Implement a binary search algorithm to find the number 77 in the sorted array
[11,22,33,44,55,66,77,88,99]. Demonstrate how the algorithm narrows down the search space
step by step.

6. With an example, describe the selection sort method and its time complexity.

7. Explain random file access functions. Write a C program to mere contents of two files into third
file.

8. What are the advantages and disadvantages of using recursion compared to iteration? Write a C

9. program to calculate the factorial of a given number using both recursive and non-recursive
methods.

10. Explain dynamic memory allocation functions in C. Why are they important for managing
memory during program execution?

11. Write and explain the binary search algorithm. Provide an example to demonstrate how the
algorithm works step by step.

12. With an example, describe the Bubble sort method and its time complexity.

13. Differentiate Text and Binary files.

14. Explain random access functions.


15. Compare and contrast call by value and call by reference in terms of their impact on the original
variables.
16. Write a C program to swap two numbers using call by reference.

17. What is recursion, what are its limitations?

18. Write a C program to find the Fibonacci series of n terms using recursion.

19. Describe how dynamic memory allocation works and explain why it is important in managing
memory during program execution.

20. With an example, describe the Insertion sort method and its time complexity.

21. Explain about linear search with an example.

22. Define function. Illustrate the inter-function communication with an example.

23. Differentiate call by value and call by reference.

24. Write a C program to find the factorial of given number using recursion.

25. What is dynamic memory allocation? Why it is required explain?

26. What is recursion? Explain the limitations of recursion with an example.

27. Explain binary search method. Illustrate binary search on {2, 11, 15, 17, 19, 21, 25} and
28. search for element 17.

29. What is sorting? Explain Selection sort algorithm with example.

30. What is Time complexity?

31. Discuss about recursive functions. Write a C program to find factorial of a given number N by
using recursive function.

32. Define Sorting. Explain bubble sort method with a program and example.

33. What is a function? What is meant by call-by value and call-by reference?

34. Sort the following 10 elements using bubble sort technique. Write the algorithm for the
35. same. 85 53 96 35 27 87 37 12 90 23

36. What is recursion? Explain the limitations of recursion

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy