AMU MCA Data Structures Previous Year Question Paper and Solution with PDF

Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations

AMU MCA
Previous Year Questions

AMU MCA
Previous Year Questions
AMU MCA

AMU MCA Previous Year Questions (PYQs)

AMU MCA Data Structures PYQ

Qus : 1 AMU MCA PYQ

Which of the following algorithms solves the all-pair shortest path problem?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

Floyd’s algorithm finds shortest path between all pairs.

Qus : 2 AMU MCA PYQ

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
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

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

Qus : 3 AMU MCA PYQ

The minimum number of nodes in an AVL tree of height 6 is

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

Minimum nodes follow Fibonacci relation:

$N(h)=N(h-1)+N(h-2)+1$

$N(6)=20$

Qus : 4 AMU MCA PYQ

Which one of the following statements is true regarding Array and Linked List?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

Array elements are stored contiguously. Linked list elements are not stored in adjacent memory.

Qus : 5 AMU MCA PYQ

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
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Binary search is used to find first and last occurrence ⇒ logarithmic comparisons.

Qus : 6 AMU MCA PYQ

Stacks cannot be used to:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

CPU allocation is done by OS scheduling, not stack.

Qus : 7 AMU MCA PYQ

Which of the following is not a collision resolution technique?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Hash addressing and chaining are collision resolution techniques. Indexing is not.

Qus : 8 AMU MCA PYQ

Which sequence represents a max heap?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Each parent node is greater than its children.

Qus : 9 AMU MCA PYQ

Which one of the following statements is not true regarding Doubly Linked List?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Doubly linked list can traverse both forward and backward.

Qus : 10 AMU MCA PYQ

Depth First Search is a technique for:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

DFS is used to traverse nodes of a graph.

Qus : 11 AMU MCA PYQ

Adjacency Matrix is used for:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Adjacency matrix is a method to represent graphs.

Qus : 12 AMU MCA PYQ

Data Mining can be used as a ………… tool.

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Data mining is mainly used as a research and analysis tool to discover patterns.

Qus : 13 AMU MCA PYQ

Sparse matrices have:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Sparse matrix contains mostly zero elements.

Qus : 14 AMU MCA PYQ

How many swapping will be required to sort the following list in increasing order using Bubble sort algorithm? $72,\ 12,\ 40,\ 5,\ 3,\ 4$

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Number of swaps in bubble sort = number of inversions. Total inversions = 13.

Qus : 15 AMU MCA PYQ

The maximum number of leaves in a binary tree of height $n$ are:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

In a binary tree, the maximum number of leaves at height $n$ is $2^n$.

Qus : 16 AMU MCA PYQ

What is the value of the postfix expression $6\ 9\ 3\ 2\ +\ -\ *\ ?$

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Stepwise evaluation: $3 + 2 = 5$ $9 - 5 = 4$ $6 \times 4 = 24$

Qus : 17 AMU MCA PYQ

Which of the following sorting method is stable?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Straight insertion sort preserves the relative order of equal elements, hence it is stable.

Qus : 18 AMU MCA PYQ

The time complexity of binary search algorithm is:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Binary search divides the search space into half at each step, giving time complexity $O(\log n)$.

Qus : 19 AMU MCA PYQ

In a Dequeue:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Deque (Double Ended Queue) allows insertion and deletion at both ends.

Qus : 20 AMU MCA PYQ

If we have six stack operations; pushing and popping each of $A$, $B$ and $C$ such that push$(A)$ must occur before push$(B)$ which must occur before push$(C)$, then $A,B,C$ is a possible order for the pop operations. Which one of the following orders could not be the order the pop operations are run, if we are to satisfy the requirements described above?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Push order: $A \rightarrow B \rightarrow C$ Valid pop orders must follow stack (LIFO) constraints. BAC cannot occur under stack rules with given push order.

Qus : 21 AMU MCA PYQ

You want to check whether a given set of items is sorted or not. Which sorting method will be most efficient if it is already sorted?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Insertion sort runs in O(n) for already sorted data.

Qus : 22 AMU MCA PYQ

What is the meaning of ‘Underflow’ in the context of data structure?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Underflow occurs when deletion is attempted on an empty data structure.

Qus : 23 AMU MCA PYQ

The average time complexity of quick sort algorithm is:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

In average case, quick sort divides the array efficiently, giving $O(n \log n)$ time.

Qus : 24 AMU MCA PYQ

The data structure needed to convert infix notations to postfix notations is:

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Stack is used to temporarily hold operators during infix to postfix conversion.

Qus : 25 AMU MCA PYQ

Which sorting method is best if number of swapping is only measure of efficiency?

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

Selection sort performs minimum swaps (n−1 swaps).

Qus : 26 AMU MCA PYQ

Maximum number of comparisons needed to sort 7 items using radix sort (each item 4-digit decimal):

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

Radix sort does not compare elements like comparison sort. Comparisons are not primary operation. Approx operations = digits × items = 4 × 7 = 28

Qus : 27 AMU MCA PYQ

A graph in which all nodes are of equal degree is called

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

If every vertex has the same degree, it is called a regular graph.

Qus : 28 AMU MCA PYQ

To sort many large objects or structures, it is most efficient to place

1
2
3
4
Go to Discussion

AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

Sorting pointers avoids copying large objects.

AMU MCA

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

AMU MCA

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Ask Your Question or Put Your Review.

Please provide more information - at least 10 characters

Feedback

Info.

Information

Aspire's Library

AMU MCA Previous Year Questions (PYQs)

AMU MCA Data Structures PYQ

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

AMU MCA

AMU MCA

Info.

Confirm Delete

Edit