# Algorithm past/Previous question paper

-Algorithm project –Computer Science all subject past paper –Algorithm Problem with source code –Algorithm Course -Algorithm Project idea -Algorithm MCQ -Algorithm Interview Question –Computer Science all courses -Technology –University Past Paper -Programming language –Question paper –old paper

- Does input size matter? Suppose a program has run time O(n!) and the run time for n = 10 is 1 second how much it will take for N=16 [5]

- Write down Algorithm Development Process steps in diagram format. [5]
- Running Time of an Algorithm depends on which parameter? [5]
- Find time complexity for the following Code [4]

int j,k;

for (j=0; j<N; j++)

for (k=2; k<8; k++)

sum += k+j;

- Write a short note on backtracking algorithm [4]
- Write short note on the following [12]
- In which case Insertion Sort perform Best, Worst and Average time to sort array
- Write down the name of Linear Time sorting algorithms
- Why quick sort better than merge sort?
- In which case quick sort take maximum time to sort array
- Write down the code for merge sort and discuss it time complexity in detail [8]
- Apply the bucket sort algorithm and write down the steps for the following array

0.78 0.17 0.39 0.26 0.72 0.94 0.21 0.12 0.23 0.68 [7]

#Algorithm project #Computer Science all subject past paper #Algorithm Problem with source code #Algorithm Course #Algorithm Project idea #Algorithm MCQ #Algorithm Interview Question #Computer Science all courses #Technology #University Past Paper #Programming language #Question paper #old paper