All Courses
Get the App Signup / Login
Sign in Open App
Humanities/Arts Exam  >  Humanities/Arts Notes  >  CBSE Sample Papers for Class 12 Humanities  >  Class 12 Computer Science: CBSE Marking Scheme (2024-25)

Class 12 Computer Science: CBSE Marking Scheme (2024-25) | CBSE Sample Papers for Class 12 Humanities - Humanities/Arts PDF Download

Download, print and study this document offline
Please wait while the PDF view is loading
 Page 1


Page: 1/11 
MARKING SCHEME 
Class: XII Session: 2024-25 
Computer Science (083) 
 
Time allowed: 3 Hours           Maximum Marks: 70 
Q No. SECTION A (21X1=21) Marks 
1.  False 
(1 mark for correct answer) 
(1) 
 
2.  (A) #THONPROGRAM       
(1 mark for correct answer)           
(1) 
3.  (A) not (True) and False 
(1 mark for correct answer) 
(1) 
4.  (B) ['I', 'ter', 'atio', 'al']  
(1 mark for correct answer) 
(1) 
5.  ce lo 
(1 mark for correct answer) 
(1) 
6.  (B) False  
(1 mark for correct answer)  
(1) 
7.  (B) print(my_dict['apple', 'banana']) 
(1 mark for correct answer) 
(1) 
8.  (B) Removes the first occurrence of value x from the list 
(1 mark for correct answer) 
(1) 
9.  (C) 3 
(1 mark for correct answer) 
(1) 
10.  file.seek(0) ( OR file.seek(0,0) )  
(1 mark for correct answer) 
(1) 
11.  False 
(1 mark for correct answer) 
(1) 
12.  (C) 12#15% 
(1 mark for correct answer) 
(1) 
13.  Alter (or Alter Table) 
(1 mark for correct answer) 
(1) 
 
 
Page 2


Page: 1/11 
MARKING SCHEME 
Class: XII Session: 2024-25 
Computer Science (083) 
 
Time allowed: 3 Hours           Maximum Marks: 70 
Q No. SECTION A (21X1=21) Marks 
1.  False 
(1 mark for correct answer) 
(1) 
 
2.  (A) #THONPROGRAM       
(1 mark for correct answer)           
(1) 
3.  (A) not (True) and False 
(1 mark for correct answer) 
(1) 
4.  (B) ['I', 'ter', 'atio', 'al']  
(1 mark for correct answer) 
(1) 
5.  ce lo 
(1 mark for correct answer) 
(1) 
6.  (B) False  
(1 mark for correct answer)  
(1) 
7.  (B) print(my_dict['apple', 'banana']) 
(1 mark for correct answer) 
(1) 
8.  (B) Removes the first occurrence of value x from the list 
(1 mark for correct answer) 
(1) 
9.  (C) 3 
(1 mark for correct answer) 
(1) 
10.  file.seek(0) ( OR file.seek(0,0) )  
(1 mark for correct answer) 
(1) 
11.  False 
(1 mark for correct answer) 
(1) 
12.  (C) 12#15% 
(1 mark for correct answer) 
(1) 
13.  Alter (or Alter Table) 
(1 mark for correct answer) 
(1) 
 
 
Page: 2/11 
14.  (A) Details of all products whose names start with 'App' 
(1 mark for correct answer) 
(1) 
15.  (D) CHAR 
(1 mark for correct answer) 
(1) 
16.  (B) count() 
(1 mark for correct answer) 
(1) 
17.  (B) FTP 
(1 mark for correct answer) 
(1) 
18.  (B) Gateway 
(1 mark for correct answer) 
(1) 
19.  (B) Packet Switching 
(1 mark for correct answer) 
(1) 
20.  (C) A is True but R is False. 
(1 mark for correct answer) 
(1) 
21.  (C) A is True but R is False. 
(1 mark for correct answer) 
(1) 
 
Q No. SECTION B (7 X 2 =14) Marks 
22.  A mutable object can be updated whereas an immutable object cannot be 
updated. 
Mutable object: [1,2] or  {1:1,2:2}  (Any one) 
Immutable object: (1,2) or ‘123’ (Any one) 
(1 mark for correct difference) 
(½ x 2 = 1 Mark for selecting correct objects) 
(2) 
23.  
(I) Arithmetic operators: +,-    
(II) Relational operators: >, >= 
(½ x 4 = 2 Marks for each correct operator) 
(2) 
24.  (I) 
     A) L1.count(4) 
