Read and download CBSE Class 11 Computer Science Question Paper Set I designed as per the latest question paper pattern and Class 11 examination guidelines issued by CBSE, NCERT and KVS. The past year Question Papers for Class 11 Computer Science have been provided with solutions which will help students to assess their performance and find out topics in Computer Science grade 11 which they need to improve to get better marks in Standard 11 exams. After solving these last year papers also refer to solved Sample Papers for Class 11 Computer Science available on our website to build strong understanding of the subject
CBSE Class 11 Computer Science Question Paper Set I. Students can download the last year question papers using the link below. Free download of examination question papers with solutions. Last 10 year question papers should be practiced to get better marks in examinations.
Q1. Very Short Answer Questions.
i) What is the function of ALU?
ii) What do you understand by IPO cycle?
iii) One Megabyte is equivalent to
a) 210 bytes b) 220 bytes c) 230 bytes d) none of these
iv) What do you understand by throughput?
v) Give examples of some non-preemptive scheduling techniques.
vi) What are the bases of decimal, octal, binary and hexadecimal systems?
vii) Complete the sequence of following binary numbers: 1000, 1001, ______ , ______, _______
viii) The term bit is an abbreviation for the expression .
ix) Why is RAM called so?
x) What is the role of input and output devices? _
xi) Which two programming languages are low level languages?
xii) What is meant by Abstraction?
xiii) What is identifier? What is the identifier forming rules of C++?
xiv) What is the input operator “>>” and output operator “<<“ called ?
xv) What is the significance of null (\0) character in a string?
xvi) What kinds of program errors can you encounter during programming? Why do these occur?
Please click the link below to download pdf file of CBSE Class 11 Computer Science Question Paper Set I.
Click for more Computer Science Study Material ›