Skip to main content

Posts

Showing posts with the label Data Structure

What is the difference between realloc() and free()?

The free subroutine frees a block of memory previously allocated by the malloc subroutine. Undefined results occur if the Pointer parameter is not a valid pointer. If the Pointer parameter is a null value, no action will occur. The realloc subroutine changes the size of the block of memory pointed to by the Pointer parameter to the number of bytes specified by the Size parameter and returns a new pointer to the block. The pointer specified by the Pointer parameter must have been created with the malloc, calloc, or realloc subroutines and not been deallocated with the free or realloc subroutines. Undefined results occur if the Pointer parameter is not a valid pointer.

Data Structure – Technical interview questions

Write programs for Bubble Sort, Quick sort Explain about the types of linked lists How would you sort a linked list? Write the programs for Linked List (Insertion and Deletion) operations? What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm? A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute? A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute? When will you  sort an array of pointers to list elements, rather than sorting the elements themselves? The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered? What is the average number of comparisons needed in a sequential search to determine the position of an element in an...