OR 
     B) L1.sort() 
(1 mark for correct answer) 
 
(2) 
Page 3


Page: 1/11 
MARKING SCHEME 
Class: XII Session: 2024-25 
Computer Science (083) 
 
Time allowed: 3 Hours           Maximum Marks: 70 
Q No. SECTION A (21X1=21) Marks 
1.  False 
(1 mark for correct answer) 
(1) 
 
2.  (A) #THONPROGRAM       
(1 mark for correct answer)           
(1) 
3.  (A) not (True) and False 
(1 mark for correct answer) 
(1) 
4.  (B) ['I', 'ter', 'atio', 'al']  
(1 mark for correct answer) 
(1) 
5.  ce lo 
(1 mark for correct answer) 
(1) 
6.  (B) False  
(1 mark for correct answer)  
(1) 
7.  (B) print(my_dict['apple', 'banana']) 
(1 mark for correct answer) 
(1) 
8.  (B) Removes the first occurrence of value x from the list 
(1 mark for correct answer) 
(1) 
9.  (C) 3 
(1 mark for correct answer) 
(1) 
10.  file.seek(0) ( OR file.seek(0,0) )  
(1 mark for correct answer) 
(1) 
11.  False 
(1 mark for correct answer) 
(1) 
12.  (C) 12#15% 
(1 mark for correct answer) 
(1) 
13.  Alter (or Alter Table) 
(1 mark for correct answer) 
(1) 
 
 
Page: 2/11 
14.  (A) Details of all products whose names start with 'App' 
(1 mark for correct answer) 
(1) 
15.  (D) CHAR 
(1 mark for correct answer) 
(1) 
16.  (B) count() 
(1 mark for correct answer) 
(1) 
17.  (B) FTP 
(1 mark for correct answer) 
(1) 
18.  (B) Gateway 
(1 mark for correct answer) 
(1) 
19.  (B) Packet Switching 
(1 mark for correct answer) 
(1) 
20.  (C) A is True but R is False. 
(1 mark for correct answer) 
(1) 
21.  (C) A is True but R is False. 
(1 mark for correct answer) 
(1) 
 
Q No. SECTION B (7 X 2 =14) Marks 
22.  A mutable object can be updated whereas an immutable object cannot be 
updated. 
Mutable object: [1,2] or  {1:1,2:2}  (Any one) 
Immutable object: (1,2) or ‘123’ (Any one) 
(1 mark for correct difference) 
(½ x 2 = 1 Mark for selecting correct objects) 
(2) 
23.  
(I) Arithmetic operators: +,-    
(II) Relational operators: >, >= 
(½ x 4 = 2 Marks for each correct operator) 
(2) 
24.  (I) 
     A) L1.count(4) 
OR 
     B) L1.sort() 
(1 mark for correct answer) 
 
(2) 
Page: 3/11 
 (II)  
     A) L1.extend(L2) 
OR 
      B) L2.reverse() 
(1 mark for correct answer) 
25.  
(A), (C)   
 (½ x 2 = 1 Mark) 
Minimum and maximum possible values of the variable b: 1,6   
(½ x 2 = 1 Mark) 
(2) 
26.  def swap_first_last(tup): 
    if len(tup) < 2: 
        return tup 
    new_tup = (tup[-1],) + tup[1:-1] + (tup[0],) 
    return new_tup 
 
result = swap_first_last((1, 2, 3, 4)) 
print("Swapped tuple:", result) 
 
(½ mark each for correcting 4 mistakes) 
(2) 
27.  
(I)  
A) UNIQUE 
OR 
B) NOT NULL 
(1 mark for correct answer) 
(II)  
A) ALTER TABLE MOBILE DROP PRIMARY KEY; 
OR 
B) ALTER TABLE MOBILE ADD PRIMARY KEY (M_ID); 
(1 mark for correct answer) 
(2) 
28.  
A) Advantage: Network extension is easy. 
Disadvantage: Failure of switch/hub results in failure of the network. 
(1 mark for correct Advantage) 
(1 mark for correct Disadvantage) 
OR 
 
(2) 
Page 4


Page: 1/11 
MARKING SCHEME 
Class: XII Session: 2024-25 
Computer Science (083) 
 
Time allowed: 3 Hours           Maximum Marks: 70 
Q No. SECTION A (21X1=21) Marks 
1.  False 
(1 mark for correct answer) 
(1) 
 
