CBSE Academic

Physical Education Class 11 NCERT Solutions

by

Physical Education Class 11 NCERT Solutions – Students who take physical education classes gain the physical fitness necessary to live a healthy life. Students can learn about various sports and exercises that they can do to improve their fitness levels using the NCERT solutions.

Getting enough exercise also improves cognitive function and mental acuity. The brain, memory, and concentration can all benefit from regular physical activity. The NCERT answers offer suggestions on how pupils might increase their mental awareness through a variety of physical exercises.

By encouraging wholesome lifestyle practises, physical education aids in kids’ emotional stability development. Among these include regular exercise, sound sleep practises, and a balanced diet. Students can learn how to implement these habits into their everyday routine by consulting the NCERT solutions.

Physical Education Class 11 NCERT Solutions

Unit 1 Changing Trends & Career in Physical Education
Unit 2 Olympism
Unit 3 Yoga
Unit 4 Physical Education & Sports for CWSN (Children with Special Needs – Divyang)
Unit 5 Physical Fitness, Health and Wellness
Unit 6 Test, Measurement & Evaluation
Unit 7 Fundamentals of Anatomy, Physiology in Sports
Unit 8 Fundamentals of Kinesiology and Biomechanics in Sports
Unit 9 Psychology & Sports
Unit 10 Training and Doping in Sports

Frequently Asked Questions

Q. What subjects are covered in physical education in class 11?

Sports, games, rules & regulations, abilities, tactics, and strategies are all covered in physical education in class 11 Notes. It also covers subjects pertaining to health, exercise, and fitness.

Q. What benefits can students who take physical education in class eleven expect?

In class eleven, physical education can enhance a student’s social, mental, and physical well-being. Besides with aiding youngsters in gaining better balance, endurance, strength, and flexibility, it might also encourage collaboration, leadership, sportsmanship, and communication.

Computer Science Class 11 NCERT Solutions

by

Computer Science Class 11 NCERT Solutions – The NCERT textbooks for computer science class 11 typically include questions and answers at the end of each chapter or section. These questions and answers are designed to test the students’ understanding of the concepts covered in the chapter. They range from simple factual questions to more complex problem-solving questions and may include multiple-choice questions, fill-in-the-blank questions, true or false questions, and short-answer questions. students can develop their critical thinking and problem-solving skills with the help of NCERT texbook Questions and Answers.

Computer Science Class 11 NCERT Solutions

Computer Systems and Organisation

Computational Thinking and Programming – 1

Society, Law and Ethics

Computer Science Class 11 MCQ

by

Computer Science Class 11 MCQ – Multiple Choice Questions (MCQs) are a popular and effective way of testing a student’s understanding of a subject, and they are widely used in various exams, including class 11 computer science exams. These MCQs are designed to cover the important topics and concepts in the subject, and they are usually divided into different NCERT chapters, with the questions being taken topic-wise from each chapter. This MCQs are develped by the teachers, they make sure that the questions cover all of the important aspects of the subject. The questions are designed to test a student’s comprehension of the subject and ability to apply it in real-world situations.

Computer Science Class 11 MCQ

Computer Systems and Organisation

Computational Thinking and Programming – 1

Society, Law and Ethics

Computer Science Class 11 Notes

by

Computer Science Class 11 Notes cover all the units in a comprehensive and concise manner, making it easier for students to learn and secure full marks with less effort and time. The topics covered include Unit 1 Computer System Organization, Unit 2 Computational Thinking and Programming, and Unit 3 Society Law and Ethics. The language used in these notes is simple and easy to understand, allowing for better grasp of the concepts.

The revision notes for Class 11 Computer Science are comprehensive study materials based on the latest syllabus and NCERT textbook. They are designed to help students excel in their exams by providing chapter-wise summaries, important questions, and answers.

These notes are created by experienced experts to ensure the most relevant and up-to-date information is included. These revision notes provide a great opportunity for students to revise and reinforce their understanding of the subject before their exams.

Computer Science Class 11 Notes

Computer Systems and Organisation

Computational Thinking and Programming – 1

Society, Law and Ethics

Computer Science Class 11 Practical

by

Computer Science Class 11 Practical – Practical work is an important aspect of learning computer science. It allows students to apply theoretical concepts to real-world problems and develop hands-on experience. In a computer science class 11, practical work may include programming assignments and projects that use various programming languages and tools.

Computer Science Class 11 Practical

Q. Input a welcome message and display it
print("Welcome to the program")

Output

Welcome to the program

Q. Input two numbers and display the larger / smaller number
num1 = int(input("Enter first number: "))
num2 = int(input("Enter second number: "))
print("Larger number: ", max(num1, num2))
print("Smaller number: ", min(num1, num2))

Output

Enter first number: 55
Enter second number: 33
Larger number: 55
Smaller number: 33

Q. Input three numbers and display the largest / smallest number
num1 = int(input("Enter first number: "))
num2 = int(input("Enter second number: "))
num3 = int(input("Enter third number: "))
print("Largest number: ", max(num1, num2, num3))
print("Smallest number: ", min(num1, num2, num3))

Output

Enter first number: 52
Enter second number: 66
Enter third number: 44
Largest number: 66
Smallest number: 44

Q. Generate the following patterns using nested loop.
a) *
    **
    ***
    ****
    *****

for i in range(1, 6):
    print("*" * i)

b) 1 2 3 4 5
    1 2 3 4
    1 2 3
    1 2
    1


for i in range(5, 0, -1):
    print(" ".join([str(x) for x in range(1, i + 1)]))


c) A
    AB
    ABC
    ABCD
    ABCDE


for i in range(1, 6):
    print("".join([chr(x) for x in range(65, 65 + i)]))
Q. Write a program to input the value of x and n and print the sum of the following series:
a) 1+x+x2+x3+x4+. ..........xn

def sum_of_series(x, n):
    result = 0
    for i in range(n + 1):
        result += x**i
    return result

x = int(input("Enter the value of x: "))
n = int(input("Enter the value of n: "))
print("Sum of the series:", sum_of_series(x, n))

Output

Enter the value of x: 5
Enter the value of n: 10
Sum of the series: 12207031

b) 1-x+x2-x3+x4 .................................xn

