computer science 9 class, Schemes and Mind Maps of Computer science

this note help for study of exam paper you 1000 percent mask in exam but you download the note with you will come back and downloads the note it can easy short question

Typology: Schemes and Mind Maps

2011/2012

Uploaded on 07/31/2023

subhan-naveed-1
subhan-naveed-1 🇵🇰

1 document

1 / 56

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
COMPUTERSCIENCE: -
CLASS NO 9: -
NOTE OF
COMPUTER: -
Unit NUMBER 1: -
PROBLEM SOLVING: -
Question no 1: -
List of the problem-solving
steps: -
Defining a problem
Understanding the problem
Planning a solution
Define candid solution
Selecting the best solution.
Question no 2: -
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31
pf32
pf33
pf34
pf35
pf36
pf37
pf38

Partial preview of the text

Download computer science 9 class and more Schemes and Mind Maps Computer science in PDF only on Docsity!

COMPUTERSCIENCE: -

CLASS NO 9: -

NOTE OF

COMPUTER: -

Unit NUMBER 1: -

PROBLEM SOLVING: -

Question no 1: -

List of the problem-solving

steps: -

 Defining a problem  Understanding the problem  Planning a solution  Define candid solution  Selecting the best solution.

Question no 2: -

What is a problem solving : -

Problem solving is the act of defining a problem; determining the cause of the problem; identifying, prioritizing, and selecting alternatives for a solution; and implementing a solution.

Question no 2: -

Defining a problem: - In everyday language, a problem is a question proposed for solution, a matter stated for examination or proof. In each case, a problem is considered to be a matter which is difficult to solve or settle, a doubtful case, or a complex task involving doubt and uncertainty.

Question no 3: -

What is a Gain Background

Knowledge: -

Background knowledge is a reader's understanding of the specific concepts, situations and problems associated with the words encountered in the text. Knowledge of the topic provides readers enough understanding to make meaning and build onto what they currently know.

Question no 4: -

Question no 7: --

What is a planning a solution: --

Solution planning is the process of verifying that all your server equipment meets or exceeds the operational requirements of your solution. Before installing the hardware, software, and other equipment needed to run your hardware solution, develop a solution plan to ensure that your system meets your requirements. Question no 8: - Divide and conquer: - The divide-and-conquer paradigm is often used to find an optimal solution to a problem. Its basic idea is to decompose a given problem into two or more similar, but simpler, subproblems, to solve them in turn, and to compose their solutions to solve the given problem.

Question no 9: -

Guess, Check and Improve: -

The main idea behind the Guess and Check method is to guess the answer to a problem and then check if the answer fits the given scenario. If it doesn't, we'll adjust our guess accordingly until all conditions are met.

Question no 10: -

Act it Out:

in this strategy the designer defines the list of " to-do" task. Afterwards he\she performs the task.

Question no 11: -

Prototype (draw): -

A prototype is an early version of a product from which future versions are developed. Engineers and product developers often create these test versions of a new product, service or device before releasing it. Prototypes aren't the final product or service.

Question no 12: -

Defining candid solution: -

A candid solution is an honest and straightforward approach or proposal to solve a problem or address a challenge. It involves providing a sincere and genuine response or action without any hidden agenda or ulterior motive. A candid solution aims to tackle issues directly, without sugarcoating or evading the underlying problems. By being candid, a solution demonstrates transparency, openness, and authenticity. It promotes clear communication, trust-building, and effective problem-solving. Candid solutions often involve presenting the facts, acknowledging any limitations or potential drawbacks, and proposing practical and realistic strategies or resolutions. In summary, a candid solution is an approach that is sincere, straightforward, and transparent in addressing problems or challenges, fostering open communication and trust.

Question no 13: -

Determining requirement for a flowchart:

A few Best Practices in Flowcharting Proper Form is Essential: In drawing a proper flowchart, all necessary requirements should be listed out in a logical order. 2. Clarity is Paramount: The flowchart should be clear, neat and easy to follow. There should not be any room for ambiguity in understanding the flowchart.

Question no 17: -

What is a flowchart symbols: -

