WB JECA MCA 2023 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

WB JECA MCA
Previous Year Questions

WB JECA MCA
Previous Year Questions
WB JECA MCA

WB JECA MCA Previous Year Questions (PYQs)

WB JECA MCA 2023 PYQ

Qus : 1 WB JECA MCA PYQ 2023

Find out the wrong statement based on the characteristics of AVL tree data structure.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

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

Qus : 2 WB JECA MCA PYQ 2023

Example of non-linear data structure is __________.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

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

Qus : 3 WB JECA MCA PYQ 2023

Bubble sort algorithm has a worst-case time complexity of __________.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

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

Qus : 4 WB JECA MCA PYQ 2023

Insertion sort algorithm has a best-case time complexity of __________.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

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

Qus : 5 WB JECA MCA PYQ 2023

In machine learning, VC dimension is used to measure the capacity of a set of functions.

VC means __________.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

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

Qus : 6 WB JECA MCA PYQ 2023

Artificial Neural networks are __________ algorithms.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

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

Qus : 7 WB JECA MCA PYQ 2023

One-class SVM is __________ algorithm.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

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

Qus : 8 WB JECA MCA PYQ 2023

Time complexity of K-Means clustering is __________.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

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

Qus : 9 WB JECA MCA PYQ 2023

__________ algorithm is used to find out the shortest path between two points in a connected weighted graph.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

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

Qus : 10 WB JECA MCA PYQ 2023

Forward–backward algorithm is used in case of HMM to compute __________ of all hidden state variables.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

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

Qus : 11 WB JECA MCA PYQ 2023

HMM is a specific instance of CRF which is known as __________.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Hidden Markov Model (HMM) is a probabilistic model and can be seen as a special case of Conditional Random Fields (CRF).

Qus : 12 WB JECA MCA PYQ 2023

In FP-Growth Algorithm, FP means __________

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

In FP-Growth, FP stands for Frequent Pattern, used in association rule mining.

Qus : 13 WB JECA MCA PYQ 2023

In software engineering, what is the full form for PERT chart?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Program Evaluation and Review Technique

Qus : 14 WB JECA MCA PYQ 2023

In software engineering, the testing performed by development team is known as ______.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Alpha testing is performed internally by the development team before releasing the software for beta testing.

Qus : 15 WB JECA MCA PYQ 2023

In software engineering, a prototyping model can be used when __________.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Technical solutions are unclear to the development team

Qus : 16 WB JECA MCA PYQ 2023

60.In classical waterfall model, which phase comes before the design phase?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Requirements analysis and specification

Qus : 17 WB JECA MCA PYQ 2023

In software engineering, which of the following is not a type of cohesion?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Projection” is not a type of cohesion.

Qus : 18 WB JECA MCA PYQ 2023

In software engineering, which of the following is not a type of coupling?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Coupling types are Data, Stamp, Control, Common, Content.
“Connection” is not a coupling type.

Qus : 19 WB JECA MCA PYQ 2023

Choose the correct option as the activities of the first quadrant of Spiral model.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Determine objectives, alternatives and constraints

Qus : 20 WB JECA MCA PYQ 2023

Choose the appropriate black-box testing technique in software engineering.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Boundary Value Analysis (BVA) is a black-box testing technique used to check inputs at their boundary values.

Qus : 21 WB JECA MCA PYQ 2023

In User Datagram packet format, the size of the header is ________.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

The UDP header is 8 bytes (64 bits) long — containing source port, destination port, length, and checksum.

Qus : 22 WB JECA MCA PYQ 2023

Transmission Control Protocol (TCP) offers __________ service in which data can flow in both directions at the same time.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

TCP provides a full-duplex service — meaning data can flow simultaneously in both directions.

Qus : 23 WB JECA MCA PYQ 2023

Example of a two-layer switch is ____________.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

A bridge operates at Layer 2 (Data Link Layer) and is considered a two-layer switch.

Qus : 24 WB JECA MCA PYQ 2023

A ____________ routing table contains information entered manually.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

A static routing table is manually configured by the administrator.

Qus : 25 WB JECA MCA PYQ 2023

BOOTP is ____________ layer protocol.
(A) application
(B) physical
(C) network
(D) datalink

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

BOOTP (Bootstrap Protocol) works at the application layer of the OSI model.

Qus : 26 WB JECA MCA PYQ 2023

