Programming for Problem Solving Unit 4 Notes AKTU (BCS101)

AKTU · BTECH · Semester 1, 2 · Programming for Problem Solving · Unit 4 · Notes

AKTU Programming for Problem Solving (BCS101) Unit 4 notes for B.Tech Semester 1/2 – Functions and Searching Sorting Algorithms. Topics: Functions…

A preview is available. Sign in or check access options in the reader for the complete resource.

Unit 4: Functions and Searching Sorting Algorithms – AKTU syllabus topics

Functions: Types of Functions, Call by Value and Reference, Recursive Functions, Functions with Arrays
Searching Algorithms: Linear Search, Binary Search
Sorting Algorithms: Bubble Sort, Insertion Sort, Selection Sort

Q5b. Differentiate between call by value and call by reference with proper example. (10 marks, 2021-22)
Q6a. Write the importance of sorting in problem solving. Write a program in C using bubble sort technique to sort 10 numbers entered by the user. (10 marks, 2018-19)
Q2d. Differentiate between call by value and call by reference parameter passing in C using example. (7 marks, 2025-26)
Q2e. Describe the difference between call by value and call by reference with examples. (7 marks, 2024-25)
Q1f. Differentiate recursion and iteration. (2 marks, 2018-19)
Q1h. Differentiate linear and binary search. (2 marks, 2018-19)
Q5b. Differentiate between call by value and call by reference. Write a program in C that computes the area and circumference of a circle with radius taken as input using call by reference in functions. (10 marks, 2019-20)
Q6a. What do you mean by sorting? Write a program in C to sort 'n' positive integers using bubble sort. Also draw the flow chart for the same. (10 marks, 2019-20)
Q6a. What is recursion? Write a program to find factorial of n numbers using recursion. (7 marks, 2025-26)
Q6b. Define call by reference. Write a program to swap two numbers with this concept. (7 marks, 2024-25)

AKTU paper codes: BCS101, BCS201, KCS101, KCS101T, KCS201, KCS201T