wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

tech

Total questions: 53

Worksheet time: 1hrs 26mins

Name
Class
Date
1.
What is software?
a)
any set of instructions that tells the hardware what to do
b)
the video card on the monitor
c)
the operating system
d)
the monitor and computer case
2.

You can use this port for networking and connecting to the Internet.

a)

USB Port

b)

Serial Port

c)

Ethernet Port

d)

Power Button

3.

The ______ is where your software, documents, and other files are stored. It long-term storage, which means the data is still saved even if you turn the computer off or unplug it.

a)

RAM

b)

USB

c)

Hard Drive

d)

Storage Drive

4.
What is this an image of?
a)
Star
b)
Bus
c)
WAN
d)
LAN
5.
What type of network is this?
a)
Star
b)
Bus
c)
LAN
d)
WAN
6.
Choose an example of a WAN
a)
School
b)
College
c)
Netflix
d)
Single site
7.
In the code example: hero.moveRight(), what is the object?
a)
move
b)
hero
c)
()
d)
Right
8.
________ are the building blocks, they are things or characters that perform actions
a)
Variable
b)
Functions
c)
Syntax
d)
Objects
9.
What do you type for an infinite loop?
a)
while True:
b)
while True ()
c)
While true:
d)
While True ()
10.
_________ holds your data for later
a)
Object
b)
Expression
c)
Variable
d)
Value
11.
A license to use software on multiple computers (like in a school lab or a business) 
a)
Software Licence
b)
Site Licence
c)
Shareware
d)
Free ware
12.
Using a portion or piece of writing that has been copied from someone else and presenting it as your own work 
a)
Unauthorized Use
b)
Software Piracy
c)
Plagiarism
d)
Fair Use
13.
State of not being identified (this is nearly impossible online)
a)
Anomity
b)
Software Piracy
c)
Plagiarism
d)
Fair Use
14.
A good algorithm must be: 
a)
replacable
b)
simple 
c)
open-ended
d)
detailed
15.
On the Keyboard  the keys
asdfghjkl are called
a)
the best keys
b)
The easy keys
c)
The home row keys
d)
the First Keys
16.
What is gaining unauthorised access to a computer system also known as?
a)
Hacking
b)
Spamming
c)
Phishing
d)
Logging on
17.
Which year was the Computer Misuse Act passed?
a)
2000
b)
1989
c)
1990
d)
1988
18.
Which of the following could protect against unauthorised access to an ICT system?
a)
anti-virus software
b)
a firewall
c)
anti-malware software
d)
disk defragger
19.
When we want to print in Java, we use the code ......
a)
system.out.print();
b)
System.out.println();
c)
System.Out.Printf();
d)
System.out.show();
20.
Which of the following is the best definition of a recursive method?
a)
A method that iterates itself exactly 5 times.
b)
A method that invokes itself by name within the method.
c)
A method that will never iterate infinitely.
d)
A method that cannot be called more than once.
21.

In Java, if we wish to retrieve data from a keyboard, we use a utility called?

a)

Scanner

b)

KeyInput

c)

Fetch

d)

Get

22.

What is the output for the following statement:

System.out.print("1"+"1");

a)

11

b)

2

c)

Error Message

23.

Which character is known as the escape string or escape character?

a)

\

b)

/

c)

?

d)

@

24.

Which of the these is the functionality of ‘Encapsulation’?

a)

Binds together code and data

b)

Using single interface for general class of actions

c)

Reduce Complexity

d)

All of the mentioned

25.

What does this flowchart symbol represent?

a)

Starting and stopping

b)

Actions

c)

Sub-routines

d)

Decisions

26.

Which of the following is not a goal of testing?

a)

To determine if the program works efficiently.

b)

To ensure that it solves the original problem.

c)

To determine if there are errors in the program.

d)

To determine if performs as intended.

27.
A compiler ignores whitespace between words and lines. 
a)
True
b)
False
28.

He was the developer of Java Language.

a)

James Gowsling

b)

Jackie Gosling

c)

James Gosling

d)

Jackie Gosling

29.

Alpha testing can be done by the software developer

a)

True

b)

False

30.

What is validation?

a)

Checking that the code is correct

b)

Checking that the specification is correct

c)

Checking that the correct programming language has been used

d)

Checking that there are no invalid number errors, such as divide by zero

31.

What is the correct order of the stages for the System Development Lifecycle?

a)

Design, analysis, test, build, evaluate

b)

design, analysis, build, test, evaluate

c)

analysis, design, build, evaluate, test

d)

analysis, design, build, test, evaluate

32.

The testing in which code is checked

a)

Black box testing

b)

White box testing

c)

Red box testing

d)

Green box testing

33.
Are the following statements true?
Verification - confirmation by examination and objective evidence that specified requirements have been fulfilled (are we building the product right?)  

Validation - confirmation by examination and objective evidence that the requirements for a specific intended use of application has been fulfilled (are we building the right product?)
a)
True
b)
False
34.

Which of the following is non-functional testing?


a)

Black box testing

b)

Performance testing

c)

Unit testing

d)

None of the mentioned

35.

Which one is the most adopted SDLC that used by many software company?

