Define Algorithm. Define Token with an Example. Write any two rules for Identifiers. Define Binary Search. What is sorting? List any two sorting techniques. What is an array? Give... Define Algorithm. Define Token with an Example. Write any two rules for Identifiers. Define Binary Search. What is sorting? List any two sorting techniques. What is an array? Give the syntax. Write an algorithm to exchange the values of two variables. Write a note on break and continue with an example. Illustrate the declaration and initialization of pointers with an example. Write a C program to remove the duplicate entries in a single dimensional array? How do find the smallest divisor of an integer? Write an algorithm to perform hash search on the given set of elements. Read more

Answer key for various programming concepts and sample solutions provided.

1. Algorithm: A set of step-by-step instructions to perform a task or solve a problem, typically by a computer.

2. Token in C: The smallest element of a program recognized by the compiler, e.g., keywords, identifiers, operators, etc.

3. Rules for Identifiers:

   • Must begin with a letter or underscore.
   • Cannot use reserved words.

4. Binary Search: An efficient algorithm to find an item's position in a sorted list by repeatedly dividing the search interval in half.

5. Sorting: Rearranging elements in a particular order. Techniques: Bubble Sort, Quick Sort.

6. Array: A collection of elements of the same type stored in contiguous memory locations. Syntax: type name[size];

7. Algorithm to Exchange Values:

   1. Input variables a, b.
   2. temp = a.
   3. a = b.
   4. b = temp.
   5. Output a, b.

8. Note on Break and Continue:

   • Break: Exits the loop immediately. Example:

     for(int i=0; i<10; i++) {
         if(i == 5) break;
         printf("%d ", i);
     }
     

   • Continue: Skips the current iteration and proceeds to the next. Example:

     for(int i=0; i<10; i++) {
         if(i == 5) continue;
         printf("%d ", i);
     }
     

9. Pointers Declaration and Initialization Example:

   int a = 10;
   int *p = &a;
   

10. C Program to Remove Duplicate Entries in Array:

#include <stdio.h>

void removeDuplicates(int arr[], int n) {
    int temp[n];
    int j = 0;
    for (int i = 0; i < n - 1; i++) {
        if (arr[i] != arr[i + 1]) {
            temp[j++] = arr[i];
        }
    }
    temp[j++] = arr[n - 1];
    for (int i = 0; i < j; i++) {
        arr[i] = temp[i];
    }
}

int main() {
    int arr[] = {1, 2, 2, 3, 4, 4, 5};
    int n = sizeof(arr) / sizeof(arr[0]);
    removeDuplicates(arr, n);
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    return 0;
}

11. Smallest Divisor of an Integer:

• Check divisibility starting from the smallest integer greater than 1 up to the square root of the number.

12. Hash Search Algorithm:
13. Create a hash table.
14. Compute hash index for each element.
15. Insert keys at computed hash index.
16. Search by calculating hash index of target value.