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 traversal is used for beacking up files in a directory.

Question # 2

Which real life example represents an undirected graph.

Question # 3

The purpose of the inkeywrod used with a Pythonlist

Question # 4

What is a stack.

Question # 5

What does abstraction mean in computing.

Question # 6

What is a leaf node.

Question # 7

What is a graph in data structures.

Question # 8

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

Question # 9

Which of the following is NOT a primitive computational structure.

Question # 10

Which principle does a stack follow.

Question # 11

What is he degree of a vrtex in a graph.

Question # 12

A scenario where a graph data structure is most suitable.

Question # 13

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

Question # 14

What is a tree in data structures.  

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

Which type of grah has edges with direction.

A.

Undirected graph

B.

Directed graph

C.

Weighted graph

D.

Binary graph

2

Which principle does a stack follow.

A.

FIFO

B.

LIFO

C.

FILO

D.

LILO

3

Whcih keyword checks if an item exists in alist

A.

In

B.

for

C.

if

D.

exists

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

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 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

8

Wha is a list in Python.

A.

Unordered items

B.

Changeable sequence

C.

Print function 

D.

Loop type

9

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

10

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

Test Questions

Is this page helpful?

Share your comments & questions here

Guest
  • Babar ali

    Babar ali

    25 May 2017

    15/15 yahoooo......faisalabadi always best

    Like
    Reply