2.  (A) #THONPROGRAM       
(1 mark for correct answer)           
(1) 
3.  (A) not (True) and False 
(1 mark for correct answer) 
(1) 
4.  (B) ['I', 'ter', 'atio', 'al']  
(1 mark for correct answer) 
(1) 
5.  ce lo 
(1 mark for correct answer) 
(1) 
6.  (B) False  
(1 mark for correct answer)  
(1) 
7.  (B) print(my_dict['apple', 'banana']) 
(1 mark for correct answer) 
(1) 
8.  (B) Removes the first occurrence of value x from the list 
(1 mark for correct answer) 
(1) 
9.  (C) 3 
(1 mark for correct answer) 
(1) 
10.  file.seek(0) ( OR file.seek(0,0) )  
(1 mark for correct answer) 
(1) 
11.  False 
(1 mark for correct answer) 
(1) 
12.  (C) 12#15% 
(1 mark for correct answer) 
(1) 
13.  Alter (or Alter Table) 
(1 mark for correct answer) 
(1) 
 
 
Page: 2/11 
14.  (A) Details of all products whose names start with 'App' 
(1 mark for correct answer) 
(1) 
15.  (D) CHAR 
(1 mark for correct answer) 
(1) 
16.  (B) count() 
(1 mark for correct answer) 
(1) 
17.  (B) FTP 
(1 mark for correct answer) 
(1) 
18.  (B) Gateway 
(1 mark for correct answer) 
(1) 
19.  (B) Packet Switching 
(1 mark for correct answer) 
(1) 
20.  (C) A is True but R is False. 
(1 mark for correct answer) 
(1) 
21.  (C) A is True but R is False. 
(1 mark for correct answer) 
(1) 
 
Q No. SECTION B (7 X 2 =14) Marks 
22.  A mutable object can be updated whereas an immutable object cannot be 
updated. 
Mutable object: [1,2] or  {1:1,2:2}  (Any one) 
Immutable object: (1,2) or ‘123’ (Any one) 
(1 mark for correct difference) 
(½ x 2 = 1 Mark for selecting correct objects) 
(2) 
23.  
(I) Arithmetic operators: +,-    
(II) Relational operators: >, >= 
(½ x 4 = 2 Marks for each correct operator) 
(2) 
24.  (I) 
     A) L1.count(4) 
OR 
     B) L1.sort() 
(1 mark for correct answer) 
 
(2) 
Page: 3/11 
 (II)  
     A) L1.extend(L2) 
OR 
      B) L2.reverse() 
(1 mark for correct answer) 
25.  
(A), (C)   
 (½ x 2 = 1 Mark) 
Minimum and maximum possible values of the variable b: 1,6   
(½ x 2 = 1 Mark) 
(2) 
26.  def swap_first_last(tup): 
    if len(tup) < 2: 
        return tup 
    new_tup = (tup[-1],) + tup[1:-1] + (tup[0],) 
    return new_tup 
 
result = swap_first_last((1, 2, 3, 4)) 
print("Swapped tuple:", result) 
 
(½ mark each for correcting 4 mistakes) 
(2) 
27.  
(I)  
A) UNIQUE 
OR 
B) NOT NULL 
(1 mark for correct answer) 
(II)  
A) ALTER TABLE MOBILE DROP PRIMARY KEY; 
OR 
B) ALTER TABLE MOBILE ADD PRIMARY KEY (M_ID); 
(1 mark for correct answer) 
(2) 
28.  
A) Advantage: Network extension is easy. 
Disadvantage: Failure of switch/hub results in failure of the network. 
(1 mark for correct Advantage) 
(1 mark for correct Disadvantage) 
OR 
 
(2) 
Page: 4/11 
B) SMTP: Simple Mail Transfer Protocol. 
    SMTP is used for sending e-mails from client to server. 
(1 mark for correct expansion) 
(1 mark for correct usage) 
 
 
Q No. SECTION C (3 X 3 = 9) Marks 
29.  
(A)  
def show(): 
    f=open("Email.txt",'r') 
    data=f.read() 
    words=data.split() 
    for word in words: 
        if '@cmail' in word: 
            print(word,end=' ') 
    f.close() 
(½ mark for correct function header)  
(½ mark for correctly opening the file) 
(½ mark for correctly reading from the file)  
(½ mark for splitting the text into words)  
(1 mark for correctly displaying the desired words) 
OR 
(B)  
def display_long_words(): 
    with open("Words.txt", 'r') as file: 
        data=file.read() 
        words=data.split() 
        for word in words: 
           if len(word)>5: 
               print(word,end=' ') 
