SRI INDU COLLEGE OF ENGG & (Regulation :R22)

TECH QUESTION BANK Prepared

on :12/10/2022 Rev1:
(Regulation :R22) 1/10/2024
Department of Computer Science and Engineering Page: 1 of 7
Sub. Code & Title (R22CSE1113) PROGRAMMING FOR PROBLEM SOLVING
Academic Year: 2024-25 Year/Sem. I-I/CSE(A,B,C,D&E),IT,AIML(A,B,C,&D)),
CS(A&B),CSIT,DS(A&B&C),AI&DS
Faculty Name & Designation Dr P RAMESHKUMAR\ D MOUNIKA \K S ARCHANA\
CH.SHRAVANI P.MANASA\G.LAVANYA\CHITTY\SWAPNA\
MEGHAMLA\T.SIRISHA

UNIT-III PREPROCESSORS AND FILES

3C-7 What is the keyword used to define a macro I CO3
a) Define c) def
b) Else d) if (a )
3C-8 The output of the following code is II CO3
( c )
.#include<stdio.h>
#define clrscr() 17
int main()
{
Clrscr();
Printf(“%d”,clrscr());
return 0;
}
a) Compilation error b) Runtime error
c) 17 d) none of the above

3C-9 Which of the following file modes open a file in the write state for updating I CO4
(a )
a) Ab b) wb
c ) rb d) r+b
3C-10 The first and second arguments of fopen() are (a ) CO4
a). A character string containing the name of the file & the second argument is the
mode
b) A character string containing the name of the user & the second argument is the I
mode
c) A character string containing file pointer & the second argument is the mode
d) None of the mentioned
3C-11 Which function is used to position a file at the beginning I CO4
(b )
a) ftell b) fseek
c) freport d) feof
3C-12 What are the C functions used to read or write a file in Text Mode.? (a ) II CO4
a) fprintf(),fscanf(); b) fread(),fwrite();
fprint(),fscan(); d)read(),write()
3C-13 which Is data type of file pointer is? ( d) II CO4

a) int b) double c) void d) File

 SRI INDU COLLEGE OF ENGG & (Regulation :R22)
TECH QUESTION BANK Prepared
on :12/10/2022 Rev1:
(Regulation :R22) 1/10/2024
Department of Computer Science and Engineering Page: 2 of 7
Sub. Code & Title (R22CSE1113) PROGRAMMING FOR PROBLEM SOLVING
Academic Year: 2024-25 Year/Sem. I-I/CSE(A,B,C,D&E),IT,AIML(A,B,C,&D)),
CS(A&B),CSIT,DS(A&B&C),AI&DS
Faculty Name & Designation Dr P RAMESHKUMAR\ D MOUNIKA \K S ARCHANA\
CH.SHRAVANI P.MANASA\G.LAVANYA\CHITTY\SWAPNA\
MEGHAMLA\T.SIRISHA

3C-14 stderr, stdin, stdout are FILE pointers(a) III CO4

a) Yes
b) No
c) May Be
d) Can't Say

3C-15 getc() returns EOF when (b) I CO4

a) When getc() fail to read the character

b) When end of file is reached
c) Both A and B
d) None of the above

Fill in the blanks

3F-9 The -fprintf----------------- function is used to writing a file I CO4

3F-10 If there is any error while opening a file, fopen will return--NULL---- I CO4

3F-11 File is of type--filetype------------------ I C04

3F-12 For Binary files a ------b-------------------- must be appended to the mode string. II CO4

3F-13 When fopen() is not able to open a file returns-------NULL--------------- III CO4

3F-14 The --fscanf---------------- function is used to read a file I CO4

3F-15 EOF() is an integer type define stdio.h and has a value--<1------------ III C04

5- MARK QUESTIONS
3D-7 Differentiate between Conditional Compilation and Conditional Branching CO3
IV
statements?
3D-8 Develop a ‘C program to write contents of one file in reverse into another file? CO4
I
3D-9 Write a C program to read an email address from user using scanf function. The code V CO4
should accept only email addresses and store user name and domain name separately.
(Eg if user supplies [email protected] username is xyz and domain name is gmail.com)
3D-10 Develop a ‘C program to combine contents of two files in a third file and display CO4
IV
the data from third file?
3D-11 Explain about Random Access using fseek , ftell and rewind functions? III CO4
 SRI INDU COLLEGE OF ENGG & (Regulation :R22)
