Prof. B. I. Khodanpur HOD – Dept. of CSE R. V. College of Engineering

Slides:



Advertisements
Similar presentations
CS 240 Computer Programming 1
Advertisements

Algorithms An algorithm is a finite sequence of instructions, logic, an explicit step-by-step procedure for solving a problem. Specific algorithms sometimes.
Flowcharts Amir Haider Lecturer NFC IEFR. Introduction The flowchart is a means of visually presenting the flow of data through an information processing.
Chapter 1 - An Introduction to Computers and Problem Solving
Chapter 2 - Problem Solving
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
Reference :Understanding Computers
Chapter 2 - Problem Solving
CS 240 Computer Programming 1
Flowchart TA. Maram Al-Khayyal.
Flowcharts.
ITEC113 Algorithms and Programming Techniques
Prof. B. I. Khodanpur HOD – Dept. of CSE R. V. College of Engineering
Chapter 2- Visual Basic Schneider
Engineering H192 - Computer Programming The Ohio State University Gateway Engineering Education Coalition Lect 3P. 1Winter Quarter Structured Engineering.
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
The Program Design Phases
Review Algorithm Analysis Problem Solving Space Complexity
PRE-PROGRAMMING PHASE
Engineering H192 - Computer Programming The Ohio State University Gateway Engineering Education Coalition Lect 3P. 1Winter Quarter Structured Engineering.
ALGORITHMS AND FLOW CHARTS 1 Adapted from the slides Prepared by Department of Preparatory year Prepared by: lec. Ghader Kurdi.
Programming Logic and System Analysis
Prof. B. I. Khodanpur HOD – Dept. of CSE R. V. College of Engineering
Algorithm & Flowchart.
Fundamentals of C programming
Systems Analysis – Analyzing Requirements.  Analyzing requirement stage identifies user information needs and new systems requirements  IS dev team.
PROGRAMMING LANGUAGES Prof. Lani Cantonjos. PROGRAM - set of step-by-step instructions that tells or directs the computer what to do. PROGRAMMING LANGUAGE.
Software Life Cycle What Requirements Gathering, Problem definition
Chapter 2 Problem Solving On A Computer 2.1 Problem Solving Steps Solving a problem on a computer requires steps similar to those followed when solving.
Problem Solving Techniques. Compiler n Is a computer program whose purpose is to take a description of a desired program coded in a programming language.
INTRODUCTION TO COMPUTING CHAPTER NO. 04. Programming Languages Program Algorithms and Pseudo Code Properties and Advantages of Algorithms Flowchart (Symbols.
Algorithms & Flowchart
Chapter 2: General Problem Solving Concepts
Basic problem solving CSC 111.
PROGRAM DEVELOPMENT CYCLE. Problem Statement: Problem Statement help diagnose the situation so that your focus is on the problem, helpful tools at this.
Engineering H192 - Computer Programming Gateway Engineering Education Coalition Lect 3P. 1Winter Quarter Structured Engineering Problem Solving and Logic.
Chapter 2 - VB 2005 by Schneider- modified by S. Jane '081 Chapter 2 - Problem Solving 2.1 Program Development Cycle 2.2 Programming Tools.
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
ALGORITHMS AND FLOWCHARTS. Why Algorithm is needed? 2 Computer Program ? Set of instructions to perform some specific task Is Program itself a Software.
PROGRAMMING FUNDAMENTALS INTRODUCTION TO PROGRAMMING. Computer Programming Concepts. Flowchart. Structured Programming Design. Implementation Documentation.
Program Program is a collection of instructions that will perform some task.
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
Victoria Ibarra Mat:  Generally, Computer hardware is divided into four main functional areas. These are:  Input devices Input devices  Output.
 Problem Analysis  Coding  Debugging  Testing.
Algorithms and Flowcharts
Pseudocode (pronounced SOO-doh-kohd)  is a detailed yet readable description of what a computer program or algorithm must do, expressed in a formally-styled.
Chapter One Problem Solving
Programming Languages
Chapter One Problem Solving
Flowcharting Guidelines
Presentation of Flowchart
Chapter 2- Visual Basic Schneider
ALGORITHMS AND FLOWCHARTS
Algorithms An algorithm is a sequence of steps written in the form of English phrases that specific the tasks that are performed while solving the problem.It.
Lecture 2 Introduction to Programming
Algorithm Algorithm is a step-by-step procedure or formula or set of instruction for solving a problem Its written in English language or natural language.
Introduction to Computer Programming
Unit# 9: Computer Program Development
Computer Programming LAB 1 Tejalal Choudhary Asst. Prof, CSE Dept.
Structured Program
Computers & Programming Languages
Chapter 2- Visual Basic Schneider
Introduction to Algorithms and Programming
CSC128 FUNDAMENTALS OF COMPUTER PROBLEM SOLVING
Chapter 2- Visual Basic Schneider
ME 142 Engineering Computation I
Lecture 7 Algorithm Design & Implementation. All problems can be solved by employing any one of the following building blocks or their combinations 1.
Basic Concepts of Algorithm
Prof. B. I. Khodanpur HOD – Dept. of CSE R. V. College of Engineering
Presentation transcript:

Prof. B. I. Khodanpur HOD – Dept. of CSE R. V. College of Engineering Prof. B. I. Khodanpur HOD – Dept. of CSE R. V. College of Engineering. EmailID:  bi.khodanpur@gmail.com Subject: Computer Fundamentals (For EDUSAT) Common Paper for BA / B.Com / B.Sc Code: CS-54

Types of OS: Single User Systems Multi User Systems Operating System can also be classified as,- Single User Systems Multi User Systems

Single User Systems: Provides a platform for only one user at a time. They are popularly associated with Desk Top operating system which run on standalone systems where no user accounts are required. Example: DOS

Multi-User Systems: Provides regulated access for a number of users by maintaining a database of known users. Refers to computer systems that support two or more simultaneous users. Another term for multi-user is time sharing. Ex: All mainframes and  are multi-user systems. Example: Unix

Contents Today's Topic: Problem Solving Techniques We will learn Problem Statement. Algorithm Types, Example Flowchart Symbols, Examples.

Problem Solving Techniques

Problem Statement: Problem Statement help diagnose the situation so that your focus is on the problem, helpful tools at this stage include Algorithms and flowcharts for identifying the expected steps of a process. Therefore to solve any problem, Collect and analyze information and data Talk with people familiar with the problem If at all possible, view the problem first hand Confirm all findings

Algorithm: The algorithm is part of the blueprint or plan for the computer program, an algorithm is: “An effective procedure for solving a class of problems in a finite number of steps.” Every algorithm should have the following 5 characteristic feature: Input Output Definiteness Effectiveness Termination

Algorithm (Contd…): To find largest of three numbers Start Read 3 numbers: num1, num2, num3 if num1 > num2 then go to step 5 if num2 > num3 then print num2 is largest else print num3 is largest goto step 6 if num1 > num3 then print num1 is largest end.

Algorithm (Contd…): Example: One of the simplest algorithms is to find the largest number in an (unsorted) list of numbers. High-level description: Assume the first item is largest. Look at each of the remaining items in the list and if it is larger than the largest item so far, make a note of it. The last noted item is the largest in the list when the process is complete.

Algorithm (Contd…): Formal description: Written in prose but much closer to the high-level language of a computer program, the following is the more formal coding of the algorithm in pseudo code (find the largest number in an (unsorted) list of numbers) Algorithm LargestNumber Input: A non-empty list of numbers L. Output: The largest number in the list L. largest ← L0 for each item in the list L, do if the item > largest, then largest ← the item return largest

Flowchart: What is a Flowchart? The flowchart is a means of visually presenting the flow of control through an information processing systems, the operations performed within the system and the sequence in which they are performed. It is a graphic representation of how a process works, showing, at a minimum, the sequence of steps. Flowcharts are generally drawn in the early stages of formulating computer solutions.

Flowchart (Contd…): Guideline for drawing a flowchart: Flowcharts are usually drawn using some standard symbols; Some standard symbols, which are frequently required for flowcharting many computer programs are shown below,-

Flowchart (Contd…): A set of useful standard Flowchart symbols: Rounded box use it to represent an event which occurs automatically. Rectangle or box use it to represent an event which is controlled within the process. Typically this will be a step or action which is taken. Diamond use it to represent a decision point in the process. Circle use it to represent a point at which the flowchart connects with another process.

ADVANTAGES OF USING FLOWCHARTS: Communication: Flowcharts are better way of communicating the logic of a system Effective analysis: Problem can be analyzed in more effective way. Proper documentation: Flowcharts serve as a good program documentation Efficient Coding: Flowcharts act as a guide or blueprint during the systems analysis and program development phase.

ADVANTAGES OF USING FLOWCHARTS (Contd…): Proper Debugging: Flowchart helps in debugging process. Efficient Program Maintenance: The maintenance of operating program becomes easy with the help of flowchart.

Flow chart of the while loop :

Flow chart of the for loop:

The flow chart of the if statement:

The flow chart of the if…else statement:

The flow chart of the switch statement:

Flowchart for finding the sum of first five natural numbers ( i. e

Flowchart (Example): Flowchart to find the sum of first 50 natural numbers.

Flow Chart to find largest of two numbers: Start Read A, B Is A > B Yes No Print B Print A End

Flowchart to find the largest of three numbers A,B, and C: NO

LIMITATIONS OF USING FLOWCHARTS: Complex logic: Sometimes, the program logic is quite complicated. In that case, flowchart becomes complex and clumsy. Alterations and Modifications: If alterations are required the flowchart may require re-drawing completely. Reproduction: As the flowchart symbols cannot be typed, reproduction of flowchart becomes a problem.

Flowchart (Exercise): Draw a flowchart to depict all steps that you do reach your college. Draw Flowchart for Linear search.