def sum_of_series(x, n):
    result = 0
    for i in range(n + 1):
        result += (-1)**i * x**i
    return result

x = int(input("Enter the value of x: "))
n = int(input("Enter the value of n: "))
print("Sum of the series:", sum_of_series(x, n))

Output

Enter the value of x: 5
Enter the value of n: 10
Sum of the series: 8138021
Q. Determine whether a number is a perfect number, an armstrong number or a palindrome
def is_perfect(num):
    sum = 0
    for i in range(1, num):
        if num % i == 0:
            sum += i
    return sum == num

def is_armstrong(num):
    temp = num
    sum = 0
    while temp > 0:
        digit = temp % 10
        sum += digit ** 3
        temp //= 10
    return sum == num

def is_palindrome(num):
    return str(num) == str(num)[::-1]

num = int(input("Enter a number: "))
if is_perfect(num):
    print(num, "is a perfect number")
elif is_armstrong(num):
    print(num, "is an armstrong number")
elif is_palindrome(num):
    print(num, "is a palindrome")
else:
    print(num, "is none of the above")

Output

Enter a number: 66
66 is a palindrome

Q. Input a number and check if the number is a prime or composite number
def is_prime(num):
    if num > 1:
        for i in range(2, num):
            if (num % i) == 0:
                return False
        return True
    else:
        return False

num = int(input("Enter a number: "))
if is_prime(num):
    print(num, "is a prime number")
else:
    print(num, "is a composite number")

# Display the terms of a Fibonacci series
def fibonacci(n):
    fib = [0, 1]
    for i in range(2, n):
        fib.append(fib[i-1] + fib[i-2])
    return fib

n = int(input("Enter the number of terms: "))
print("Fibonacci series: ", fibonacci(n))

Output

Enter a number: 5
5 is a prime number
Enter the number of terms: 3
Fibonacci series: [0, 1, 1]

Q. Display the terms of a Fibonacci series.
def fibonacci(n):
    if n <= 0:
        return []
    elif n == 1:
        return [0]
    elif n == 2:
        return [0, 1]
    else:
        fib_list = [0, 1]
        while len(fib_list) < n:
            next_term = fib_list[-1] + fib_list[-2]
            fib_list.append(next_term)
        return fib_list

n = int(input("Enter the number of terms to display: "))
print("The terms of the Fibonacci series:", fibonacci(n))

Output

Enter the number of terms to display: 10
The terms of the Fibonacci series: [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]

Q. Compute the greatest common divisor and least common multiple of two integers.
def gcd(a, b):
    while b != 0:
        a, b = b, a % b
    return a

def lcm(a, b):
    return a * b // gcd(a, b)

a = int(input("Enter the first integer: "))
b = int(input("Enter the second integer: "))

gcd_value = gcd(a, b)
lcm_value = lcm(a, b)

print("The GCD of", a, "and", b, "is", gcd_value)
print("The LCM of", a, "and", b, "is", lcm_value)

Output

Enter the first integer: 18
Enter the second integer: 61
The GCD of 18 and 61 is 1
The LCM of 18 and 61 is 1098

Q. Count and display the number of vowels, consonants, uppercase, lowercase characters in string.
def count_characters(string):
    vowels = "AEIOUaeiou"
    consonants = "BCDFGHJKLMNPQRSTVWXYZbcdfghjklmnpqrstvwxyz"
    uppercase = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
    lowercase = "abcdefghijklmnopqrstuvwxyz"

    vowel_count = 0
    consonant_count = 0
    uppercase_count = 0
    lowercase_count = 0
    for char in string:
        if char in vowels:
            vowel_count += 1
        elif char in consonants:
            consonant_count += 1
        elif char in uppercase:
            uppercase_count += 1
        elif char in lowercase:
            lowercase_count += 1

    return vowel_count, consonant_count, uppercase_count, lowercase_count

string = input("Enter a string: ")
vowel_count, consonant_count, uppercase_count, lowercase_count = count_characters(string)

print("Number of vowels:", vowel_count)
print("Number of consonants:", consonant_count)
print("Number of uppercase characters:", uppercase_count)
print("Number of lowercase characters:", lowercase_count)

Output

Enter a string: Welcome to my School
Number of vowels: 6
Number of consonants: 11
Number of uppercase characters: 2
Number of lowercase characters: 15

Q. Input a string and determine whether it is a palindrome or not; convert the case of characters in a string.
def is_palindrome(string):
    return string == string[::-1]

def convert_case(string):
    return string.swapcase()

string = input("Enter a string: ")

if is_palindrome(string):
    print("The string is a palindrome.")
else:
    print("The string is not a palindrome.")

converted_string = convert_case(string)
print("Converted string:", converted_string)

Output

Enter a string: MADAM
The string is a palindrome.
Converted string: madam

Q. Find the largest/smallest number in a list/tuple
def find_min_max(numbers):
    return min(numbers), max(numbers)

numbers = [int(num) for num in input("Enter a list of numbers separated by space: ").split()]

minimum, maximum = find_min_max(numbers)

print("The smallest number is:", minimum)
print("The largest number is:", maximum)

Output

Enter a list of numbers separated by space: 55 32 12
The smallest number is: 12
The largest number is: 55

Q. Input a list of numbers and swap elements at the even location with the elements at the odd location.
def swap_elements(numbers):
    for i in range(0, len(numbers) - 1, 2):
        numbers[i], numbers[i + 1] = numbers[i + 1], numbers[i]
    return numbers

numbers = [int(num) for num in input("Enter a list of numbers separated by space: ").split()]

swapped_numbers = swap_elements(numbers)

print("The list after swapping elements:", swapped_numbers)

Output

Enter a list of numbers separated by space: 55 41 63
The list after swapping elements: [41, 55, 63]

Q. Input a list/tuple of elements, search for a given element in the list/tuple.
def search_element(elements, search_item):
    if search_item in elements:
        return True
    else:
        return False

elements = [int(num) for num in input("Enter a list of elements separated by space: ").split()]

search_item = int(input("Enter the item to search for: "))

if search_element(elements, search_item):
    print("The item was found in the list/tuple.")
else:
    print("The item was not found in the list/tuple.")

Output