TECH QUESTION BANK Prepared
on :12/10/2022 Rev1:
(Regulation :R22) 1/10/2024
Department of Computer Science and Engineering Page: 3 of 7
Sub. Code & Title (R22CSE1113) PROGRAMMING FOR PROBLEM SOLVING
Academic Year: 2024-25 Year/Sem. I-I/CSE(A,B,C,D&E),IT,AIML(A,B,C,&D)),
CS(A&B),CSIT,DS(A&B&C),AI&DS
Faculty Name & Designation Dr P RAMESHKUMAR\ D MOUNIKA \K S ARCHANA\
CH.SHRAVANI P.MANASA\G.LAVANYA\CHITTY\SWAPNA\
MEGHAMLA\T.SIRISHA

3D-12 Write a program to open the file in read mode and append the content to it IV CO4

3D-13 Explain about types of files with an example? II CO4

3D-14 Write a program to read name and marks of N number of students and store them in a IV CO4
text file.
3D-15 Compare I/O operations on text file and binary file using structures? CO4
II

Unit-IV: Functions and Dynamic Memory Allocation

Multiple choice questions
4C-1 We use malloc and calloc for
I CO5
( a )
a) Dynamic memory allocation b) static memory allocation
c) Both dynamic and static memory allocation d) none of the above
4C-2 malloc() allocates memory from the heap and not from the stack.
I CO5
( a )
a) true b) false
c) may be d) can’t say

4C-3 A function which calls itself is called a ___ function.

( C ) I CO5

a) Self Function b) Auto Function

c) Recursive Function d) Static Function

4C-4 Choose correct statements about C Language Pass By Value.
( D ) I CO5

a) Pass By Value copies the variable value in one more memory location
b) Pass By Value does not use Pointers
c) Pass By Value protects your source or original variables from changes in outside
functions or called functions
d) All the above
4C-5 To tell the compiler to store data at an address, use the
I CO5
( D )
a) Address operator(&) b) Array operator([])
c) Dereference operator(#) c) Indirection operator(*)
 SRI INDU COLLEGE OF ENGG & (Regulation :R22)
TECH QUESTION BANK Prepared
on :12/10/2022 Rev1:
(Regulation :R22) 1/10/2024
Department of Computer Science and Engineering Page: 4 of 7
Sub. Code & Title (R22CSE1113) PROGRAMMING FOR PROBLEM SOLVING
Academic Year: 2024-25 Year/Sem. I-I/CSE(A,B,C,D&E),IT,AIML(A,B,C,&D)),
CS(A&B),CSIT,DS(A&B&C),AI&DS
Faculty Name & Designation Dr P RAMESHKUMAR\ D MOUNIKA \K S ARCHANA\
CH.SHRAVANI P.MANASA\G.LAVANYA\CHITTY\SWAPNA\
MEGHAMLA\T.SIRISHA

4C-6 Which of the following is not a part of a function header?

( D ) I CO5
a)name b) parameter list
c) return type d) title
4C-7 The function that returns the absolute value of a long integer is
( D ) I CO5
a) abs b) dabs
c) fabs d) labs
4C-8 The keyword used to transfer control from a function back to the calling function is (D
) I CO5
a) switch b) goto c) break d) rerurn
4C-9 Arguments passed to a function in C language are called ___ arguments.
( A ) I CO5
a) Formal arguments b) Actual Arguments
c) Definite Arguments d) Ideal Arguments
4C-10 Choose a non Library C function below.
( A ) I CO5
a) printf() b) scanf()
c) fprintf() d) printf()
4C-11
I CO5
What is the default return value of a C function if not specified explicitly? ( B
) a) -1 b) 0
c) 1 d) None of the above
4C-12
I CO5
A recursive function can be replaced with __ in C language. ( D
) a) for loop b) while loop
c) do while loop d) All the above
4C-13 Which of the following header files must necessarily be included to use dynamic
memory allocation functions? ( A IV CO5
)
a) stdlib.h
b) stdio.h
c) memory.h
d) dos.h
4C-14 calloc() returns a storage that is initialized to. ( A )
a)zero III CO5
b)Null
c)Nothing
d) One
 SRI INDU COLLEGE OF ENGG & (Regulation :R22)
