AMU MCA Data Structures Previous Year Questions (PYQs) – Page 1 of 3
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations
Study Stuff for MCA Examinations
Showing 28 questions
Which of the following algorithms solves the all-pair shortest path problem?
1
2
3
4
Solution
Floyd’s algorithm finds shortest path between all pairs.
The following sequence of operation is performed on stack:
push(1), push(2), pop, push(1), push(2), pop, pop, pop, push(2), pop.
The sequence of popped out values are:
1
2
3
4
Solution
Start: []
push(1) → [1]
push(2) → [1,2]
pop → 2 → [1]
push(1) → [1,1]
push(2) → [1,1,2]
pop → 2 → [1,1]
pop → 1 → [1]
pop → 1 → []
push(2) → [2]
pop → 2 → []
Popped sequence: 2,2,1,1,2
The minimum number of nodes in an AVL tree of height 6 is
1
2
3
4
Solution
Minimum nodes follow Fibonacci relation:
$N(h)=N(h-1)+N(h-2)+1$
$N(6)=20$
Which one of the following statements is true regarding Array and Linked List?
1
2
3
4
Solution
Array elements are stored contiguously. Linked list elements are not stored in adjacent memory.
The minimum number of comparisons required to determine if an integer appears more than $n/2$ times in a sorted array of $n$ integers is
1
2
3
4
Solution
Binary search is used to find first and last occurrence ⇒ logarithmic comparisons.
Stacks cannot be used to:
1
2
3
4
Solution
CPU allocation is done by OS scheduling, not stack.
Which of the following is not a collision resolution technique?
1
2
3
4
Solution
Hash addressing and chaining are collision resolution techniques. Indexing is not.
Which sequence represents a max heap?
1
2
3
4
Solution
Each parent node is greater than its children.
Which one of the following statements is not true regarding Doubly Linked List?
1
2
3
4
Solution
Doubly linked list can traverse both forward and backward.
Depth First Search is a technique for:
1
2
3
4
Solution
DFS is used to traverse nodes of a graph.
AMU MCA
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
AMU MCA
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