Enter a list of elements separated by space: 61 24 52
Enter the item to search for: 24
The item was found in the list/tuple.

Q. Input a list of numbers and find the smallest and largest number from the list.
def find_min_max(numbers):
  min_num = float('inf')
  max_num = float('-inf')
  for num in numbers:
    if num < min_num:
      min_num = num
    if num > max_num:
      max_num = num
  return (min_num, max_num)

numbers = [int(x) for x in input("Enter a list of numbers separated by space: ").split()]
min_num, max_num = find_min_max(numbers)
print("Smallest number:", min_num)
print("Largest number:", max_num)

Output

Enter a list of numbers separated by space: 63 41 75
Smallest number: 41
Largest number: 75

Q. Create a dictionary with the roll number, name and marks of n students in a class and display the names of students who have scored marks above 75.
n = int(input("Enter the number of students: "))
students = {}
for i in range(n):
    roll_number = int(input("Enter the roll number: "))
    name = input("Enter the name: ")
    marks = int(input("Enter the marks: "))
    students[roll_number] = (name, marks)

print("\nList of students who have scored marks above 75:")
for roll_number, (name, marks) in students.items():
    if marks > 75:
        print(name)

Output

Enter the number of students: 2
Enter the roll number: 1
Enter the name: Rakesh Kumar
Enter the marks: 88
Enter the roll number: 2
Enter the name: Amit Singh
Enter the marks: 58
List of students who have scored marks above 75:
Rakesh Kumar

Q. Write a program in python to find the area of Circle using If Conditions
import math

def area_of_circle(radius):
  if radius < 0:
    return "Invalid radius. Radius should be a positive number."
  else:
    area = math.pi * radius**2
    return "Area of Circle with radius {} is {}".format(radius, area)

radius = float(input("Enter the radius of the circle: "))
print(area_of_circle(radius))

Output

Enter the radius of the circle: 6
Area of Circle with radius 6.0 is 113.09733552923255

Q. Write a program to take input from the user and print reverse order
def reverse_string(s):
  return s[::-1]

string = input("Enter a string: ")
print("The reversed string is:", reverse_string(string))

Output

Enter a string: PYTHON
The reversed string is: NOHTYP

Q. Write a program to take two input from the user and concatenate the strings
def concatenate_strings(s1, s2):
  return s1 + s2

string1 = input("Enter the first string: ")
string2 = input("Enter the second string: ")
print("The concatenated string is:", concatenate_strings(string1, string2))

Output

Enter the first string: My
Enter the second string: School
The concatenated string is: MySchool

Q. Write a program to accept list from the used and sort the list
def sort_list(lst):
  return sorted(lst)

list = [int(x) for x in input("Enter a list of numbers separated by spaces: ").split()]
print("The sorted list is:", sort_list(list))

Output

Enter a list of numbers separated by spaces: 6 8 4 9 7 5
The sorted list is: [4, 5, 6, 7, 8, 9]

Q. Write a program to take input from the user and find the average of the list
def average_of_list(lst):
  return sum(lst) / len(lst)

list = [int(x) for x in input("Enter a list of numbers separated by spaces: ").split()]
print("The average of the list is:", average_of_list(list))

Output

Enter a list of numbers separated by spaces: 6 5 1 8 4 9
The average of the list is: 5.5

Q. Write a program to take input from the used and find the largest and smallest number from the List
def largest_and_smallest_in_list(lst):
  return max(lst), min(lst)

list = [int(x) for x in input("Enter a list of numbers separated by spaces: ").split()]
largest, smallest = largest_and_smallest_in_list(list)
print("The largest number in the list is:", largest)
print("The smallest number in the list is:", smallest)

Output

Enter a list of numbers separated by spaces: 6 5 7 1 5
The largest number in the list is: 7
The smallest number in the list is: 1

Computer Science Class 11 Notes
Computer Science Class 11 MCQ
Computer Science Class 11 NCERT Solutions

MCQ for Class 12 Computer Science Python

by
mcq for class 12 computer science python

Teachers and Examiners (CBSESkillEduction) collaborated to create the MCQ for Class 12 Computer Science Python. All the important Information are taken from the NCERT Textbook Computer Science (083) class 12.

MCQ for Class 12 Computer Science Python

Computer Science Class 12 Notes

  1. Python Revision tour – 1 Class 12 Notes
  2. Python Revision tour – 2 Class 12 Notes Notes
  3. Working with Functions Class 12 Notes
  4. Using Python Libraries Class 12 Notes
  5. File Handling Class 12 Notes
  6. Recursion Class 12 Notes
  7. Idea of Algorithmic Efficiency Class 12 Notes
  8. Data Visualization using Pyplot Class 12 Notes
  9. Data Structure Class 12 Notes
  10. Computer Network Class 12 Notes
  11. More on MySQL Class 12 Notes

MCQ for Class 12 Computer Science Python

  1. Python Revision tour – 1 Class 12 MCQs
  2. Python Revision tour – 2 Class 12 MCQs
  3. Working with Functions Class 12 MCQs
  4. Using Python Libraries Class 12 MCQs
  5. File Handling Class 12 MCQs
  6. Recursion Class 12 MCQs
  7. Data Visualization using Pyplot Class 12 MCQs
  8. Data Structure Class 12 MCQs
  9. Computer Network Class 12 MCQs
  10. More on MySQL Class 12 MCQs

Computer Science Class 12 Questions and Answers

  1. Python Revision tour – 1 Class 12 Questions and Answers
  2. Working with Functions Class 12 Questions and Answers
  3. Using Python Libraries Class 12 Questions and Answers
  4. File Handling Class 12 Questions and Answers
  5. Recursion Class 12 Questions and Answers
  6. Idea of Algorithmic Efficiency Class 12 Questions and Answers
  7. Data Structure Class 12 Questions and Answers
  8. More on MySQL Class 12 Questions and Answers
  9. Computer Network Class 12 Questions and Answers
  10. More on MySQL Class 12 Questions and Answers 

Computer Science Class 12 Notes

by
computer science class 12 notes

Teachers and Examiners (CBSESkillEduction) collaborated to create the Computer Science Class 12 Notes. All the important Information are taken from the NCERT Textbook Computer Science (083) class 12.

Computer Science Class 12 Notes