Flowchart symbols are standardized graphical representations used in flowcharts to depict different elements and actions within a process. These symbols help to visually convey the meaning and function of each step or decision point in the flowchart. Here are some commonly used flowchart symbols:

  1. Terminal or Start/End Symbol: Represented by an oval or rounded rectangle, it indicates the beginning or end of the flowchart.
  2. Process Symbol: Depicted as a rectangle with rounded corners, it represents a specific action or task within the process.
  3. Decision Symbol: Represented by a diamond shape, it indicates a branching point in the process where a decision needs to be made. The flow can take different paths based on the outcome of the decision.
  4. Input/Output Symbol: Shown as a parallelogram, it represents the input or output of data, information, or materials in the process.
  1. Connector Symbol: Denoted by a small circle or dot, it indicates that the flow continues on a different part of the flowchart. It is used to connect different sections of the flowchart.
  2. Flow Arrows: Arrows are used to indicate the sequential flow of steps or decisions in the process. They connect the various symbols and show the direction of the flow. In addition to these basic symbols, there are also specific symbols used for specialized purposes or to represent specific actions or conditions within a flowchart. These may vary depending on the industry or context in which the flowchart is being used. q It's important to note that while there are common conventions for flowchart symbols, variations can exist. It's always good practice to include a legend or key that explains the meaning of the symbols used in a particular flowchart to ensure clarity and understanding.

Algorithm: -

Studying algorithm is a fundamental part of computer science.

Question no 18: -

Definition algorithm: -

An algorithm is a step-by-step procedure or set of rules designed to solve a specific problem or perform a specific task. It is a well-defined sequence of instructions that outlines the logical and computational steps needed to achieve a desired outcome. Algorithms can be expressed in various forms, including natural language, pseudocode, or programming languages. Key characteristics of algorithms include:

Overall, an algorithm is a systematic and logical procedure that provides a clear and structured approach to problem-solving or task execution.

Question no 19: -

Formulation of an algorithm: -

Description. A flowchart is a graphical representation of the steps a program takes to process data. In this, we can use several geometric patterns to illustrate the numerous actions the program carries out. An algorithm is a procedure or set of rules that defines how a program is to be executed.

Question no 20: -

Efficiency of algorithms: -

. An algorithm is considered efficient if its resource consumption, also known as computational cost, is at or below some acceptable level. Roughly speaking, 'acceptable' means it will run in a reasonable amount of time or space on an available computer, typically as a function of the size of the input. Question no 21: - Difference between an algorithm a flowchart: - An algorithm and a flowchart are different in terms of their nature, representation, and purpose. Here's a breakdown of the key differences between the two:

  1. Nature:
  • Algorithm: An algorithm is an abstract, step-by-step procedure or set of rules that defines how to solve a problem or perform a task. It focuses on the logical and computational steps required to achieve a specific outcome.
  • Flowchart: A flowchart is a visual diagram that represents the flow of steps, decisions, and processes within an algorithm or any other system. It provides a graphical representation of the algorithm's logic and structure.
  1. Representation:
  • Algorithm: Algorithms can be expressed in various forms, including natural language, pseudocode, or programming languages. They are typically presented in textual format, providing a clear and precise description of the steps and operations.
  • Flowchart: Flowcharts use standardized symbols and arrows to represent the steps, decisions, and connections within an algorithm. They provide a visual representation of the algorithm's flow, making it easier to understand and analyze.
  1. Purpose:
  • Algorithm: The main purpose of an algorithm is to provide a systematic and logical approach to problem-solving or task execution. It defines the sequence of steps and operations needed to achieve a desired outcome.
  • Flowchart: Flowcharts serve as a visual aid to understand and communicate the logical flow of an algorithm or any other process. They help in visualizing the structure, decision points, and overall flow of steps in a clear and intuitive manner.
  1. Abstraction:

Question no 24: -

Type of test data: -

Three types of test data are: normal data - typical, sensible data that the program should accept and be able to process. boundary data - valid data that falls at the boundary of any possible ranges, sometimes known as extreme data. erroneous data - data that the program cannot process and should not accept

Question no 25: -

Verification: -

If you verify something, you check that it is true by careful examination or investigation.

Question no 26: -

Validation: -

Validation is the process of checking whether the software product is up to the mark or in other words product has high level requirements. It is the process of checking the validation of product i.e. it checks what we are developing is the right product. it is validation of actual and expected product.

Question no 27: -

Trace table: -

Data tracing is the process of tracking data flows and transformations across systems and applications in order to understand the path that data takes through an organization's infrastructure.

Question no 28: -

What is valid and invalid test data

  1. Valid data set: Create it to check if the application is functioning as per requirements and valid input data is properly saved in database or files. 3) Invalid data set: Prepare invalid data set to check application behavior for negative values, alphanumeric string inputs. Chapter number 2: - Binary number system: -

Question no 1: -

Introduction to number

systems: -

A number system is defined as a system of writing to express numbers. It is the mathematical notation for representing numbers of a given set by using digits or other symbols in a consistent manner. It provides a unique representation of every number and represents the arithmetic and algebraic structure of the figures

