WB JECA MCA 2024 Previous Year Questions (PYQs) – Page 1 of 8
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations
Study Stuff for MCA Examinations
Showing 78 questions
What is the output of the following code snippet?
#include <stdio.h>
main() {
int x = 65, *p = &x;
void *q = p;
char *r = q;
printf("%c", *r);
}
(A) $A$
(B) $Z$
(C) $65$
(D) None of the above
1
2
3
4
Solution
Step 1: Initialization
$x = 65$
In ASCII, $65 \equiv A$
Step 2: Pointer flow
$p = \&x \;\; \rightarrow$ pointer to integer
$q = p \;\; \rightarrow$ void pointer
$r = q \;\; \rightarrow$ typecast to char pointer
Step 3: Dereferencing
Since r is char*, it reads 1 byte.
The value stored = $65$
Step 4: Printing
printf("%c", *r); prints character with ASCII $65$.
Hence, the output is:
$\; \boxed{A} \;$
Correct Answer: (A)
ROM is a
(A) Combinational Circuit
(B) Static Circuit
(C) Sequential Circuit
(D) Magnetic Circuit
1
2
3
4
Solution
- ROM (Read Only Memory) stores fixed data permanently.
- Its output depends only on the given input address.
- No clock or feedback is required, so it is not sequential.
- Hence, ROM is a Combinational Circuit.
Correct Answer: (A) Combinational Circuit
Each stage in pipelining should be completed within _________cycles.
(A) 1
(b) 2
(C) 3
(D) 4
1
2
3
4
Solution
- In pipelining, the CPU instruction is divided into stages (Fetch, Decode, Execute, etc.).
- To maximize throughput, each stage must complete within 1 clock cycle.
- This ensures that new instructions can enter the pipeline without delay.
Correct Answer: (A) 1
Relational calculus is a
(A) Procedural language
(B) Non-procedural language
(C) Data definition language
(D) High-level language
1
2
3
4
Solution
- Relational Algebra is procedural (it specifies how to obtain the result).
- Relational Calculus is non-procedural (it specifies what to obtain, not how).
Correct Answer: (B) Non-procedural language
How many parameters does a default constructor require ?
(A) 1
(B) 2
(C) 0
(D) 3
1
2
3
4
Solution
- A default constructor in C++ is a constructor that takes no arguments.
- It is invoked automatically when an object is created without passing parameters.
Correct Answer: (C) 0
An artificially intelligent car decreases its speed based on its distance from the car in front of it. Which method is used?
- (A) Naive Bayes
- (B) Decision Tree
- (C) Linear Regression
- (D) Logistic Regression
1
2
3
4
Solution
- The car’s speed is a continuous variable that depends on the distance from the car ahead.
- To model this relation, we need a method for predicting a continuous outcome.
Correct Answer: (C) Linear Regression
The keyword friend does not appear in
(A) the class allowing access to another class.
(B) the class desiring access to another class.
(C) the private section of a class.
(D) the public section of a class.
1
2
3
4
Solution
- The
friendkeyword is used inside a class definition to allow another class or function to access its private/protected members. - It appears in the class granting access (not the one desiring access).
- It can be declared in either public or private section of that class.
Correct Answer: (B) the class desiring access to another class
What is the maximum number of level-2 DFD possible if the number of
processes in level-1 DFD is n ?
(A) $\frac{n}{2}$
(B) 2
(C) $n^2$
(D) n
1
2
3
4
Solution
- In a Data Flow Diagram (DFD), each process in level-1 can be decomposed further into its own level-2 diagram.
Correct Answer: (D) $n$
The small extremely fast RAM's are termed as ______
(A) Heap
(B) Accumulators
(C) Stack
(D) Cache
1
2
3
4
Solution
- Heap → Memory area for dynamic allocation.
- Accumulator → Register in CPU for intermediate results.
- Stack → Memory area used for function calls and local variables.
- Cache → Small, high-speed RAM located close to the CPU, used to store frequently accessed data.
Correct Answer: (D) Cache
A computer with a 32 bit wide data bus uses 4k × 8 static RAM memory chips. The smallest memory this computer is
1
2
3
4
Solution
Each RAM chip = $4k \times 8 = 32k$ bits = 4 KB.
Bus width = 32 bits, each chip = 8 bits → need 4 chips in parallel.
Total memory = $4 \times 4$ KB = 16 KB.
Answer = (B) 16 kb
Bus width = 32 bits, each chip = 8 bits → need 4 chips in parallel.
Total memory = $4 \times 4$ KB = 16 KB.
Answer = (B) 16 kb
WB JECA MCA
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
WB JECA MCA
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
