All Posts

DoITToday - For Better Tomorrow (Edition - Sunday, February 1, 2026)

Define Binary Tree.

What are the drawbacks of using sequential storage to represent stacks and queues? One major drawback is that a fixed amount of storage remains allocated to the stack or queue even when the data structure is actually using a smaller amount or possibly no storage at all. Further , no more than that fixed amount of storage may be allocated., thus introducing the possibility of overflow. Define Linked List. Linked List is an ordered collection of nodes and each node has two part

To register for on-line session on this topic click to pay https://www.questionbankos.com/_paylink/AZv5OP8R

DoITToday - For Better Tomorrow (Edition - Sunday, January 24, 2026)

Definition Linked List is a collection of nodes , each node has two parts data(or Info) and address (or pointer part). Data (or Info) part can be of simple type (such as integer, character, float double ) or it can be of complex type like string (char *) or user defined type (using struct). Address / Pointer usually called as next , is used to hold address of next node in the linked list as all these memory locations are scattered and cannot be accessed using index variable l

Definition Linked List is a collection of nodes , each node has two parts data(or Info) and address (or pointer part). Data (or Info) part can be of simple type (such as integer, character, float double ) or it can be of complex type like string (char *) or user defined type (using struct). Address / Pointer usually called as next , is used to hold address of next node in the linked list as all these memory locations are scattered and cannot be accessed using index variable l

DoITToday - For Better Tomorrow (Edition - Sunday, January 18, 2026)

DoITToday - For Better Tomorrow (Edition - Sunday, January 11, 2026)

DoITToday - For Better Tomorrow (Sunday, January 4, 2026)

Join for the upcoming session on this topic. Click here to know more,,,

Course Fee - 1200/- (Rupees Twelve Hundred Only) OR pay Rs. 10/- (Rupees Ten Only) as a session fee to join any session of your choice. Sessions are only for Members of this educational web site. You can Pay subscription fee Rs. 100/- (Rupees Hundred Only) to become member of this site and start attending sessions. Click here to subscribe. Course Fee Pay Link - https://www.questionbankos.com/_paylink/AZqni6C7 #Session Topic Date & Time Learning Resource Pay Link for Sessio

Q.1) How Counting Sort works? Counting sort maintains a separate array to count occurrences of each element and stores them in another array as per their sorted position which is calculates on the basis of occurrences. For example, if the first element is 12 and if it occurs 5 times in the unsorted collection then first 5 positions in the array will be assigned to 12....and so on. Counting sort needs largest number (key) value in the collection to create counting array. For e

Q.1) Define Stack. Stack is an ordered collection of elements into which new element can be inserted or existing element can be deleted from one end called as the top of the stack. Stack is a Last-in-First-Out (LIFO) or First-In-Last-Out (FILO) structure. Q.2) What are the application of Stack? Q.3) "Stack can be considered as a priority queue.". Comment. Stack can be considered as an Ascending Priority Queue with minimal waiting time before popping an element as it is Last-I

Q.1) What is the process of insertion sort? Insertion sort is an in-place sort in which sorted and unsorted data resides in the same array. In this sorting technique, next element is selected and inserted in the sorted part of array (sorted sub-array). This process continues till all elements get inserted in sorted subarray. Q.2) Sort Given integers using Insertion Sort : 32, 35, 12, 92, 86, 48, 37, 25   0 1 2 3 4 5 6 7 a[] 42 12 18 11 92 76 82 36 Pass 1   12 42 18 11 92 76 8

Q.1) What is the process of merge sort? Merge sort takes two unsorted subarray and combine them into single sorted array. Q.2) What is the advantage of merge sort? Merge sort is faster in sorting elements as it avoids Swapping (interchanges). It does not require all elements in memory, hence it is best suitable for virtual memory environment. (refer to quick sort for more on virtual memory) Q.3) What is an efficiency of merge sort? Merge sort requires O(nlogn) comparisons irr

Q.1) What is the working of Quick Sort? Quick Sort method sorts one element at a time. The element selected for sorting called pivot element will be placed in array at its proper position such that to the left of it all elements are smaller or equal and to the right all elements are greater (in case of ascending sorting). An array will be divided into two parts at sorted position of the pivot and sorting continues with sub - arrays by selecting pivot element. Q.2) What is t

Q.1) What are the critical operations for Bubble Sort? Comparison and Swapping are two critical operations for sorting. Bubble sort requires both comparison and swapping , hence it is least efficient. Q.2) What is the basic idea of Bubble Sort ? (How it sorts?) The bubble sort passes through the file(or array) sequentially several times. Each pass consists of comparing each element in the file with its successor (x[i] with x[i+1]) and interchanging the two elements if they

Three of the most important efficiency considerations while writing programs to solve problems are

Total Questions - 10