TECH QUESTION BANK Prepared
on :12/10/2022 Rev1:
(Regulation :R22) 1/10/2024
Department of Computer Science and Engineering Page: 5 of 7
Sub. Code & Title (R22CSE1113) PROGRAMMING FOR PROBLEM SOLVING
Academic Year: 2024-25 Year/Sem. I-I/CSE(A,B,C,D&E),IT,AIML(A,B,C,&D)),
CS(A&B),CSIT,DS(A&B&C),AI&DS
Faculty Name & Designation Dr P RAMESHKUMAR\ D MOUNIKA \K S ARCHANA\
CH.SHRAVANI P.MANASA\G.LAVANYA\CHITTY\SWAPNA\
MEGHAMLA\T.SIRISHA

4C-15 If malloc() and calloc() are not type casted, the default return type is _____ ( C )
III CO5
(a) void*
(b) void**
(c) int*
(d) char*

Fill in the blanks

4F-1
-VOID-----------------is Default return type of function definition I CO5

4F-2
The parameters in a function definition are called---FORMAL----------- I CO5

4F-3
In function free(p), p is a –P IS POINTER----------------- I CO5

4F-4 Syntax for function declaration is---RETURNTYPE FUNCTION

I CO5
NAME(PARAMERTER LIST);---------------
4F-5 The function -----MALLOC------------- obtains block of memory dynamically.
I CO5
4F-6 A recursive function is faster than ----WHILE--------------- loop.
I CO5
4F-7 The output of this C code is -W---------------
II CO5
#include<stdio.h>
void main()
{
char *p = calloc(100, 1);
p = "welcome";
printf("%s\n", p);
}

4F-8 A function calling itself is called -----RECURSIVE FUNCTION---------------

I CO5
4F-9 Parameters in function call are called as –ACTUAL PARAMETER-----------------
I CO5
4F-10 int *m();
void main(){ I CO5
int k = m();
printf("%d", k);}
int *m() {
int a[2] = {5, 8};
return a;
}the output is-----------------
 SRI INDU COLLEGE OF ENGG & (Regulation :R22)
TECH QUESTION BANK Prepared
on :12/10/2022 Rev1:
(Regulation :R22) 1/10/2024
Department of Computer Science and Engineering Page: 6 of 7
Sub. Code & Title (R22CSE1113) PROGRAMMING FOR PROBLEM SOLVING
Academic Year: 2024-25 Year/Sem. I-I/CSE(A,B,C,D&E),IT,AIML(A,B,C,&D)),
CS(A&B),CSIT,DS(A&B&C),AI&DS
Faculty Name & Designation Dr P RAMESHKUMAR\ D MOUNIKA \K S ARCHANA\
CH.SHRAVANI P.MANASA\G.LAVANYA\CHITTY\SWAPNA\
MEGHAMLA\T.SIRISHA

4F-11 The CALLOC_____ library function allocates a specified number of bytes and
initializes them to zero. I CO5

4F-12 Creating variables while a program is running is called---RUN TIME

ALLOCATION------------ II CO5

4F-13 Example of static memory allocation ARRAYS-----------

IV CO5
4F-14 Code reusability can be achieved through ---FUNCTIONS-----------------------
IV CO5
4F-15 Parameters in function definition are called--FORMAL--------------
II CO5

Match the following

4M-1. a) calloc ( 3) i) Frees previously allocated space.
I CO5
b) free (1 ) ii) Modifies previously allocated space.
c) malloc (4 ) iii) Allocates space for array.
d) realloc ( 2) iv) Allocates requested size of space.Define a function. .
4M-2 a) Abs (2) i) 2.0 II CO5
b) Round 1) ii) 3
c) Pow (4) iii) 1
d) tunk (3) iv) 16
4M-3. a) functions with out parameters (2) i) void with arguments
II CO5
b) functions with parameters (1 ) ii) void without arguments
c) functions with parameters (4) iii) non void without arguments
and return values
d)functions without (3) iv) non void with arguments
parameters and with return value
4M-4. a).Call by value (2) i) function calls itself
III CO5
b).Call by reference (3) ii) Modification of formal parameters will effect actual
Parameters
c).Void functions (4) iii) Modification of formal parameters will effect actual
Parameters
d).Recursion (1) iv) returns nothing
4M-5 a)ceil(1.5) (1) i) 2
III CO5
b)floar(-1.6) (2) ii) -2
c)pow(2,3) (3) iii) 8
d)trunk(-1.9) (4) iv) -1
 SRI INDU COLLEGE OF ENGG & (Regulation :R22)
