This document contains details of a computer science exam for class 11th including 10 multiple choice questions on conversions between binary, octal and hexadecimal numbering systems, binary additions, logic circuits, Boolean expressions, truth tables, Von Neumann architecture and memory, relational algebra operations, user identity tracking, cyberbullying, denial of service attacks, and data vs information and time vs space complexity. It also contains questions about a student information database table including entities, attributes, tuples, keys, domains and relations.
This document contains details of a computer science exam for class 11th including 10 multiple choice questions on conversions between binary, octal and hexadecimal numbering systems, binary additions, logic circuits, Boolean expressions, truth tables, Von Neumann architecture and memory, relational algebra operations, user identity tracking, cyberbullying, denial of service attacks, and data vs information and time vs space complexity. It also contains questions about a student information database table including entities, attributes, tuples, keys, domains and relations.
This document contains details of a computer science exam for class 11th including 10 multiple choice questions on conversions between binary, octal and hexadecimal numbering systems, binary additions, logic circuits, Boolean expressions, truth tables, Von Neumann architecture and memory, relational algebra operations, user identity tracking, cyberbullying, denial of service attacks, and data vs information and time vs space complexity. It also contains questions about a student information database table including entities, attributes, tuples, keys, domains and relations.
This document contains details of a computer science exam for class 11th including 10 multiple choice questions on conversions between binary, octal and hexadecimal numbering systems, binary additions, logic circuits, Boolean expressions, truth tables, Von Neumann architecture and memory, relational algebra operations, user identity tracking, cyberbullying, denial of service attacks, and data vs information and time vs space complexity. It also contains questions about a student information database table including entities, attributes, tuples, keys, domains and relations.
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1of 2
ST MARY'S SCHOOL
FIRST PERIODICAL EXAM
CLASS - 11TH SUBJECT - COMPUTER SCIENCE WITH PYTHON
TIME: 2HRS MM: 50 MARKS
__________________________________________________________________________________________ 1. Conversions - [12 * 1 = 12] a) (125.375)10 =()2 g) (11100.1010)2 =()16 b) (325.25)10 =()8 h) (FACE.32)16 =()2 c) (300.75)10 =()16 i) (10110.01)2 =()8 d) (1001011.101)2 =()10 j) (742)8 =()2 e) (23.25)8 =()10 k) (A42)16 =()8 f) (1E.8C)16 =()10 l) (762)8 =()16 2. Binary Additions - [2*1=2] a) ADD 110101 and 101111 b) ADD 101.0111 and 111.1011 3. Draw the logic circuits - [2*3=6] a) AB+CD using NOR gate. b) (A+B). (C+D) using NAND gate. 4. Obtain the Boolean Expression for the logic circuit shown below. [1 marks]
5. Verify with help of truth table. [2 marks]
a) X.X’=0 b) X+1=1 6. Draw Von-Neumann architecture and explain memory at your best. [5 marks] 7. Explain any two operations of relational algebra with example. [2 marks] 8. Discuss the ways of tracking the user’s identity. [5 marks] 9. Define the terms – [2*2 1/2=5 Marks] a) Cyber bullying. b) Denial of service attacks. c) Data vs information. d) Time complexity vs space complexity.
10. Consider a table - [10*1=10]
TABLE NAME: STUDENT INFO
St_num Admn_No Name Father's name Roll_no Phone Address City
S001 4332 Tushar parekh Mr. Aman 1452001 654321 M.G Road SRE S002 4221 Soni sharma Mr. Somesh 1452002 456789 Ghantaghar DEL S003 5661 Juyal Mr. Ravi 1452003 987652 Behat road MRT S004 3221 Bob John rib 1452004 123456 Rai waala DEL S005 1223 Sam Andrew 1452005 234567 Chilkaana MRT
Answer the following Questions -
a) Name any Entity. b) Attributes in the table[any two] c) Tuples [any one] d) Cardinality of relations e) Degree of relations. f) primary key g) candidate key h) alternate key i) Domain of the attribute city. j) Name the relation k) Write any tuple.