ICMP always reports error messages to the original ____________.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

ICMP error messages are always sent back to the source of the packet.

Qus : 27 WB JECA MCA PYQ 2023

The ____________ program uses ICMP messages and TTL field in IP packet to find route.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

traceroute uses ICMP Echo and TTL fields to determine the route to a destination.

Qus : 28 WB JECA MCA PYQ 2023

SNMP is ____________ level protocol.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

SNMP (Simple Network Management Protocol) is an application layer protocol.

Qus : 29 WB JECA MCA PYQ 2023

Which key can be derived directly from a Super Key?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

A Candidate Key is derived from a Super Key, and then one candidate key is chosen as the Primary Key.

Qus : 30 WB JECA MCA PYQ 2023

Relational Algebra is ____________ query language.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Relational Algebra is a procedural query language because it specifies the operations to obtain the result.

Qus : 31 WB JECA MCA PYQ 2023

In case of union compatibility, ____________

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

For union compatibility, two relations must have the same set of attributes and domains.

Qus : 32 WB JECA MCA PYQ 2023

Which option cannot be used with “ALTER table” command in SQL ?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

ALTER TABLE can ADD, MODIFY, and DROP columns, but DELETE is a DML operation, not part of ALTER.

Qus : 33 WB JECA MCA PYQ 2023

Third normal form (3NF) removes ____________ from a relation.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

3NF eliminates transitive dependencies.

Qus : 34 WB JECA MCA PYQ 2023

Which option is not a step for query processing ?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Metadata organization is not a query processing step.

Qus : 35 WB JECA MCA PYQ 2023

Which of the following option is not a transaction state ?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Transaction states are Active, Partially committed, Failed, Aborted, Terminated. There is no "Updated" state.

Qus : 36 WB JECA MCA PYQ 2023

Which of the following option does not have any partial functional dependencies ?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

2NF removes partial dependency.

Qus : 37 WB JECA MCA PYQ 2023

What is the output of the following program ?

#include void main ( )

{

int a = 40; float b;

b = ++a;

printf(“%d, %f ”, a, ++b);

}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Qus : 38 WB JECA MCA PYQ 2023

What is the output of the following C program?

#include <stdio.h>
void main(){
  int a = -7;
  float b;
  b = a++;
  printf("%d, %f ", a, ++b);
}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: The statement b = a++; assigns the current value of a (−7) to b and then increments a to −6. Later, ++b increments b from −7 to −6 before printing. $$ a = -6,\quad b = -6.000000 $$

Qus : 39 WB JECA MCA PYQ 2023

What is the output?

#include <stdio.h>
void main(){
  int i = -1;
  printf("sizeof(i) = %d", sizeof(i));
}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: The operator sizeof gives the size of the type in bytes, not the value. On most 32-bit and 64-bit systems, sizeof(int) is 4. $$ \text{Output: } \texttt{sizeof(i) = 4} $$

Qus : 40 WB JECA MCA PYQ 2023

What is the output?

#include <stdio.h>
void main(){
  int x = -1, y = 1, z = 0;
  if(x && y++ && z)
    ++x, y++, --z;
  printf("%d, %d, %d", x++, y++, z++);
}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: In the condition x && y++ && z, since z = 0, the logical AND short-circuits and the body of the if is not executed. However, y++ is evaluated before the short-circuit, so y becomes 2. Values before printing: $$ x = -1,\ y = 2,\ z = 0 $$ So the program prints: $$ (-1,\ 2,\ 0) $$

Qus : 41 WB JECA MCA PYQ 2023

What is the output?

#include <stdio.h>
enum colors{RED, BROWN, ORANGE};
void main(){
  printf("%ld..%f..%d", RED, BROWN, ORANGE);
}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: The format specifiers do not match the data types (%f is used for int). This causes undefined behavior. The program may compile, but the output is not reliable. Correct choice: None of these.

Qus : 42 WB JECA MCA PYQ 2023

What is the output?

#include <stdio.h>
void main(){
  char M = 'M';
  printf("%d, %c", M, M);
}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: The character 'M' has an ASCII value of 77. So printing with %d shows 77, and %c shows M. $$ \text{Output: } 77,\ M $$

Qus : 43 WB JECA MCA PYQ 2023

What is the output?