Unit I: Computational Thinking and Programming – 2

  • Revision of Python topics covered in Class XI.
  • Functions: types of function (built-in functions, functions defined in module, user defined
    functions), creating user defined function, arguments and parameters, default parameters,
    positional parameters, function returning value(s), flow of execution, scope of a variable (global
    scope, local scope)
  • Introduction to files, types of files (Text file, Binary file, CSV file), relative and absolute paths
  • Text file: opening a text file, text file open modes (r, r+, w, w+, a, a+), closing a text file, opening a
    file using with clause, writing/appending data to a text file using write() and writelines(), reading
    from a text file using read(), readline() and readlines(), seek and tell methods, manipulation of data
    in a text file
  • Binary file: basic operations on a binary file: open using file open modes (rb, rb+, wb, wb+, ab, ab+),
    close a binary file, import pickle module, dump() and load() method, read, write/create, search,
    append and update operations in a binary file
  • CSV file: import csv module, open / close csv file, write into a csv file using csv.writer() and read
    from a csv file using csv.reader( )
  • Data Structure: Stack, operations on stack (push & pop), implementation of stack using list.

Computer Science Class 12 Notes

  1. Python Revision tour – 1 Class 12 Notes
  2. Python Revision tour – 2 Class 12 Notes Notes
  3. Working with Functions Class 12 Notes
  4. Using Python Libraries Class 12 Notes
  5. File Handling Class 12 Notes
  6. Recursion Class 12 Notes
  7. Idea of Algorithmic Efficiency Class 12 Notes
  8. Data Visualization using Pyplot Class 12 Notes
  9. Data Structure Class 12 Notes

Computer Science Class 12 MCQ

  1. Python Revision tour – 1 Class 12 MCQs
  2. Python Revision tour – 2 Class 12 MCQs
  3. Working with Functions Class 12 MCQs
  4. Using Python Libraries Class 12 MCQs
  5. File Handling Class 12 MCQs
  6. Recursion Class 12 MCQs
  7. Data Visualization using Pyplot Class 12 MCQs
  8. Data Structure Class 12 MCQs

Computer Science Class 12 Questions and Answers

  1. Python Revision tour – 1 Class 12 Questions and Answers
  2. Working with Functions Class 12 Questions and Answers
  3. Using Python Libraries Class 12 Questions and Answers
  4. File Handling Class 12 Questions and Answers
  5. Recursion Class 12 Questions and Answers
  6. Idea of Algorithmic Efficiency Class 12 Questions and Answers
  7. Data Structure Class 12 Questions and Answers
  8. More on MySQL Class 12 Questions and Answers

Unit II: Computer Networks (Computer Science Class 12 Notes)

  • Evolution of networking: introduction to computer networks, evolution of networking (ARPANET,
    NSFNET, INTERNET)
  • Data communication terminologies: concept of communication, components of data
    communication (sender,receiver, message, communication media, protocols), measuring capacity
    of communication media (bandwidth, data transfer rate), IP address, switching techniques (Circuit
    switching, Packet switching)
  • Transmission media: Wired communication media (Twisted pair cable, Co-axial cable, Fiber-optic
    cable), Wireless media (Radio waves, Micro waves, Infrared waves)
  • Network devices (Modem, Ethernet card, RJ45, Repeater, Hub, Switch, Router, Gateway, WIFI
    card)
  • Network topologies and Network types: types of networks (PAN, LAN, MAN, WAN), networking
    topologies (Bus, Star, Tree)
  • Network protocol: HTTP, FTP, PPP, SMTP, TCP/IP, POP3, HTTPS, TELNET, VoIP
  • Introduction to web services: WWW, Hyper Text Markup Language (HTML), Extensible Markup
    Language (XML), domain names, URL, website, web browser, web servers, web hosting
  1. Computer Network Class 12 Notes
  2. Computer Network Class 12 MCQs
  3. Computer Network Class 12 Questions and Answers

Unit III: Database Management

  • Database concepts: introduction to database concepts and its need
  • Relational data model: relation, attribute, tuple, domain, degree, cardinality, keys (candidate key,
    primary key, alternate key, foreign key)
  • Structured Query Language: introduction, Data Definition Language and Data Manipulation
    Language, data type (char(n), varchar(n), int, float, date), constraints (not null, unique, primary
    key), create database, use database, show databases, drop database, show tables, create table,
    describe table, alter table (add and remove an attribute, add and remove primary key), drop table,
    insert, delete, select, operators (mathematical, relational and logical), aliasing, distinct clause,
    where clause, in, between, order by, meaning of null, is null, is not null, like, update command,
    delete command, aggregate functions (max, min, avg, sum, count), group by, having clause, joins:
    cartesian product on two tables, equi-join and natural join
  • Interface of python with an SQL database: connecting SQL with Python, performing insert, update,
    delete queries using cursor, display data by using fetchone(), fetchall(), rowcount, creating
    database connectivity applications
  1. More on MySQL Class 12 Notes
  2. More on MySQL Class 12 MCQs
  3. More on MySQL Class 12 Questions and Answers 

Data Structure Questions and Answers

by
data structure questions and answers

Teachers and Examiners (CBSESkillEduction) collaborated to create the Data Structure Questions and Answers. Al the important Information are taken from the NCERT Textbook Data Structure.

Data Structure Questions and Answers

1. What is a Data Strucuture?
Answer – A data structure is a specific type of format used to arrange, process, retrieve, and store data. There are a number of fundamental and sophisticated forms of data structures, all of which are made to organise data for a particular use. Users may easily get the data they require and use it in the proper ways thanks to data structures.

2. Why we are using Data Structures?
Answer – Users find it simple to access the data they need and use it appropriately thanks to data structures. The organising of information is framed by data structures in a way that both machines and people can better grasp.

Data Structure Questions and Answers

3. Compare a data type with a Data Strucutre.
Answer – A data type is one of the variations of a variable to which only values of that kind may be assigned. The programme can utilise this value at any time. A collection of data of several data kinds is referred to as a data structure. This data set can be used throughout the application and represented using an object.

4. What are some applications of Data structures?
Answer – Core operating system (OS) resources and operations are made possible through the usage of data structures, such as linked lists for memory allocation, file directory management and file structure trees, as well as queues for process scheduling.