TECH QUESTION BANK Prepared
on :12/10/2022 Rev1:
(Regulation :R22) 1/10/2024
Department of Computer Science and Engineering Page: 7 of 7
Sub. Code & Title (R22CSE1113) PROGRAMMING FOR PROBLEM SOLVING
Academic Year: 2024-25 Year/Sem. I-I/CSE(A,B,C,D&E),IT,AIML(A,B,C,&D)),
CS(A&B),CSIT,DS(A&B&C),AI&DS
Faculty Name & Designation Dr P RAMESHKUMAR\ D MOUNIKA \K S ARCHANA\
CH.SHRAVANI P.MANASA\G.LAVANYA\CHITTY\SWAPNA\
MEGHAMLA\T.SIRISHA

5 MARK QUESTIONS
4D-1. Explain about recursive function with an example? II CO5
4D-2. Construct a program to find factorial of a given number?
III CO5
4D-3. Explain about dynamic memory allocation? II CO5
4D-4 Implement a recursive function to print the numbers in Fibonacci series?
III CO4
4D-5. Discuss about the following with an example . III CO5

a) malloc() b) calloc() c) realloc() d) free()

4D-6 Describe function prototype and how parameters are passing to functions.?
II CO5
4D-7. Develop a ‘C’ program to find GCD of given integers using functions?
III CO5
4D-8 Develop a ‘C ‘program to pass an array as an argument to function?
III CO5
4D-9 Explain call by value and call by reference. Develop a C program to swap two values by using
III CO5
both techniques ?
4D-10 Explain parameters and return types of function?
II CO5
4D-11 Differences between malloc( ) and calloc( )
III CO5
4D-12 Differentiate call by value and call by reference.?
III CO5
4D-13 Write a c program to find the Fibonacci series using recursive function?
IV CO5

4D-14 Explain the standard library functions in c along with its advantages and disadvantages?
II CO5
4D-15
IV CO5
Write a program to find sum of first n natural numbers using recursion?

Unit – V : Searching and Sorting

Multiple choice questions
5C-1 What is the worst case complexity of binary search using recursion? ( A ) II CO6
a) O(nlogn) b) O(logn)
c) O(n) d) O(n2)
5C-2 Which of the following is not an application of binary search? ( D) II CO6
 SRI INDU COLLEGE OF ENGG & (Regulation :R22)
TECH QUESTION BANK Prepared
on :12/10/2022 Rev1:
(Regulation :R22) 1/10/2024
Department of Computer Science and Engineering Page: 8 of 7
Sub. Code & Title (R22CSE1113) PROGRAMMING FOR PROBLEM SOLVING
Academic Year: 2024-25 Year/Sem. I-I/CSE(A,B,C,D&E),IT,AIML(A,B,C,&D)),
CS(A&B),CSIT,DS(A&B&C),AI&DS
Faculty Name & Designation Dr P RAMESHKUMAR\ D MOUNIKA \K S ARCHANA\
CH.SHRAVANI P.MANASA\G.LAVANYA\CHITTY\SWAPNA\
MEGHAMLA\T.SIRISHA

a) To find the lower/upper bound in an ordered sequence b) Union of intervals

c) Debugging d) To search in
unordered list
5C-3 Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done II CO6
until the element is found?
( C )
a) 1 b) 3
c) 4 d) 2
5C-4 Which of the following is not a stable sorting algorithm? ( B ) I CO6
a) Insertion sort b) Selection sort
c) Bubble sort d) Merge sort
5C-5 Where is linear searching used? I CO6
( C )
a) When the list has only a few elements
b) When performing a single search in an unordered list
c) Used all the time
d) When the list has only a few elements and When performing a single search in an
unordered list
5C-6 What is the worst case for linear search? ( C ) II CO6
a) O(nlogn) b) O(logn)
c) O(n) d) O(1)
5C-7 Which of the following is a disadvantage of linear search? ( A I CO6
)

a) Requires more space