#include <stdio.h>
void main(){
  int i = -9;
  printf("%d %d %d", i++, ++i, ++i);
}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Ek hi expression me variable i par multiple modifications → C standard me undefined behavior.
Isliye koi fixed output/compile error guarantee nahi. Sahi option: None of these.

Qus : 44 WB JECA MCA PYQ 2023

What is the output?

#include <stdio.h>
void main(){
  int **ptr;
  int temp = 65;
  ptr[0] = &temp;
  printf("%d", ptr[0][0]);
}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: The pointer ptr is uninitialized, so it does not point to valid memory. When the code tries to access ptr[0], it attempts to dereference an invalid location. This leads to undefined behavior, and in most cases results in a segmentation fault.

Qus : 45 WB JECA MCA PYQ 2023

What is the output?

#include <stdio.h>
#include <stdlib.h>
void main(){
  int *ptr;
  ptr = (int*) calloc(3, sizeof(int));
  ptr[2] = 30;
  printf("%d", *ptr);
  free(ptr);
}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: The function calloc initializes all allocated memory blocks with zero. So ptr[0] is initialized to 0. The statement *ptr is equivalent to ptr[0]. $$ \text{Output: } 0 $$

Qus : 46 WB JECA MCA PYQ 2023

__________ interrupt may happen due to power failure.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Power failure ⇒ Hardware interrupt.

Qus : 47 WB JECA MCA PYQ 2023

11. Address of the next instruction to be executed is specified by ______________.

(A) MBR (B) MAR (C) PSW (D) PC

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: The Program Counter (PC) holds the address of the next instruction to be fetched and executed.

Qus : 48 WB JECA MCA PYQ 2023

12. Auxiliary memory is also known as ______________ memory.

(A) Primary (B) Secondary (C) Binary (D) Quad

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: Auxiliary storage refers to secondary memory (e.g., HDD, SSD, tapes) used for non-volatile, large-capacity storage.

Qus : 49 WB JECA MCA PYQ 2023

13. BIOS means ______________.

(A) basic input/output system (B) best input/output system (C) basic input system (D) basic output system

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: BIOS stands for Basic Input/Output System, firmware that initializes hardware and starts the boot process.

Qus : 50 WB JECA MCA PYQ 2023

14. _________ is the most appropriate scheduling in case of a time-shared operating system.

(A) FCFS (B) RR (C) SJF (D) SRTF

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: Time-sharing systems aim for responsiveness and fairness, which is best provided by Round Robin (RR) using time quanta.

Qus : 51 WB JECA MCA PYQ 2023

15. If only one process can be able to access a particular resource at a time, then it is known as ______________.

(A) Mutual execution (B) Mutual exclusion (C) Multiple execution (D) Multiple exclusion

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: Allowing only one process to access a resource at a time is called mutual exclusion (mutex).

Qus : 52 WB JECA MCA PYQ 2023

16. Resource allocation graph is used to represent ______________.

(A) deadlock (B) virtual memory (C) main memory (D) scheduling

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: Resource Allocation Graph (RAG) models processes and resources; cycles in certain cases indicate deadlock.

Qus : 53 WB JECA MCA PYQ 2023

17. Banker’s algorithm for resource allocation deals with ______________.

(A) mutual exclusion (B) mutual inclusion (C) deadlock recovery (D) deadlock avoidance

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: Banker’s algorithm is a deadlock avoidance algorithm ensuring the system stays in a safe state.

Qus : 54 WB JECA MCA PYQ 2023

18. Page fault means ______________.

(A) required page is available in main memory (B) required page is not available in main memory (C) segment number (D) reduce page I/O

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: A page fault occurs when the referenced page is not present in main memory, forcing a page-in from secondary storage.

Qus : 55 WB JECA MCA PYQ 2023

19. ___________ is a technique to move a process from main memory to secondary memory.

(A) Deadlock (B) Synchronization (C) Caching (D) Swapping

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: Swapping transfers processes between main memory and secondary storage to manage memory pressure.

Qus : 56 WB JECA MCA PYQ 2023

20. Demand paging is considered as ______________.

(A) fetching a page when not needed (B) switching between two processes (C) fetching a page only when needed (D) switching between two threads

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: In demand paging, a page is loaded into memory only when it is actually referenced.

Qus : 57 WB JECA MCA PYQ 2023

21. Thrashing means a condition having ______________.

