Interested to Buy Any Domain ? << Click Here >> for more details...
What data structure is fastest, on average, for retrieving data:
a) Binary Tree
b) Hash Table
c) Stack
- 0 Answers
- 1026 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
1)#include <iostream.h> int main() { int *a, *savea, i; savea = a = (int *) malloc(4 * sizeof(int)); for (i=0; i<4; i++) *a++ = 10 * i; for (i=0; i<4; i++) { printf("%d\n", *savea); savea += sizeof(int); } return 0; } 2)#include <iostream.h> int main() { int *a, *savea, i; savea = a = (int *) malloc(4 * sizeof(int)); for (i=0; i<4; i++) *a++ = 10 * i; for (i=0; i<4; i++) { printf("%d\n", *savea); savea ++; } return 0; } The output of this two programs will be different why?
Show the application of a dynamic array with the help of an example.
What is a storage class?
What is the difference between function overloading and operator overloading?
how to swap two strings without using any third variable ?
What is input operator in c++?
Explain stack unwinding.
What are the different types of Storage classes?
Define the process of error-handling in case of constructor failure?
What is a c++ object?
program in c++ to input digits and print in words
Explain terminate() and unexpected() function?
STL 
