Answer Posted / s v s pradeep

Generally 0(log n) and 0(n log(n)) will come into picture
if u are dealing with the programs that have for loops
(where the increment is divided or multiplied), functional
blocks.

Eg. for(i=0;i<n;i=i++)
for(j=0;j<n;j=j*2)
......
Here in this case the inner loop complexity is 3n+2 where
the outer loop complexity will be in logarithm terms
because every time when we increment i value the, i is
multiplied by 2 so the no of iterations will be reduced ..
so when the iterations are reduced then we will get log(n)


so, for the above example the complexity will be 0(n log(n))
n-- for the outer loop and log(n) is for inner loop.

so multiply the no of times innerloop will be executed for
the outer loop. so n*log(n).
So the time complexity will be 0(n log(n)).

..

Linked list is a Linear or non linear explain if linear how it working as a non linear data structures

2191

---

Explain how do you override a defined macro?

1085

---

The statement, int(*x[]) () what does in indicate?

1158

---

What are the general description for loop statement and available loop types in c?

1132

---

What happens if you free a pointer twice?

1089

---

What are the benefits of organizational structure?

1031

---

Write a code to generate divisors of an integer?

1077

---

What do you mean by invalid pointer arithmetic?

1091

---

what are the 10 different models of writing an addition program in C language?

1903

---

write a program to rearrange the array such way that all even elements should come first and next come odd

2286

---

How can I write data files which can be read on other machines with different word size, byte order, or floating point formats?

1035

---

In this problem you are to write a program that will cut some number of prime numbers from the list of prime numbers between 1 and N.Your program will read in a number N; determine the list of prime numbers between 1 and N; and print the C*2 prime numbers from the center of the list if there are an even number of prime numbers or (C*2)-1 prime numbers from the center of the list if there are an odd number of prime numbers in the list.

1856

---

What is a double c?

994

---

When should a type cast not be used?

1073

---

What are keywords c?

1039

---