(½ mark for correct function header)  
(½ mark for correctly opening the file) 
(½ mark for correctly reading from the file)  
( ½  mark for splitting the text into words)  
(1 mark for correctly displaying the desired words) 
(3) 
Page 5


Page: 1/11 
MARKING SCHEME 
Class: XII Session: 2024-25 
Computer Science (083) 
 
Time allowed: 3 Hours           Maximum Marks: 70 
Q No. SECTION A (21X1=21) Marks 
1.  False 
(1 mark for correct answer) 
(1) 
 
2.  (A) #THONPROGRAM       
(1 mark for correct answer)           
(1) 
3.  (A) not (True) and False 
(1 mark for correct answer) 
(1) 
4.  (B) ['I', 'ter', 'atio', 'al']  
(1 mark for correct answer) 
(1) 
5.  ce lo 
(1 mark for correct answer) 
(1) 
6.  (B) False  
(1 mark for correct answer)  
(1) 
7.  (B) print(my_dict['apple', 'banana']) 
(1 mark for correct answer) 
(1) 
8.  (B) Removes the first occurrence of value x from the list 
(1 mark for correct answer) 
(1) 
9.  (C) 3 
(1 mark for correct answer) 
(1) 
10.  file.seek(0) ( OR file.seek(0,0) )  
(1 mark for correct answer) 
(1) 
11.  False 
(1 mark for correct answer) 
(1) 
12.  (C) 12#15% 
(1 mark for correct answer) 
(1) 
13.  Alter (or Alter Table) 
(1 mark for correct answer) 
(1) 
 
 
Page: 2/11 
14.  (A) Details of all products whose names start with 'App' 
(1 mark for correct answer) 
(1) 
15.  (D) CHAR 
(1 mark for correct answer) 
(1) 
16.  (B) count() 
(1 mark for correct answer) 
(1) 
17.  (B) FTP 
(1 mark for correct answer) 
(1) 
18.  (B) Gateway 
(1 mark for correct answer) 
(1) 
19.  (B) Packet Switching 
(1 mark for correct answer) 
(1) 
20.  (C) A is True but R is False. 
(1 mark for correct answer) 
(1) 
21.  (C) A is True but R is False. 
(1 mark for correct answer) 
(1) 
 
Q No. SECTION B (7 X 2 =14) Marks 
22.  A mutable object can be updated whereas an immutable object cannot be 
updated. 
Mutable object: [1,2] or  {1:1,2:2}  (Any one) 
Immutable object: (1,2) or ‘123’ (Any one) 
(1 mark for correct difference) 
(½ x 2 = 1 Mark for selecting correct objects) 
(2) 
23.  
(I) Arithmetic operators: +,-    
(II) Relational operators: >, >= 
(½ x 4 = 2 Marks for each correct operator) 
(2) 
24.  (I) 
     A) L1.count(4) 
OR 
     B) L1.sort() 
(1 mark for correct answer) 
 
(2) 
Page: 3/11 
 (II)  
     A) L1.extend(L2) 
OR 
      B) L2.reverse() 
(1 mark for correct answer) 
25.  
(A), (C)   
 (½ x 2 = 1 Mark) 
Minimum and maximum possible values of the variable b: 1,6   
(½ x 2 = 1 Mark) 
(2) 
26.  def swap_first_last(tup): 
    if len(tup) < 2: 
        return tup 
    new_tup = (tup[-1],) + tup[1:-1] + (tup[0],) 
    return new_tup 
 
result = swap_first_last((1, 2, 3, 4)) 
print("Swapped tuple:", result) 
 
(½ mark each for correcting 4 mistakes) 
(2) 
27.  
(I)  
A) UNIQUE 
OR 
B) NOT NULL 
(1 mark for correct answer) 
(II)  
A) ALTER TABLE MOBILE DROP PRIMARY KEY; 
OR 
B) ALTER TABLE MOBILE ADD PRIMARY KEY (M_ID); 
(1 mark for correct answer) 
(2) 
28.  
A) Advantage: Network extension is easy. 
Disadvantage: Failure of switch/hub results in failure of the network. 
(1 mark for correct Advantage) 
(1 mark for correct Disadvantage) 
OR 
 
