Which of the following data structures is on average the fastest for retrieving data: 1) Binary Tree 2) Hash Table 3) Stack

3 Answers  

---

Explain what are compound statements?

0 Answers  

---

What does %p mean?

0 Answers  

---

Explain how do you override a defined macro?

0 Answers  

---

A character flag or control mechanism that delineates one data item from another a) variable b) constant c) delimiter d) call by reference

0 Answers  

---

---

main() { int a,b; printf("%d,%d",scanf("%d%d",&a,&b)); } => do u mean above program's output... =>output will be:2,whatever you enter value for b. =>because scanf is a library fn which will return how many arguements it processes, and second value you are right mr.Satya but i found my self unable to understand that for the first time scanf returns the no of successful matches but how for the second time it returns the value of 'b'.while a function should return the same 'r' value every time.

1 Answers   Cisco,

---

write a proram to reverse the string using switch case?

0 Answers   Syntel,

---

Can a variable be both static and volatile in c?

0 Answers  

---

A array contains dissimilar element how can we count, and A array contains dissimilar element how can we store in another array with out repetition.

4 Answers  

---

Write a program to swap two numbers without using third variable?

0 Answers  

---

How many bytes is a struct in c?

0 Answers  

---

can we access one file to one directory?

1 Answers  

---