CLASS VIII COMPUTERS FLOW CHART AND ALGORITHM
Download as docx, pdf2 likes15,605 views
The document defines algorithms and flowcharts. It provides examples of algorithms for basic mathematical operations like addition, subtraction, finding greatest numbers. It also defines the key components of an algorithm like inputs, outputs, finite steps. Additionally, it defines the symbols used in a flowchart like terminal, input/output, process, decision, flow direction and connector symbols. Examples of flowcharts are given for algorithms like addition of two numbers and finding greatest among three numbers.
1 of 7
Downloaded 86 times
Ad
Recommended
Algorithm and flowchart
Algorithm and flowchartBaliThorat1 The document discusses algorithms and flowcharts. It defines an algorithm as a sequence of steps to solve a problem and lists their characteristics as having inputs, outputs, definiteness, and finiteness. Examples of algorithms are provided to find the sum of two numbers, convert between Celsius and Fahrenheit, and calculate the area and perimeter of shapes. Flowcharts are defined as using symbols to represent the sequence of operations to solve a problem. Advantages of both algorithms and flowcharts are given.
CBSE Grade XI - Computer system overview - Lesson 1
CBSE Grade XI - Computer system overview - Lesson 1 sumedhadeshpande5 The document provides an overview of computer systems, detailing components such as hardware, software, and memory. It explains the roles of input units, output units, the CPU, and the ALU in processing data, along with software types like system software and application software. Additionally, it highlights the importance of memory in data storage and management.
Preparative and analytical centrifugation
Preparative and analytical centrifugationPratheeba Subramani 1. Ultracentrifugation is a technique that uses very high speeds to separate particles in solution based on properties like size, shape, density.
2. There are two main types - preparative ultracentrifugation which handles large volumes to separate molecules, and analytical ultracentrifugation which uses small volumes and optical detection to study purified molecules.
3. Preparative ultracentrifugation techniques include differential centrifugation, density gradient centrifugation, and zonal centrifugation to separate organelles, proteins, and other molecules. Analytical ultracentrifugation determines molecular weight and detects conformational changes.
Physical and chemical properties of carbohydrates
Physical and chemical properties of carbohydratesJasmineJuliet The document discusses the physical and chemical properties of carbohydrates. It describes how monosaccharides exhibit optical isomerism due to asymmetric carbon atoms, and can be dextrorotatory or levorotatory. It also discusses mutarotation, where the optical rotation of monosaccharides changes over time when in solution. Additionally, it covers chemical properties such as reducing ability, reaction with acids and bases, and different types of oxidation reactions carbohydrates undergo.
Flower parts and its functions
Flower parts and its functionsShahrul Afzanizam The document provides an overview of flower parts and their functions, detailing the reproductive role of flowers, processes of fertilization and pollination, and types of pollination agents. It also explains seed dispersal mechanisms and includes questions for understanding flower structures and functions. Key flower components include sepals, petals, stamens, carpels, ovules, and ovaries, each serving distinct purposes in plant reproduction.
Ip address and subnetting
Ip address and subnettingIGZ Software house IP addressing and subnetting allows networks to be logically organized and divided. The key objectives covered include explaining IP address classes, configuring addresses, subnetting networks, and advanced concepts like CIDR, summarization, and VLSM. Transitioning to IPv6 is also discussed as a way to address the depletion of IPv4 addresses and improve security.
Informal letters
Informal lettersSaro Rosales Informal or friendly letters typically contain 5 parts:
1. The Heading includes the date but not necessarily the sender's address.
2. The Salutation is a greeting that ends in a comma, such as "Dear Uncle" or "Hi Joe".
3. The Body contains the message, which is usually introduced and concluded. Paragraphs are indented and the main body develops the subject.
4. The Closing is a short expression on a single line with the first word capitalized and a comma after the last word.
5. The Signature line contains the sender's name under the closing.
Python revision tour II
Python revision tour IIMr. Vikram Singh Slathia This document covers the basics of Python programming, focusing on data structures such as strings, lists, tuples, and dictionaries. It outlines how to create and manipulate these structures, including their methods and operations. Additionally, it highlights the key differences between strings and lists, as well as discussing sorting algorithms like bubble sort and insertion sort.
Tree - Data Structure
Tree - Data StructureAshim Lamichhane This document provides an overview of trees as a non-linear data structure. It begins by discussing how trees are used to represent hierarchical relationships and defines some key tree terminology like root, parent, child, leaf, and subtree. It then explains that a tree consists of nodes connected in a parent-child relationship, with one root node and nodes that may have any number of children. The document also covers tree traversal methods like preorder, inorder, and postorder traversal. It introduces binary trees and binary search trees, and discusses operations on BSTs like search, insert, and delete. Finally, it provides a brief overview of the Huffman algorithm for data compression.
Infix to-postfix examples
Infix to-postfix examplesmua99 This document provides examples of converting infix notation mathematical expressions to postfix notation. It shows the step-by-step process of parsing an infix expression token-by-token, pushing and popping operators from a stack to build the postfix string. For the expressions a+b*c-d/e*f and (a+b*c-d)/(e*f), it displays the token, operator stack, and resulting postfix strings after each step of the infix to postfix conversion algorithm.
Introduction to data structure ppt
Introduction to data structure pptNalinNishant3 The document provides an introduction to data structures, defining them as ways to efficiently store and organize data in computers. It classifies data structures into primitive and non-primitive types, and further divides them into linear and non-linear structures, covering examples such as arrays, stacks, queues, trees, and graphs. Additionally, the document discusses various operations associated with data structures, including creation, insertion, deletion, traversal, searching, sorting, and merging.
Array in c++
Array in c++Mahesha Mano - An array is a collection of consecutive memory locations that all have the same name and type. An array allows storing multiple values of the same type using a single name.
- Arrays in C++ must be declared before use, specifying the type, name, and number of elements. Elements are accessed using an index.
- The main advantages of arrays are that they allow storing and processing large numbers of values efficiently using a single name. Arrays also make sorting and searching values easier.
Top down parsing
Top down parsingLakshmiSamivel This document discusses top-down parsing and predictive parsing techniques. It explains that top-down parsers build parse trees from the root node down to the leaf nodes, while bottom-up parsers do the opposite. Recursive descent parsing and predictive parsing are introduced as two common top-down parsing approaches. Recursive descent parsing may involve backtracking, while predictive parsing avoids backtracking by using a parsing table to determine the production to apply. The key steps of a predictive parsing algorithm using a stack and parsing table are outlined.
Data structure ppt
Data structure pptProf. Dr. K. Adisesha The document provides an introduction to data structures. It defines data structures as representations of logical relationships between data elements that consider both the elements and their relationships. It classifies data structures as either primitive or non-primitive. Primitive structures are directly operated on by machine instructions while non-primitive structures are built from primitive ones. Common non-primitive structures include stacks, queues, linked lists, trees and graphs. The document then discusses arrays as a data structure and operations on arrays like traversal, insertion, deletion, searching and sorting.
Circular Queue data structure
Circular Queue data structureDhananjaysinh Jhala Circular queues are a type of queue where the first index follows the last index in a circular fashion. This allows for more efficient use of memory compared to standard queues by reusing spaces that would otherwise be left empty after deletion. The document provides an example C program for implementing a circular queue using an array, including contents on what a circular queue is, why they are useful, and sample code.
Sorting Algorithms
Sorting AlgorithmsPranay Neema This document discusses various sorting algorithms and their complexities. It begins by defining an algorithm and complexity measures like time and space complexity. It then defines sorting and common sorting algorithms like bubble sort, selection sort, insertion sort, quicksort, and mergesort. For each algorithm, it provides a high-level overview of the approach and time complexity. It also covers sorting algorithm concepts like stable and unstable sorting. The document concludes by discussing future directions for sorting algorithms and their applications.
Circular linked list
Circular linked listchauhankapil This document provides an introduction to circular linked lists. It explains that a circular linked list is a variation of a linked list where the first element points to the last element, forming a loop. Both singly and doubly linked lists can be made circular by having the next pointer of the last node point to the first node, and in doubly linked lists the previous pointer of the first node points to the last node. Basic operations like insert, delete, and display are supported. Memory management involves the head pointer storing the address of the first node, and each node storing the address of the next node and last node.
Graph traversals in Data Structures
Graph traversals in Data StructuresAnandhasilambarasan D Graph traversal techniques are used to search vertices in a graph and determine the order to visit vertices. There are two main techniques: breadth-first search (BFS) and depth-first search (DFS). BFS uses a queue and visits the nearest vertices first, producing a spanning tree. DFS uses a stack and visits vertices by going as deep as possible first, also producing a spanning tree. Both techniques involve marking visited vertices to avoid loops.
Binary Tree Traversal
Binary Tree TraversalDhrumil Panchal The document provides an overview of binary tree traversal methods, specifically preorder, inorder, and postorder traversal techniques. It includes examples of each traversal type as well as converse variations, along with recursive procedures for implementing these traversals in a binary tree. The content is aimed at computer engineering students studying data structures.
Data Structure - Elementary Data Organization
Data Structure - Elementary Data Organization Uma mohan 1. The document discusses elementary data organization and data structures. It defines key terms like data, entity, attribute, field, record, and file.
2. Different data types are described including primitive types like integer and float, and non-primitive types like arrays and structures.
3. Data structures are defined as arrangements of data in memory or storage. Common structures include arrays, linked lists, queues, and trees. Algorithms are used to manipulate data within these structures.
4. Common operations on data structures are discussed, including traversing, searching, inserting, deleting, sorting, and merging.
Evaluation of postfix expression
Evaluation of postfix expressionAkhil Ahuja This document discusses postfix notation for evaluating mathematical expressions. It begins by explaining that postfix notation, also called reverse polish notation, writes operators after their operands. It then covers the precedence of operators in postfix notation and the fundamental principles of evaluating a postfix expression using a stack. Key advantages of postfix notation are that operator precedence is unnecessary and the order of evaluation is determined by the position of operators and operands. An example is provided to demonstrate how to manually evaluate a postfix expression step-by-step using a stack.
Data structures using c
Data structures using cProf. Dr. K. Adisesha The document discusses various data structures and their classification. It begins by stating the objectives of understanding how data structures can be classified, basic data types and arrays, and problem-oriented data structures used to solve specific problems. It then defines key terms like data, information, and data structures. It describes primitive and non-primitive, linear and non-linear data structures. It also discusses basic and problem-oriented data structures like lists, stacks, queues, and trees. It provides examples and applications of different data structures.
Applications of stack
Applications of stackeShikshak The document discusses applications of stacks, including reversing strings and lists, Polish notation for mathematical expressions, converting between infix, prefix and postfix notations, evaluating postfix and prefix expressions, recursion, and the Tower of Hanoi problem. Recursion involves defining a function in terms of itself, with a stopping condition. Stacks can be used to remove recursion by saving local variables at each step.
Function overloading(c++)
Function overloading(c++)Ritika Sharma The document discusses function and operator overloading in C++, emphasizing polymorphism and its usefulness in allowing multiple definitions for the same function name. It explains how function signatures determine which function to call during compilation and describes the scope of variables, distinguishing between local, block, and global variables. Lastly, it covers the importance of understanding scope in programming to avoid errors related to variable accessibility.
Data Types - Premetive and Non Premetive
Data Types - Premetive and Non Premetive Raj Naik This document discusses data types in C programming. It describes primitive data types like integers, floats, characters and their syntax. It also covers non-primitive data types like arrays, structures, unions, and linked lists. Arrays store a collection of similar data types, structures group different data types, and unions store different types in the same memory location. Linked lists are dynamic data structures using pointers. The document also provides overviews of stacks and queues, describing their LIFO and FIFO properties respectively.
Presentation on C++ Programming Language
Presentation on C++ Programming Languagesatvirsandhu9 This document provides an overview of the C++ programming language. It discusses why C++ is used, how it compares to Fortran, and the basic structure and components of a C++ program. The key topics covered include data types, variables, operators, selection statements, iteration statements, functions, arrays, pointers, input/output, preprocessor instructions, and comments. The document is intended to teach the basics of C++ programming in a structured way over multiple sections.
DBMS Keys
DBMS KeysTarun Maheshwari This document discusses the different types of keys used in database management systems (DBMS). It outlines five types of keys: super key, candidate key, primary key, foreign key, and composite key. For each key type, it provides a definition and examples to illustrate how the key uniquely identifies records in a database table. The primary points made are that super keys are the broadest unique identifiers, candidate keys are minimal super keys, primary keys must uniquely identify each record and not change, and foreign keys link records between related tables.
trees in data structure
trees in data structure shameen khan Tree and graph data structures are used to represent hierarchical data. A tree has nodes connected by edges in a parent-child relationship where each node can have zero or more children but only one parent, forming a rooted tree. Common tree types include binary trees where each node has at most two children, binary search trees where the left child is less than the parent which is less than the right child, and B-trees where nodes can have multiple children. Trees are traversed using in-order, pre-order and post-order algorithms.
our c prog work
our c prog worksravan kumar This document provides examples of algorithms and program development methodologies. It discusses problem solving steps, program development cycles like waterfall method, and control structures like sequence, selection, and loops. Examples provided include finding the largest of three numbers, calculating the area of a circle, and reversing a number. Pseudocode and flowcharts are used to represent the algorithms.
Unit 3 Foc
Unit 3 FocJAYA This document provides examples of algorithms and program development methodologies. It discusses problem solving steps, program development cycles like waterfall method, and control structures like sequence, selection, and loops. Examples provided include finding the largest of three numbers, calculating factorials, and reversing a number. Pseudocode and flowcharts are used to represent the algorithms.
More Related Content
What's hot (20)
Tree - Data Structure
Tree - Data StructureAshim Lamichhane This document provides an overview of trees as a non-linear data structure. It begins by discussing how trees are used to represent hierarchical relationships and defines some key tree terminology like root, parent, child, leaf, and subtree. It then explains that a tree consists of nodes connected in a parent-child relationship, with one root node and nodes that may have any number of children. The document also covers tree traversal methods like preorder, inorder, and postorder traversal. It introduces binary trees and binary search trees, and discusses operations on BSTs like search, insert, and delete. Finally, it provides a brief overview of the Huffman algorithm for data compression.
Infix to-postfix examples
Infix to-postfix examplesmua99 This document provides examples of converting infix notation mathematical expressions to postfix notation. It shows the step-by-step process of parsing an infix expression token-by-token, pushing and popping operators from a stack to build the postfix string. For the expressions a+b*c-d/e*f and (a+b*c-d)/(e*f), it displays the token, operator stack, and resulting postfix strings after each step of the infix to postfix conversion algorithm.
Introduction to data structure ppt
Introduction to data structure pptNalinNishant3 The document provides an introduction to data structures, defining them as ways to efficiently store and organize data in computers. It classifies data structures into primitive and non-primitive types, and further divides them into linear and non-linear structures, covering examples such as arrays, stacks, queues, trees, and graphs. Additionally, the document discusses various operations associated with data structures, including creation, insertion, deletion, traversal, searching, sorting, and merging.
Array in c++
Array in c++Mahesha Mano - An array is a collection of consecutive memory locations that all have the same name and type. An array allows storing multiple values of the same type using a single name.
- Arrays in C++ must be declared before use, specifying the type, name, and number of elements. Elements are accessed using an index.
- The main advantages of arrays are that they allow storing and processing large numbers of values efficiently using a single name. Arrays also make sorting and searching values easier.
Top down parsing
Top down parsingLakshmiSamivel This document discusses top-down parsing and predictive parsing techniques. It explains that top-down parsers build parse trees from the root node down to the leaf nodes, while bottom-up parsers do the opposite. Recursive descent parsing and predictive parsing are introduced as two common top-down parsing approaches. Recursive descent parsing may involve backtracking, while predictive parsing avoids backtracking by using a parsing table to determine the production to apply. The key steps of a predictive parsing algorithm using a stack and parsing table are outlined.
Data structure ppt
Data structure pptProf. Dr. K. Adisesha The document provides an introduction to data structures. It defines data structures as representations of logical relationships between data elements that consider both the elements and their relationships. It classifies data structures as either primitive or non-primitive. Primitive structures are directly operated on by machine instructions while non-primitive structures are built from primitive ones. Common non-primitive structures include stacks, queues, linked lists, trees and graphs. The document then discusses arrays as a data structure and operations on arrays like traversal, insertion, deletion, searching and sorting.
Circular Queue data structure
Circular Queue data structureDhananjaysinh Jhala Circular queues are a type of queue where the first index follows the last index in a circular fashion. This allows for more efficient use of memory compared to standard queues by reusing spaces that would otherwise be left empty after deletion. The document provides an example C program for implementing a circular queue using an array, including contents on what a circular queue is, why they are useful, and sample code.
Sorting Algorithms
Sorting AlgorithmsPranay Neema This document discusses various sorting algorithms and their complexities. It begins by defining an algorithm and complexity measures like time and space complexity. It then defines sorting and common sorting algorithms like bubble sort, selection sort, insertion sort, quicksort, and mergesort. For each algorithm, it provides a high-level overview of the approach and time complexity. It also covers sorting algorithm concepts like stable and unstable sorting. The document concludes by discussing future directions for sorting algorithms and their applications.
Circular linked list
Circular linked listchauhankapil This document provides an introduction to circular linked lists. It explains that a circular linked list is a variation of a linked list where the first element points to the last element, forming a loop. Both singly and doubly linked lists can be made circular by having the next pointer of the last node point to the first node, and in doubly linked lists the previous pointer of the first node points to the last node. Basic operations like insert, delete, and display are supported. Memory management involves the head pointer storing the address of the first node, and each node storing the address of the next node and last node.
Graph traversals in Data Structures
Graph traversals in Data StructuresAnandhasilambarasan D Graph traversal techniques are used to search vertices in a graph and determine the order to visit vertices. There are two main techniques: breadth-first search (BFS) and depth-first search (DFS). BFS uses a queue and visits the nearest vertices first, producing a spanning tree. DFS uses a stack and visits vertices by going as deep as possible first, also producing a spanning tree. Both techniques involve marking visited vertices to avoid loops.
Binary Tree Traversal
Binary Tree TraversalDhrumil Panchal The document provides an overview of binary tree traversal methods, specifically preorder, inorder, and postorder traversal techniques. It includes examples of each traversal type as well as converse variations, along with recursive procedures for implementing these traversals in a binary tree. The content is aimed at computer engineering students studying data structures.
Data Structure - Elementary Data Organization
Data Structure - Elementary Data Organization Uma mohan 1. The document discusses elementary data organization and data structures. It defines key terms like data, entity, attribute, field, record, and file.
2. Different data types are described including primitive types like integer and float, and non-primitive types like arrays and structures.
3. Data structures are defined as arrangements of data in memory or storage. Common structures include arrays, linked lists, queues, and trees. Algorithms are used to manipulate data within these structures.
4. Common operations on data structures are discussed, including traversing, searching, inserting, deleting, sorting, and merging.
Evaluation of postfix expression
Evaluation of postfix expressionAkhil Ahuja This document discusses postfix notation for evaluating mathematical expressions. It begins by explaining that postfix notation, also called reverse polish notation, writes operators after their operands. It then covers the precedence of operators in postfix notation and the fundamental principles of evaluating a postfix expression using a stack. Key advantages of postfix notation are that operator precedence is unnecessary and the order of evaluation is determined by the position of operators and operands. An example is provided to demonstrate how to manually evaluate a postfix expression step-by-step using a stack.
Data structures using c
Data structures using cProf. Dr. K. Adisesha The document discusses various data structures and their classification. It begins by stating the objectives of understanding how data structures can be classified, basic data types and arrays, and problem-oriented data structures used to solve specific problems. It then defines key terms like data, information, and data structures. It describes primitive and non-primitive, linear and non-linear data structures. It also discusses basic and problem-oriented data structures like lists, stacks, queues, and trees. It provides examples and applications of different data structures.
Applications of stack
Applications of stackeShikshak The document discusses applications of stacks, including reversing strings and lists, Polish notation for mathematical expressions, converting between infix, prefix and postfix notations, evaluating postfix and prefix expressions, recursion, and the Tower of Hanoi problem. Recursion involves defining a function in terms of itself, with a stopping condition. Stacks can be used to remove recursion by saving local variables at each step.
Function overloading(c++)
Function overloading(c++)Ritika Sharma The document discusses function and operator overloading in C++, emphasizing polymorphism and its usefulness in allowing multiple definitions for the same function name. It explains how function signatures determine which function to call during compilation and describes the scope of variables, distinguishing between local, block, and global variables. Lastly, it covers the importance of understanding scope in programming to avoid errors related to variable accessibility.
Data Types - Premetive and Non Premetive
Data Types - Premetive and Non Premetive Raj Naik This document discusses data types in C programming. It describes primitive data types like integers, floats, characters and their syntax. It also covers non-primitive data types like arrays, structures, unions, and linked lists. Arrays store a collection of similar data types, structures group different data types, and unions store different types in the same memory location. Linked lists are dynamic data structures using pointers. The document also provides overviews of stacks and queues, describing their LIFO and FIFO properties respectively.
Presentation on C++ Programming Language
Presentation on C++ Programming Languagesatvirsandhu9 This document provides an overview of the C++ programming language. It discusses why C++ is used, how it compares to Fortran, and the basic structure and components of a C++ program. The key topics covered include data types, variables, operators, selection statements, iteration statements, functions, arrays, pointers, input/output, preprocessor instructions, and comments. The document is intended to teach the basics of C++ programming in a structured way over multiple sections.
DBMS Keys
DBMS KeysTarun Maheshwari This document discusses the different types of keys used in database management systems (DBMS). It outlines five types of keys: super key, candidate key, primary key, foreign key, and composite key. For each key type, it provides a definition and examples to illustrate how the key uniquely identifies records in a database table. The primary points made are that super keys are the broadest unique identifiers, candidate keys are minimal super keys, primary keys must uniquely identify each record and not change, and foreign keys link records between related tables.
trees in data structure
trees in data structure shameen khan Tree and graph data structures are used to represent hierarchical data. A tree has nodes connected by edges in a parent-child relationship where each node can have zero or more children but only one parent, forming a rooted tree. Common tree types include binary trees where each node has at most two children, binary search trees where the left child is less than the parent which is less than the right child, and B-trees where nodes can have multiple children. Trees are traversed using in-order, pre-order and post-order algorithms.
Similar to CLASS VIII COMPUTERS FLOW CHART AND ALGORITHM (20)
our c prog work
our c prog worksravan kumar This document provides examples of algorithms and program development methodologies. It discusses problem solving steps, program development cycles like waterfall method, and control structures like sequence, selection, and loops. Examples provided include finding the largest of three numbers, calculating the area of a circle, and reversing a number. Pseudocode and flowcharts are used to represent the algorithms.
Unit 3 Foc
Unit 3 FocJAYA This document provides examples of algorithms and program development methodologies. It discusses problem solving steps, program development cycles like waterfall method, and control structures like sequence, selection, and loops. Examples provided include finding the largest of three numbers, calculating factorials, and reversing a number. Pseudocode and flowcharts are used to represent the algorithms.
Flowchart and algorithm
Flowchart and algorithmDHANIK VIKRANT The document discusses the problem-solving process in computing, detailing stages like problem definition, algorithm development, and flowchart creation. It highlights the importance of these stages in accurately solving problems while providing examples of algorithms and flowcharts for various tasks. The document also defines common symbols used in flowcharts and their respective functions.
Algorithm for computational problematic sit
Algorithm for computational problematic sitSaurabh846965 A computer requires precise instructions from a user in order to perform tasks correctly. It has no inherent intelligence or ability to solve problems on its own. For a computer to solve a problem, a programmer must break the problem down into a series of simple steps and write program code that provides those step-by-step instructions in a language the computer can understand. This process involves understanding the problem, analyzing it, developing a solution algorithm, and coding the algorithm so the computer can execute it. Flowcharts can help visualize algorithms and problem-solving logic in a graphical format before writing program code.
Logic Development and Algorithm.
Logic Development and Algorithm.NandiniSidana The document discusses algorithms and flowcharts for solving problems. It defines an algorithm as a set of sequential steps to solve a problem and notes that there are various techniques for specifying algorithms, including formally, informally, mathematically, or through graphical flowcharts. The document provides examples of algorithms to solve common problems and explains the properties and steps involved in algorithm development. It also describes flowcharts as a visual representation of an algorithm using standard symbols like ovals, rectangles, and diamonds to indicate starts/stops, processes, and decisions.
Problem solving methodology
Problem solving methodologyProf. Dr. K. Adisesha The document outlines a comprehensive problem-solving methodology that includes steps such as problem definition, analysis, algorithm development, coding, testing, debugging, and maintenance. It emphasizes the importance of algorithms and flowcharts in programming, detailing their advantages and disadvantages, as well as providing examples of various algorithms and constructs like loops and conditional statements. Additionally, it discusses the characteristics of good programming practices and approaches such as top-down and bottom-up design.
Cp module 2
Cp module 2Amarjith C K The document discusses basic elements of the C programming language including flow charts, algorithms, constants, variables, data types, and the structure of a C program. It provides definitions and examples of key concepts such as:
- Flow charts depict the sequence of instructions in an algorithm using standard symbols like rectangles, diamonds, and arrows.
- An algorithm is a precise set of instructions to solve a problem with inputs, unambiguous processing rules, basic instructions, and finite time and outputs.
- Constants in C include integers, characters, strings, and floating-point numbers. Variables are named values that can change.
- C has primary data types like int, char, float, and void, and derived types are built from the
flowchart & algorithms
flowchart & algorithmsStudent An algorithm is a set of steps to solve a problem. It has four characteristics: finiteness, definiteness, effectiveness, and inputs/outputs. To develop an algorithm, one identifies the inputs, outputs, logic, breaks the logic into simple steps, and writes the steps in order. A flowchart is a pictorial representation of an algorithm that uses standard symbols like rectangles, diamonds, and arrows. It shows the flow of instructions and is easier to understand than an algorithm. Examples are provided to write algorithms and flowcharts to convert feet to centimeters and calculate the area of a rectangle.
UNIT 1.pptx Programming for Problem Solving
UNIT 1.pptx Programming for Problem Solvingramesh130484 The document is a syllabus for a programming course covering topics in problem solving and the C programming language. It includes algorithms, flowcharts, control structures, program design, and practical examples for various programming tasks. Key educational resources are also provided, alongside detailed explanations of programming fundamentals and constructs.
C language algorithms
C language algorithmscprogram An algorithm is a sequence of steps to solve a problem. There are four main types of algorithms: divide and conquer, greedy method, branch and bound, and recursion. Pseudocode is a language used to describe algorithms, comprising elements like variable declaration, assignment, procedure calls, input/output, and constants. Examples provide pseudocode to find the sum of two numbers, reverse a number, and calculate the sum of the first n factorial terms.
Proble, Solving & Automation
Proble, Solving & AutomationJanani Satheshkumar The document provides information on problem solving and office automation. It discusses key concepts like algorithms, program development cycles, and control structures. For algorithms, it covers characteristics, representations using flowcharts and pseudocode, and examples. The main program development methodologies covered are the program planning method and waterfall method. Control structures discussed include sequence, selection, and looping. Examples provided include finding largest of three numbers, quadratic equation, swapping variables, and checking leap year.
UNIT- 3-FOC.ppt
UNIT- 3-FOC.pptKalaivaniRMECLectCSE The document provides information on problem solving and office automation. It discusses key concepts like algorithms, program development cycles, and control structures. For algorithms, it covers characteristics, representations using flowcharts and pseudocode, and examples. The main program development methodologies covered are the program planning method and waterfall method. Control structures discussed include sequence, selection, and looping. Examples provided include finding largest of three numbers, quadratic equation, swapping variables, and checking leap year.
UNIT 1.pptx
UNIT 1.pptxShaswatSurya The document provides an overview of computational thinking and problem solving. It discusses key concepts like algorithms, the building blocks of algorithms including statements, state, control flow, functions. It also covers different notations for representing algorithms - pseudocode, flowcharts, programming languages. Some key aspects covered include the definition of an algorithm, properties and qualities of a good algorithm. Examples are provided for different algorithm concepts like finding the minimum/maximum value, sorting cards etc.
Programming in C by SONU KUMAR.pptx
Programming in C by SONU KUMAR.pptxSONU KUMAR The document discusses various computer programming concepts in C language including data types, operators, control structures, functions, and algorithms. It provides an overview of different types of languages like machine language, assembly language, and high-level languages. It also explains concepts like variables, expressions, I/O functions, data structures and their implementation in C programs through examples. Flowcharts and algorithms for basic mathematical and logical problems are presented. Different loops and decision making statements supported in C like if-else, switch-case, for, while, do-while are described along with their syntax and usage.
Unit 1-problem solving with algorithm
Unit 1-problem solving with algorithmrajkumar1631010038 The document discusses algorithms and their building blocks. It defines an algorithm as a collection of well-defined, unambiguous and effectively computable instructions that return a proper output. The three building blocks of algorithms are identified as sequence, selection, and iteration. Sequence refers to a series of actions performed in order. Selection allows a program to choose between different actions or conditions. Iteration allows a block of code to be repeated while a condition is true. Pseudocode and flowcharts are introduced as common ways to express algorithms and illustrate the control flow and logic of a program.
Python breakdown-workbook
Python breakdown-workbookHP IT GROUP (TEBIM TEBITAGEM) TTGRT HP E-TİCARET This document introduces a Python workbook for beginners. It covers 7 chapters that teach Python fundamentals like data types, variables, operators, conditional statements, and loops. The chapters also include quizzes to test the reader's understanding. The conclusion encourages the reader to take a paid Python course for more practical learning experiences to advance their skills.
programming concept
programming conceptNehabhy This document discusses programming concepts and introduces algorithms, flowcharts, and pseudocode as tools for developing programs. An algorithm is a sequence of steps to solve a problem, like adding two numbers. A flowchart uses graphical symbols to represent an algorithm's logic flow. Pseudocode uses English-like syntax to describe a program's flow without a specific programming language. These tools help break problems down into steps and ensure programs are correctly structured before writing actual code.
Chapter #1 (Introduction To Algorithms).pptx
Chapter #1 (Introduction To Algorithms).pptxhekmatyarzahir44 An algorithm is a set of clear and finite instructions for solving a problem or completing a task, often illustrated through recipes or direction sets. Algorithms have specific features such as definiteness, input/output, and must be language-independent, while offering advantages like ease of understanding but also have drawbacks like time consumption. Additionally, algorithms can be analyzed for performance using various methods including asymptotic analysis, determining different cases of execution time and utilizing notations like big O, omega, and theta to describe their efficiency.
C program
C programAJAL A J This document provides information on C programming concepts including data types, operators, functions, and basic program structure.
It defines key concepts like variables, data types (integer, float, character), operators (arithmetic, relational, logical), functions (printf, scanf), and basic program anatomy with main(), I/O statements, and comments. Examples are given to illustrate variable declaration and usage, arithmetic operations, type casting, and basic programs to read/write and perform calculations.
Algorithms and flowcharts
Algorithms and flowchartsSamuel Igbanogu This document discusses algorithms, flowcharts, pseudocode, and decision structures. It begins by defining algorithms and their purpose in problem solving. It then explains flowchart symbols and how to represent algorithms visually using flowcharts. Several examples are provided of writing pseudocode, detailed algorithms, and corresponding flowcharts to solve problems. The document also covers decision structures like if-then-else statements and relational operators. It provides examples of algorithms using nested if statements. Finally, it presents an example of determining an employee bonus based on overtime worked and absences.
Ad
More from Rc Os (20)
Dove
DoveRc Os The farmer bought a goose that laid a golden egg everyday, making him rich by selling the eggs in the market. However, he greedily killed the goose thinking he could take all the golden eggs from its stomach at once, but found nothing inside.
CLASS IV ENGLISH
CLASS IV ENGLISHRc Os This document provides examples of compound words formed by joining two words together, such as "rainbow", "butterfly", and "snowman". It then asks the reader to identify compound words in sentences and lists of words. Examples of compound words given include "camper", "doghouse", and "lighthouse". The document concludes by asking the reader to create their own compound words by joining two words.
CLASS 4 MATHS
CLASS 4 MATHSRc Os This document contains 15 multiple choice questions about volumes of liquids measured in milliliters and liters. It is a quiz about common volumes like a teaspoon, a mug of tea, and the gas tanks of cars, as well as larger volumes like swimming pools. Players earn hypothetical cash prizes for answering the questions correctly, with the potential to win 1 million rupees for answering the final question about the volume of an Olympic swimming pool.
CLASS 4 MATHS
CLASS 4 MATHSRc Os The document discusses a class trip to Bhopal where 210 children from grades 1-5 will attend. It calculates that 4 regular buses, each able to hold 50 children, would be needed for transportation. However, the buses available are mini buses that can only hold 35 children each. So the document prompts calculating how many mini buses would be required to transport all 210 children.
CLASS III MATHS
CLASS III MATHS Rc Os This document discusses different views of objects and symmetry. It contains pictures of objects with their front, back, top, and side views labeled. It also contains pictures that are divided in half along a dotted line and asks students to draw the other half using a mirror. The document suggests activities for students like making shapes with dots, listing symmetrical letters, and identifying which objects can be divided into equal halves with a dotted line. It includes two worksheets with questions about views of objects and drawing lines of symmetry.
CLASS III MATHS
CLASS III MATHSRc Os The document lists comparative adjective pairs in three categories: longer-shorter, tallest-shortest, thickest-thinnest. It repeats the pairs "taller-shorter" and "tallest-shortest" multiple times and also includes the pairs "longest-shortest", "heavier-lighter", and "heaviest-lightest".
Changing times.
Changing times.Rc Os Chetandas describes his life experiences moving from India to Pakistan as a child after the countries divided. He helped his parents build their first home using local materials like mud, husk, cow dung and wood. Over the years he got married, had children, and built additional rooms. His children are now grown and he is planning to build a new home with modern materials like bricks, cement and running water. Chetandas has seen many changes over his lifetime in how homes are constructed.
3 class english
3 class englishRc Os This document describes different sounds that can be heard on the road, including birds singing, cycles ringing their bells, vegetable sellers calling out what they are selling, school children chatting, and the tramping sound of shoes on the pavement. It also identifies common birds like crows that caw in the mornings and sparrows that chirp. Rules for walking and crossing roads safely are provided, along with values around road safety like prioritizing safety over speed.
Clss ii english-the mouse---
Clss ii english-the mouse---Rc Os A mouse found a pencil and started chewing on it. The pencil pleaded with the mouse, saying "You are hurting me," and asked if it could draw one last picture before the mouse continued chewing. The pencil hoped its request would make the mouse stop chewing and potentially harming it.
Rainbow
RainbowRc Os The document discusses various topics including the brightness of the sun, favorite fruits, plants in gardens, fruits lying outside baskets, and colors like yellow, orange, blue, red, violet, green and indigo. It also includes short phrases about inside and outside, awake and asleep, love and hate, and an activity to match opposite words.
TIME
TIMERc Os This document outlines a student's daily schedule and asks questions about the timing of activities. It describes the student waking up in the morning, eating breakfast, going to school, having lunch, playing, studying, and going to bed. It then asks which activities take place in the morning, evening, day, and night and which activity takes the longest time.
MEASUREMENTS
MEASUREMENTSRc Os This document contains questions about comparing the length, height, weight, and other attributes of different objects. It asks which object is longer/shorter, tallest/shortest, heavier/lighter, and which house and tree have specific attributes. The questions are assessing skills in comparing attributes and determining which object has a superlative quality like being the longest, tallest or heaviest.
DATA HANDLING
DATA HANDLINGRc Os Sudha and her sister Harini want to separate and count the fruits in a basket their father brought for a family pooja. They counted 6 bananas, 3 apples, 5 oranges, 2 grapes, and 8 mangoes. The document provides worksheets and questions to help students practice organizing and analyzing data.
patterns
patternsRc Os This document discusses patterns and completing them. It asks the reader to find the next pattern in a series and how many additional patterns could be completed based on the rules given.
Who is heavier
Who is heavierRc Os The document is a story about a boy named Shiva learning about what makes objects heavier or lighter from his grandfather. His grandfather has him hold different objects like a sharpener, book, lock, and crayon to understand which feels heavier. Through this interactive lesson, Shiva learns that heavier objects are harder to carry than lighter objects. His grandfather reinforces this by having Shiva watch a video and answer questions correctly about which common items are heavier or lighter.
Sundari
SundariRc Os Bobby made a kite called Sundari out of red, white, and blue paper. He took Sundari to the fair where he tried to fly her but a dog grabbed her string. After shooing the dog away, Bobby was able to get Sundari airborne and she flew up high, enjoying her freedom.
The tiger and the mosquitoe
The tiger and the mosquitoeRc Os A tiger was napping under a tree when an annoying mosquito started buzzing around him. When the tiger tried to swat the mosquito away with his paws, he ended up hitting himself both times and scraping his cheek, making it bleed. Unable to hit the evasive mosquito, the embarrassed tiger walked away as the mosquito called out that everyone has their strengths.
Photoshop
PhotoshopRc Os Photoshop is image editing software created by Thomas Knoll in 1987. It contains various tools for selection, painting, and editing images organized in a toolbar. Key tools include selection tools like the marquee and lasso tools, painting and editing tools like the brush and crop tools, and tools to work with layers and colors. Photoshop allows users to open, edit, and save images in various formats like PSD, JPEG, and TIFF. Images can be created or modified using layers, tools, and options like adding text.
COMPUTERS Database
COMPUTERS Database Rc Os This document provides an overview of databases and database management systems (DBMS). It discusses what a database is, components of a database system like users and applications, and examples of DBMS like MySQL and Oracle. It also summarizes key database concepts such as data models, relationships between data using keys, and relational algebra operations for querying databases.
Ad
Recently uploaded (20)
How to Manage Inventory Movement in Odoo 18 POS
How to Manage Inventory Movement in Odoo 18 POSCeline George Inventory management in the Odoo 18 Point of Sale system is tightly integrated with the inventory module, offering a solution to businesses to manage sales and stock in one united system.
Chalukyas of Gujrat, Solanki Dynasty NEP.pptx
Chalukyas of Gujrat, Solanki Dynasty NEP.pptxDr. Ravi Shankar Arya Mahila P. G. College, Banaras Hindu University, Varanasi, India. This presentation has been made keeping in mind the students of undergraduate and postgraduate level. In this slide try to present the brief history of Chaulukyas of Gujrat up to Kumarpala To keep the facts in a natural form and to display the material in more detail, the help of various books, websites and online medium has been taken. Whatever medium the material or facts have been taken from, an attempt has been made by the presenter to give their reference at the end.
Chaulukya or Solanki was one of the Rajputs born from Agnikul. In the Vadnagar inscription, the origin of this dynasty is told from Brahma's Chauluk or Kamandalu. They ruled in Gujarat from the latter half of the tenth century to the beginning of the thirteenth century. Their capital was in Anahilwad. It is not certain whether it had any relation with the Chalukya dynasty of the south or not. It is worth mentioning that the name of the dynasty of the south was 'Chaluky' while the dynasty of Gujarat has been called 'Chaulukya'. The rulers of this dynasty were the supporters and patrons of Jainism.
Sustainable Innovation with Immersive Learning
Sustainable Innovation with Immersive LearningLeonel Morgado Prof. Leonel and Prof. Dennis approached educational uses, practices, and strategies of using immersion as a lens to interpret, design, and planning educational activities in a sustainable way. Rather than one-off gimmicks, the intent is to enable instructors (and institutions) to be able to include them in their regular activities, including the ability to evaluate and redesign them.
Immersion as a phenomenon enables interpreting pedagogical activities in a learning-agnostic way: you take a stance on the learning theory to follow, and leverage immersion to envision and guide your practice.
Battle of Bookworms 2025 - U25 Literature Quiz by Pragya
Battle of Bookworms 2025 - U25 Literature Quiz by Pragya Pragya - UEM Kolkata Quiz Club Battle of Bookworms is a literature quiz organized by Pragya, UEM Kolkata, as part of their cultural fest Ecstasia. Curated by quizmasters Drisana Bhattacharyya, Argha Saha, and Aniket Adhikari, the quiz was a dynamic mix of classical literature, modern writing, mythology, regional texts, and experimental literary forms. It began with a 20-question prelim round where ‘star questions’ played a key tie-breaking role. The top 8 teams moved into advanced rounds, where they faced audio-visual challenges, pounce/bounce formats, immunity tokens, and theme-based risk-reward questions. From Orwell and Hemingway to Tagore and Sarala Das, the quiz traversed a global and Indian literary landscape. Unique rounds explored slipstream fiction, constrained writing, adaptations, and true crime literature. It included signature IDs, character identifications, and open-pounce selections. Questions were crafted to test contextual understanding, narrative knowledge, and authorial intent, making the quiz both intellectually rewarding and culturally rich. Battle of Bookworms proved literature quizzes can be insightful, creative, and deeply enjoyable for all.
How to Manage & Create a New Department in Odoo 18 Employee
How to Manage & Create a New Department in Odoo 18 EmployeeCeline George In Odoo 18's Employee module, organizing your workforce into departments enhances management and reporting efficiency. Departments are a crucial organizational unit within the Employee module.
BUSINESS QUIZ PRELIMS | QUIZ CLUB OF PSGCAS | 9 SEPTEMBER 2024
BUSINESS QUIZ PRELIMS | QUIZ CLUB OF PSGCAS | 9 SEPTEMBER 2024Quiz Club of PSG College of Arts & Science THE QUIZ CLUB OF PSGCAS BRINGS T0 YOU A FUN-FILLED, SEAT EDGE BUSINESS QUIZ
DIVE INTO THE PRELIMS OF BIZCOM 2024
QM: GOWTHAM S
BCom (2022-25)
THE QUIZ CLUB OF PSGCAS
ICT-8-Module-REVISED-K-10-CURRICULUM.pdf
ICT-8-Module-REVISED-K-10-CURRICULUM.pdfpenafloridaarlyn In this module, you will discover how digital tools, systems, and platforms empower people, businesses, and communities in the modern world. As 21st-century learners, you are part of a generation that lives and learns in a digital environment. This module is designed to guide you in exploring how ICT serves as a powerful tool—not only for communication but also for innovation, entrepreneurship, and responsible citizenship. Throughout this learning material, you will examine how ICT is used in real-world scenarios such as online marketing, digital citizenship, and legal and ethical issues in technology use. You’ll gain practical knowledge and skills, from creating websites and managing e-commerce platforms, to analyzing data and practicing safe and responsible behavior online.
By engaging with the lessons, activities, and performance tasks in this module, you will become more than just a technology user—you will be a responsible, informed, and empowered digital citizen ready to thrive in today’s interconnected world.
Let’s begin this journey and unlock the full potential of ICT in your everyday life!
Introduction to Generative AI and Copilot.pdf
Introduction to Generative AI and Copilot.pdfTechSoup In this engaging and insightful two-part webinar series, where we will dive into the essentials of generative AI, address key AI concerns, and demonstrate how nonprofits can benefit from using Microsoft’s AI assistant, Copilot, to achieve their goals.
This event series to help nonprofits obtain Copilot skills is made possible by generous support from Microsoft.
Ray Dalio How Countries go Broke the Big Cycle
Ray Dalio How Countries go Broke the Big CycleDadang Solihin A complete and practical understanding of the Big Debt Cycle. A much more practical understanding of how supply and demand really work compared to the conventional economic thinking. A complete and practical understanding of the Overall Big Cycle, which is driven by the Big Debt Cycle and the other major cycles, including the big political cycle within countries that changes political orders and the big geopolitical cycle that changes world orders.
Paper 108 | Thoreau’s Influence on Gandhi: The Evolution of Civil Disobedience
Paper 108 | Thoreau’s Influence on Gandhi: The Evolution of Civil DisobedienceRajdeep Bavaliya Dive into the powerful journey from Thoreau’s 19th‑century essay to Gandhi’s mass movement, and discover how one man’s moral stand became the backbone of nonviolent resistance worldwide. Learn how conscience met strategy to spark revolutions, and why their legacy still inspires today’s social justice warriors. Uncover the evolution of civil disobedience. Don’t forget to like, share, and follow for more deep dives into the ideas that changed the world.
M.A. Sem - 2 | Presentation
Presentation Season - 2
Paper - 108: The American Literature
Submitted Date: April 2, 2025
Paper Name: The American Literature
Topic: Thoreau’s Influence on Gandhi: The Evolution of Civil Disobedience
[Please copy the link and paste it into any web browser to access the content.]
Video Link: https://youtu.be/HXeq6utg7iQ
For a more in-depth discussion of this presentation, please visit the full blog post at the following link: https://rajdeepbavaliya2.blogspot.com/2025/04/thoreau-s-influence-on-gandhi-the-evolution-of-civil-disobedience.html
Please visit this blog to explore additional presentations from this season:
Hashtags:
#CivilDisobedience #ThoreauToGandhi #NonviolentResistance #Satyagraha #Transcendentalism #SocialJustice #HistoryUncovered #GandhiLegacy #ThoreauInfluence #PeacefulProtest
Keyword Tags:
civil disobedience, Thoreau, Gandhi, Satyagraha, nonviolent protest, transcendentalism, moral resistance, Gandhi Thoreau connection, social change, political philosophy
Energy Balances Of Oecd Countries 2011 Iea Statistics 1st Edition Oecd
Energy Balances Of Oecd Countries 2011 Iea Statistics 1st Edition Oecdrazelitouali Energy Balances Of Oecd Countries 2011 Iea Statistics 1st Edition Oecd
Energy Balances Of Oecd Countries 2011 Iea Statistics 1st Edition Oecd
Energy Balances Of Oecd Countries 2011 Iea Statistics 1st Edition Oecd
Wax Moon, Richmond, VA. Terrence McPherson
Wax Moon, Richmond, VA. Terrence McPhersonTerrenceMcPherson1 Wax Moon is an independent record store keeping its foundational foothold in vinyl records by taking in collections and keeping the old 80s aesthetics alive with involvement in its community and participation with record distributors.
Assisting Individuals and Families to Promote and Maintain Health – Unit 7 | ...
Assisting Individuals and Families to Promote and Maintain Health – Unit 7 | ...RAKESH SAJJAN This PowerPoint presentation is based on Unit 7 – Assisting Individuals and Families to Promote and Maintain Their Health, a core topic in Community Health Nursing – I for 5th Semester B.Sc Nursing students, as per the Indian Nursing Council (INC) guidelines.
The unit emphasizes the nurse’s role in family-centered care, early detection of health problems, health promotion, and appropriate referrals, especially in the context of home visits and community outreach. It also strengthens the student’s understanding of nursing responsibilities in real-life community settings.
📘 Key Topics Covered in the Presentation:
Introduction to family health care: needs, principles, and objectives
Assessment of health needs of individuals, families, and groups
Observation and documentation during home visits and field assessments
Identifying risk factors: environmental, behavioral, genetic, and social
Conducting growth and development monitoring in infants and children
Recording and observing:
Milestones of development
Menstrual health and reproductive cycle
Temperature, blood pressure, and vital signs
General physical appearance and personal hygiene
Social assessment: understanding family dynamics, occupation, income, living conditions
Health education and counseling for individuals and families
Guidelines for early detection and referral of communicable and non-communicable diseases
Maintenance of family health records and individual health cards
Assisting families with:
Maternal and child care
Elderly and chronic disease management
Hygiene and nutrition guidance
Utilization of community resources – referral linkages, support services, and local health programs
Role of nurse in coordinating care, advocating for vulnerable individuals, and empowering families
Promoting self-care and family participation in disease prevention and health maintenance
This presentation is highly useful for:
Nursing students preparing for internal exams, university theory papers, or community postings
Health educators conducting family teaching sessions
Students conducting fieldwork and project work during community postings
Public health nurses and outreach workers dealing with preventive, promotive, and rehabilitative care
It’s structured in a step-by-step format, featuring tables, case examples, and simplified explanations tailored for easy understanding and classroom delivery.
How to Configure Vendor Management in Lunch App of Odoo 18
How to Configure Vendor Management in Lunch App of Odoo 18Celine George The Vendor management in the Lunch app of Odoo 18 is the central hub for managing all aspects of the restaurants or caterers that provide food for your employees.
ROLE PLAY: FIRST AID -CPR & RECOVERY POSITION.pptx
ROLE PLAY: FIRST AID -CPR & RECOVERY POSITION.pptxBelicia R.S Role play : First Aid- CPR, Recovery position and Hand hygiene.
Scene 1: Three friends are shopping in a mall
Scene 2: One of the friend becomes victim to electric shock.
Scene 3: Arrival of a first aider
Steps:
Safety First
Evaluate the victim‘s condition
Call for help
Perform CPR- Secure an open airway, Chest compression, Recuse breaths.
Put the victim in Recovery position if unconscious and breathing normally.
How to Implement Least Package Removal Strategy in Odoo 18 Inventory
How to Implement Least Package Removal Strategy in Odoo 18 InventoryCeline George In Odoo, the least package removal strategy is a feature designed to optimize inventory management by minimizing the number of packages open to fulfill the orders. This strategy is particularly useful for the business that deals with products packages in various quantities such as boxes, cartons or palettes.
Chalukyas of Gujrat, Solanki Dynasty NEP.pptx
Chalukyas of Gujrat, Solanki Dynasty NEP.pptxDr. Ravi Shankar Arya Mahila P. G. College, Banaras Hindu University, Varanasi, India.
BUSINESS QUIZ PRELIMS | QUIZ CLUB OF PSGCAS | 9 SEPTEMBER 2024
BUSINESS QUIZ PRELIMS | QUIZ CLUB OF PSGCAS | 9 SEPTEMBER 2024Quiz Club of PSG College of Arts & Science
CLASS VIII COMPUTERS FLOW CHART AND ALGORITHM
- 1. ALGORITHM 1. What is a computer ? Ans: Computer is an electronic device. It accepts data as input, process the data and displays the result as output. 2. What is Data? Ans: Data includes facts, figures , symbols and letters . Which we give from the keyboard 3. What is an algorithm? Ans: An algorithm is a well defined set of steps followed in a sequence provide of specific problem. 4. What are the Characters of an algorithm? Ans: 1. An algorithm should have zero or more input 2. An algorithm should exhibit atleast one output 3. An algorithm should be finite means if executed it should be finished in finite number of steps. 4. An algorithm should be defined clearly 5. An algorithm should be basic and easy to perform. 5. What is the use of an algorithm Ans: An algorithm can be used in many ways it can be used in natural language like english or graphical tool flow chart but they work well only if the algorithm is small and simple. Examples: Example1: Adding of two numbers Step1: Start Step2: Take two values a,b Step3: Add a+b Step4: Store the value in c Step5: print c Step6: end
- 2. Example2: Subtraction of two numbers Step1: Start Step2: Take two values a,b Step 3: Subtract a-b Step4: Store the value in c Step5: print c Step6: End Example3: Adding of three numbers Step1: Start Step2: Take three values a,b,C Step 3: Add a+b+c Step4: Store the value in D Step5: print D Step6: End Example4: Find the greatest number between two numbers Step1: Start Step2: Take two values a,b Step 3: a>b Step4: a is the greatest number Step5: print a Step6: Else Step7: b is greatest number Step8: Print b step9:end Example5: Find the greatest number among three numbers Step1: Start Step2: Take three values a,b and c Step3: a>c, a>b Step4: a is the greatest number Step5: Print a
- 3. Step 6: Else Step7: b>a,b>c Step8: b is the greatest number Step9:print b Step 10: else Step11: c>a, c>b Step12: c is the greatest number Step13: print c Step14: End Example 6: Find the area of rectangle Step1: Start Step2: Take two values l,b Step3: Multiply lxb Step4: Store value ‘a’ Step5: Print ‘a’ Step6: End Example 7: Find the circumference of circle Step1: Start Step2: Take three values 2 , π, r Step3: Multiply 2X II XR Step4: Store the value c Step5: Print c Step6: End Example 8: Find the area of triangle Step1: Start Step2: Take two values b , h Step3: Multiply 1/2xbxh Step4: Store the value ‘a’ Step5: print a Step6: end
- 4. FLOW CHART 1. Define Flow chart? Ans:A graphical toolfor representing the defined solution of a problem .It uses different symbols to represent different terminology. 2. What is the use of terminal symbol in flow chart Ans: It is first and last symbol in the flowchart. It is a symbol used to indicate starting and ending of a program flow ,indicated with oval shape
- 5. 3. What is the use of Input/Output symbol in flowchart Ans: I/O symbol used to denote input/ output function of any input/output devices. It indicated with parallelogram symbol 4.What is the use of process symbol in flowchart? Ans: It is used to process the given data, which indicated rectangle shape 5. What is the use of decision symbol in flowchart? Ans: The diamond symbol used for decision making operations like <,> < =, > =, AND ,OR ,NOT etc 6. What is the use of Flow direction symbol in flowchart Ans: Arrow symbols indicates the flow of the entire program 7. What is the use of connector symbol in flow chart Ans: Circle is used to represent the link between parts of flowchart, if flowchart is large and unfit in a single page. Example1: Draw a flowchart for adding two numbers
- 6. Example2: Draw a flowchart for finding the largest between two numbers Example3: Draw a flowchart for finding the greatest among three numbers