(2) 
Page: 4/11 
B) SMTP: Simple Mail Transfer Protocol. 
    SMTP is used for sending e-mails from client to server. 
(1 mark for correct expansion) 
(1 mark for correct usage) 
 
 
Q No. SECTION C (3 X 3 = 9) Marks 
29.  
(A)  
def show(): 
    f=open("Email.txt",'r') 
    data=f.read() 
    words=data.split() 
    for word in words: 
        if '@cmail' in word: 
            print(word,end=' ') 
    f.close() 
(½ mark for correct function header)  
(½ mark for correctly opening the file) 
(½ mark for correctly reading from the file)  
(½ mark for splitting the text into words)  
(1 mark for correctly displaying the desired words) 
OR 
(B)  
def display_long_words(): 
    with open("Words.txt", 'r') as file: 
        data=file.read() 
        words=data.split() 
        for word in words: 
           if len(word)>5: 
               print(word,end=' ') 
(½ mark for correct function header)  
(½ mark for correctly opening the file) 
(½ mark for correctly reading from the file)  
( ½  mark for splitting the text into words)  
(1 mark for correctly displaying the desired words) 
(3) 
Page: 5/11 
30.  (A) 
(I)  
def push_book(BooksStack, new_book): 
  BooksStack.append(new_book) 
(II)  
def pop_book(BooksStack): 
    if not BooksStack: 
        print("Underflow") 
    else: 
        return(BookStack.pop()) 
(III)  
def peep(BooksStack): 
    if not BooksStack: 
        print("None") 
    else: 
        print(BookStack[-1]) 
(3x1 mark for correct function body; No marks for any function header as it 
was a part of the question) 
OR 
(B)  
def push_even_numbers(N): 
           EvenNumbers = [] 
           for num in N: 
                  if num % 2 == 0: 
                     EvenNumbers.append(num) 
            return EvenNumbers 
 
 
VALUES = [] 
 
for i in range(5): 
    VALUES.append(int(input("Enter an integer: "))) 
 
EvenNumbers = push_even_numbers(VALUES) 
 
def pop_even(): 
   if not EvenNumbers: 
        print("Underflow") 
          else: 
               print(EvenNumbers.pop()) 
 
pop_even() 
 
 
 
(3)
Read More
129 docs|4 tests
Join Course for Free

Top Courses for Humanities/Arts

Related Exams
About this Document
Dec 22, 2024 Last updated
Document Description: Class 12 Computer Science: CBSE Marking Scheme (2024-25) for Humanities/Arts 2024 is part of CBSE Sample Papers for Class 12 Humanities preparation. The notes and questions for Class 12 Computer Science: CBSE Marking Scheme (2024-25) have been prepared according to the Humanities/Arts exam syllabus. Information about Class 12 Computer Science: CBSE Marking Scheme (2024-25) covers topics like and Class 12 Computer Science: CBSE Marking Scheme (2024-25) Example, for Humanities/Arts 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises and tests below for Class 12 Computer Science: CBSE Marking Scheme (2024-25).
Introduction of Class 12 Computer Science: CBSE Marking Scheme (2024-25) in English is available as part of our CBSE Sample Papers for Class 12 Humanities for Humanities/Arts & Class 12 Computer Science: CBSE Marking Scheme (2024-25) in Hindi for CBSE Sample Papers for Class 12 Humanities course. Download more important topics related with notes, lectures and mock test series for Humanities/Arts Exam by signing up for free. Humanities/Arts: Class 12 Computer Science: CBSE Marking Scheme (2024-25) | CBSE Sample Papers for Class 12 Humanities - Humanities/Arts
Description
Full syllabus notes, lecture & questions for Class 12 Computer Science: CBSE Marking Scheme (2024-25) | CBSE Sample Papers for Class 12 Humanities - Humanities/Arts - Humanities/Arts | Plus excerises question with solution to help you revise complete syllabus for CBSE Sample Papers for Class 12 Humanities | Best notes, free PDF download
Information about Class 12 Computer Science: CBSE Marking Scheme (2024-25)
In this doc you can find the meaning of Class 12 Computer Science: CBSE Marking Scheme (2024-25) defined & explained in the simplest way possible. Besides explaining types of Class 12 Computer Science: CBSE Marking Scheme (2024-25) theory, EduRev gives you an ample number of questions to practice Class 12 Computer Science: CBSE Marking Scheme (2024-25) tests, examples and also practice Humanities/Arts tests
Explore Courses for Humanities/Arts exam

