HSC CLASS 12 ( COMPUTER SCIENCE ) 2021/22
IMPORTANT MOST LIKELY QUESTIONS
CS -1
CHAPTER 1 : OPERATING SYSTEMS
1. WHAT IS VIRTUAL MEMORY.EXPLAIN ITS ANY 2 ELEMENTS.
2. DIFFERENCE BETWEEN WORM & VIRUS .
3. WHAT IS SYSTEM CALL . LIST ANY 2 SYSTEM CALLS
4. EXPLAIN MULTIUSER & TIMESHARING OS
5. WHAT IS FILE SYSTEM
6. GIVE FEATURES OF WINDOWS 98 OS
7. EXPLAIN VIRUS DETECTION, REMOVAL , PREVENTION
8. STATE FEATURES OF WINDOWS NT
9. EXPLAIN MULTIPROGRAMMING IN PROCESS MANAGEMENT
10. EXPLAIN 3 TERMS RELATED TO VIRTUAL MEMORY
11. EXPLAIN INTERNAL,EXTERNAL,PURCHASE PRIORITY & TIME SLICE
12.STATE ANY 4 MEMORY MANAGEMENT SYSTEMS
13. STATE FUNCTIONS OF MEMORY MANGEMENT SYSTEM OF OS
14.WHAT IS VIRUS & STATE DIFFERENT METHODS BY WHICH VIRUS CAN INFECT OTHER PROGRAMS
15. STATE VARIOUS STEPS IN ALLOCATION OF PARTION IN FIXED MEMORY MANAGEMENT.
16. EXPLAIN : FILE SYSTEMS, TYPE&DISK BASED FS, GUI , VDU
17. EXPLAIN DUMB & INTELLIGENT TERMINAL IN VDU
18. EXPLAIN MENU,TITLE& SCROLL BAR OF GUI
19. EXPLAIN RUNNING,READY& BLOCKED STATE
20. DEFINE SECURITY & ITS DIFFERENT ELEMENTS
21. LIST ANY 6 FEATURES OF LINUX OS
22. LIST&EXPLAIN TERMS OF PROCESS SCHEDULING.
23. WHAT IS PAGING
FILL UPS /MCQ
____________ IS A FREE SOFTWARE
TIME REQUIRED TO MOVE RW HEAD TO A TRACK IS CALLED ___________
CONTEXT SWITCHING IS RELATED TO ______________MANAGEMENT
TIME LOST IN TURNING ATTENTION OF CPU IS CALLED _________________
CHAPTER 2 : ( DATA STRUCTURES )
1 . WHAT IS DATA STRUCTURE
2. DEFINE TREE,BINARY TREE , EXTENDED BINARY
3. HOW A TREE CAN BE REPRESNTED IN A MEMORY.EXPLAIN WITH DIAGRAM
4. WHAT IS LINKLIST. HOW IT CAN BE REPRESENTED IN MEMORY.
5. WHAT IS RECORD. HOW IT CAN BE REPRESENTED IN MEMORY.
6. EXPLAIN FLOWCHART FOR FOLLOWING CONTROL STRUCTURES SEQUENCE,SELECTION& ITRETION LOGIC.
7. EXPLAIN BUBBLE SORT LOGIC
8. EXPLAIN LINEAR & BINARY SEARCH
9. EXPLAIN THE FOLLOWING ROOT,TREE,SIBLING,DEPTH
10. WHAT IS ARRAY ? DEFINE ARRAY& POINTER ARRAY
11. EXPLAIN LINEAR&NON LINEAR DATA STRUCTURE
12. DEFINE GROUP ITEM, ELEMENTARY ITEM, ENTITY & BINARY TREE.
13. SHOW RELATION BETWEEN NO OF NODES & DEPTH OF BINARY TREE.
14. DRAW TREEDIAGRAM FOR EXPRESSION 3R-5T
15. WRITE 2 FEATURES OF RECORD, ARRAY,LINKLIST
16. WRITE AN ALGORITHM TO FIND BINARY SEARCH METHOD, TRAVERSING LINEAR ARRAY,
17.EXPLAIN BINARY SEARCH ALGORITHM
FILL UP/MCQ
__________ DATA STRUCTURE DEOS NOT REQUIRE CONTIGOUS MEMORY ALLOCATION.
RECORD IS COLLECTION OF _______
DATA ITEMS ARE DIVIDED INTO SUBITEMS CALLED _________
__________ IS VERY USEFULL IN SITUATION WHERE DATA IS TO BE STORED .
CHAPTER 3 ( C++)
1. WHAT IS FUNCTION OVERLOAD GIVE EXAMPLES
2. WHAT IS CONSTRUCTOR/DSTRUCTOR GIVE EXAMPLES
3. WHAT IS OPERATOR FUNCTION?GIVE SYNTAX
4. WHAT IS FRIEND FUNCTION
5. WHAT IS DATA ABSTRACTION
6. WHAT IS VIRTUAL FUNCTION? GIVE 6 RULES
7. WHAT IS INHERITANCE . EXPLAIN ITS 2 TYPES
8. WHY USER IS NOT ALLOWED TO INTERACT DIRECTLY WITH HARD DISK
9. STATE 6 PROPERTIES OF CONSTRUCTOR
10. DEFINE FILE , RECORD, KEY FIELD , POLYMORPHISAM
11. EXPLAIN COMPILE & RUN TIME PM
12. LOCAL & GLOBAL DATA WITH EXAMPLES
13. HOW FILES ARE OPENED& CLOSED IN C++ WITH EXAMPLES. STATE ANY 4 FILE MODES
14. 3 CHARACTERISTICS OF STATIC DATA
15. USE OF MEMORY MANAGEMENT OPERATORS IN C++
16. 3 SPECIAL CHARECTERISTICS OF STATIC DATA
17. DIFFERENT TYPES OF INHERITANCE
18. DEFINE DATA ENCAPSULATION,DATA ABSTRACTION
19. DEFINE OOP & WRITE ITS FEATURES
20. EXPLAIN USE OF FOLLOWING SEEKP,SEEKG,TEELP,TELLG
21. WRITE 8 RULES OF VIRTUAL FUNCTION
22. DIFFERENCE BETWEEN TPP & OOP
23. WHAT IS POINTER. GIVE EXAMPLES
24. EXPLAIN SYNTAX OF C++
25. EXPLAIN OPERATOR OVERLOADING WITH 2 FEATURES
26. LIST 2 TYPES OF CONVERSION
27. LIST 6 OPERATORS
FILL /MCQ
OOP USES _________ APPROACH
IN C++ DOUBLE DATATYPE USES _____ BYTES
IF ALL LABELS ARE MISSING THE DEFAULT MEMBERS OF CLASS IS __________
OBJECT IS A ___________
WRITE PROGRAMS:
TO ACCEPT 3 INTEGERS AND FIND GREATEST NUMBER
TO ACCEPT STRING FROM KEYBOARD & COPY IT
TO FIND AREA OF A CIRCLE
TO PRINT FIRST 20 NUMBERS OF FIBBONACI SERIES
TO READ A SET OF 10 NOS & FIND THE LARGEST
CHAPTER 4 (HTML)
IMPORTANT QUESTIONS ( CLICK HERE )
CS-2
CHAPTER 1 ( 8085 MICROPROCESSORS)
1. IMPORTANT QUESTIONS ( CLICK HERE )
CHAPTER 2
2. IMPORTANT QUESTIONS ( CLICK HERE )
CHAPTER 3
3. IMPORTANT QUESTIONS ( CLICK HERE )
CHAPTER 4
4. IMPORTANT QUESTIONS ( CLICK HERE )
CHAPTER 5
5. IMPORTANT QUESTIONS ( CLICK HERE )