Jamia Millia Islamia MCA Data Structures Previous Year Questions (PYQs)
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations
Study Stuff for MCA Examinations
Which of the following statement is correct about the array?
1
2
3
4
Solution
A (run time only) is false; arrays in many languages (like C static arrays) are allocated at compile time.
C is false because an array is a linear data structure (though it stores homogeneous types).
Hence the correct statement is compile-time allocation.
What is the time complexity of binary search in a sorted array?
1
2
3
4
Solution
Binary search repeatedly divides the search space by half.
Complexity = O(logn)
If A, B and C are three sets such that $A \cap B = A \cap C$ and $A \cup B = A \cup C$, then:
1
2
3
4
Solution
Given $A \cap B = A \cap C$ and $A \cup B = A \cup C$
These conditions hold only if $B = C$.
What is the time complexity of a linear search in an unsorted array?
1
2
3
4
Solution
Linear search checks each element sequentially until the desired element is found. In the worst case it checks all elements.
Time Complexity = O(n)
Which of the following is true about a stack data structure?
1
2
3
4
Solution
A stack works on the Last In First Out principle.
Jamia Millia Islamia MCA
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Jamia Millia Islamia MCA
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
