WB JECA MCA Computer Previous Year Questions (PYQs) – Page 1 of 16

 AVL trees guarantee O(log n) search time, not O(n).

Graphs and trees are non-linear data structures, while linked-list, queue, and stack are linear.

Graphs and trees are non-linear data structures, while linked-list, queue, and stack are linear.

Insertion sort runs in O(n) time when the array is already sorted (best case).

VC dimension stands for Vapnik–Chervonenkis dimension, a measure of model capacity/complexity.

Artificial Neural Networks (ANNs) are computational algorithms inspired by biological neural networks.

One-class SVM is mainly used for anomaly/outlier detection, which falls under unsupervised learning.

For K-Means, the time complexity per iteration is O(kN), where k = number of clusters and N = number of data points.

Kruskal’s algorithm (and Prim’s) are used in shortest path/minimum spanning tree problems.

The forward–backward algorithm in Hidden Markov Models (HMM) is used to compute posterior marginals over hidden states.