**1)What is Data Structure ?**

- Way to organize data
- Accessing of data elements in specified manner
- Organization of mathematical and logical concepts
- All of Above

Show/Hide Answer

**Answer = D**

**Explanation:A Data Structure may be organized in different ways : The logical or mathematical model of a particular organization of data is called Data Structure.**

**2) Which operation is not possible on Data Structure ?**

- Traversing
- Insertion
- Reading
- Deletion

Show/Hide Answer

**Answer = C**

**Explanation:Possible operations on the Data Structure are Traversing, Insertion, Searching and Deletion.**

**3) The memory address of the first element is called ?**

- Floor Address
- Foundation Address
- First Address
- Base Address

Show/Hide Answer

**Answer = D**

**Explanation:The memory address of the first element is often called base address in Data Structure.**

**4) The value of first linked list address is ?**

- 0
- -1
- 1
- None of Above

Show/Hide Answer

**Answer = 0**

**Explanation: No explanation for this question.**

**5) Two dimensional arrays are also called ?**

- Matrix Array
- Table Array
- Both a and b
- None of the Above

Show/Hide Answer

**Answer = C**

**Explanation:Two dimensional arrays are called as matrix array and table arrays because they contains rows and columns.**

**6) The situation in linked list START=NULL is called ?**

- Overflow
- Underflow
- Both of above
- None of Above

Show/Hide Answer

**Answer = B**

**Explanation:It is the situation when we are trying to delete an item from the empty linked list.**

**7) Length of the linear array can be found by using the formula ?**

- UB - LB + 1
- LB + UB
- LB - UB
- LB - UB + 1

Show/Hide Answer

**Answer = A**

**Explanation:The length of linear array can be found by using UB - LB + 1 Where UB is upper Bound, LB is Lower Bound of the array.**

**8) The restriction while using the binary search is ?**

- List should be small in number
- List should be large in number
- List should be sorted
- No restriction

Show/Hide Answer

**Answer = C**

**Explanation: Binary search can be applied to a list only if the list is either in ascending or descending order.**

**9) The terms PUSH and POP are related to ?**

- Arrays
- Stacks
- Linked List
- None

Show/Hide Answer

**Answer = B**

**Explanation:PUSH is used for inserting an element into the stack and POP is used for deleting an elements from the stack.**

**10) The operation of processing element is called ?**

- Traversing
- Inserting
- Deleting
- Searching

Show/Hide Answer

**Answer = A**

**Explanation:Traversing means visiting or processing each element exactly once.**

Do You Like This? Please take 5 seconds to share with your firends.

## 0 comments:

## Post a Comment