Wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Computer Science Quiz

Total questions: 85

Worksheet time: 43mins

Name
Class
Date
1.

The parser which is used to produce a syntax tree is known as:

a)

Lexical Analyzer

b)

Syntax Analyzer

c)

Semantic Analyzer

d)

Intermediate Code Generator

2.

Which layer of the OSI model is responsible for data encryption?

a)

Application Layer

b)

Presentation Layer

c)

Session Layer

d)

Transport Layer

3.

What is the purpose of the JOIN operation in SQL?

a)

To combine columns from multiple tables

b)

To delete rows from a table

c)

To update rows in a table

d)

To insert rows into a table

4.

Which of the following is not a type of kernel?

a)

Monolithic kernel

b)

Microkernel

c)

Exokernel

d)

Nanokernel

5.

Which layer of the OSI model is responsible for establishing, managing, and terminating connections between applications?

a)

Physical Layer

b)

Data Link Layer

c)

Network Layer

d)

Transport Layer

6.

Which of the following is not a characteristic of a greedy algorithm?

a)

Optimal substructure

b)

Overlapping subproblems

c)

Local optimal choice

d)

Feasible solutions

7.

Which of the following is not a cryptographic algorithm?

a)

AES

b)

RSA

c)

SHA-256

d)

FTP

8.

In machine learning, overfitting occurs when:

a)

The model performs well on the training data but poorly on new, unseen data.

b)

The model performs well on new, unseen data but poorly on the training data.

c)

The model has a high bias but low variance.

d)

The model has low bias and low variance.

9.

The traveling salesman problem (TSP) is an example of:

a)

P problem

b)

NP problem

c)

NP-complete problem

d)

NP-hard problem

10.

The language accepted by a Turing machine is:

a)

Context-Free Language

b)

Context-Sensitive Language

c)

Regular Language

d)

Recursively Enumerable Language

11.

Which of the following data structures is best suited for implementing a priority queue?

a)

Stack

b)

Queue

c)

Linked List

d)

Heap

12.

Which of the following automata has the simplest computational power?

a)

Turing Machine

b)

Pushdown Automaton

c)

Finite Automaton

d)

Linear Bounded Automaton

13.

What is the time complexity of the merge sort algorithm in the worst case?

a)

O(n)

b)

O(n log n)

c)

O(n^2)

d)

O(log n)

14.

Which of the following is not a type of CPU architecture?

a)

Harvard

b)

Von Neumann

c)

RISC

d)

FIFO

15.

In graph theory, a graph with no cycles is called a:

a)

Tree

b)

Complete Graph

c)

Bipartite Graph

d)

Multigraph

16.

The pumping lemma is used to prove that:

a)

A language is regular

b)

A language is context-free

c)

A language is not regular

d)

A language is not context-free

17.

In which phase of the SDLC is the software design created?

a)

Requirement Analysis

b)

Design

c)

Implementation

d)

Maintenance

18.

In software engineering, which model is also known as the "Waterfall Model"?

a)

Agile Model

b)

Incremental Model

c)

Spiral Model

d)

Linear Sequential Model

19.

Which memory allocation scheme suffers from external fragmentation?

a)

Paging

b)

Segmentation

c)

Contiguous allocation

d)

None of the above

20.

Which problem is undecidable?

a)

Whether a context-free grammar generates any strings

b)

Whether a context-free grammar generates an infinite language

c)

Whether a Turing machine halts on all inputs

d)

Whether a finite automaton accepts a given string

21.

Which testing is performed to ensure that new code changes do not adversely affect the existing functionality?

a)

Unit Testing

b)

Integration Testing

c)

Regression Testing

d)

System Testing

22.

Which sorting algorithm is stable?

a)

Quick Sort

b)

Heap Sort

c)

Merge Sort

d)

Selection Sort

23.

Which protocol is used to retrieve email from a mail server?

a)

HTTP

b)

FTP

c)

SMTP

d)

IMAP

24.

In HTML, which tag is used to create a hyperlink?

a)

b)