Which recursive sorting technique always makes recursive calls to sort subarrays that are about half size of the original array?

0 Answers  

---

Explain the difference between static and dynamic binding of functions?

0 Answers  

---

Read the following program carefully and write the output of the program. Explain each line of code according to given numbering. #include <stdio.h> #include <unistd.h> #include <stdlib.h> #include <errno.h> 1……………… int main (void) { pid_t pid; 2………………………… pid = fork(); 3…………………………. if (pid > 0) { int i; 4………………………… for (i = 0; i < 5; i++) { 5………………… …………… printf(" I AM VU : %d\n", i); 6………………… …………… sleep(1); } exit(0); } 7………………… ……… else if (pid == 0) { int j; for (j = 0; j < 5; j++) { 8……………………………… printf(" I have no child: %d\n", j); sleep(1); } _exit(0); } else { 9………………………………fprintf(stderr, "can't fork, error %d\n", errno); 10……………… … ………… exit (EXIT_FAILURE); } }

1 Answers  

---

Difference between overloading vs. Overriding

0 Answers  

---

Discuss the effects occur, after an exception thrown by a member function is unspecified by an exception specification?

0 Answers  

---

Are c and c++ different?

0 Answers  

---

Why use of template is better than a base class?

0 Answers  

---

What is a manipulator in c++?

0 Answers  

---

What is pointer in c++ with example?

0 Answers  

---

Which programming language is best to learn first?

0 Answers  

---

What are virtual constructors/destructors?

0 Answers  

---

What is virtual base class?

0 Answers  

---