JECA 2022 Question Paper – 90+ Sample Questions Exposed

100 Sample Questions for JECA 2022

These are the most probable questions of JECA 2022. Please go through these questions and secure your career. Try to solve it on your own.

Question 1

Question 2

Question 3

Question 4

Question 5

Question 6

Question 7

Question 8

Question 9

100 C Questions

Question 10

Question 11

Question 12

Question 13

Question 14

Question 15

Question 16

Question 17

Question 18

Question 19

Cognizant Solutions | CodeGladiators Solutions

Solution 1

Solution 2

Question 20

Question 21

Question 22

Question 23

Question 24

Question 25

Question 26

Question 27

Question 28

Question 29

Cognizant Solutions | Automata Fixing

Automata Fixing 1

Automata Fixing 2

Automata Fixing 3

Automata Fixing 4

Automata Fixing 5

Automata Fixing 6

Question 30

Question 31

Question 32

Question 33

Question 34

Question 35

Question 36

Question 37

Question 38

Question 39

Aptitude 1

Question 40

Question 41

Question 42

Question 43

Question 44

Question 45

Question 46

Question 47

Question 48

Question 49

C Interview Questions

String Programs in C

Question 50

Question 51

Question 52

Question 53

Question 54

Question 55

Question 56

Question 57

Question 58

Question 59

Python I

Python II

Python III

Question 60

Question 61

Question 62

Question 63

Question 64

Question 65

Question 66

Question 67

Question 68

Question 69

JAVA Topic 1

JAVA Topic 2

JAVA Topic 3

Question 70

Question 71

Question 72

Question 73

Question 74

Question 75

Question 76

Question 77

Question 78

Question 79

Question 80

Question 81

Question 82

Question 83

Question 84

Question 85

Question 86

Question 87

Question 88

Question 89

Wipro Previous Year Questions

Question 90

Question 91

Question 92

Question 93

Question 94

Question 95

Question 96

Question 97

Question 98

Question 99

Question 100

100 Sample Questions for JECA 2022

These are the most probable questions of JECA 2022. Please go through these questions and secure your career. Try to solve it on your own.

What is the output of the following program?

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

(A) Compiler error(B) 5,5(C) 4,5(D) 5,4

What is the output of the following program?

#include<stdio.h>#define I charvoid main() { I i = 65; printf(“sizeof(i) = %d”, sizeof(i));}

(A) Compiler Error(B) sizeofi) =1(C) sizeofi) = 65(D) sizeof(i) = 66

What is the output of the following program?

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

(A) 0..0(B) 0..1(C) 1..1(D) 1..0

What is the output of the following program?

#include <stdio.h>enum colors {BLACK, BLUE, CYAN):void main () { printf (“%d.%d.%d”, BLACK, BLUE, CYAN);}

(A) BLACK, BLUE, CYAN(B) 0.0.0(C) 0.1.2(D) No output

What is the output of the following program?

#include <stdio.h>void main () { char xy=0; for(;xy>0;xy++); printf(“%d\n”, xy);}

(A) 2(B) 0(C) Compiler error(D) 1

What is the output of the following program?

#include<stdio.h>void main() { int *j; { int i = 1000; j=&i; } printf(“%d”,*j);}

(A) 1000(B) 0(C) Garbage Value(D) Compiler error

Which of the following statement immediately terminates the execution of a loop?

(A) else(B) break(C) return(D) goto

An unrestricted use of the “goto” statement is harmful because ____.

(A) it is difficult to verify program(B) memory requirement is increased(C) it increases execution time of the program(D) compiler generates longer machine code

In object oriented programming, inheritance is a technique to ____.

(A) pass arguments and improve data hiding(B) pass arguments and add features to existing classes without rewriting them(C) automatically acquire features from its parent object(D) improve data hiding and encapsulation

In object oriented programming, the visibility mode by default is _____.

(A) public(B) private(C) protected(D) anywhere

Which statement is false based on the concept of object-oriented programming?

(A) Method overloading is an example of compile-time polymorphism(B) Method overriding is an example of runtime polymorphism(C) Derived class does not need a derived class.(D) Object oriented prgramming supports inheritance.

Method overloading in respect of object oriented programming is _____.

(A) overloading without argument passing(B) overloading the method that has same name but different parameters(C) a feature in which multiple functions with different names and same(D) not possible parameters

In object-oriented programming, _____ can be declared in a class template.

(A) global data members(B) constant data members(C) static data members(D) statistical data members

In object oriented programming, same function or object behaves different in different situations. It is known as _____.

(A) inheritance(B) polymorphism(C) memory addressing (D) encapsulation

Which of the following class constructor will be invoked first in object oriented programming?

(A) Base class(B) Virtual base class(C) Abstract class(D) Derived class

In object-oriented programming, public members of a base class become protected member of derived class. The situation happens in _____.

(A) Virtual inheritance(B) Protected inheritance(C) Private inheritance(D) Public inheritance

