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 operation remvoe an itesm by tis value in a list

Question # 2

Which principle does a queue follow.

Question # 3

What is a tree in data structures.  

Question # 4

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

Question # 5

Which real life example follows the stack principle.

Question # 6

What is the dequeue operatin ina queue.

Question # 7

Why are primitive computationl structures important in computer sciecne.

Question # 8

Wha is a list in Python.

Question # 9

Which of the following best describes a tree.

Question # 10

Which of the following is an application of lists.

Question # 11

What is the height of a tree.

Question # 12

Which traversal is used for beacking up files in a directory.

Question # 13

What is the enqueue operation in a queue.

Question # 14

A scenario where a graph data structure is most suitable.

Question # 15

Which node is the staring point of a tree.

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
  • T
    Toqeer Ahmad 16 - May - 2026 01 Min 10 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

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

Sr.# Question Answer
1

Which operation remvoe an itesm by tis value in a list

A.

Delete ()

B.

Remove()

C.

Pop ()

D.

Clear ()

2

Which operation remvoes an item by its value in a list.

A.

delete ()

B.

pop ()

C.

remove()

D.

clear ()

3

What does abstraction mean in computing.

A.

Hide data

B.

combine simple

C.

Parts into complex systems

D.

Use high level languages

4

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

5

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

6

The purpose of the inkeywrod used with a Pythonlist

A.

Add an item to the list

B.

Remvoes an itemfrom the list

C.

Cheeks if an item exists int he list

D.

Returns the length of the list

7

An  operation that remvoes an item from the top of the stack

A.

Push

B.

Pop

C.

Peek

D.

Add

8

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

9

True statemetn about the height of a tree.

A.

Number of edges fromt he root to the deepest node

B.

Number of nodes from the root to the deepest node

C.

Number of children of the root node

D.

Always equal to the number of nodes in the tree

10

What is the height of a tree.

A.

No of nodes

B.

Longest path 

C.

Memory used

D.

No of leaves

Test Questions