5. What kind of sorting is this: SORT (k,n) 1.[Loop on I Index] repeat thru step2 for i=1,2,........n-1 2.[For each pass,get small value] min=i; repeat for j=i+1 to N do { if K[j]<k[min] min=j; } temp=K[i];K[i]=K[min];K[min]=temp; 3.[Sorted Values will be returned] A)Bubble Sort B)Quick Sort C)Selection Sort D)Merge Sort

2 Answers   Accenture,

---

Write a program to implement a round robin scheduler and calculate the average waiting time.Arrival time, burst time, time quantum, and no. of processes should be the inputs.

0 Answers   Aspiring Minds,

---

Why pointers are used in c?

0 Answers  

---

print the palindrome numbers in between 0 to n

1 Answers  

---

Hai sir, I had planned to write the NIC scientific engineer exam , plz post the sample question......

0 Answers  

---

---

How can you return multiple values from a function?

0 Answers  

---

What does sizeof function do?

0 Answers  

---

main() {int a=200*200/100; printf("%d",a); }

14 Answers   TCS,

---

How does placing some code lines between the comment symbol help in debugging the code?

0 Answers  

---

What is sizeof in c?

0 Answers  

---

Which of these functions is safer to use : fgets(), gets()? Why?

0 Answers  

---

What is pointer & why it is used?

0 Answers  

---