In unix/linux platform, which vi editor command copies the curent line of the file?

(A) yy(B) yw(C) yc(D) zz

In unix/linux platform, which command is used to delete a line in vi editor?

(A) P(B) dd(C) x(D) q

In unix/linux platform, which set is correct to move cursor within vi editor?

Cognizant Solutions | CodeGladiators Solutions​

In unix/linux platform, which command is used to see path of the working directory?

(A) ls(B) dir(C) vi(D) pwd

In unix/linux platform, which command is used to view the first n number of lines of a particular file (consider the file name is “filename”)?

(A) head -n filename(B) tail-n filename(C) head -n -tail filename(D) top-n filename

In unix/linux platform, which command is used to search for a pattern within a file?

(A) cd(B) cp(C) paste(D) grep

In unix/linux platform, hidden file can be viewed using ____.

(A) ls -a(B) ls -l(C) ls -h(D) ls -k

In unix/linux platform, what is the output of the following command (consider the file name is “filename”)?grep-y ‘hello’ filename

(A) show the current directory(B) show the patterm ignoring case(C) show the lines which don’t match with the pattern(D) show the line numbers at the time of result

In shell script, what is the output of the following program?counter=1while [$counter -le 10]do echo $counter ((counter++))done

(A) lists all the numbers from 1 to 10(B) lists all the odd numbers from 1 to 10(C) lists all the even numbers from 1 to 10(D) lists only the 10th position number

Stack is a ____ in data structure concept.

(A) basic data type(B) derived data type(C) float data type(D) char data type

In data structure, the stack is a linear type of data structure in which data is stored and retrieved in a ____ manner.

(A) No out only in(B) Last in First out(C) First in First out(D) Last out Last in

In bubble sort algorithm, worst case time complexity is ____ considering ‘n’ is the number of elements.

(A) O(1)(B) O(n^2)(C) O(n)(D) O(nlogn)

In data structure, a binary tree with ‘n’ nodes has ____.

(A) n edges(B) n+1 edges(C) n-1 edges(D) n-2 edges

Cognizant Solutions | Automata Fixing

Merge sort follows ____ in data structure.

(A) divide and conquer strategy(B) back tracking approach(C) heuristic search(D) greedy approach

In data structure, maximum degree of a vertex in a typical graph with ‘n’ vertices 1s ____.

(A) n(B) n-1(C) n+1(D) 2n-1

In data structure, a graph is represented as a pair of sets (V, E), where ____.

(A) V is the set of variables and E is the set of edges(B) V is the set of vertices and E is the set of edges(C) V is the set of vertices and E is the set of elements(D) V is the set of variables and E is the set of elements

In binary search tree data structure, in-order traversal means the nodes are being searched in ____ order.

(A) left child node – right child node – root node(B) right child node – root node – left child node(C) root node – right ehild node – left child node(D) left child node – root node – right child node

Queue data structure can be utilized for ____ implementation.

(A) radix sort(B) quick sort(C) recursion(D) depth first search

The handware device used for direct memory access is known as ____.

(A) DMA schedular(B) DMA controller(C) DMA disk(D) DMA monitor

Hit ratio means ____.

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

(A) Compiler error
(B) 5,5
(C) 4,5
(D) 5,4

#include<stdio.h>
#define I char
void main() {
I i = 65;
printf(“sizeof(i) = %d”, sizeof(i));
}

(A) Compiler Error
(B) sizeofi) =1
(C) sizeofi) = 65
(D) sizeof(i) = 66

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

(A) 0..0
(B) 0..1
(C) 1..1
(D) 1..0

#include <stdio.h>
enum colors {BLACK, BLUE, CYAN):
void main () {
printf (“%d.%d.%d”, BLACK, BLUE, CYAN);
}

(A) BLACK, BLUE, CYAN
(B) 0.0.0
(C) 0.1.2
(D) No output

#include <stdio.h>
void main () {
char xy=0;
for(;xy>0;xy++);
printf(“%d\n”, xy);
}

(A) 2
(B) 0
(C) Compiler error
(D) 1

#include<stdio.h>
void main() {
int j;
{
int i = 1000;
j=&i;
}
printf(“%d”,j);
}

(A) 1000
(B) 0
(C) Garbage Value
(D) Compiler error

(A) else
(B) break
(C) return
(D) goto

(A) it is difficult to verify program
(B) memory requirement is increased
(C) it increases execution time of the program
(D) compiler generates longer machine code

(A) pass arguments and improve data hiding
(B) pass arguments and add features to existing classes without rewriting them
(C) automatically acquire features from its parent object
(D) improve data hiding and encapsulation

(A) public
(B) private
(C) protected
(D) anywhere

(A) Method overloading is an example of compile-time polymorphism
(B) Method overriding is an example of runtime polymorphism
(C) Derived class does not need a derived class.
(D) Object oriented prgramming supports inheritance.