b) Not easy to understand
c) Greater time complexities compared to other searching algorithms
d) Not easy to implement
Which of the following is not an application of binary search? ( D )
5C-8
a) To find the lower/upper bound in an ordered sequence b) Union of intervals I CO6
c) Debugging d) To search in unordered list
5C-9 Binary Search can be categorized into which of the following? I CO6
( B )
a) Brute Force technique b) Divide and conquer
c) Greedy algorithm d) Dynamic programming
5C-10 What is an external sorting algorithm? I CO6
( A )
a) Algorithm that uses tape or disk during the sort
b) Algorithm that uses main memory during the sort
 SRI INDU COLLEGE OF ENGG & (Regulation :R22)
TECH QUESTION BANK Prepared
on :12/10/2022 Rev1:
(Regulation :R22) 1/10/2024
Department of Computer Science and Engineering Page: 9 of 7
Sub. Code & Title (R22CSE1113) PROGRAMMING FOR PROBLEM SOLVING
Academic Year: 2024-25 Year/Sem. I-I/CSE(A,B,C,D&E),IT,AIML(A,B,C,&D)),
CS(A&B),CSIT,DS(A&B&C),AI&DS
Faculty Name & Designation Dr P RAMESHKUMAR\ D MOUNIKA \K S ARCHANA\
CH.SHRAVANI P.MANASA\G.LAVANYA\CHITTY\SWAPNA\
MEGHAMLA\T.SIRISHA

c) Algorithm that involves swapping

d) Algorithm that are considered ‘in place’

5C-11 The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. I CO6
How many iterations will be done to sort the array?
( B )
a) 4 b) 2
c) 1 d) 0

5C-12 Which of the following algorithm pays the least attention to the ordering of the I CO6
elements in the input list?
( A )
a) Insertion sort b) Selection sort
c) Quick sort d) None
5C-13 Linear search is also called------ ( B )
I CO6
a)Random search
b)Sequential Search
c)Perfect search
d)None

5C-14 If the given input array is sorted or nearly sorted, which of the following algorithm I CO6
gives the best performance? ( A )

a) Insertion sort b) Selection sort c) Quick sort d) Merge sort

5C-15 Time complexity of bubble sort in best case is (A ) III CO6
a) θ (n) b) θ (nlogn) c) θ (n2) d) θ (n(logn) 2)
Fill in the blanks
5F-1 Binary search follows -----DIVIDE AND CONQUER---------------principle I CO6
5F-2 Best case time complexity of binary search with iteration is-----O(1)----------- II CO6
5F-3 ------O(N)--------is the best case complexity of bubble sort I CO6
5F-4 ---------INSERTION--------is an in-place sorting algorithms needs the minimum I CO6
number of swaps
 SRI INDU COLLEGE OF ENGG & (Regulation :R22)
TECH QUESTION BANK Prepared
on :12/10/2022 Rev1:
(Regulation :R22) 1/10/2024
Department of Computer Science and Engineering Page: 10 of 7
Sub. Code & Title (R22CSE1113) PROGRAMMING FOR PROBLEM SOLVING
Academic Year: 2024-25 Year/Sem. I-I/CSE(A,B,C,D&E),IT,AIML(A,B,C,&D)),
CS(A&B),CSIT,DS(A&B&C),AI&DS
Faculty Name & Designation Dr P RAMESHKUMAR\ D MOUNIKA \K S ARCHANA\
CH.SHRAVANI P.MANASA\G.LAVANYA\CHITTY\SWAPNA\
MEGHAMLA\T.SIRISHA

5F-5 ------4------------many comparisons are needed to sort an array of length 5 if a I CO6

straight selection sort is used and array is already in the opposite order?
5F-6 ---O(N2)-------- is the worst case complexity of selection sort I CO6
5F-7 The process through which data arranged according to their values is called---- I CO6
SORTING---------
5F-8 The -------SELECTION-----------sort finds the smallest elements from unsorted I CO6
sublist and swaps it with the elements at the beginning of the unsorted data
5F-9 The ----LINEAR---------- search locates the target item by starting at the beginning I CO6
and moving towards the end of list
5F-10 Complexity of linear search under recursion is------O(N)------------ I CO6

5F-11 Binary search is also known as ------LOGARITHMIC SEARCH-------------- I CO6

