English

CBSE solutions for Computer Science with Python [English] Class 12 chapter 1 - Liner List Manipulation [Latest edition]

Advertisements

Chapters

Unit -1 : Review of Phython & Concept of Oops

    1: Review of Phython

    2: Concept of Object Oriented Programming

    3: Classes in Python

    4: Inheritance

Unit -2 : Advanced Programming with Python

▶ 1: Liner List Manipulation

    2: Stacks & Queues in list

    3: Data File Handling

    4: Exception Handling & Generate Functions

Unit -3 : Databases Management Systems and SQL

    1: Databases Concepts and SQL

    2: Structure Query Language

Unit -4 : Introduction to Boolean Algebra

    1: Boolean Algebra

    2: Boolean Functions and Reduce Forms

   Chapter 3: Application of Boolean Logic

Unit -5 : Communication Technologies

   Chapter 1: Networking Concepts Part I

   Chapter 2: Networking Concepts Part II

   Chapter 3: Networking Protocols

   Chapter 4: Mobile Telecommunication Technologies, Network Security and Internet Services

CBSE solutions for Computer Science with Python [English] Class 12 chapter 1 - Liner List Manipulation - Shaalaa.com
Advertisements

Solutions for Chapter 1: Liner List Manipulation

Below listed, you can find solutions for Chapter 1 of CBSE CBSE for Computer Science with Python [English] Class 12.


EXERCISE
EXERCISE [Pages 104 - 105]

CBSE solutions for Computer Science with Python [English] Class 12 1 Liner List Manipulation EXERCISE [Pages 104 - 105]

1.Page 104

Define a data structure.

2.Page 104

Name the two types of data structures and give one point of difference between them.

3.Page 104

Give one point of difference between an array and a list in Python.

4.Page 104

How are lists implemented in memory?

5. a.Page 104

What is sequential allocation of memory?

5. b.Page 104

Why do we say that lists are stored sequentially?

6.Page 104

How is memory allocated to a list in Python?

7.Page 104

Write a function that takes a list that is sorted in ascending order and a number as arguments. The function should do the following:

  1. Insert the number passed as argument in a sorted list.
  2. Delete the number from the list.
8.Page 104

How is linear search different from binary search?

9.Page 104

Accept a list containing integers randomly. Accept any number and display the position at which the number is found is the list.

10.Page 104

Write a function that takes a sorted list and a number as an argument. Search for the number in the sorted list using binary search.

11.Page 104

In the following list containing integers, sort the list using Insertion sort algorithm. Also show the status of the list after each iteration.

15     -5     20      -10     10

12.Page 104

Consider the following unsorted list.

Neena       Meeta      Geeta      Reeta      Seeta

Sort the list using selection sort algorithm. Show the status of the list after every iteration.

13.Page 104

Consider the following unsorted list

90     78      20      46      54      1

Write the list after:

  1. 3rd iteration of selection sort 
  2. 4th iteration of bubble sort 
  3. 5th iteration of insertion sort
14.Page 105

Consider the following unsorted list:

10     5     55     13     3     49     36

Write the position of elements in the list after:

  1. 5th iteration of bubble sort 
  2. 7th iteration of insertion sort 
  3. 4th iteration of selection sort
15.Page 105

Sort a list containing names of students in ascending order using selection sort.

16.Page 105

A list contains roll_no, name and marks of the student. Sort the list in descending order of marks using Selection Sort algorithm.

17.Page 105

A list contains Item_code, Item_name and price. Sort the list :

  1. In ascending order of price using Bubble sort.
  2. In descending order of qty using Insertion sort.
18.Page 105

Accept a list containing numbers. Sort the list using any sorting technique. Thereafter accept a number and display the position where that number is found. Also display suitable message, if the number is not found in the list.

Solutions for 1: Liner List Manipulation

EXERCISE
CBSE solutions for Computer Science with Python [English] Class 12 chapter 1 - Liner List Manipulation - Shaalaa.com

CBSE solutions for Computer Science with Python [English] Class 12 chapter 1 - Liner List Manipulation

Shaalaa.com has the CBSE Mathematics Computer Science with Python [English] Class 12 CBSE solutions in a manner that help students grasp basic concepts better and faster. The detailed, step-by-step solutions will help you understand the concepts better and clarify any confusion. CBSE solutions for Mathematics Computer Science with Python [English] Class 12 CBSE 1 (Liner List Manipulation) include all questions with answers and detailed explanations. This will clear students' doubts about questions and improve their application skills while preparing for board exams.

Further, we at Shaalaa.com provide such solutions so students can prepare for written exams. CBSE textbook solutions can be a core help for self-study and provide excellent self-help guidance for students.

Concepts covered in Computer Science with Python [English] Class 12 chapter 1 Liner List Manipulation are .

Using CBSE Computer Science with Python [English] Class 12 solutions Liner List Manipulation exercise by students is an easy way to prepare for the exams, as they involve solutions arranged chapter-wise and also page-wise. The questions involved in CBSE Solutions are essential questions that can be asked in the final exam. Maximum CBSE Computer Science with Python [English] Class 12 students prefer CBSE Textbook Solutions to score more in exams.

Get the free view of Chapter 1, Liner List Manipulation Computer Science with Python [English] Class 12 additional questions for Mathematics Computer Science with Python [English] Class 12 CBSE, and you can use Shaalaa.com to keep it handy for your exam preparation.

Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×