0% found this document useful (0 votes)
47 views3 pages

Class 9 Computer Science Notes

This document contains notes from class 9th on computer science topics including problem solving techniques like defining problems, strategies for planning solutions, flowcharts, and algorithms. It also covers computer memory systems including binary, hexadecimal, and decimal number systems, data storage, Boolean logic and truth tables. The notes are divided into two chapters, with Chapter 1 focusing on problem solving and Chapter 2 on computer memory and number systems. Key concepts defined and explained include problem strategies, flowcharts, algorithms, binary conversion, hexadecimal conversion, computer memory storage, Boolean propositions, and logic laws. Examples are provided throughout to illustrate the various topics and concepts.

Uploaded by

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

Class 9 Computer Science Notes

This document contains notes from class 9th on computer science topics including problem solving techniques like defining problems, strategies for planning solutions, flowcharts, and algorithms. It also covers computer memory systems including binary, hexadecimal, and decimal number systems, data storage, Boolean logic and truth tables. The notes are divided into two chapters, with Chapter 1 focusing on problem solving and Chapter 2 on computer memory and number systems. Key concepts defined and explained include problem strategies, flowcharts, algorithms, binary conversion, hexadecimal conversion, computer memory storage, Boolean propositions, and logic laws. Examples are provided throughout to illustrate the various topics and concepts.

Uploaded by

Awais Humayun
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Native Schools

Notes Class 9th (Computer)


Chapter # 1
1. Define problem and name its strategies.
2. How we plan a solution. Describe anyone of its strategy.
3. Define candid solution with example.
4. Define flowchart with example.
5. Define algorithm with example.
6. Suppose a problem has multiple algorithms. How would you choose the most efficient on? Explain with
example.
7. Write the advantages of flowchart.
8. Define problem and one of its strategy.
9. Draw a flowchart to convert Celsius to Fahrenheit temperature.
10. How we plan a solution? Describe anyone of its strategy.
11. Define flowchart and draw a flowchart to find sum and product of 3 given numbers.
12. Define algorithm and write an algorithm to find the area of parallelogram.
13. Describe role of algorithm in problem solving.
14. What is test data with example? Name its types.
15. Draw a flowchart to find the largest number out of 3 given numbers.
16. Write the advantages and disadvantages of flowchart.
17. Define problem and one of its strategy.
18. Draw a flowchart to convert Celsius to Fahrenheit temperature.
19. How we plan a solution? Describe anyone of its strategy.
20. What is flowchart? Give an example.
21. Draw a flowchart to find sum and product of 5 given numbers.
22. Define problem and one of its strategy.
23. Draw a flowchart to convert Celsius to Fahrenheit temperature.
24. How we plan a solution? Describe anyone of its strategy.
25. Define flowchart and draw a flowchart to find sum and product of 3 given numbers.
26. What is test data with example? Name its types.
27. Draw a flowchart to find the largest number out of 3 given numbers.
28. Write the advantages and disadvantages of flowchart.
29. What is well-defined problem?
30. Define ‘Gain Background Knowledge’.
31. Define ‘Use Guesses’.
32. Why we draw pictures in defining the problem?
33. How we analyze the problem?
34. Define ‘Candid Solution’.
35. Define ‘Prototype (Draw)’.
36. Define flowchart with example.
37. Define any 3 flowchart symbols.
38. Define gain background knowledge and use guesses.
39. Define ‘Guess, check and improve’ & ‘Act it out’ strategies of planning a solution.
40. What are the requirements to make a flowchart? Briefly describe.
41. Write a flowchart to find sum, product & average of 3 given numbers.
42. Write the disadvantages of algorithm.
43. Write a flowchart to determine whether a given number is odd or even.
44. Write an algorithm to find even numbers in integers ranging from n1 to n2 (where n2 is greater than n1).
45. Define problem and name its strategies.
Native Schools
46. How we plan a solution. Describe anyone of its strategy.
47. Define flowchart with example.
48. Suppose a problem has multiple algorithms. How would you choose the most efficient on? Explain with
example.
49. What is formulation of an algorithm?
50. Write the advantages of flowchart.
51. Write a flowchart to convert Celsius to Fahrenheit temperature.
52. Write algorithm to display the larger one out of the three given unequal numbers.

