11th class Computer Science chapter 4 online mcq test with answers for ICS part 1 Computer Science chapter 4 (Applications and Uses of Computer)

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

Sr.#	Question	Answer
1	In which structures can cycles exist.	A. Graph B. Tree C. Stack D. Queue
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	Which of the following best describes primitive computational structures.	A. Advanced tools B. Complex Algorithms C. Basic building blocks of computing D. High level data types
4	Which principle does a stack follow.	A. FIFO B. LIFO C. FILO D. LILO
5	What is a stack.	A. Add/remove at both ends B. Add /remove from the top C. Add front, remvoe back D. No specific order
6	What is a graph in data structures.	A. A linear structure B. A hierachiecal structure C. A set of vertices connected by edges. D. A type of array
7	What is a leaf node.	A. A node with many children B. A node with one child C. A node with no children D. A node with no parent
8	Which operation remvoe an itesm by tis value in a list	A. Delete () B. Remove() C. Pop () D. Clear ()
9	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
10	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