Data structures & Algorithms - Multiple Choice Questions (MCQs) - Objective Set 1 . Answers. 1. Two main measures for the efficiency of an algorithm are c. Data Structures and Algorithms Multiple Choice Questions and Answers pdf free download foe cse and musicmarkup.info Structures and Algorithms. + Multiple Choice Questions & Answers in Data Structure with explanations The section contains questions and answers on arrays, stacks, queues.

Author: | FRIDA WHEELEY |

Language: | English, Spanish, Dutch |

Country: | Uruguay |

Genre: | Environment |

Pages: | 581 |

Published (Last): | 31.10.2015 |

ISBN: | 559-7-49261-435-3 |

ePub File Size: | 20.31 MB |

PDF File Size: | 10.71 MB |

Distribution: | Free* [*Sign up for free] |

Downloads: | 34868 |

Uploaded by: | LEIDA |

7/17/ TOP DATA STRUCTURES and ALGORITHMS Multiple Choice Questions and Answers Engineering Interview musicmarkup.info Engineering. Data Structure MCQ - Multiple Choice Question and Answer. Data Structure MCQ with detailed explanation for interview, entrance and competitive exams. Data Structures multiple choice questions and answers on data structure MCQ questions quiz on structures MCQ questions quiz on data structures objectives questions with answer test pdf. Data Structures MCQ Questions and Answers Quiz.

Skip to main content. Log In Sign Up. Mehboob Alom. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called …… A AVL tree http: Which of the following is true about the characteristics of abstract data types? Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..

Two main measures for the efficiency of an algorithm are c. Time and space 2. The time factor when determining the efficiency of algorithm is measured by b.

Counting the number of key operations 3. The space factor when determining the efficiency of algorithm is measured by a. Counting the maximum memory needed by the algorithm 4. Which of the following case does not exist in complexity theory d.

Null case 5. The Worst case occur in linear search algorithm when d. Item is the last element in the array or is not there at all 6.

The Average case occur in linear search algorithm a. When Item is somewhere in the middle of the array 7. The complexity of the average case of an algorithm is a. Much more complicated to analyze than that of worst case 8. The complexity of linear search algorithm is a. The complexity of Binary search algorithm is b. O log n The complexity of Bubble sort algorithm is c. In this method, each element in the list is checked and compared against the target key.

The process is repeated until found or if the end of the file has been reached. The amount of memory to be allocated or reserved would depend on the data type of the variable being declared. For example, if a variable is declared to be of integer type, then 32 bits of memory storage will be reserved for that variable. The heap is more flexible than the stack.

However, the memory of the heap can at times be slower when compared to that stack. A postfix expression is an expression in which each operator follows its operands. The advantage of this form is that there is no need to group sub-expressions in parentheses or to consider operator precedence.

Data abstraction is a powerful tool for breaking down complex data problems into manageable chunks.

This is applied by initially specifying the data objects involved and the operations to be performed on these data objects without being overly concerned with how the data objects will be represented and stored in memory. Assuming that the data to be inserted is a unique value that is, not an existing entry in the tree , check first if the tree is empty.

The selection sort is a fairly intuitive sorting algorithm, though not necessarily efficient. In this process, the smallest element is first located and switched with the element at subscript zero, thereby placing the smallest element in the first position.

The smallest element remaining in the subarray is then located next to subscripts 1 through n-1 and switched with the element at subscript 1, thereby placing the second smallest element in the second position.

The steps are repeated in the same manner till the last element. In the case of signed numbers, the first bit is used to indicate whether positive or negative, which leaves you with one bit short. With unsigned numbers, you have all bits available for that number.

A binary tree can have a minimum of zero nodes, which occurs when the nodes have NULL values. Furthermore, a binary tree can also have 1 or 2 nodes.

Dynamic data structures are structures that expand and contract as a program runs. It provides a flexible means of manipulating data because it can adjust according to the size of the data. Pointers that are used in linked list have various applications in the data structure. Most declarations do, with the exemption of pointers. Pointer declaration does not allocate memory for data, but for the address of the pointer variable. Actual memory allocation for the data comes during run-time.

When dealing with arrays, data is stored and retrieved using an index that refers to the element number in the data sequence. This means that data can be accessed in any order.

In programming, an array is declared as a variable having a number of indexed elements. The minimum number of queues needed in this case is two. One queue is intended for sorting priorities while the other queue is used for actual storage of data.

There are many types of sorting algorithms: quick sort, bubble sort, balloon sort, radix sort, merge sort, etc. Not one can be considered the fastest because each algorithm is designed for a particular data structure and data set. It would depend on the data set that you would want to sort. Stack follows a LIFO pattern.

It means that data access follows a sequence wherein the last data to be stored when the first one to be extracted. Arrays, on the other hand, does not follow a particular order and instead can be accessed by referring to the indexed element within the array.

A dequeue is a double-ended queue. This is a structure wherein elements can be inserted or removed from either end. A bubble sort is one sorting technique that can be applied to data structures such as an array. It works by comparing adjacent elements and exchanges their values if they are out of order.

A linked list typically has two parts: the head and the tail. Between the head and tail lie the actual nodes. Selection sort works by picking the smallest number from the list and placing it at the front. This process is repeated for the second position towards the end of the list. It is the simplest sort algorithm. A graph is one type of data structure that contains a set of ordered pairs. These ordered pairs are also referred to as edges or arcs and are used to connect nodes where data can be stored and retrieved.

The linear data structure is a structure wherein data elements are adjacent to each other. Examples of linear data structure include arrays, linked lists, stacks, and queues.

On the other hand, a non-linear data structure is a structure wherein each data element can connect to more than two adjacent data elements. Examples of nonlinear data structure include trees and graphs.

An AVL tree is a type of binary search tree that is always in a state of partially balanced. The balance is measured as a difference between the heights of the subtrees from the root.

- LIGHTING FOR FILM AND DIGITAL CINEMATOGRAPHY PDF
- SECRETS OF YANTRA MANTRA AND TANTRA PDF
- COMPUTER ALGORITHMS INTRODUCTION TO DESIGN AND ANALYSIS PDF
- 16F628 DATASHEET EBOOK
- ORGANIC CHEMISTRY BOOKS PDF OP TANDON
- UNDERSTANDING TECHNICAL GRAPHICS BOOK
- ALICE IN WONDERLAND IN HINDI PDF
- DESIGN OF STEEL STRUCTURE BY BHAVIKATTI PDF
- USER INTERFACE DESIGN AND EVALUATION PDF
- NEWTON PRINCIPIA PDF ENGLISH