Explain how performance of algorithm is analysed?
The performance of an algorithm is analysed by the time complexity as well as its space complexity though both the complexities are trafe-offs between them. If time... Read more »
‘Data Structure Interview Questions’ - KyaPoocha.com
Is it possible to implement trees using arrays ? If yes, how?
Yes, it is possible. Here is an example of implementing a binary tree: Consider an attay : a[n]; Place the root in first position. and let the current position to... Read more »
What is a void pointer?
a pointer with no return type is called a null pointer.It may be any kind of datatype.It takes the data type according to the requirement in the program. for eg: ... Read more »
What is the difference between function templates and function overloading?
Function templates involve telling a function that it will be receiving a specified data type and then it will work with that at compile time. The difference with... Read more »
Explain what are linear data structure & non-linear data structure?
A data structure is classified into two categories: Linear and Non-Linear data structures. A data structure is said to be linear if the elements form a sequence,... Read more »
Difference between calloc and malloc?
malloc: allocate n bytes calloc: allocate m times n bytes initialized to 0 Read more »
What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model.
1. RDBMS– Array (i.e. Array of structures) 2. Network data model– Graph 3. Hierarchical data model– Trees. Read more »
Which file contains the definition of member functions?
Definitions of member functions for the Linked List class are contained in the LinkedList.cpp file. Read more »
How is any Data Structure application is classified among files?
A linked list application can be organized into a header file, source file and main application file. The first file is the header file that contains the definition... Read more »
What member function places a new node at the end of the linked list?
The appendNode() member function places a new node at the end of the linked list. The appendNode() requires an integer representing the current data of the node. Read more »
What is Linked List ?
Linked List is one of the fundamental data structures. It consists of a sequence of nodes, each containing arbitrary data fields and one or two (”links”)... Read more »
What does each entry in the Link List called?
Each entry in a linked list is called a node. Think of a node as an entry that has three sub entries. One sub entry contains the data, which may be one attribute... Read more »
How is the front of the queue calculated ?
The front of the queue is calculated by front = (front+1) % size. Read more »
Why is the isEmpty() member method called?
The isEmpty() member method is called within the dequeue process to determine if there is an item in the queue to be removed i.e. isEmpty() is called to decide whether... Read more »
Which process places data at the back of the queue?
Enqueue is the process that places data at the back of the queue. Read more »