Data Structure Questions and Answers

5. What is linear and non-linear data structure?
Answer – Data items are arranged in a linear order and connected to their previous and next neighbouring pieces in a linear data structure. Data elements are attached hierarchically in a non-linear data structure.

6. Describe the types of Data Structures?
Answer – A data structure is a specific type of format used to arrange, process, retrieve, and store data. There are a number of fundamental and sophisticated forms of data structures, all of which are made to organise data for a particular use. Users may easily get the data they require and use it in the proper ways thanks to data structures. There are generally four types of data structures to consider: arrays, lists: linear. Binary, heaps, space division, etc. are all examples of a tree.

Data Structure Questions and Answers

7. What common operations are performed on different Data Structures?
Answer – Some of the commonly performed operations on data strucutures are
a. Insertion – To add a new data item in the given collection of data items.
b. Deletion – To delete an existing data item from the given collection of data items.
c. Raversal – To access each data item exactly once so that it can be processed.
d. Searching – To find out the location of the data item if it exists in the given collection of data items.
e. Sorting – To arrange the data items in some order i.e. in ascending or descending order in case of numerical data and in dictionary oreder in case of alphanumeric data.

8. Differentiate between stack and queue data structure.
Answer – The main distinction between stack and queue data structures is that while queue uses a FIFO data structure type, stack uses LIFO. Last In First Out is referred to as LIFO. It implies that the last element is processed first when data is added to a stack. On the other hand, FIFO stands for First In First Out.

Data Structure Questions and Answers

9. What purpose Linear lists data structre are mostly used for?
Answer – It is a kind of data structure where information is managed and stored in an uniform manner. Each data element in the series is linked to the one before it. Since the data is arranged progressively, it is simple to implement the linear structure in a computer’s memory.

10. What is a list comprehension? How is it useful?
Answer – List comprehensions are helpful and can assist you in writing elegant code that is simple to read and debug, but they are not always the best option. They might increase memory use or slow down the performance of your code.

Data Structure Questions and Answers

11. What is a linked list data structure? What are the applications for the Linked list?
Answer – When it comes to managing dynamic data items, a linked list is the most desired data structure. A node is a type of data element found in linked lists. Additionally, each node has two fields: one field contains data, and the other field contains an address that maintains a link to the node after it.

12. What is the difference between a regular 2D list and a ragged List?
Answer – A list with entries that are lists of the same shape is referred to as a normal two-dimensional list. A ragged list is made up of lists with various shapes as its constituent parts.

Data Structure Questions and Answers

13. Difference between Array and Linked List.
Answer – An array is a grouping of objects with related data types. A linked list is an ordered grouping of identically typed elements where each element is linked to the following one via pointers. The array index can be used to randomly access array elements.

14. What is a stack? What basic operations can be performed on them?
Answer – A stack is an abstract data type used in computer science that acts as a collection of components and has two primary operations: Push, which includes an element in the collection, and. Pop, which eliminates the most recent ingredient to be added that has not yet been eliminated.

Data Structure Questions and Answers

15. Enlist some applications of stacks.
Answer – Some of the application of stacks are –
a. The evaluation of expressions with operands and operators can be done using a stack.
b. Stacks can be used for backtracking, or to verify if an expression’s parenthesis match.
c. It can also be used to change the expression from one form to another.
d. It can be applied to formally manage memories.

16. What are queues? What all operations can be performed on queues?
Answer – An object called a queue is used to control the sorted arrangement of various data kinds. Various queue actions, including Enqueue(), Dequeue(), isFull(), isNull(), and Peek().

Computer Science Class 12 Notes

  1. Python Revision tour – 1 Class 12 Notes
  2. Python Revision tour – 2 Class 12 Notes Notes
  3. Working with Functions Class 12 Notes
  4. Using Python Libraries Class 12 Notes
  5. File Handling Class 12 Notes
  6. Recursion Class 12 Notes
  7. Idea of Algorithmic Efficiency Class 12 Notes
  8. Data Visualization using Pyplot Class 12 Notes
  9. Data Structure Class 12 Notes
  10. Computer Network Class 12 Notes
  11. More on MySQL Class 12 Notes

MCQ for Class 12 Computer Science Python

  1. Python Revision tour – 1 Class 12 MCQs
  2. Python Revision tour – 2 Class 12 MCQs
  3. Working with Functions Class 12 MCQs
  4. Using Python Libraries Class 12 MCQs
  5. File Handling Class 12 MCQs
  6. Recursion Class 12 MCQs
  7. Data Visualization using Pyplot Class 12 MCQs
  8. Data Structure Class 12 MCQs
  9. Computer Network Class 12 MCQs
  10. More on MySQL Class 12 MCQs

Computer Science Class 12 Questions and Answers

  1. Python Revision tour – 1 Class 12 Questions and Answers
  2. Working with Functions Class 12 Questions and Answers
  3. Using Python Libraries Class 12 Questions and Answers
  4. File Handling Class 12 Questions and Answers
  5. Recursion Class 12 Questions and Answers
  6. Idea of Algorithmic Efficiency Class 12 Questions and Answers
  7. Data Structure Class 12 Questions and Answers
  8. Computer Network Class 12 Questions and Answers
  9. More on MySQL Class 12 Questions and Answers 

Data Structure MCQ With Answer

by
data structure mcq

Teachers and Examiners (CBSESkillEduction) collaborated to create the Data Structure MCQ. Al the important Information are taken from the NCERT Textbook Data Structure.

Data Structure MCQ With Answer

1. The computer system is used essentially as data manipulation system where __________ are very important things for it.
a. Data 
b. Data Strucutre
c. Program
d. None of the above

Show Answer ⟶
a. Data

2. Representation of data can be in forms of _________.
a. Raw data
b. Data item
c. Data structures
d. All of the above 

Show Answer ⟶
d. All of the above

3. Which of the following algorithms is used to solve problems involving pattern and string matching?
a. Robin Karp Algorithm
b. Z Algorithm
c. KMP Algorihtm
d. All of the above 

Show Answer ⟶
d. All of the above

4. A __________ is a physical implementation that clearly defiens a way of storing, accessing, manipulating data stored in a data strucutre.
a. Data Structure 
b. Data Program
c. Data Storage
d. None of the above