Number system conversions deal with the operations to change the base of the numbers. For example, to change a decimal number with base 10 to binary number with base 2. We can also perform the arithmetic operations like addition, subtraction, multiplication on the number system.

Question no 6: -

Decimal to binary: -

Take decimal number as dividend. Divide this number by 2 (2 is base of binary so divisor here). Store the remainder in an array (it will be either 0 or 1 because of divisor 2). Repeat the above two steps until the number is greater than zero

Question no 7: -

Bimary to decimal: -

_How to convert binary to decimal. The decimal number is equal to the sum of binary digits (dn) times their power of 2 ( n ): decimal = d 0 × 0

  • d 1 × 1
  • d 2 × 2 +._

Question no 8: -

Decimal to hexdecimal: -

Go through the steps given below to learn how to convert the numbers from decimal to hex. Step 1: First, divide the decimal number by 16, considering the number as an integer. Step 2: Keep aside the remainder. Step 3: Again divide the quotient by 16 and repeat till you get the quotient value equal to zero.

Question no 9: -

Hexadecimal to decimal:

Go through the steps given below to learn how to convert the numbers from decimal to hex. Step 1: First, divide the decimal number by 16, considering the number as an integer. Step 2: Keep aside the remainder. Step 3: Again divide the quotient by 16 and repeat till you get the quotient value equal to zero.

Question no 10: -

j How many hexadecimal in binary?

Converting between hex and binary is easy, because each digit of a hexadecimal number "maps" to four bits (a bit being an individual binary digit) of a binary value. So a byte -- eight binary digits -- can always be represented by two hexadecimal digits

Question no 11: -

Binary to hexadecimal: -

Convert binary number 1101010 into hexadecimal number. First convert this into decimal number: = (1101010) 2 = 1x 6 +1x 5 +0x 4 +1x 3 +0x 2 +1x 1 +0x 0 = 64+32+0+8+0+2+0 = (106) 10 Then, convert it into hexadecimal number = (106) 10 = 6x 1 +10x 0 = (6A) 16 which is answer.

Question no 12: -

What is a memory: -

Memory is the process of taking in information from the world around us, processing it, storing it and later recalling that information, sometimes many years later. Human memory is often likened to that of a computer memory system or a filing cabinet.

Question no13: -

What is a volatile memory: -

measurement of size of computer

memory: -

Computer storage and memory is often measured in megabytes (MB) and gigabytes (GB). A medium-sized novel contains about 1 MB of information. 1 MB is 1,024 kilobytes, or 1,048,576 (1024x1024) bytes, not one million bytes. Similarly, one 1 GB is 1,024 MB, or 1,073,741,824 (1024x1024x1024) bytes.

Question no 18: -

Boolean Algebram: -

Boolean algebra is the category of algebra in which the variable's values are the truth values, true and false, ordinarily denoted 1 and 0 respectively. It is used to analyze and simplify digital circuits or digital gates. It is also called Binary Algebra or logical Algebra.

Question no 19: -

What is a truth table: -

The definition of a truth value is the attribute of a proposition as to whether the proposition is true or false. For example, the truth value for "7 is odd" is true, which can be denoted as T. The truth value of "1 + 1 = 3" is false, which can be denoted as F.

Question no 20: -

What is a Logical operator: -

A logical operator is a symbol or word used to connect two or more expressions such that the value of the compound expression produced depends only on that of the original expressions and on the meaning of the operator. Common logical operators include AND, OR, and NOT.

Question no 21: -

What is a AND Operator: -

The && (logical AND) operator indicates whether both operands are true. If both operands have nonzero values, the result has the value

  1. Otherwise, the result has the value 0. The type of the result is int. Both operands must have an arithmetic or pointer type.

Question no 22: -

What is a OR operator: -

|| (OR) The “OR” operator is represented with two vertical line symbols: result = a || b; In classical programming, the logical OR is meant to manipulate Boolean values only. If any of its arguments are true, it returns true, otherwise it returns false

Question no 23: -

What is a not operator

If the result of an expression is non-zero or true, the result will be reversed as zero or false value. Similarly, if the condition's result is false or 0, the NOT operator reverses the result and returns 1 or true. For example, suppose the user enters a non-zero value is 5, the logical NOT (!)

Question no 24: -

What is a truth table: -

A truth table provides a method for mapping out the possible truth values in an expression and to determine their outcomes. The table includes a column for each variable in the expression and a row for each possible combination of truth values. It also includes a column that shows the outcome of each set of values.