0% found this document useful (0 votes)
84 views30 pages

Comprehensive Computer Science Exam Blueprint

The document provides a summary of the chapters, content domains, units and themes covered in a typical computer science course curriculum. It includes the number of periods allotted for each topic, the question type and number of questions asked, and the total marks for each topic. Some of the major topics covered include typical computer system configuration, Boolean algebra, logic gates, data structures, object-oriented programming concepts, classes and objects, inheritance, pointers, databases, SQL commands, networking concepts, and web designing. The summary provides a breakdown of the cognitive levels such as remember, understand, apply and higher order thinking skills for each topic.

Uploaded by

akashkishore363
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
84 views30 pages

Comprehensive Computer Science Exam Blueprint

The document provides a summary of the chapters, content domains, units and themes covered in a typical computer science course curriculum. It includes the number of periods allotted for each topic, the question type and number of questions asked, and the total marks for each topic. Some of the major topics covered include typical computer system configuration, Boolean algebra, logic gates, data structures, object-oriented programming concepts, classes and objects, inheritance, pointers, databases, SQL commands, networking concepts, and web designing. The summary provides a breakdown of the cognitive levels such as remember, understand, apply and higher order thinking skills for each topic.

Uploaded by

akashkishore363
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 30

Question type Number of questions Marks

MCQ 15 15(15)

FILL IN THE BLANKS(DATA BASE 05 05(05)


CONCEPTS)SA-1
SHORT ANSWERS SA-2 04(08) 08 (16)

SHORT ANSWER SA-3 04(08) 12 (24)

LONG ANSWERS 04(08) 20(40)

LONG ANSWER (HOTS 2,LÓTS 1) 02(03) 10(15)

Total 34(47) 70(115)


Chapter/ Remember Understand Apply HOTS
Content No. of LA LA LA LA
Marks MC SA- SA- SA- SA- SA- SA- SA- SA- SA- MC SA- SA- SA-
domain/ Unit/ periods MCQ MCQ
Q 1 2 3 1 2 3 1 2 3 Q 1 2 3
Theme
Typical
configuration
of 5 4 1 1
Computer
system
Boolean
algebra 10 10 1 1 1 1
Logic Gates 5 4 1 1
Data structures 15 14 1 1 1 1
Review of C++
covered in First 2 0
PUC
OOP concepts 5 7 1 1
Classes and
objects 6 6 1 1
Function
Overloading 5 6 1 1
Constructors
and 8 8 1 1 1
Destructors
Inheritance 8 6 1 1
Pointers 5 4 1 1
Data File
handling 6 5 1 1

Database
13 16 1 2 1 1 2 1 1
concepts
SQL
7 8 1 1 1
commands
Networking
10 9 1 1 1 1
Concepts
Internet and
Open
5 4 1 1
source
concepts
Web
5 4 1 1
Designing
120 115 6 2 3 2 2 5 2 3 3 4 1 1 2 3 3 3 2
 Typical configuration of computer
 Motherboard – characteristics, types.
 Components – Processor, BIOS, CMOS, slots, disk
controllers, I/O ports, BUS.
 Memory – Registers, Cache, Primary, Secondary
 Power supply – SMPS, UPS.

Marks MCQ R1+U3 = 4


 BOOLEAN ALGEBRA
 NOT, OR, AND Operator.
 LAWS -Indempotence, Involution, Complementarity
, Demorgan’s theorem, …..
 Tautology and Fallacy.
 Minterm and Maxterm.
 K Map

Marks MCQ R1+R2+U2+HOT 5 = 10


 LOGIC GATES
 BASIC – NOT, OR, AND
 DERIVED – NOR, NAND, XOR, XNOR.
 (symbols and truth table)

 Realization

Marks MCQ U1+U3 = 4


 Data Structures
 Primitive – Examples, Operations.
 Non Primitive – arrays, lists, files.
 Linear DS – Operations
 Arrays, types, adv/dis adv.
 Algorithms
 Stacks –(Operations, push, pop, applications)
 Queues –(Operations, Types, applications)
 Linked list –(Operations, Types)
 Non Linear DS (Graphs, Trees)

