Answer / Deep Kumar

B+ tree is a type of self-balancing tree data structure that allows efficient storage and retrieval of sorted data. It consists of nodes with multiple key-value pairs, where each node except the root has a fixed number of children (minimum 2, maximum N), and all keys in a node are stored in sorted order. B+ trees provide faster search, insert, and delete operations compared to B-trees due to their shallow height.

1 1 12 21 123 321 12344231 how i creat it with for loop??

1 Answers  

---

What is the significance of an algorithm to C programming?

1 Answers  

---

Take an MxN matrice from user and then sum upper diagonal in a variable and lower diagonal in a separate variables. Print the result

1 Answers  

---

Explain the meaning of keyword 'extern' in a function declaration.

1 Answers  

---

What is the significance of scope resolution operator?

1 Answers   Agilent, ZS Associates,

---

what is the output for the code : main() { int i,j; printf("%d %d ",scanf("%d%d",&i,&j)); }

20 Answers   Infosys,

---

How do i store a paragraph into a string? for example, if i input a long paragraph, the program will read the words one by one and concatenate them until no word is left.

1 Answers  

---

6)swap(int x,y) { int temp; temp=x; x=y; y=temp; } main() { int x=2;y=3; swap(x,y); } after calling swap ,what are yhe values x&y?

3 Answers  

---

Tell me when is a void pointer used?

1 Answers  

---

f(x,y,z) { y = y+1; z = z+x; } main() { int a,b; a = 2 b = 2; f(a+b,a,a); print a; } what is the value of 'a' printed

5 Answers  

---

DIFFERNCE BETWEEN THE C++ AND C LANGUAGE?

2 Answers   Wipro,

---

if the address of a[1,1] and a[2,1] are 1000 and 1010 respectively and each occupies 2 bytes then the array has been stored in what order?

4 Answers   Amazon, Apple, Bata, Google, NASA,

---