Chapter # 2
1. Differentiate between volatile and non-volatile memory.
2. Covert (10110101)2 to decimal.
3. Convert (69640)10 to Hexadecimal.
4. (ABCDE)16
5. Differentiate between memory and storage.
6. Define Boolean proposition.
7. Define truth table.
8. Differentiate between volatile and non-volatile memory.
9. What is binary number system? Give 2 examples.
10. Convert (151)10 to binary with all steps.
11. Covert (10111101)2 to decimal with all steps.
12. Convert (69340)10 to Hexadecimal.
13. Convert (EDCBA) 16 to Decimal with all steps.
14. Store ‘Computer’ in computer memory.
15. Differentiate between memory and storage.
16. Convert (AB9C3)16 to binary with all steps.
17. Convert (0110101101010111101)2 to Hexa-decimal number system.
18. Differentiate between volatile and non-volatile memory.
19. What is binary number system?
20. Convert 12210 (122 in decimal) to binary.
21. Covert (10110101)2 to decimal.
22. Convert (69640)10 to Hexadecimal.
23. (ABDE)16
24. Store ‘Pakistan’ in computer memory.
25. Differentiate between memory and storage.
26. Define Boolean proposition.
27. Define truth table.
28. Differentiate between volatile and non-volatile memory.
29. What is binary number system?
30. Convert 12210 (122 in decimal) to binary.
31. Covert (10110101)2 to decimal.
32. Convert (69640)10 to Hexadecimal.
33. (ABDE)16
34. Store ‘Pakistan’ in computer memory.
35. Differentiate between memory and storage.
36. Define Boolean proposition.
37. Define truth table.
38. Define storage device with examples.
Native Schools
39. Store the word ‘Man’ in computer’s memory.
40. Convert your age into binary.
41. Define Boolean proposition.
42. Convert (69640)10 to hexadecimal.
43. Define identity law.
44. Define commutative law with one truth table.
45. Define Associative Law with truth table.
46. Differentiate between volatile and non-volatile memory.
47. What is hexa-decimal number system?
48. Convert 16410 (164 in decimal) to binary.
49. Covert (11100111)2 to decimal.
50. Convert (69640)10 to hexadecimal.
51. Convert (ABCDE)16 to decimal.
52. Define truth table.
53. Define Distributive Law with truth table.

Common questions

Powered by AI

A flowchart is a diagram that represents a sequence of operations or steps in a process using symbols and arrows. To design one for calculating the sum and product of three numbers: start with 'Start', proceed to 'Input three numbers', then add an operation box for 'sum = a + b + c', another for 'product = a * b * c', finishing with 'Output results' and 'End'. This guides users through input, process, and output visually .

A truth table is a tabular representation of all possible values of logical variables and their corresponding output values. The commutative law in Boolean algebra, which states that A AND B is equivalent to B AND A, can be verified using a truth table: listing all boolean combinations of A and B, showing consistent results when the operands are swapped .

A well-defined problem has clear criteria for its description, constraints, and a single, clear solution pathway. An ill-defined problem lacks these structured parameters, leading to multiple potential solutions or approaches. For example, a math equation with a unique solution is well-defined, whereas solving poverty is ill-defined due to its complexity and lack of definitive solutions .

Algorithmic efficiency determines how quickly and resource-effectively a solution can be reached. When choosing an algorithm, factors like time complexity, resource consumption, and ease of implementation are considered. For example, if sorting data, one might prefer quicksort for its average-case O(n log n) time complexity over bubble sort, which has a higher O(n^2) complexity, to handle larger datasets more efficiently .

To convert (10110101)2 to decimal: Start from the right, assigning powers of 2 from 0 upwards. Multiply each bit by 2 raised to its position index and sum: 1*2^0 + 0*2^1 + 1*2^2 + 0*2^3 + 1*2^4 + 1*2^5 + 0*2^6 + 1*2^7 = 1 + 0 + 4 + 0 + 16 + 32 + 0 + 128 = 181 .

Flowcharts serve as visual tools to map out the steps in a process, aiding in understanding and communication. They help identify potential improvements by offering a clear pathway from one step to the next. Advantages include simplifying complex processes, enhancing communication among team members, and providing documentation that aids in troubleshooting or process audits .

The hexadecimal number system uses base 16, employing digits 0-9 and letters A-F, to represent values compactly. Its advantage over binary is the reduction of length, as it bundles four binary digits into one hex digit, simplifying readability and error-checking. This system is especially useful in computing for memory addresses .

Algorithms, while systematic, have disadvantages like inflexibility in dynamic environments, potential for high computational complexity in tailoring to specific problems, and developer understanding limitations which can lead to implementation errors. For example, a rigid algorithm may fail to adapt to unexpected inputs, creating inefficiency .

Gaining background knowledge prepares problem solvers by enhancing understanding of the context and constraints, informing decision-making processes. It helps identify relevant factors, foresee potential challenges, and apply appropriate strategies. For example, understanding algorithm complexity is essential before attempting optimization problems .

Volatile memory, such as RAM, requires power to maintain stored information, making it fast but temporary. Non-volatile memory, like hard drives and SSDs, retains data without power, providing permanent storage. This distinction is crucial for data persistence and system performance: volatile memory offers speed for active processing, while non-volatile memory ensures data is saved despite power-off events .

You might also like