NIELIT QUESTION PAPER - 2024 - Data Structure Through Object Oriented Programming Language

Concept of Overloading relates to which Object oriented feature-

Encapsulation
Abstraction
Inheritance
Polymorphism
option4

Clear All

Polymorphism: This is the ability to present the same interface for different underlying data types. Overloading is a form of polymorphism where two or more methods in the same class have the same name but different parameters.

What will be the output of following code in C++ ? #include #include using namespace std; int main() { char str1[6] = "Happy"; char str2[9] = "Birthday"; char str3[15] = str1+ " " + str2; cout<

HappyBirthday

Error

Happy Birthday

Birthday

option2
Clear All

Clear All

In C++, adding a string literal (" ") to a char array pointer (str1) doesn't concatenate them. Instead, it attempts to perform pointer arithmetic, leading to an invalid operation.

What is the complexity of Binary Search in best case scenario-

O(1)
O(log n)
O(n^2 )
O(n log n)
option1

Clear All

Explanation:
Best Case: In the best case, the target element is found at the middle of the array during the first comparison. This results in a constant time complexity of O(1) because you only make one comparison.

Other Cases:

(B) O(log N): This is the average and worst-case time complexity for Binary Search, where the array is repeatedly halved.
(C) O(n²): This is not applicable to Binary Search; it relates more to algorithms like Bubble Sort.
(D) O(n log n): This is the complexity for some sorting algorithms and not for Binary Search.

Which algorithm follows the Divide and Conquer Strategy ?

(A) Bubble Sort
(B) Heap
(C) Quicksort
(D) All the above
option3

Clear All

Explanation:
(A) Bubble Sort: This algorithm does not follow the divide and conquer strategy; it is a simple comparison-based sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.

(B) Heap: Heap itself is a data structure used to implement priority queues and does not specifically represent an algorithm that follows the divide and conquer strategy.

(C) Quicksort: This is a classic example of a divide and conquer algorithm. It works by selecting a 'pivot' element from the array, partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot, and then recursively sorting the sub-arrays.

(D) All the above: This is incorrect because not all of the listed algorithms (Bubble Sort and Heap) follow the divide and conquer strategy.

Which statement is not true about Arrays ?

(A) Arrays are homogenous in nature
(B) Arrays are dynamic in nature
(C) Array elements are stored in contiguous memory
(D) Arrays are also called as subscripted variable
option2

Clear All

Values on the stack can be removed from :

(A) anywhere
(B) bottom position
(C) top position
(D) value cannot be removed
option3

Clear All

An algorithm that calls itself directly or indirectly is known as :

(A) Sub algorithm
(B) Recursion
(C) Polish notation
(D) Traversal algorithm
option2

Clear All

Which traversal method lists the nodes of binary search tree in ascending order ?

(A) post-order
(B) in-order
(C) Pre-order
(D) None of the above
option2

Clear All

In-order: This traversal method visits the left subtree first, then the node, and finally the right subtree. For a binary search tree (BST), this traversal yields the nodes in ascending order, as it processes the smaller values before the larger ones.

Which Data Structure is used in implementation of Quicksort ?

(A) stack
(B) set
(C) tree
(D) queue
option1

Clear All

Graph can be represented using :

(A) Adjacency Matrix
(B) Incidence Matrix
(C) Linklist
(D) Both (A) and (B)
option4

Clear All

OR

Total

0

Correct

0

InCorrect

0

Score

0%

NIELIT QUESTION PAPER - 2024 - Data Structure Through Object Oriented Programming Language

Concept of Overloading relates to which Object oriented feature-

What is the complexity of Binary Search in best case scenario-

Which algorithm follows the Divide and Conquer Strategy ?

Which statement is not true about Arrays ?

Values on the stack can be removed from :

An algorithm that calls itself directly or indirectly is known as :

Which traversal method lists the nodes of binary search tree in ascending order ?

Which Data Structure is used in implementation of Quicksort ?

Graph can be represented using :