(A) overloading without argument passing
(B) overloading the method that has same name but different parameters
(C) a feature in which multiple functions with different names and same
(D) not possible parameters

(A) global data members
(B) constant data members
(C) static data members
(D) statistical data members

(A) inheritance
(B) polymorphism
(C) memory addressing
(D) encapsulation

(A) Base class
(B) Virtual base class
(C) Abstract class
(D) Derived class

(A) Virtual inheritance
(B) Protected inheritance
(C) Private inheritance
(D) Public inheritance

(A) yy
(B) yw
(C) yc
(D) zz

(A) P
(B) dd
(C) x
(D) q

Cognizant Solutions | CodeGladiators Solutions

(A) ls
(B) dir
(C) vi
(D) pwd

(A) head -n filename
(B) tail-n filename
(C) head -n -tail filename
(D) top-n filename

(A) cd
(B) cp
(C) paste
(D) grep

(A) ls -a
(B) ls -l
(C) ls -h
(D) ls -k

In unix/linux platform, what is the output of the following command (consider the file name is “filename”)?
grep-y ‘hello’ filename

(A) show the current directory
(B) show the patterm ignoring case
(C) show the lines which don’t match with the pattern
(D) show the line numbers at the time of result

In shell script, what is the output of the following program?
counter=1
while [$counter -le 10]
do
echo $counter
((counter++))
done

(A) lists all the numbers from 1 to 10
(B) lists all the odd numbers from 1 to 10
(C) lists all the even numbers from 1 to 10
(D) lists only the 10th position number

(A) basic data type
(B) derived data type
(C) float data type
(D) char data type

(A) No out only in
(B) Last in First out
(C) First in First out
(D) Last out Last in

(A) O(1)
(B) O(n^2)
(C) O(n)
(D) O(nlogn)

(A) n edges
(B) n+1 edges
(C) n-1 edges
(D) n-2 edges

(A) divide and conquer strategy
(B) back tracking approach
(C) heuristic search
(D) greedy approach

(A) n
(B) n-1
(C) n+1
(D) 2n-1

(A) V is the set of variables and E is the set of edges
(B) V is the set of vertices and E is the set of edges
(C) V is the set of vertices and E is the set of elements
(D) V is the set of variables and E is the set of elements

(A) left child node – right child node – root node
(B) right child node – root node – left child node
(C) root node – right ehild node – left child node
(D) left child node – root node – right child node

(A) radix sort
(B) quick sort
(C) recursion
(D) depth first search

(A) DMA schedular
(B) DMA controller
(C) DMA disk
(D) DMA monitor

(A) [number of hit / (number of hit +number of mis)]
(B) [number of miss / (number of hit + number of miss)]
(C) a negative value based on specific software
(D) a negative value based on specific hardware

(A) schedhuler
(B) interrupt
(C) deadlock
(D) virtual memory

(A) viral
(B) non-preemptive
(C) preemptive
(D) multi-layer

(A) fragmentation
(B) process scheduling
(C) process synchronization
(D) deadlock

(A) spawning
(B) processing
(C) killing
(D) switching

(A) FIFO
(B) LRU
(C) LFU
(D) NRU

(A) Heavy Weight Process
(B) Light Weight Process
(C) Process
(D) Program

(A) cache
(B) DMA
(C) synchronization
(D) disk

(A) CPU
(B) memory
(C) disk
(D) process

(A) Mutual exclusion
(B) Deadlock recovery
(C) Deadlock avoidance
(D) Cache allocation

(A) starvation
(B) greedy allocation
(C) unsafe state
(D) safe state

(A) process
(B) CPU
(C) memory
(D) disk

(A) Transition File Transfer Protocol
(B) Transport File Transfer Protocol
(C) Trimmed File Transfer Protocol
(D) Trivial File Transfer Protocol

(A) Simplex Gateway Monitoring Protocol
(B) Simplex Gateway Memory Protocol
(C) Simple Gateway Monitoring Protocol
(D) Simple Gateway Memory Protocol

(A) monitoring protocol
(B) communication protocol
(C) visibility protocol
(D) chaos protocol

(A) simplex
(B) half duplex
(C) multiplex
(D) full duplex

(A) logical link control
(B) logistic link control
(C) length-wise link control
(D) layer link control

(A) application
(B) network
(C) session
(D) transport

(A) Address Resolution Protocol
(B) Reverse Address Resolution Protocol
(C) Simple Network Management Protocol
(D) Simple Mail Transfer Protocol

(A) Application
(B) Presentation
(C) Session
(D) Data link

(A) 241.44.20.131
(B) 243.42.20.135
(C) 243.44.20.131
(D) 243.44.20.135

(A) Address
(B) Birth date
(C) Phone number
(D) Age

(A) One column
(B) Two columns
(C) One row
(D) Two rows

(A) Selection
(B) Projection
(C) Rename
(D) Join

(A) maximize
(B) minimize
(C) average
(D) diffuse