Latest Answer: all valid commands in sql so none of these ...
One qn about pointer to funciton :how will a pointer to a pointer to a function will be declaredvoid *(*ptr[]));void *ptr[];void (**ptr[]
4
Latest Answer: argc is an argument count value, so for this example, argc equals to 3. ...
Latest Answer: hi, size of a union is size of largest data type among its members ...so size of union a is 4 bytes.Even if int no is type bt-field the sizeof union will remain 4 bytes as sizeof(int) = 4.now int no:2 means value for "no" wil be 2-bit wide i.e. either ...
Latest Answer: Note that the question asks which type of "function" takes less time to execute, not algorithm. While recursive algorithms generally take less time (depending on application), recursive functions have more overhead (a function call translates ...
Latest Answer: merge ...
Latest Answer: Efficiency of bubble sort = O(N^2)Merge is a divide-and-conquer = O(N * log N)Worst case: List is bigger than main memory. Bubble sort doesn't work.Best case: List is very small, bubble sort may be faster, due to less overhead. ...
Class A{fn to print ‘A’;}Class B {virtual fn to print ‘B’ }Class C {fn to print ‘C’}a ptr object is created for class C, what will be printed?
Hint: Read Virtual functions concept in C++
Latest Answer: 3rd NORMAL FORM IS BETTER COMPARED TO 1NF AND 2NF........ BUT BOYCE CODD NORMAL FORM IS NOT BETTER COZ IT LEADS TO LOSSY DECOMPOSITION OF DEPENDENCIES........... ...
