Vol I-Ln.1-Introdcution to 5. Hardware(Defn-10,11) 4.

Classification of
computers 6. Types of micro computers(18-20) computer/hardware
7. Early devices(2-5) components(65)
2 marks 5. BUS(66)
Ln.2-Number system 6. Stored program concept(67)
1. Computer(1)
2. Computing(2) 2 marks 7. Pg.68 (6 short answers)
3. Any early devices(2-5) 8. Flash memory(76)
4. Diff data, information(9-bulleted 1. Numbering system-26 9. Operations on memory(or)
detail) 2. Dec, oct, hexadec, binary memory read and write(76-77)
5. Algorithm(9) number system-cw 10. Performance of memory(or)
3. 2’s complement representation- Access time,memory cycle time
6. Data(9)
7. Information(9) 38 (77)
8. Program(10) 4. Manual method of 2’s 11. Hierarchy of memory(77)
9. Problem solving(10) complement 12. Diff main memory, secondary
representation-39 memory(78)
10. Define hardware, software(10)
11. Components of computer 5. Augend, addend-43 13. input/Output/storage devices
system(9) 6. Subtrahend , minuend-46 any
12. Peripheral equipment(11) 7. Boolean algebra-48 14. Pixel(86)
13. Classification of software(12) 8. Basic operations and symbols-48 15. Aspect ratio,resolution(86)
14. System software(12-2pts,eg) 9. And operator-49 16. Printer(87)
15. Operating system(13,eg) 10. OR operator-50 17. Impact, non impact printer
16. Compiler(13) 11. Not operator-50 definition (87,88)
17. Utility programs(13) 12. NAND operator-51 18. Track, sector(93)
18. Application software(13,eg) 13. NOR operator-51 19. How to calculate storage
19. Spreadsheet(14,eg) 14. Pg.54,55 all subheadings capacity of disk(93)
20. Wordprocessor(14,eg) 15. Commutative law=55,56 20. Format(93)
16. Associative, distributive law-56 21. Book back exercises
21. DBMS(14,eg)
22. Analog computer(15) 17. DeMorgan’s theorems-59 Detail answer
23. Microcomputers(18) 18. Book back problems 1. Types of memory(75-76)
24. Laptop computers(20) 2. Functions of CPU(68)-diagram
5 marks
25. PDA(20) 3. Characteristics of impact,non
1. Theorems / Laws(pg.52,53 impact printer(87,88)
5 marks compulsory+2 more laws) 4. Functional units of computer
2. Operators(49-51) system(pg.11,diagram-
1. Types of computers(based on
3. Number system pg.65)
configuration/Digital
5. Stored program concept(67)
computers/based on 4. Book back exercises
Vol I-Ln.3-Computer Organisation 6. Any input/output /storage
performance ,size, cost)(17-18)
device
2. Types of computers(based on 1. Book back questions
2. Components of digital 7. Working principles of CPU(70-
operation)(15-16)
computer(64) with diagram
3. Generation of computers(6-8)
4. Software(Defn-10,12-14) 3. Functions of computer(65)
Vol II-Ln.4- Problem solving 34. Operators and types, order of 61. Diff arrays and structures
techniques and C programming precedence/hierarchy, Array
1. Define flowchart(183) associativity-215
2. Symbols of flowchart(184) 35. Assignment operators-219 Array is a collection of homogenous
3. Connectors(185) 36. Conditional /Ternary elements
4. Advantages of flow chart(186) operator(220) Struct is a collection of
5. Disadvantages of flow charts(186) 37. Preprocessor directive-223 heterogenous elements
6. Any flowchart or pseudocode 38. Stdio.h-223
7. Pseudocode(197) 39. Clrscr()-224
8. Diff. flowchart and pseudocode 40. Statements(224,225) 62. Pointer arithmetic-262
9. Diff. definite and indefinite 41. Printf()-230 & (syntax223) 63. Strlen()-266
iteration 42. Control string/Formatting 64. String.h-266
10. Diff. while and do while string(230) 65. Multi dimensional arrays-269
11. 43. What are the type of char 66. Struct-274
12. How can we club/bunch printf() can hold? 67. How to access the members of
statements together in 44. scanf()-233 & (syntax223) the structure-277
pseudocode?198 45. Function233 68. How to access members of
13. Debugging-199 46. calling function, called structure using pointers278
14. Walk through-203 function234
5 marks
15. Properties of algorithm-203 47. Function prototype and
16. Top down approach-205 components(234) 1. Any flowchart or pseudocode
17. Structured prog-205 48. Actual parameters,Formal 2. Fundamental control structures
18. Object oriented approach-205 parameters-236 Ans(I.Sequencing-
19. Who developed C?-207 49. Call by value, call by address- defn.194,flowchart-
20. Portability-207 236 186,algorithm200-1st one
21. Use of C-207 50. Storage class,list-240 II.Branching 1. Two way
22. Tokens-207 51. Auto, static, register,extern- branchingdefn-194,194-given
23. Constant-208 240-242 flowchart & pseudocode,2. Multi
24. Numeric constant-208 52. If statement-243(defn, syntax, way branching
25. Integer constant-208 eg) defn.195,flowchart-
26. Floating point constant-208 53. If else statement-243(defn, 195,algorithm200-2nd one)
27. Char constant-209 syntax, eg) III.Iteration1. Definite iteration-
28. Escape sequence-210eg 54. switch statement-247(defn, Qn.9-ans,flowchart-190,
29. String literal-210 syntax, eg) pseudocode 201 last one
30. Identifiers-211 55. break, default-248 2.Indefinite iteration
31. Rules for identifiers-211 56. while statement-250-251(defn, Qn.9-ans,flowchart-190,
32. List fundamental/primitive syntax, eg) pseudocode 201 last one
data type and derived data type- 57. for statement-254-255 (but in both instead of n<=100
212 (defn, syntax, eg) we must write sum<=100)
33. Pointer and its operators-214 58. getchar()-256
59. do while-257
60. Array-257
3. Operators-215-220 (tabular
column with one line
explanation)
4. Call by value and call by
address
5. Conditional statements(if, if
else ,switch case)-243-247
6. If statement(both if ,if else)
7. Switch case-247
(defn,syntax,eg,default, break)
8. Control
statements/loops(while, do
while, for short ans together)
9. Storage class-(240-243)
#include<stdio.h>
#include<conio.h
Void main()
{
Printf(“hllo);
};
Debugging
S.N L. Error Correction
o n
o
1 2 Angular #include<con
bracket > io.h>
missing
2 3 Replace V void main()
with v
3 5 “ missing printf(“hllo”);
4 5 Replace P
with p
5 6 Remove ; }