Show Answer ⟶
a. Data Structure

Data Structure MCQ With Answer

5. Which of the following algorithms uses a Divide and Conquer algorithm?
a. Merge Sort 
b. Bubble Sort
c. Quick Sort
d. None of the above

Show Answer ⟶
a. Merge Sort

6. ___________ data strucutres are normally built from primitive data types like integers, reals, characters, boolean.
a. Simple Data Strucutre 
b. Compound Data Strucutre
c. Both a) and b)
d. None of the above

Show Answer ⟶
a. Simple Data Strucutre

7. Simple data structures can be combined in various ways to form more complex strucutes called ____________.
a. Simple Data Strucutre
b. Compound Data Strucutre 
c. Both a) and b)
d. None of the above

Show Answer ⟶
b. Compound Data Strucutre

8. Example of Linear data structrues are _____________.
a. Stack
b. Queue
c. Linked List
d. All of the above 

Show Answer ⟶
d. All of the above

9. Example of Non-linear data strucutre are _________.
a. Stack & Queue
b. Linked List
c. Tree 
d. All of the above

Show Answer ⟶
c. Tree

Data Structure MCQ With Answer

10. _________ refer to a named list of a finite number n of similar data elements.
a. Linear List
b. Arrays
c. Both a) and b) 
d. None of the above

Show Answer ⟶
c. Both a) and b)

11. Arrays can be ___________.
a. One dimensional
b. Two dimensional
c. Multi dimensional
d. All of the above 

Show Answer ⟶
d. All of the above

12. _________ data strucutres refer to the lists stored and accessed in a special way, Where LIFO (Last in first out) technique is followed.
a. Stacks 
b. Queue
c. Linked List
d. None of the above

Show Answer ⟶
a. Stacks

13. __________ data strucutres are FIFO (First in First out) lists, where insertions take place at the “rear” end of the queues and deletions take palce at the “front” end of the queues.
a. Stacks
b. Queue 
c. Linked List
d. None of the above

Show Answer ⟶
b. Queue

14. _________ lists are special lists of some data elements linked to one another. The logical ordering is represented by having each element pointing to the next element.
a. Stacks
b. Queue
c. Linked List 
d. None of the above

Show Answer ⟶
c. Linked List

Data Structure MCQ With Answer

15. Trees are multilevel data strucutre having a hierarchical relationship among its elements called ________.
a. Node 
b. Reference
c. Link
d. None of the above

Show Answer ⟶
a. Node

16. Which one of the following is not a type of queue?
a. Single – ended queue 
b. Circular queue
c. Priority queue
d. Ordinary queue

Show Answer ⟶
a. Single – ended queue

17. Which of the following does not represent a data structure operation?
a. Operations that manipulate data in some way 
b. Operations that perform a computation
c. Operations that monitor an object for the occurrence of a controlling event
d. Operations that check for syntax errors

Show Answer ⟶
a. Operations that manipulate data in some way

18. What are the basic operations that are performed on data structures _________.
a. Insertion
b. Deletion
c. Searching
d. All of the above 

Show Answer ⟶
d. All of the above

19. When elements of linear strucutes are homogeneous and are represented in memory by means of sequentional momoey location, these linear strucures are called _________.
a. String
b. Arrays 
c. List
d. None of the above

Show Answer ⟶
b. Arrays

Data Structure MCQ With Answer

20. What data structure is necessary to change infix notation into prefix notation?
a. Stack 
b. Linked list
c. Binary tree
d. Queue

Show Answer ⟶
a. Stack

21. If the stack is implemented using a linked list, which of the following nodes is considered as the top of the stack?
a. First node 
b. Second node
c. Last node
d. None of the above

Show Answer ⟶
a. First node

22. Linear List or Arrarys are one of the simplest data strucures and are very easy to _________.
a. Traverse
b. Search
c. Sort
d. All of the above 

Show Answer ⟶
d. All of the above

23. What are the different searching algorithms in Data structre.
a. Linear Search
b. Binary Search
c. Both a) and b) 
d. None of the above

Show Answer ⟶
c. Both a) and b)

24. In the ________ search, each element of the array list is compared with the given item to be searched for, One by One.
a. Linear search
b. Sequential search
c. Both a) and b) 
d. None of the above

Show Answer ⟶
c. Both a) and b)

Data Structure MCQ With Answer

25. In _________ search, the ITEM is searched for in smaller segment (nearly half the previous segment) after every stage.
a. Linear serach
b. Sequential search
c. Binary serach 
d. None of the above

Show Answer ⟶
c. Binary serach

26. The __________ refers to arranging elements of a list in ascending or descending order.
a. Order wise
b. Sorting 
c. Algorithms
d. None of the above

Show Answer ⟶
b. Sorting

27. What are the advantages of list comprehensions in Python.
a. Code reduction
b. Faster code processing
c. Both a) and b) 
d. None of the above

Show Answer ⟶
c. Both a) and b)

28. What is the maximum number of swaps that can be performed in the Selection Sort algroithm?
a. n – 2
b. n
c. n + 2
d. n – 1 

Show Answer ⟶
d. n – 1

29. The condition is known as___ if the stack has a size of 10 and we attempt to add the 11th element to it.
a. Underflow
b. Garbage collection
c. Overflow 
d. None of the above

Show Answer ⟶
c. Overflow

Data Structure MCQ With Answer

30. Which data structure is mostly used in the recursive algorithm’s implementation?
a. Queue
b. Stack 
c. Binary tree
d. Linked list

Show Answer ⟶
b. Stack

31. What data structures from the list below can be utilised to implement queues?
a. Stack
b. Linked List
c. Arrays
d. All of the above 

Show Answer ⟶
d. All of the above

32. What do you mean by code reduction.
a. A code of 3 or more lines gets reduced to a single line of code 
b. A code of 3 or more lines converted into a multiple lines
c. Both a) and b)
d. None of the above

Show Answer ⟶
a. A code of 3 or more lines gets reduced to a single line of code

33. If you want to create 2D list by inputting element by element, you can employ a ____________ loop.
a. Single loop
b. Nested loop 
c. Both a) and b)
d. None of the above

