Contributed by: Shah Saleem Computer science is a fascinating and challenging subject that explores the principles and applications of computing. If you are a student of 10th class and want to study computer science for FBISE, then you should download the 10th class computer science notes from this website. These notes are updated and based on the latest syllabus of FBISE. They cover all the topics and concepts that you need to know for your exams. You can also find solved exercises, MCQs, short questions, and long questions in these notes. The notes are in PDF format and easy to download. Just click on the link below and get access to the best 10th class computer science notes for FBISE.

## Chapter 1 – Programming Techniques

Chapter 1 notes have:

• Explain the criteria for measuring the efficiency of an Algorithm
• The criteria for measuring the efficiency of an algorithm are:
• 1. Time Efficiency
• 2. Space Efficiency
• In order to analyze the time efficiency of an algorithm, we must first define a way to measure it. It is more difficult than the space efficiency analysis because in case of time there are many factors involved, such as:
• 1. The speed of the processor, or CPU.
• 2. The size of the main memory.
• 3. The size of input data.
• 4. The number of times a statement is executed in an algorithm.
• However, these factors cannot be controlled by us and hence, depend upon the physical resources available at the time of execution of an algorithm. Keeping this in mind, we consider another factor which is under our control, i.e., number of statements executed at different instances during the execution of an algorithm on any machine with a given set of physical resources (like CPU speed and main memory).
• This factor however depends upon the implementation language used for coding the algorithm but since all high-level languages have similar basic constructs and features like conditional statements and loops, these languages are considered equivalent for such analysis.
• The most common measure of the efficiency of an algorithm is the total number of steps taken by the algorithm to complete execution. The number of steps for an algorithm is generally a function of the size of the input.
• The size of the input is denoted by n and can be thought of as the number of elements in an array, a string or a matrix. In order to compare algorithms it is necessary to develop a metric that will classify them in terms of their efficiency.
• Find the Sun, Product, and average of five given numbers
• Find the Largest of three unequal Numbers
• Much more!
• Chapter 1
• Content: Short and Long Answers | Solved Exercises | MCQs

## Chapter 2 – Programming In C

Chapter 2 notes have:

• Define Computer Programming
• Classification of Programming language
• What is a Programming environment
• Much More!
• Content: Short and Long Answers | Solved Exercises | MCQs
• Chapter 2

## Chapter 3 – Input And Output Handling

Chapter 3 notes have:

• Define the input function
• Define the output function
• What is displaying strings output function
• Much More!
• Content: Short and Long Answers | Solved Exercises | MCQs
• Chapter 3

## Chapter 4- Conditional Control Structure

Chapter 4 notes have:

• Define a control statement
• Define a conditional statement
• What is the purpose of if statement
• Much More!
• Content: Short and Long Answers | Solved Exercises | MCQs
• Chapter 4

## Chapter 5- Loop Control Structure

Chapter 5 notes have:

• Highlight the function of loop
• What is Loop
• Program to print numbers from 1 to 5 using for () loop
• Much more
• Content: Short and Long Answers | Solved Exercises | MCQs
• Chapter 5

## Chapter 6 – Computer Logic And Gates

Chapter 6 notes have:

• Explain data representation in data
• Define digital logic and logic gates
• Describe the properties of the truth table
• Much More
• Content: Short and Long Answers | Solved Exercises | MCQs
• Chapter 6