First Year Computer Science Chapter 4 Online MCQ Test for 1st Year Computer Science Chapter 4 (Applications and Uses of Computer)

ICS Part 1 Computer Science Chapter 4 Test

Start Chapter 4 Test

ICS Part 1 Computer Science Chapter Wise Test

MCQ's Test For Chapter 4 "Computer Science Ics Part 1 Chapter 4 Online Test"

Try The MCQ's Test For Chapter 4 "Computer Science Ics Part 1 Chapter 4 Online Test"

  • Total Questions15

  • Time Allowed20

Computer Science Ics Part 1 Chapter 4 Online Test

00:00
Question # 1

Which real life example follows the stack principle.

Question # 2

The opertion used to add an item to a queue

Question # 3

What is he degree of a vrtex in a graph.

Question # 4

Why are primitive computationl structures important in computer sciecne.

Question # 5

What does abstraction mean in computing.

Question # 6

What is a leaf node.

Question # 7

If you have a list f{Apple"banana". “cherry ”}ruits = I " what is fruit (1)

Question # 8

Which operation  remvoes an intem by its index in a list.

Question # 9

What is the dequeue operatin ina queue.

Question # 10

True statemetn about the height of a tree.

Question # 11

Which operation remvoe an itesm by tis value in a list

Question # 12

What is the purpose of the pop operation in a stack 

Question # 13

Which node is the staring point of a tree.

Question # 14

Which type of grah has edges with direction.

Question # 15

How are lists created in Python.

Prepare Complete Set Wise Chapter 4 "Computer Science Ics Part 1 Chapter 4 Online Test" MCQs Online With Answers


Topic Test

00:00
4th Chapter

11th Class ICS Computer Science Chapter 4 MCQ's Test

Top Scorers Of Chapter 4 "Computer Science Ics Part 1 Chapter 4 Online Test" MCQ`s Test

  • H
    Hafiz Ali Hassan 19 - Dec - 2024 00 Min 09 Sec 15/15
  • 2
    24P-0510 Abdul Mueez 09 - Dec - 2024 00 Min 15 Sec 15/15
  • S
    sallu khan 06 - Jan - 2025 00 Min 33 Sec 15/15
  • F
    Fajar Hameed 06 - Dec - 2024 01 Min 05 Sec 15/15
  • A
    Abubakar 07 - Dec - 2024 01 Min 20 Sec 15/15
  • M
    MUBASHIR HUSSAIN 06 - Dec - 2024 01 Min 28 Sec 15/15
  • I
    Iqra Amjad 21 - Dec - 2024 01 Min 30 Sec 15/15
  • H
    Hamza Shykh 10 - Dec - 2024 01 Min 31 Sec 15/15
  • R
    Rabeeha Piracha 15 - Dec - 2024 01 Min 47 Sec 15/15
  • A
    Awais Mughal 12 - Dec - 2024 01 Min 57 Sec 15/15
  • S
    Saim Yousaf 21 - Dec - 2024 02 Min 22 Sec 15/15
  • S
    Shumaila Riaz 13 - Dec - 2024 05 Min 11 Sec 15/15
  • T
    Taqdees Kiani 08 - Dec - 2024 01 Min 11 Sec 14/15
  • S
    Sheikh Umer 02 - May - 2026 01 Min 31 Sec 14/15
  • A
    Alyaan Shahbaz 30 - Nov - 2024 01 Min 33 Sec 14/15

ICS Part 1 Computer Science (New Book) Chapter 4 Important MCQ's

Sr.# Question Answer
1

Wha is a list in Python.

A.

Unordered items

B.

Changeable sequence

C.

Print function 

D.

Loop type

2

What is the enqueue operation in a queue.

A.

Removeing an item from the front

B.

Printing the queue

C.

Adding an item to the back

D.

Searchign for an item

3

Which is the purpose of the push operation in a stack.

A.

Remvoe teh bottom item

B.

Add an item to the top

C.

Search for an item

D.

Sort the stack

4

What is the dequeue operatin ina queue.

A.

Adding an item to th eback

B.

Remoiving an item fromt he fornt

C.

Sorting the queue

D.

Copying the queue

5

What hapens when you use the append () method on a list.

A.

It deletes the last item

B.

It adds an item to the end of the list

C.

It sorts the list

D.

It creates a new list

6

What is the dequeue opertion in a queue.

A.

Removing an item formt he front

B.

Additing an item to the back

C.

Sorthing the queue

D.

Copying the queue

7

How do primitives affect a system's capabilities.

A.

Make program look better

B.

Decide what and how fast it computes

C.

Control internet speed

D.

Improve graphics

8

Which of the following is NOT a primitive computational structure.

A.

integers

B.

Loops

C.

Artificial intelligence

D.

Boolean values

9

Which of the following is NOT a characteristic of a graph

A.

Vertices

B.

Edges

C.

One directional flow only

D.

Weighted or unweighted edges

10

Which of the following best describes a tree.

A.

Graph with cycles

B.

Graph with no cycles and a root

C.

Random graph

D.

Circular graph

Test Questions

Is this page helpful?