Show Answer ⟶
b. Nested loop

34. Which of the following sorting algorithms, in the worst-case situation, offers the best temporal complexity?
a. Quick Sort
b. Bubble Sort
c. Merge Sort 
d. None of the above

Show Answer ⟶
c. Merge Sort

Data Structure MCQ With Answer

35. A ____________ is a named group of data of different data types which can be processed as a single unit.
a. Data Type
b. Data Strucutre 
c. Data Item
d. None of the above

Show Answer ⟶
b. Data Strucutre

36. ________ data sturctre are normally built from primitive data types.
a. Simple 
b. Compound
c. Both a) and b)
d. None of the above

Show Answer ⟶
a. Simple

37. When an empty queue receives a pop() request. What is the name of the condition?
a. Underflow 
b. Overflow
c. Peek
d. None of the above

Show Answer ⟶
a. Underflow

38. ___________ data structure may be linear and no-linear.
a. Simple
b. Compound 
c. Both a) and b)
d. None of the above

Show Answer ⟶
b. Compound

39. What data structure from the list below is used in recursion?
a. Stack 
b. Linked List
c. Arrays
d. Queues

Show Answer ⟶
a. Stack

Data Structure MCQ With Answer

40. Which of the following data structures allows for both end-to-end insertion and deletion?
a. Stack
b. Queue
c. Deque 
d. None of the above

Show Answer ⟶
c. Deque

41. In an n-ary tree, how many kids can a node have at once?
a. Infinite node 
b. 3
c. 2
d. 0

Show Answer ⟶
a. Infinite node

42. A __________ referes to a named list of a finite number n of similar data elements whereas a structure refers to a named collection of variables of different data types.
a. Linear List
b. Arrays
c. Both a) and b) 
d. None of the above

Show Answer ⟶
c. Both a) and b)

43. Stacks are __________ lists where insertions and deletions take place only at one end.
a. LIFO (Last in First Out) 
b. FIFO (First in First Out)
c. Both a) and b)
d. None of the above

Show Answer ⟶
a. LIFO (Last in First Out)

44. What are the drawbacks of the array data structure?
a. Elements of an array can be sorted
b. Easier to access the elements in an array
c. Elements of mixed data tyeps can be stored
d. Index of the first element starts from 0

Show Answer ⟶
c. Elements of mixed data tyeps can be stored

Data Structure MCQ With Answer

45. Queues are __________ lists where insertions take place at “rear” end and deletions take place at the “front” end.
a. LIFO (Last in First Out)
b. FIFO (First in First Out) 
c. Both a) and b)
d. None of the above

Show Answer ⟶
b. FIFO (First in First Out)

46. In __________, each element of the array is compared with the given item to be searched for, one by one.
a. Linear search 
b. Binary search
c. Both a) and b)
d. None of the above

Show Answer ⟶
a. Linear search

47. A ___________ is a concise description of a list that shorthands the list creating for loop in the form of a single statement.
a. List Comprehension 
b. Queues Comprehension
c. Both a) and b)
d. None of the above

Show Answer ⟶
a. List Comprehension

48. What type of data is required to be stored by a LinkedList’s Node?
a. The value of the current node
b. The address of the next node
c. Both a) and b) 
d. None of the above

Show Answer ⟶
c. Both a) and b)

49. Stack is a list of data that follows ___________ rules.
a. Data can only be removed from the top
b. A new data element can only be added to the top of the stack.
c. Both a) and b) 
d. None of the above

Show Answer ⟶
c. Both a) and b)

Data Structure MCQ With Answer

50. How is a string stored in memory?
a. The Object of some class
b. An array of characters 
c. Same as other primitive data types
d. LinkedList of charcaters.

Show Answer ⟶
b. An array of characters

51. _________ refers to inspecting the value at the stack’s top without removing it. It is also sometimes referred as inspection.
a. Peek 
b. Overflow
c. Underflow
d. None of the above

Show Answer ⟶
a. Peek

52. What is the binary search algorithm’s time complexity?
a. O(n^2)
b. O(n)
c. O(1)
d. O(log2n) 

Show Answer ⟶
d. O(log2n)

53. ________ refers to situation (ERROR) when one tries to push an item in stack that is full.
a. Peek
b. Overflow 
c. Underflow
d. None of the above

Show Answer ⟶
b. Overflow

54. What are the disadvantages of the array data structure?
a. Elements of an array can be accessed in constant time
b. The amount of memory to be allocated should be known beforehand
c. Multiple other data strucutre can be implementd using arrays.
d. Elements are stored in contiguous memory blocks

Show Answer ⟶
b. The amount of memory to be allocated should be known beforehand

Data Structure MCQ With Answer

55. _________ refers to situation (ERROR) when one tries to pop/delete an item from an empty stack.
a. Peek
b. Overflow
c. Underflow 
d. None of the above

Show Answer ⟶
c. Underflow

Computer Science Class 12 Notes

  1. Python Revision tour – 1 Class 12 Notes
  2. Python Revision tour – 2 Class 12 Notes Notes
  3. Working with Functions Class 12 Notes
  4. Using Python Libraries Class 12 Notes
  5. File Handling Class 12 Notes
  6. Recursion Class 12 Notes
  7. Idea of Algorithmic Efficiency Class 12 Notes
  8. Data Visualization using Pyplot Class 12 Notes
  9. Data Structure Class 12 Notes
  10. Computer Network Class 12 Notes
  11. More on MySQL Class 12 Notes

MCQ for Class 12 Computer Science Python

  1. Python Revision tour – 1 Class 12 MCQs
  2. Python Revision tour – 2 Class 12 MCQs
  3. Working with Functions Class 12 MCQs
  4. Using Python Libraries Class 12 MCQs
  5. File Handling Class 12 MCQs
  6. Recursion Class 12 MCQs
  7. Data Visualization using Pyplot Class 12 MCQs
  8. Data Structure Class 12 MCQs
  9. Computer Network Class 12 MCQs
  10. More on MySQL Class 12 MCQs