(A) minimum paging (B) optimized paging (C) synchronized paging (D) excessive paging

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: Thrashing occurs when the system spends most time paging due to insufficient frames, causing excessive paging and poor performance.

Qus : 58 WB JECA MCA PYQ 2023

22. A counting semaphore is initialized to 15. Then, 4 wait operations and 2 signal operations are completed on this semaphore. The resulting value of the semaphore is ____________.

(A) 11 (B) 13 (C) 17 (D) 19

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: Each wait (P) decrements; each signal (V) increments. Initial: 15 → after 4 waits: 11 → after 2 signals: 13. $$ 15 - 4 + 2 = 13 $$

Qus : 59 WB JECA MCA PYQ 2023

23. What do you mean by fork()? Choose the correct option.

(A) Starvation (B) Creation of new task (C) Demand paging (D) Semaphore

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: fork() creates a new process (child) as a copy of the calling process.

Qus : 60 WB JECA MCA PYQ 2023

24. In file management, FAT means ______________.

(A) Feature Access Table (B) File Access Table (C) Fault Allocation Table (D) File Allocation Table

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation: FAT stands for File Allocation Table, a file system layout used to map files to disk clusters.

Qus : 61 WB JECA MCA PYQ 2023

25.What is the output of the following program ? include <iostream> using namespace std; int addition (int a, int b) { return a+b; } double addition (double a, double b) { return a+b; } int main () { cout<< addition (35,20) << “;”; cout<< addition (34.1,12.7); return 0; }

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

The given program defines two overloaded functions `addition`:

1. `int addition(int a, int b)` → returns integer sum

2. `double addition(double a, double b)` → returns double sum

In `main()`:

- `addition(35,20)` calls the integer version → 35 + 20 = 55

- `addition(34.1,12.7)` calls the double version → 34.1 + 12.7 = 46.8

Therefore, the output is:

55;46.8

Qus : 62 WB JECA MCA PYQ 2023

26.What is the output of the following program ? #include <iostream> using namespace std; template <class C1, class C2> bool is_equal (C1 var1, C2 var2) { return (var1 = = var2); } int main () { if (is_equal(10,10.0)) cout<< “Equal”; else cout<< “Not equal”; return 0; }

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

The function `is_equal` is a template that compares two variables of possibly different types.

In `main()`, we call `is_equal(10, 10.0)`.

- `10` is an integer (int).

- `10.0` is a double.

C++ allows implicit type conversion during comparison.

So, `10 == 10.0` evaluates to `true`.

Therefore, the condition in the `if` statement is true, and the output will be:

Equal

Qus : 63 WB JECA MCA PYQ 2023

26.What is the output of the following program ?

#include <iostream>

using namespace std;

int main()

{

int var = 0;

while (var < 10)

{

cout << var << " ";

var++;

}

cout << var;

return 0;

}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Output:

0 1 2 3 4 5 6 7 8 9 10

Explanation:

The variable var starts at 0.
The while (var < 10) loop prints 0 1 2 3 4 5 6 7 8 9 with spaces.
When var reaches 10, the loop stops.
After the loop, cout << var; prints 10.

Final output:
```
0 1 2 3 4 5 6 7 8 9 10
```

Qus : 64 WB JECA MCA PYQ 2023

What is the output of the following program ?

#include <iostream>

using namespace std;

struct demo

{

int var;

};

int main()

{

demo str;

demo *ptr;

str.var = 100;

ptr = &str;

cout << ptr->var;

return 0;

}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Output:

100

Explanation:

str.var = 100; assigns 100 to the structure variable.

ptr = &str; makes the pointer point to str.

ptr->var accesses the member var of structure str via pointer.

Hence it prints 100.

Qus : 65 WB JECA MCA PYQ 2023

29.What is the output of the following program ?

#include <iostream>

using namespace std;

int main ()

{

int c1 = 10;

int c2 = 20;

{

int c1;

c1 = 50;

c2 = 50;

cout << "c1= " << c1 << ", c2=" << c2;

}

cout << ", c1= " << c1 << ", c2=" << c2;

return 0;

}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Output:
c1= 50, c2=50, c1= 10, c2=50
Explanation:

Outer c1 = 10, c2 = 20.

Inside the inner block, a new local c1 is declared (shadowing outer c1).

Inner c1 = 50, and c2 (outer one) is updated to 50.