a)

Big Bang Model

b)

Agile Scrum

c)

Waterfall Model

d)

Spiral Model

36.

Which of the following is black box testing

a)

Basic path testing

b)

Boundary value analysis

c)

Code path analysis

d)

None of the mentioned

37.
 Robert needs to create a database of all his friends. In a table, is what last name considered?   
a)
 Field
b)
  Record
c)
 Table
d)
  Cell Address
38.
An Algorithm has 4 main characteristics. It should be....
a)
Doable, Creative, finite and precise
b)
Doable, Understandable, finite and precise
c)
Amazing, Understandable, finite and precise
d)
Doable, Understandable, Infinite and precise
39.

Which of the following is not a backtracking algorithm?

a)

N-queens Problem

b)

Task Scheduling Algorithm

c)

Subset Sum Problem

d)

Tower of Hanoi Problem

40.

Let S be an NP-complete problem and Q and R be two other problems not known to be in NP. Q is polynomial time reducible to S and S is polynomial-time reducible to R. Which one of the following statements is true?

a)

R is NP-complete

b)

R is NP-hard

c)

Q is NP-complete

d)

Q is NP-hard

41.

Which of the following standard algorithms is not Dynamic Programming based.

a)

Bellman–Ford Algorithm for single source shortest path

b)

Floyd Warshall Algorithm for all pairs shortest paths

c)

0-1 Knapsack problem

d)

Prim's Minimum Spanning Tree

42.

Which of the following algorithms is NOT a divide & conquer algorithm by nature?

a)

Euclidean algorithm to compute the greatest common divisor

b)

Heap Sort

c)

Cooley-Tukey fast Fourier transform

d)

Quick Sort

43.

Maximum Subarray Sum problem is to find the subarray with maximum sum. For example, given an array {12, -13, -5, 25, -20, 30, 10}, the maximum subarray sum is 45.

The naive solution for this problem is to calculate sum of all subarrays starting with every element and return the maximum of all. We can solve this using Divide and Conquer, what will be the worst case time complexity using Divide and Conquer.

a)

O(n)

b)

O(nLogn)

c)

O(Logn)

d)

O(n^2)

44.

Dijkstra's algorithm is based on which paradigm?

a)

Greedy paradigm

b)

Backtracking paradigm

c)

Dynamic Programming paradigm

d)

Divide and Conquer paradigm

45.

What is time complexity of fun()?

int fun(int n)

{

int count = 0;

for (int i = n; i > 0; i /= 2)

for (int j = 0; j < i; j++)

count += 1;

return count;

}

a)

O(n2)

b)

O(nLogn)

c)

O(n)

d)

O(nLognLogn)

46.

Which of the following statements is not true?

a)

Quicksort and merge sort are both examples of divide and conquer algorithms.

b)

If we randomly choose a pivot element each time, quicksort will always terminate in time O(n log n).

c)

For every fixed strategy to choose a pivot for quicksort, we can construct a worst case input that requires time O(n2).

d)

If we could find the median in time O(n), quicksort would have worst case complexity O(n log n).

47.

Time complexity of binary search:

a)

O(n)

b)

O(log n)

c)

O(1)

d)

O(n2)

48.

Which is purely upper bound notation?

a)

Big-oh

b)

Small-oh

c)

Big-omega

d)

Theta

49.

If the insertion and deletion happens from both the ends then the queue is called a______Queue

a)

a) Deque

b)

b) Header

c)

c) Queue

d)

d) Circular Queue

50.

Which of the following applications may use a stack?

a)

a) A parentheses balancing program

b)

b) Tracking of local variables at run time

c)

c) Compiler Syntax Analyzer

d)

d) Data Transfer between two asynchronous process

51.

What is the value of the postfix expression 6 3 2 4 + – *:

a)

1

b)

14

c)

74

d)

-18

52.

To represent hierarchical relationship between elements, Which data structure is suitable?

a)

Dequeue

b)

Priority

c)

Tree

d)

Graph

53.

Efficiency of an algorithm is measured by

a)

Time and Capacity complexity

b)

Time and Space complexity

c)

Speed and Space complexity

d)

Speed and Capacity complexity

Similar Resources on Wayground

Scratch Programming

50 questions

Scratch Programming

quiz

Worksheet

•

5th Grade - University

shell programing

49 questions

shell programing

quiz

Worksheet

•

University - Professi...

Cyber Security and Digital Awareness - Assessment 2

50 questions

Cyber Security and Digital Awareness - Assessment 2

quiz

Worksheet

•

University

Linux Commands and Cybersecurity Assessment #1

50 questions

Linux Commands and Cybersecurity Assessment #1

quiz

Worksheet

•

12th Grade - University

Rekayasa Perangkat Lunak

50 questions

Rekayasa Perangkat Lunak

quiz

Worksheet

•

University

AP CS P 5.1

50 questions

AP CS P 5.1

quiz

Worksheet

•

10th Grade - University

Data Communication and Network

50 questions

Data Communication and Network

quiz

Worksheet

•

11th Grade - University

Safety and Security - Easy

57 questions

Safety and Security - Easy

quiz

Worksheet

•

7th Grade - University