Computer Science Class 12 Questions and Answers

  1. Python Revision tour – 1 Class 12 Questions and Answers
  2. Working with Functions Class 12 Questions and Answers
  3. Using Python Libraries Class 12 Questions and Answers
  4. File Handling Class 12 Questions and Answers
  5. Recursion Class 12 Questions and Answers
  6. Idea of Algorithmic Efficiency Class 12 Questions and Answers
  7. Data Structure Class 12 Questions and Answers
  8. More on MySQL Class 12 Questions and Answers
  9. Computer Network Class 12 Questions and Answers
  10. More on MySQL Class 12 Questions and Answers 

MCQ on Data Visualization in Python Class 12

by

Teachers and Examiners (CBSESkillEduction) collaborated to create the MCQ on Data Visualization in Python Class 12. All the important Information are taken from the NCERT Textbook Computer Science (083) class 12.

MCQ on Data Visualization in Python Class 12

1. _________ basically refers to the graphical or visual representation of information and data using visual elements like chart, graphs, and maps etc.
a. Data Visualization
b. Matplotlib
c. PyPlot
d. None of the above

Show Answer ⟶
a. Data Visualization

2. _________ is a Python library that provided many interfaces and functionality for 2D-graphics.
a. Data Visualization
b. Matplotlib
c. PyPlot
d. None of the above

Show Answer ⟶
b. Matplotlib

3. __________ is a collection of mathods within matplotlib which allow user to construct 2D plots easily and interactively.
a. Data Visualization
b. Matplotlib
c. PyPlot
d. None of the above

Show Answer ⟶
c. PyPlot

4. In order to use PyPlot on your computers for data visulization, you need to first import it in your Python environment by issuing _________ command for matplotlib pyplot.
a. Insert
b. Import
c. Retrive
d. None of the above

Show Answer ⟶
b. Import

5. _________ is a Python library that offer many functions for creating and manipulating arrays, which come handy while plotting.
a. NumPy
b. Matplotlib
c. PyPlot
d. None of the above

Show Answer ⟶
a. NumPy

6. NumPy arrary are also called ________.
a. MatArrarys
b. NdArrays
c. NumPyArrays
d. None of the above

Show Answer ⟶
b. NdArrays

7. Which type of chart are available in data visulization.
a. Line chart
b. bar chart
c. Pie chart & Scatter chart
d. All of the above

Show Answer ⟶
d. All of the above

8. ________ is a type of chart which displays information as a series of data points called ‘markers’ connected by straight line segments.
a. Line chart
b. Line graph
c. Both a) and b)
d. None of the above

Show Answer ⟶
c. Both a) and b)

9. You can create line charts by using PyPlot’s _______ fucntion
a. Myplot()
b. Plot()
c. Both a) and b)
d. None of the above

Show Answer ⟶
b. Plot()

10. You can change line color, width, line-style, marker-type using ________ function.
a. Myplot()
b. Plot()
c. Both a) and b)
d. None of the above

Show Answer ⟶
b. Plot()

11. A _________ is a graphical display of data using bars of different heights.
a. Bar Graph or Bar Chart
b. Line Chart
c. Pie Chart
d. None of the above

Show Answer ⟶
a. Bar Graph or Bar Chart

12. You can create a bar chart using pyplot’s ________ function.
a. pie()
b. bar()
c. line()
d. None of the above

Show Answer ⟶
b. bar()

13. You can change colors of the bars, widths of the bars in ________ function.
a. bar()
b. pie()
c. line()
d. None of the above

Show Answer ⟶
a. bar()

14. The _________ is a type of graph in which a circle is diveded into sectors that each represent a proporation of the whole.
a. Pie chart
b. Bar chart
c. Line chart
d. None of the above

Show Answer ⟶
a. Pie chart

15. By default, the pie chart is _________ in shaper but you can change to circular shaper by giving command.
a. Oval
b. Square
c. Circle
d. All of the above

Show Answer ⟶
a. Oval

16. The axes can be labelled using _________ and _________ function.
a. xlabel() and ylabel()
b. labelx() and labely()
c. Both a) and b)
d. None of the above

Show Answer ⟶
a. xlabel() and ylabel()

17. The tick marks for axes values can be defined using _______ and ________ functions.
a. ticks() and ticks()
b. xticks() and yticks()
c. ticksx() and ticksy()
d. None of the above

Show Answer ⟶
b. xticks() and yticks()

18. Using __________ function, one can add legends to a plot where multiple data ranges have been plotted, but before that the data ranges must have their label argument defined in plot() or bar() function.
a. legend()
b. legends()
c. leg()
d. None of the above

Show Answer ⟶
a. legend()

Computer Science Class 12 Notes

  1. Python Revision tour – 1 Class 12 Notes
  2. Python Revision tour – 2 Class 12 Notes Notes
  3. Working with Functions Class 12 Notes
  4. Using Python Libraries Class 12 Notes
  5. File Handling Class 12 Notes
  6. Recursion Class 12 Notes
  7. Idea of Algorithmic Efficiency Class 12 Notes
  8. Data Visualization using Pyplot Class 12 Notes
  9. Data Structure Class 12 Notes
  10. Computer Network Class 12 Notes
  11. More on MySQL Class 12 Notes

MCQ for Class 12 Computer Science Python

  1. Python Revision tour – 1 Class 12 MCQs
  2. Python Revision tour – 2 Class 12 MCQs
  3. Working with Functions Class 12 MCQs
  4. Using Python Libraries Class 12 MCQs
  5. File Handling Class 12 MCQs
  6. Recursion Class 12 MCQs
  7. Data Visualization using Pyplot Class 12 MCQs
  8. Data Structure Class 12 MCQs
  9. Computer Network Class 12 MCQs
  10. More on MySQL Class 12 MCQs

Computer Science Class 12 Questions and Answers

  1. Python Revision tour – 1 Class 12 Questions and Answers
  2. Working with Functions Class 12 Questions and Answers
  3. Using Python Libraries Class 12 Questions and Answers
  4. File Handling Class 12 Questions and Answers
  5. Recursion Class 12 Questions and Answers
  6. Idea of Algorithmic Efficiency Class 12 Questions and Answers
  7. Data Structure Class 12 Questions and Answers
  8. More on MySQL Class 12 Questions and Answers
  9. Computer Network Class 12 Questions and Answers
  10. More on MySQL Class 12 Questions and Answers 
error: Content is protected !!