$1$A i$.$ Explain four classifications of computational problems.

ii$.$ Explain all the steps $($phases$)$ in a C program development with a neat diagram.

$1$B Write a flowchart to display perfect numbers between $1$ and $500.$

$1$C Write a $C$ program to read $N$ positive integers without using arrays and functions to find the $2M$ second largest number among them.

$2$A Explain the various Bitwise operators with proper example.

$2$B Write a program to search $n^{th}$ Fibonacci indexed number from the given list of $1$D array.

$5M$

$3M$

Ex: $1$ D Array$--34,21,11,18,21,81,57,69,97,24$

$4^{th}$ Fibonacci number i$.$e$.2,$ so fetch array $[2]=11$

Fibonacci series: $0,1,1,2,3,5,8$dotsdotsdots

$2$C What is the largest number of key comparisons made by binary search in searching for a key $2M$ in the following array? Show all the steps.

$\backslash$table$[[3,4,27,31,39,42,55,70,74,81,85,93,98]]$

$3$A Write a single program to i$)$ sort $\text{'}n\text{'}$ strings using selection sort method.

$5M$

ii$)$Eliminate the duplicate strings in the sorted list. $[$Do not use any additional array$]$

$3$B i$.$ List the different ways of initializing pointers. Illustrate with examples.

ii$.$ Write a code snippet to swap the contents of two pointers. Note that the content of pointers

$2M$

are addresses. Assume integer pointers.

$1M$

$3$C Differentiate between function declaration and function definition. Give the general syntax for defining a function