First cout prints → c1= 50, c2=50.

After the block ends, inner c1 is destroyed. Outer c1 remains 10, while outer c2 is 50.

Second cout prints → , c1= 10, c2=50.

? Final output: c1= 50, c2=50, c1= 10, c2=50.

Qus : 66 WB JECA MCA PYQ 2023

30.What is the output of the following program ?

#include <iostream>

using namespace std;

class Demo {

public:

static int count;

Demo() { count++; }

};

int Demo::count = 0;

int main() {

Demo var1;

Demo var2[5];

cout << var1.count;

return 0;

}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation:
- int Demo::count = 0; initializes the static variable count to 0.
- Demo var1; → constructor is called once → count = 1.
- Demo var2[5]; → constructor is called 5 times (for each element in the array) → count = 6.
- Since count is static, it is shared among all objects.
- Finally, cout << var1.count; prints 6.
? Correct answer: (A) 6 ✅

Qus : 67 WB JECA MCA PYQ 2023

31.What is the output of the following program ?

#include <iostream>

using namespace std;

void print();

int main()

{

int var = 0;

var = print();

cout << var;

return 0;

}

void print()

{

cout << "Hi";

}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation:
- print() is declared as void print().
- In main(), the statement var = print(); tries to assign the return value of print() to an int variable.
- But since print() has no return value (void), this causes a compile-time error.
Hence, the program does not compile.

Qus : 68 WB JECA MCA PYQ 2023

32.What is the output of the following program ?

#include <iostream>

using namespace std;

int main()

{

int var = 2;

{

cout << var;

} while (var--);

return 0;

}

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Explanation:
- Initially var = 2.
- First iteration: prints 2, then var-- makes var = 1.
- Second iteration: prints 1, then var-- makes var = 0.
- Third iteration: prints 0, then var-- makes var = -1. Condition fails and loop exits.
So output is:

Qus : 69 WB JECA MCA PYQ 2023

33.In shell script, which command is used to create a new directory ?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

mkdir is the command to create a new directory in Unix/Linux.

Qus : 70 WB JECA MCA PYQ 2023

34.In shell script, which command is used to copy a file?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

cp is used to copy files or directories in Unix/Linux.

Qus : 71 WB JECA MCA PYQ 2023

35.In shell script, which command is used to delete a file?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

rm is the command to remove/delete files in Unix/Linux.

Qus : 72 WB JECA MCA PYQ 2023

36.In Unix/Linux platform, which command is used to find out the difference between two files?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

diff compares two files line by line and shows differences.

Qus : 73 WB JECA MCA PYQ 2023

37.In Unix/Linux platform, which command is used to create a symbolic link?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

ln -s is used to create symbolic (soft) links in Linux.

Qus : 74 WB JECA MCA PYQ 2023

38.In Unix/Linux platform, which command is used to view the inode number of a file?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

ls -i displays the inode number of each file.

Qus : 75 WB JECA MCA PYQ 2023

39.In Unix/Linux platform, which command is used to specify the access mode for files?

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

chmod is used to change file permissions (read/write/execute).

Qus : 76 WB JECA MCA PYQ 2023

40.In Unix/Linux platform, ______ command is used to show current running processes.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

ps shows the list of currently running processes.

Qus : 77 WB JECA MCA PYQ 2023

41.In singly linked list, the time complexity for insertion at a particular node is:

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Insertion after a given node in a linked list takes constant time O(1) (if pointer to that node is already available).

Qus : 78 WB JECA MCA PYQ 2023

42.In stack data structure, __________ operation is not permitted.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Enqueue is a queue operation, not allowed in stack.

Qus : 79 WB JECA MCA PYQ 2023

43.In tree data structure, the in-degree of root node is always __________.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

The root node has no incoming edges, so its in-degree is always 0.

Qus : 80 WB JECA MCA PYQ 2023

44.In binary tree data structure, using depth-first approach, preorder traversal means _______.

1
2
3
4
Go to Discussion

WB JECA MCA Previous Year PYQ WB JECA MCA JECA MCA 2023 PYQ

Solution

Preorder traversal visits root first, then left subtree, then right subtree.

WB JECA MCA

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

Click Here to
View More

WB JECA 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

WB JECA MCA Previous Year Questions (PYQs)

WB JECA MCA 2023 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

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

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution