wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Roll-a-coaster

Total questions: 30

Worksheet time: 22mins

Name
Class
Date
1.

Which company hires through STEP intern program?

a)

Microsoft

b)

Salseforce

c)

Google

d)

Oracle

2.

Which educational platform hires interns as "Technical Content Writter"?

a)

Leetcode

b)

GeeksforGeeks

c)

Javatpoint

d)

Work@Tech

3.

Which company hires through NQT?

a)

Infosys

b)

Wipro

c)

Cognizant

d)

TCS

4.

Full form of STEP in "STEP intern"?

a)

Student Training in Engineering Program

b)

Schedule Training of Engineers Portal

c)

Senior Technical Engineering Program

d)

Student Test in Engineering Process

5.

What is full form of "NQT"?

a)

National Quality Test

b)

National Qualify Test

c)

National Quest Test

d)

National Qualifier Test

6.

Which is a competitive coding platform ?

a)

GeeksforGeeks

b)

Javatpoint

c)

Codeforces

d)

Leetcode

7.

Full Form of ICPC challenge?

a)

International Collegiate Programming Contest

b)

Inter Collegiate Programming Contest

c)

International College Programming Contest

d)

International Collegite Programming Contest

8.

Which one of the following is a fintech company?

a)

Verizon

b)

HighRadius

c)

Atlassian

d)

Google

9.

When GSOC begins?

a)

April - May

b)

May - June

c)

June - July

d)

Aug - Sept

10.

Which are the Cloud Computing companies?

a)

AWS

b)

Microsoft Azure

c)

Capegemini

d)

Yahoo

11.

What is the best way to answer why should we hire you?

a)

I have good knowledge of skills written in the job description

b)

I am hardworking

c)

Bragging about your achievements

d)

Skip the question

12.

HackWithInfy organise by _____________?

a)

Capegemini

b)

TCS

c)

Cognizant

d)

Infosys

13.

Stratethon hackathon organize by which company anually?

a)

Oracle

b)

Myntra

c)

Optum

d)

Flipkart

14.

Is competitive programming Compulsory for placement?

a)

true

b)

false

15.

CODE JAM organise by____________?

a)

amazon

b)

google

c)

facebook

d)

flipkart

16.

Which subject is most important for placements?

a)

Data Structures & Algorithms

b)

Computer networks

c)

Maths

d)

Operating System

17.

Queue follows ________?

a)

LIFO

b)

FIFO

c)

FIFI

d)

FILO

18.

What are the four pillars of OOPs?

a)

Inheritance,Polymorphism,Abstraction,Encapsulation

b)

Composition,Abstraction,Encapsulation,Association

c)

Composition,Polymorphism,Encapsulation,Association

d)

Scheduling,Queueing,Composition,Abstraction

19.

Full form of ACID ?

a)

atomicity, concurrency, isolation, and database

b)

atomicity, consistency, isolation, and durability

c)

atomicity, consistency, inheritence, and durability

d)

auto, consistency, isolation, and durability

20.

The concept of two functions with same name & different arguments is know as?

a)

Operator Overloading

b)

Function Overriding

c)

Function Overloading

d)

Function renaming

21.

Which of the following is a keyword?

a)

Finalize

b)

Finally

c)

Final

d)

Finale

22.

A ______class can access private and protected members of other class in which it declares as _________?

a)

Static

b)

Virtual

c)

Friend

d)

Pure Virtual

23.

How many times PlacementReady is printed?

a)

one

b)

Compilation Error

c)

Infinite

d)

Runtime Error

24.

Given array= {8,9,77,88,99} and key = 88; How many iterations are done until the element is found using Binary Search?

a)

4

b)

3

c)

2

d)

1

25.

Output of Stack & queue respectively after performing following operations ?

a)

stack : 2 10 , Queue : 17 3

b)

stack : 2 10, Queue : 10 2

c)

stack : 17 3 , Queue : 10 2

d)

stack : 17 3 , Queue : 2 10

26.

what will be in place of y if factorial

of a number is given by algorithm?

int fact(int n){

if(n==0)

return 1;

return y

}

a)

y=(n+1)*fact(n);

b)

y= n*fact(n-1);

c)

y= (n)*fact(n-1)

d)

y= (n-1)*fact(n);

27.

What is the Time complexity of all Algorithms Given?

a)

1.O(n^2) 2. O(nlogn) 3. O(logn) 4.O(n) 5.O(1) 6.O(logn) 7.O(1) 8.O(n)

b)

1.O(n^2) 2. O(n^2) 3. O(logn) 4.O(n) 5.O(logn) 6.O(logn) 7.O(1) 8.O(n)

c)

1.O(n^2) 2. O(nlogn) 3. O(logn) 4.O(n) 5.O(1) 6.O(logn) 7.O(n) 8.O(n)

d)

1.O(n^2) 2. O(nlogn) 3. O(logn) 4.O(n) 5.O(logn) 6.O(logn) 7.O(1) 8.O(n)

28.

DFS & BFS traversal of given graph Respectively if Source node is A?

a)

ABDFEC , ABCDEF

b)

ABCDFE,ABDEFC

c)

ABDECF , ABCDEF

d)

ABCEFD , ABDCEF

29.

What is output of below code?

a)

6,6

b)

6,7

c)

7,7

d)

0,0

30.

 

How is the 3rd element in an array accessed based on pointer notation?

a)

*a +3

b)

*(a+3)

c)

*(*a+3)

d)

&(a+3)