Marks : MCQ R1+U3+U5+A5= 14


Review of C++ (First PUC)
Marks - 00
 OOP Concepts.
 Characteristics of OOPS
 Advantages of OOP over earlier programming
languages.
 Limitations of OOP
 Applications of OOP

Marks – U2+A5 = 7
 Classes and Objects.
 Difference between POP and OOP
 Data member and Member function.
 Defining a class (syntax and example).
 Access specifiers.
 Dot (.) operator
 Scope resolution operator (::)
 Member functions defined (inside & outside)
 Defining objects of a class.
 Array of objects.
 Objects as function argument.
Marks – MCQ U1 + U5 = 6
 FUNCTION OVERLOADING.
 Need for function overloading.
 Function overloading with suitable example.
 Inline functions (advantage, example)
 Friend function (characteristics, example)

Marks MCQ R1+ HOT 5 = 6


 CONSTRUCTORS AND DESTRUCTORS
 Rules to write constructor function.
 Default constructors (defining syntax & example)
 Features of parameterized constructor.
 parameterized constructor invoking methods.
 Destructors (operator, syntax, example, rules)

Marks MCQ U1+U2+U5 = 8


 INHERITANCE
 Advantages of inheritance.
 Visibility mode.
 Types of inheritance.
 Single level inheritance example.

Marks : MCQ U1+R5 = 6


 POINTERS
 Advantages of pointers.
 Definition, declaration (syntax example),
assignment.
 Address operator, Indirection operator, This pointer,
Memory leak, Free store.
 Pointer arithmetic.
 Static & Dynamic memory allocation.
 New & Delete operators.
Marks : MCQ A1+A3 = 4
 DATA FILE HANDLING.
 ifstream, ofstream, fstream.
 get(), getline(), read(), put(), write().
 Types of data files (Text and Binary)
 File modes (in, out, app, etc).

Marks U2+R3 = 5
 DATABASE CONCEPTS.
 Applications of database.
 Data and Information.
 Difference between manual and electronic data
processing.
 Stages of data processing cycle.
 Definitions (Database, DBMS, table, file, attribute,
tuple, field, entity)
 Advantage of DBMS.
 Three level RDBMS architecture (data abstraction)
 File organization (serial and sequential, Random or
direct access, ISAM)
 Database logical architecture (1 tier, 2 tier, 3 tier)
 Database model (hierarchical, network, relational)
 ER diagram (entity, attribute, relationship)
 Generalization and Specialization.
 Keys (candidate, primary, alternate, foreign)
 Data warehouse (stages, components, advantages)
 Data mining, stages of data mining.
Marks (FIB –R1,U2,A2) MCQ R1, R2,U3,R5 = 16
 SQL COMMANDS
 DDL, DML Commands.
 Difference between char and varchar.
 Operators (arithmetic, comparison, logical)
 Commands (DDL and DML) syntax and example.
 Single row and group functions.

Marks MCQ A1+R2+U5 = 8


 NETWORKING CONCEPTS
 Goals, Services.
 Types of network.
 Topologies – (Bus, Ring, Star, Mesh, Tree)
 Transmission medium (Twisted pair, coaxial, optical
fibers)
 Switching techniques
 Communication modes.
 Network devices(modem, hub, Ethernet, switch,
repeater, router, bridge)
 NETWORKING CONCEPTS
 SIM, CDMA, WLL, GPRS
 Applications – SMS, Chat, WiFi, Hotspot, wi-max.
 Network security (Authorization, authentication,
encrypted smart cards, biometric, firewalls)
 VIRUS – Types, Preventions.

Marks : MCQ R1+ MCQ U1+A2+U5 = 9


 INTERNET AND OPEN SOURCE
 Free software
 OSS FLOSS
 FSF, W3C
 Proprietary software.
 Shareware
 WWW, Telnet, Web browser, Web server, Webpage
 URL
 E Commerce – services, types, advantages
Marks MCQ A1+A3 = 4
 WEB DESIGNING
 Structure of HTML
 Tags – Text formatting, Resizing, Table
 XML
 DHTML
 Web Hosting – Types.

Marks MCQ R1+A3 = 4

You might also like