What is linear searching?
Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location.
Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.
Describe a string reversal algorithm. Write the difference between a [ ] [ ] and **a.
What is the benefit of using arrays of pointers instead of several pointer variables?
What do you mean by recursion? Write down a C function to find out the GCD of two nos. using recursive technique.
Describe various actions of a shift reduce parsers.
Write a C program to transpose of a matrix.
Write a C program to find the multiplication table of any no.
What is a minimum spanning tree ? Describe Huffman’s Algorithm.
Write a C program to find the factorial of any number.
Write a C procram to G.C.D. of two no. using recursion.