Top Courses for Humanities/Arts

Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev
Related Searches

Viva Questions

,

past year papers

,

Summary

,

video lectures

,

Class 12 Computer Science: CBSE Marking Scheme (2024-25) | CBSE Sample Papers for Class 12 Humanities - Humanities/Arts

,

practice quizzes

,

MCQs

,

Class 12 Computer Science: CBSE Marking Scheme (2024-25) | CBSE Sample Papers for Class 12 Humanities - Humanities/Arts

,

pdf

,

Objective type Questions

,

Extra Questions

,

study material

,

Free

,

mock tests for examination

,

Semester Notes

,

Sample Paper

,

Previous Year Questions with Solutions

,

Important questions

,

shortcuts and tricks

,

ppt

,

Class 12 Computer Science: CBSE Marking Scheme (2024-25) | CBSE Sample Papers for Class 12 Humanities - Humanities/Arts

,

Exam

;
Additional Information about Class 12 Computer Science: CBSE Marking Scheme (2024-25) for Humanities/Arts Preparation

Class 12 Computer Science: CBSE Marking Scheme (2024-25) Free PDF Download

The Class 12 Computer Science: CBSE Marking Scheme (2024-25) is an invaluable resource that delves deep into the core of the Humanities/Arts exam. These study notes are curated by experts and cover all the essential topics and concepts, making your preparation more efficient and effective. With the help of these notes, you can grasp complex subjects quickly, revise important points easily, and reinforce your understanding of key concepts. The study notes are presented in a concise and easy-to-understand manner, allowing you to optimize your learning process. Whether you're looking for best-recommended books, sample papers, study material, or toppers' notes, this PDF has got you covered. Download the Class 12 Computer Science: CBSE Marking Scheme (2024-25) now and kickstart your journey towards success in the Humanities/Arts exam.

Importance of Class 12 Computer Science: CBSE Marking Scheme (2024-25)

The importance of Class 12 Computer Science: CBSE Marking Scheme (2024-25) cannot be overstated, especially for Humanities/Arts aspirants. This document holds the key to success in the Humanities/Arts exam. It offers a detailed understanding of the concept, providing invaluable insights into the topic. By knowing the concepts well in advance, students can plan their preparation effectively. Utilize this indispensable guide for a well-rounded preparation and achieve your desired results.

Class 12 Computer Science: CBSE Marking Scheme (2024-25) Notes

Class 12 Computer Science: CBSE Marking Scheme (2024-25) Notes offer in-depth insights into the specific topic to help you master it with ease. This comprehensive document covers all aspects related to Class 12 Computer Science: CBSE Marking Scheme (2024-25). It includes detailed information about the exam syllabus, recommended books, and study materials for a well-rounded preparation. Practice papers and question papers enable you to assess your progress effectively. Additionally, the paper analysis provides valuable tips for tackling the exam strategically. Access to Toppers' notes gives you an edge in understanding complex concepts. Whether you're a beginner or aiming for advanced proficiency, Class 12 Computer Science: CBSE Marking Scheme (2024-25) Notes on EduRev are your ultimate resource for success.

Class 12 Computer Science: CBSE Marking Scheme (2024-25) Humanities/Arts Questions

The "Class 12 Computer Science: CBSE Marking Scheme (2024-25) Humanities/Arts Questions" guide is a valuable resource for all aspiring students preparing for the Humanities/Arts exam. It focuses on providing a wide range of practice questions to help students gauge their understanding of the exam topics. These questions cover the entire syllabus, ensuring comprehensive preparation. The guide includes previous years' question papers for students to familiarize themselves with the exam's format and difficulty level. Additionally, it offers subject-specific question banks, allowing students to focus on weak areas and improve their performance.

Study Class 12 Computer Science: CBSE Marking Scheme (2024-25) on the App

Students of Humanities/Arts can study Class 12 Computer Science: CBSE Marking Scheme (2024-25) alongwith tests & analysis from the EduRev app, which will help them while preparing for their exam. Apart from the Class 12 Computer Science: CBSE Marking Scheme (2024-25), students can also utilize the EduRev App for other study materials such as previous year question papers, syllabus, important questions, etc. The EduRev App will make your learning easier as you can access it from anywhere you want. The content of Class 12 Computer Science: CBSE Marking Scheme (2024-25) is prepared as per the latest Humanities/Arts syllabus.
© EduRev
Education Revolution
Signup to see your scores go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup