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

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

Question # 2

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

Question # 3

What is a graph in data structures.

Question # 4

The purpose of the inkeywrod used with a Pythonlist

Question # 5

Which of the following is NOT a characteristic of a graph

Question # 6

Which operation remvoe an itesm by tis value in a list

Question # 7

Which of the following best describes primitive computational structures.

Question # 8

Which principle does a queue follow.

Question # 9

The function used to add an item at the end of a list in Python.

Question # 10

Which type of grah has edges with direction.

Question # 11

Which real life example follows the stack principle.

Question # 12

What does abstraction mean in computing.

Question # 13

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

Question # 14

What is the height of a tree.

Question # 15

Which of the following is a difference between trees and graphs.

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
  • R
    Rehman Nohri 28 - Nov - 2024 02 Min 43 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
  • A
    Attia Sufyan 27 - Nov - 2024 01 Min 13 Sec 14/15

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

Sr.# Question Answer
1

What does abstraction mean in computing.

A.

Hide data

B.

combine simple

C.

Parts into complex systems

D.

Use high level languages

2

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

3

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

4

Which of the following is an application of lists.

A.

Storing a single number

B.

Implementing stacks and queues

C.

Creating images

D.

Playing music

5

In which structures can cycles exist.

A.

Graph

B.

Tree

C.

Stack

D.

Queue

6

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

A.

Apple

B.

Banana

C.

Cherry

D.

Error

7

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

A.

delete ()

B.

pop ()

C.

remove()

D.

clear ()

8

Whcih keyword checks if an item exists in alist

A.

In

B.

for

C.

if

D.

exists

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

Why are primitive computationl structures important in computer sciecne.

A.

They reduce memory

B.

They for all software

C.

Only for web dev

D.

Increase hardware cost

Test Questions

Is this page helpful?