Category: Blog

Here is the Application of tree data-structure? – The manipulation of Arithmetic expression, – Symbol Table construction, – Syntax analysis.

It is 1014. For example, Consider a tree with 3 nodes(n=3), it will have the maximum combination of 5 different (ie, 2^n – 3 = 5) trees. In general: If there are n nodes,...

Here is the methods available in storing sequential files? – Straight merging, – Natural merging, – Polyphase sort, – Distribution of Initial runs.

The front of the queue is calculated by front = (front+1) % size.

List of applications that make use of Multi linked? -Structures -Sparse matrix, -Index generation.

It is 21. Let us take a tree with 5 nodes (n=5) It will have only 6 (ie,5+1) null branches. In general, A binary tree with n nodes has exactly n+1 null nodes.

Stack. Because of its LIFO (Last In First Out) property it remembers its ‘caller’ so knows whom to return when the function has to return. Recursion makes use of system stack for storing the...

It should be two. One queue is used for actual storing of data and another for storing priorities.

The heterogeneous linked list contains different data types in its nodes and we need a link, pointer to connect them. It is not possible to use ordinary pointers for this. So we go for...

– RDBMS – Array (i.e. Array of structures) – Network data model – Graph – Hierarchical data model – Trees