Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
Computer Science Ics Part 1 Chapter 4 Online Test
| Sr. # | Questions | Answers Choice |
|---|---|---|
| 1 | If you have a list f{Apple"banana". “cherry ”}ruits = I " what is fruit (1) |
<p>Apple</p> <p>Banana</p> <p>Cherry</p> <p>Error</p> |
| 2 | How are lists created in Python. |
<p>Using parentheses ( )</p> <p>Using sqquare brackets []</p> <p>Using curly braces {}</p> <p>Using angle brackets</p> |
| 3 | Wha is a list in Python. |
<p>Unordered items</p> <p>Changeable sequence</p> <p>Print function </p> <p>Loop type</p> |
| 4 | How do primitives affect a system's capabilities. |
<p>Make program look better</p> <p>Decide what and how fast it computes</p> <p>Control internet speed</p> <p>Improve graphics</p> |
| 5 | What does abstraction mean in computing. |
<p>Hide data</p> <p>combine simple</p> <p>Parts into complex systems</p> <p>Use high level languages</p> |
| 6 | Why are primitive computationl structures important in computer sciecne. |
<p>They reduce memory</p> <p>They for all software</p> <p>Only for web dev</p> <p>Increase hardware cost</p> |
| 7 | Which of the following is NOT a primitive computational structure. |
<p>integers</p> <p>Loops</p> <p>Artificial intelligence</p> <p>Boolean values</p> |
| 8 | Which of the following best describes primitive computational structures. |
<p>Advanced tools</p> <p>Complex Algorithms</p> <p>Basic building blocks of computing</p> <p>High level data types</p> |
| 9 | A scenario where a graph data structure is most suitable. |
<p>Managng a to do list</p> <p>Modeling a line of customers in a store </p> <p>Representing connections in a social network </p> <p>All of the above</p> |
| 10 | True statemetn about the height of a tree. |
<p>Number of edges fromt he root to the deepest node</p> <p>Number of nodes from the root to the deepest node</p> <p>Number of children of the root node</p> <p>Always equal to the number of nodes in the tree</p> |
| 11 | The opertion used to add an item to a queue |
<p>Dequeue </p> <p>Enqueue</p> <p>Remove</p> |
| 12 | An operation that remvoes an item from the top of the stack |
<p>Push</p> <p>Pop</p> <p>Peek</p> <p>Add</p> |
| 13 | The purpose of the inkeywrod used with a Pythonlist |
<p>Add an item to the list</p> <p>Remvoes an itemfrom the list</p> <p>Cheeks if an item exists int he list</p> <p>Returns the length of the list</p> |
| 14 | The function used to add an item at the end of a list in Python. |
<p>Append()</p> <p>Insert ()</p> <p>remove ()</p> <p>PoP ()</p> |
