Join Our Email Alerts-Subscribe
Important Note:Login & Check Your Email Inbox and Activate Confirmation Link

Enter Your Email :

Data Structure Materials-Free Download

26. What are the different types of traversing?

The different types of traversing are

i)Pre-order traversal-yields prefix from of expression.

ii)In-order traversal-yields infix form of expression.

iii)Post-order traversal-yields postfix from of expression.

27. Define pre-order traversal?

i)Process the root node

ii)Process the left subtree

iii)Process the right subtree

28. Define post-order traversal?

i)Process the left subtree

ii)Process the right subtree

iii)Process the root node

29. Define in -order traversal?

i)Process the left subtree

ii)Process the root node

iii)Process the right subtree

30. What is meant by sorting?

Ordering the data in an increasing or decreasing fashion according to some relationship among the data item is called sorting. 

31. What's the major distinction in between Storage structure and file structure and how?

The expression of an specific data structure inside memory of a computer system is termed storage structure in contrast to a storage structure expression in auxiliary memory is normally known as a file structure. 

32. Stack can be described as a pointer. Explain?

Because stack will contain a head pointer which will always point to the top of the Stack.All Stack Operations are done using Head Pointer. Hence Stack ca be Described as a Pointer 

33. What do you mean by: Syntax Error, Logical Error, Run time Error? 

Syntax Error-Syntax Error is due to lack of knowledge in a specific language. It is due to somebody does not know how to use the features of a language.We can know the errors at the time of compilation. 

logical Error-It is due to the poor understanding of the requirement or problem.

Run time Error-The exceptions like divide a number by 0,overflow and underflow comes under this. 

34. What is mean by d-queue?

D-queue stands for double ended queue. It is a abstract data structure that implements a queue for which elements can be added to front or rear and the elements can be removed from the rear or front. It is also called head-tail linked list 

35. What is AVL tree?

Avl tree is self binary tree in which balancing factor lie between the -1 to 1.It is also known as self balancing tree. 

36. what is binary tree?

Binary tree is a tree which has maximum no. of childrens either 0 or 1 or 2. i.e., there is at the most 2 branches in every node. 

37. What is the difference between a stack and a Queue?

Stack – Represents the collection of elements in Last In First Out order. Operations includes testing null stack, finding the top element in the stack, removal of top most element and adding elements on the top of the stack. 

Queue - Represents the collection of elements in First In First Out order.Operations include testing null queue, finding the next element, removal of elements and inserting the elements from the queue. 

Insertion of elements is at the end of the queue.Deletion of elements is from the beginning of the queue 

38. What actions are performed when a function is called?

i)arguments are passed

ii)local variables are allocated and initialized

iii)transferring control to the function

39. What is precision?

Precision refers the accuracy of the decimal portion of a value. Precision is the number of digits allowed after the decimal point. 

40. What do you mean by overflow and underflow? 

When new data is to be inserted into the data structure but there is no available space storage list is empty this situation is called overflow.When we want to delete data from a data structure that is empty this situation is called underflow.

Source: Contents are provided by Technicalsymposium Google Group Members. 
Disclaimer: All the above contents are provided by Google Group members. 
Further, this content is not intended to be used for commercial purpose. is not liable/responsible for any copyright issues. All Technical Interview Materials