Answer / siri

void bubble(int x[],int n)
{
int hold,j,pass;
int switched=true;
for(pass=0;pass<n-1&&switched=true;pass++){
switched=false;
for(j=0;j<n-pass-1;j++)
if(x[j]>x[j+1]){
switched=true;
hold=x[j];
x[j]=x[j+1];
x[j+1]=hold;
}
}
}

Define ancestor and descendant ?

0 Answers  

---

What is Doubly link list?

0 Answers   TCS,

---

Define a binary tree?

0 Answers  

---

What is an acyclic graph?

0 Answers  

---

What is an example of an algorithm?

0 Answers  

---

Is json a data structure?

0 Answers  

---

1) Program A and B are analyzed and found to have worst- case running times no greater than 150nlog2n and n2 respectively.Answer the folloWing questions if possible.. i) which program has the better guarantee on the running time,for larger values of n(n>10000) ? ii) which program has the better guarantee on the running time,for small values of n(n<100) ? iii) which program will run faster on average for n =1000 2) wRite a program to compute the number of collisions required in a long random sequence of insertions using linear probing ,quadratic probing and double hashing 3) what is the optimal way to compute A1 A2 A3 A4 A5 A6 where the dimensions of the matrices are A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30 A6 : 30 X 15

5 Answers   KPIT,

---

Give one example of right rotation.

0 Answers  

---

How do you sort large data?

0 Answers  

---

How do you assign an address to an element of a pointer array ?

0 Answers  

---

Why do we need to recycle?

0 Answers  

---

What is a concurrenthashmap?

0 Answers  

---