Is swift faster than go?

0 Answers  

---

Given an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].

1 Answers  

---

What are guid?

0 Answers  

---

What are the syntactic rules to be avoid ambiguity in multiple inheritance?

0 Answers  

---

How long it will take to learn c++?

0 Answers  

---

Does there exist any way to make the command line arguments available to other functions without passing them as arguments to the function?

0 Answers  

---

How do I get good at c++ programming?

0 Answers  

---

What are the advantages of c++? Explain

0 Answers  

---

Which function should be used to free the memory allocated by calloc()?

0 Answers  

---

How do you flush std cout?

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  

---

What is Memory Alignment?

2 Answers   TCS,

---