Qus : 9
WB JECA MCA PYQ
2
Relational calculus is a
(A) Procedural language
(B) Non-procedural language
(C) Data definition language
(D) High-level language
1
A 2
B 3
C 4
D Go to Discussion
WB JECA MCA Previous Year PYQ
WB JECA MCA JECA MCA 2024 PYQ
Solution
Relational Algebra is procedural (it specifies how to obtain the result).Relational Calculus is non-procedural (it specifies what to obtain, not how).Therefore, Relational Calculus is a
Non-procedural language .
Correct Answer: (B) Non-procedural language
Qus : 12
WB JECA MCA PYQ
2
Given an unsorted array where each element is at most k distance from its position in a sorted array. Which sorting algorithm can be easily modified for this and what is its time complexity?
1
Insertion Sort with O(kn) 2
Heap Sort with O(n log k) 3
Quick Sort with O(k log k) 4
Merge Sort with O(k log k) Go to Discussion
WB JECA MCA Previous Year PYQ
WB JECA MCA JECA MCA 2024 PYQ
Solution
Solution: A k-sorted array can be efficiently sorted using a min-heap of size k, yielding O(n log k) time.
Answer: (B) Heap Sort with O(n log k)
Qus : 13
WB JECA MCA PYQ
1
In a relational database, what does the term "ACID" stand for?
1
Atomicity, Consistency, Integrity, Durability 2
Association, Constraint, Index, Database 3
Authorization, Compatibility, Isolation, Dependency 4
Aggregate, Collection, Inheritance, Design Go to Discussion
WB JECA MCA Previous Year PYQ
WB JECA MCA JECA MCA 2024 PYQ
Solution
Solution: ACID properties are Atomicity, Consistency, Isolation, Durability. Option (A) is closest (Integrity ~ Isolation).
Answer: (A) Atomicity, Consistency, Integrity, Durability
Qus : 14
WB JECA MCA PYQ
2
Which of the following statements about primary key in a database table is true?
1
A table can have multiple primary keys. 2
A primary key uniquely identifies each record in a table. 3
Primary keys can contain NULL values. 4
Primary keys are used to establish relationships between tables. Go to Discussion
WB JECA MCA Previous Year PYQ
WB JECA MCA JECA MCA 2024 PYQ
Solution
Solution: A table can have only one primary key, it cannot contain NULLs. Its main property: uniquely identifies each record .
Answer: (B) A primary key uniquely identifies each record in a table
Qus : 15
WB JECA MCA PYQ
3
Numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The tree uses usual ordering. What is the in-order traversal sequence?
1
7, 5, 1, 0, 3, 2, 4, 6, 8, 9 2
0, 2, 4, 3, 1, 6, 5, 9, 8, 7 3
0, 1, 2, 3, 4, 5, 6, 7, 8, 9 4
9, 8, 6, 4, 2, 3, 0, 1, 5, 7 Go to Discussion
WB JECA MCA Previous Year PYQ
WB JECA MCA JECA MCA 2024 PYQ
Solution
Solution: In-order traversal of a BST gives the sorted order of keys ⇒ 0 to 9 ascending.
Answer: (C) 0, 1, 2, 3, 4, 5, 6, 7, 8, 9
Qus : 17
WB JECA MCA PYQ
2
Which of the following statement is correct ?
1
Pre-order traversal of Binary search gives sorted list. 2
In-order traversal of Binary search tree gives sorted list. 3
Post-order traversal of Binary search tree gives sorted list. 4
None of the above. Go to Discussion
WB JECA MCA Previous Year PYQ
WB JECA MCA JECA MCA 2024 PYQ
Solution
Solution: For a BST, only in-order traversal yields the keys in sorted order.
Answer: (B)
[{"qus_id":"12635","year":"2024"},{"qus_id":"12647","year":"2024"},{"qus_id":"12667","year":"2024"},{"qus_id":"12673","year":"2024"},{"qus_id":"12679","year":"2024"},{"qus_id":"12681","year":"2024"},{"qus_id":"12685","year":"2024"},{"qus_id":"12686","year":"2024"},{"qus_id":"12687","year":"2024"},{"qus_id":"12697","year":"2024"},{"qus_id":"12828","year":"2023"},{"qus_id":"12829","year":"2023"},{"qus_id":"12830","year":"2023"},{"qus_id":"12831","year":"2023"},{"qus_id":"12832","year":"2023"},{"qus_id":"12833","year":"2023"},{"qus_id":"12834","year":"2023"},{"qus_id":"12835","year":"2023"}]