Answer Posted / deepa

it is x for hexadecimal

Describe the complexity of Binary search, Quicksort and various other sorting and searching techniques..

987

---

the process of defining something in terms of itself is called (or) in C it is possible for the functions to call themselves. A function called a) nested function b) void function c) recursive function d) indifinite function

1264

---

Explain the use of #pragma exit?

1112

---

How many levels deep can include files be nested?

1099

---

Can the “if” function be used in comparing strings?

982

---

Can we assign string to char pointer?

1042

---

Is swift based on c?

1053

---

4-Take two sets of 5 numbers from user in two arrays. Sort array 1 in ascending and array 2 in descending order. Perform sorting by passing array to a function mySort(array, sortingOrder). Then multiply both the arrays returned from function, using metric multiplication technique in main. Print result in metric format.

2138

---

What is c language in simple words?

1013

---

What is array in c with example?

1166

---

In a byte, what is the maximum decimal number that you can accommodate?

1072

---

Is c easier than java?

999

---

What are control structures? What are the different types?

1039

---

Do you know what are bitwise shift operators in c programming?

1059

---

Why structure is used in c?

1113

---