5F-12 Write the worst-case and average-case time complexity of binary search……O(logn) IV CO6
5F-13 Arrangement of data either is ascending or descending order is called----- II CO6
SORTING---------------------
5F-14 Time Complexity of best case in bubble sort----O(N)---------- III CO6
5F-15 Types of sorting-----INSERTION--------,------BUBBLE-----,-------- II CO6
SELECTION--------
Match the following
5M-1 Match the worst case time complexity notations I CO6
a) linear search 2 i) O(N2)
b) binary search 4 ii) O(n)
c) selection 3 iii)O(N2)
d) insertion sort 1 iv) O(log n)
5M-2. Match the following
I CO6
a) searching 3 i) linear search
b) sequential search 1 ii) divide and conquer
c)binary search 2 iii) Process of finding a given value position in a
list of values
d)sorting 4 iv)storage of data in ascending or descending
order
5M-3 Match the following time complexity notations
I CO6
a)Worst case 3 i) big Omega
 SRI INDU COLLEGE OF ENGG & (Regulation :R22)
TECH QUESTION BANK Prepared
on :12/10/2022 Rev1:
(Regulation :R22) 1/10/2024
Department of Computer Science and Engineering Page: 11 of 7
Sub. Code & Title (R22CSE1113) PROGRAMMING FOR PROBLEM SOLVING
Academic Year: 2024-25 Year/Sem. I-I/CSE(A,B,C,D&E),IT,AIML(A,B,C,&D)),
CS(A&B),CSIT,DS(A&B&C),AI&DS
Faculty Name & Designation Dr P RAMESHKUMAR\ D MOUNIKA \K S ARCHANA\
CH.SHRAVANI P.MANASA\G.LAVANYA\CHITTY\SWAPNA\
MEGHAMLA\T.SIRISHA

b)Best case 1 ii) big Theta

c)Average case 2 iii) big Oh
d)Time complexity density time versus 4 iv)input size

5M-4 Match the best case time complexity notations III CO6
a) bubble sort 2 i) O(1)
b) binary search 4 ii) O(n)
c) linear search 1 iii)O(N2)

d) selection sort 3 iv) O(1)

5M-5 Match the space complexity notations III CO6
a)best-case of binary search 2 i) O(n2)
b)average-case of bubble sort 1 ii) O(1)
c)worst-case of selection sort 3 iii)O(n2)
d)worst-case of linear search 4 iv) O(n)

5- MARK QUESTIONS
5D-1
Explain Linear search technique with example.? II CO6
5D-2 Explain Binary search technique with example? II CO6
5D-3 Develop a C program on Bubble sort?
III CO6
5D-4 Implement a C program on Insertion sort? III CO6
5D-5 Construct a C program on Selection sort. And Explain with an
example? III CO6

5D-6 Explain Order of Complexity? II CO6

5D-7 Choose any one of the sorting technique and Sort the following
numbers 34, 5, 67, 8, 435, 2,78,45,12 III CO6
5D-8 Estimate the complexity to search 34,31,78 by using linear search technique with
V CO6
given data
34, 5, 67, 8, 2,78,45,12,48,36 .Justify?

5D-9 Develop a C program on Linear search?

III CO6
5D-10. Develop a C program on Binary search using functions?
III CO6
 SRI INDU COLLEGE OF ENGG & (Regulation :R22)
TECH QUESTION BANK Prepared
on :12/10/2022 Rev1:
(Regulation :R22) 1/10/2024
Department of Computer Science and Engineering Page: 12 of 7
Sub. Code & Title (R22CSE1113) PROGRAMMING FOR PROBLEM SOLVING
Academic Year: 2024-25 Year/Sem. I-I/CSE(A,B,C,D&E),IT,AIML(A,B,C,&D)),
CS(A&B),CSIT,DS(A&B&C),AI&DS
Faculty Name & Designation Dr P RAMESHKUMAR\ D MOUNIKA \K S ARCHANA\
CH.SHRAVANI P.MANASA\G.LAVANYA\CHITTY\SWAPNA\
MEGHAMLA\T.SIRISHA

5D-11 Why sorting algorithm are important explain with an example? III CO6
5D-12 Define time complexity and space complexity and write all the time and space III CO6
complexity of searching and sorting.
5D-13 Difference between insertion sort and selection sort III CO6
5D-14 Write a program for binary search using recursion. IV CO6
5D-15 Difference between linear and binary search III CO6