Lecture Unit 1

CSEG1003 Programming for Problem Solving
CSEG1003 Programming for Problem

Solving
CSEG 1003
Programming for
Problem Solving
Instructor
Dhiviya Rose J . Asst. Prof. Senior Scale
School of Computer Science and Engineering | UPES
Road Map
• Generations of Computers and Languages
•
Introduction •
•
Organization of Computers
Number Systems Conversion
Logical Analysis and Thinking
• Structure of C Program & Compilation and Linking Process

C Programming • Variables and Datatypes
• Managing Input and Output statements
Basics • Decision and Looping Statements
• Creation and Usages

Arrays and • 1D and 2 D arrys
• String Functions
Strings • Matrix operations
• Declaration and Definitions of Functions

Functions and • Passing Arguments
• Recursion
Pointers • Pointers & Pointer Arithmetic
• Need of Structure and Unions

Structures and • Declaration and Definition
• Storage classes
Unions • Preprocessor Directives
Solving
LECTURE #1
EVOLUTION ,GENERATION OF COMPUTERS &
CLASSIFICATION OF COMPUTERS
Instructor
History
• Abacus
• Sliding Beads on a rack
• Counting purpose
• Operators on addition and subtraction
• 300 B.C.
• Napier Bones
• Logarithmic value carved on ivory sticks
• Scotsman ->John Napier
• 1617
Abacus – Addition and Subtraction

Napier’s Bones - Multiplication

Steps……..Inventions
• Pascaline Machine
• Functional Automatic Calculator
• French Mathematician
• Blaise Pascal
• 1642
• gear-driven calculating machine
• Eight movable dials
Gear Engine
• Leibniz's Stepped Reckoner

• 1694
• German Mathemacian
• addition, subtraction, multiplication, and division
• Jacquard Powerloom
• 1801
• weave automatically
• read from punched wooden cards
Leibniz's Stepped Reckoned

• Jacquard Powerloom
• 1801
• weave automatically
• Programs punched in cards
• read from punched wooden cards
Jacquards Loom
Practical Jacquards Loom

Sample Punch card

• Differential Engine
• Charles Babbage – Father of Computers
• English Mathematician
• 1822
• First Computer
• Basic calc+ Log + Differential equation
• Steam Driven machine
• Single Stored program in Memory
• Memory + Central Processing Unit
• Punch Cards as memory
• Analytical Engine
• Charles Babbage
• 1833
• Fully functional
• differential engine
• Contains
• Input device as cards
• Control unit
• Output device
Steps…Inventions
• Hollerith Tabulator
• Herman Hollerith
• 1889
• U.S Census Bureau
• Official Purpose
• Punch cards
• store data
• Used Electricity
• Later IBM
• Mainframe+OS
• OS/2 -> OS with
windows
Memory Tapes
MainFrame Computers – 1955 - US

• Mark 1
• 1944
• IBM + Harvard Aiken
• Replaces the mechanical component
• Relays
• Electro magnetic component
• ENIAC
• 1946
• John Eckert and John Mauchly
• Electronic Numerical Integrator And Calculator
• Electronic Vaccum Tubes
• EDVAC
• Electronic Discrete Variable Automatic Computer
• Capability to stop and resume
• EDSAC
• Electronic Delay Storage Automatic Calculator
• 1949
• Maurice Wilkes
• Mercury delay lines – memory
• Vacuum tubes --- logic
• UNIVAC
• Universal Automatic Compute
• 1951
• Beginning of computer era
• 1970
• Integrated Circuits
• Replaces vaccum tubes
• 1980
• Very Large Scale Integration (VLSI)
Mini Comp. ---Apple1 -- $600 ---1976

IBM PC ---- 1990

Apple II
Solving
GENERATION OF
COMPUTERS
First Generation
• 1940 – 1956
• Vaccum Tubes
• Machine Language
• Specification
• Vacuum tubes -> circuitry
• Magnetic drums -> memory
• Input ->punched cards and paper tape
• Output ->printouts
• Examples
• UNIVAC -U.S. Census Bureau in 1951
• ENIAC computers
• Disadvantage
• Expensive
• Huge conception of electricity
• Big & Clumsy
• Air conditioning Necessary
• Non portable
Second Generation
• 1956 - 1963
• Transistor
• used to relay and switch electronic signals
• Assembly language
• Specification
• punched cards for input
• printouts for output
• Transistor for circuits
• magnetic core technology for memory
• Computers smaller, faster, cheaper, portable and
more energy-efficient and need air conditioning.
Third Generations
• 1964 – 1970
• Integrated Circuits
• Transistors were miniaturized and placed on silicon chips called
semiconductors
• High Level Language
• Specifications
• Keyboard as input
• Monitor as output
• Operating System
• Central program that controls the devices
• Advantages
• Speed
• Efficiency
• Portable
• Cheap
• Less power
Fourth Generation
• 1970 – Present
• Data Communication
• Microprocessors
• thousands of integrated circuits were built onto a single silicon chip
• Properties
• Instruction set
• Bandwidth
• Clock Speed
• Example
• Intel 4004 chip – minuscule chip(cpu+ memory+ i/p+ o/p unit)
• 1984 Apple introduced the Macintosh
• Specification
• Microprocessor
• Mouse and other handheld devices
• CPU and ALU
• RAID – Redundant array of Independent Disk for memory
Fifth Generation
• Present and Beyond
• Artificial Intelligence
• Game Playing
• Expert System
• Robotics
• Mega chips
• Parallel processing
• Voice Recognition
• Example
• No fully AI computers
• 1997, an IBM super-computer called Deep Blue defeated world
chess champion Gary Kasparov in a chess
Solving
CLASSIFICATION OF
COMPUTERS
Classification of Computers
Types of Computers
On the basis of On the basis of Size &

On the basis of Technology
Purpose Capacity
Special
Purpose Analog Super
General
Purpose Digital Main Frame
Hybrid Mini
Micro
Super Computers
Main Frame Computer

Mini Computers
Micro Computers
Generation of Programming Languages

Next Lecture #2…….Online Lecture

• Organization of Computers
• Hardware
• Input Unit
• Output Unit
• Storage Unit
• Processing Unit
• Software
• System Software
• Application Software
Solving
LECTURE #3
NUMBER SYSTEM CONVERSION PROBLEMS
Instructor
Why number system conversion problems

• For digital hardware, the natural numbering system is
binary (base 2).
• Expressing anything in binary causes way too many bits
to be used
• hexadecimal allows us to use 4x fewer bits, so, it is very
useful.
Two Major classifications
• Non positional Number System

• Roman Numbering (………I,II,III,IV……..)
• Collection of symbols
• Counting the figures
• Difficult with large numbers
• Positional Number System
• Uses digits instead of symbols
• Digits positions are accounted
• 3 terminology
• Digit (set of symbols)
• Position of digit (LSB, MSB, unit, tens, hundred…)
• Base or radix(total no of digits)
Decimal Number System
• Base 10
• Valid digits - 0, 1, 2, 3, 4, 5, 6, 7, 8, 9
• Position
• unit
• ten
• hundred
• thousand
Binary Number System
• Base 2
• Valid digits - 0, 1
• Position
• least significant bit(LSB)
• most significant bit(MSB)
Octal Number System

• Base 8
• Valid digits - 0, 1, 2, 3, 4, 5, 6, 7
• Position
• least significant bit(LSB)
• most significant bit(MSB)
HexaDecimal Number System

• Base 16
• valid digits - 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F
• A refers to decimal 10, B refers to decimal 11, etc.
• Fig. The list of digits in each Number System

Decimal to < Binary|Octal|HexaDecimal >

Contd.
Contd.
< Binary|Octal|HexaDecimal > to Decimal

Some more conversions

Activity
Binary Decimal Octal HexaDecimal
6E7
92
12A
1010100101
745
679
1010101000
320
Lecture #4 Online Lecture

• Problem Solving Techniques
• Need for Logical Thinking and Design
• Algorithm
• Flowchart
• Psedocode
Solving
LECTURE #5
PROBLEM SOLVING TECHNIQUES &
LOGICAL ANALYSIS AND THINKING
Instructor
How to solve a problem?
• Programming is a problem-solving activity.
• Problem-solving methods are covered in many subject

areas:
• Business students learn to solve problems with a systems approach
• Engineering and Science students use the engineering and science

methods
• Programmers use the Software Development Method

Software Development Method

Analysis & Design Plan It
Pre Programming Steps
algorithm flowchart pseudocode
Check it
Modify the solution if necessary
Coding -------Write Program with some Programming Language

C C++ Java ….
Execute & Test

Finally, the program is tested to verify that it behaves as intended.
Introduction to Algorithms
• The algorithm is the abstract idea of solving a problem.
• The algorithm is written in user language

Algorithms vs. programs

• When an algorithm is coded using any programming
language (e.g. C++), then it is called a program.
• The program is a set of instructions that can run by the

computer.
• The algorithm would consist of at least the

following tasks:
1- Input (Read the data)

2- Processing (Perform the computation)
3- Output (Display the results)
Example 1
• Write a algorithm to find an area of a circle where area = pi
* radius * radius
Data Processing Output

radius area = 3.14 x radius x radius area

Flowchart
• It is another way to display the algorithm.
• Diagram representation –
• special geometric symbols connected by lines and contain

the instructions.
Flowchart Symbols
Symbol Function
Show the direction of data flow or logical
solution.
Indicate the beginning and ending of a set of

actions or instructions (logical flow) of a module
or program.
Indicate a process, such as calculations,

opening and closing files.

Indicate input to the program and output from the
program.
Use for making decision. Either True or False based

on certain condition.
Use for doing a repetition or looping of certain steps.
Connection of flowchart on the same page.
Connection of flowchart from page to page.

Structuring a Program
• Develop efficient computer solution to problems:
1. Use Modules
2. Use four logic structures
a. Sequential structure
• Executes instructions one after another in a sequence.
b. Decision structure
• Branches to execute one of two possible sets of instructions.
c. Loop structure
• Executes set of instruction many times.
d. Case structure
• Executes one set of instructions out of several sets.
3. Eliminate rewriting of identical process by using modules.
4. Use techniques to improve readability including four logic
structure, proper naming of variables, internal documentation
and proper indentation.
Sequential Logic Structure

The Decision Logic Structure

• Implements using the IF/THEN/ELSE instruction.
• Tells the computer that IF a condition is true, THEN
execute a set of instructions, or ELSE execute another set
of instructions
• ELSE part is optional, as there is not always a set of
instructions if the conditions are false.
• Algorithm:
IF <condition(s)> THEN
<TRUE instruction(s)>
ELSE
<FALSE instruction(s)
Decision Logic Structure

Example:1
The Loop Logic Structure

• Repeat structure
• To solve the problem that doing the same task over and
over for different sets of data
• Important Concern – Counter Management
• Counter Initialization (eg. i=0)
• Counter Increment / Decrement (eg. i++,i--)
• Counter Condition Check (eg. i<5)
• Types of loop:
• WHILE loop
• Do..WHILE loop
• Automatic-Counter Loop
Types of Loop – Pre and Post Condition

Check
One Minute Drill
1.Find the counter

variable
2. Find the counter
increment
3. Find out the
counter condition
4.Find the loop
statement
5. Guess the output
Example : Print Hello 5 times
• Case 1: i=0, ?????
• Case 2: i=10 ?????

The Case Logic Structure

• Made up of several or many sets of instructions, only one
of which will be selected by the user and executed by the
computer
• Algorithm:
CASE OF VARIABLE
= constant1:
actions for VARIABLE = constant1
= constants2:
actions for VARIABLE = constant2
…
OTHERWISE:
Actions for VARIABLE = anything else
END-OF-CASE
Case Logic Structure

Pseudocode
• Pseudocode means an imitation computer code.
• Pseudocode is close to the actual programming
language.
• Using the Pseudocode, the programmer can start
to write the actual code.
• Psedocode Programming Constructs includes
• READ, PRINT, SET , INITIALIZE
• INCREMENT,DECREMENT,
• IF…THEN….ENDIF,IF….THEN….ELSE….ENDIF,
• REPEAT ….UNTILL, DO…WHILE
Example 2 : Sum of 5 numbers

Practice Activities
• Given 2 numbers. Calculate sum, difference, multiplication
and division.
• Finding the Area of Rectangle
• Finding the biggest of 3 numbers
• Finding the simple interest for the given P, T, R values.
• To swap two numbers
• Find whether a given number is even or odd.
• Check if the given number is divisible by 2 and 3 or not.
• Check whether a given character is an alphabet, digit or
special character.
Example: Biggest of 3 numbers


Lecture Unit 1

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Lecture Unit 1

Caricato da

Copyright:

Formati disponibili

CSEG1003 Programming for Problem Solving

CSEG1003 Programming for Problem

• Structure of C Program & Compilation and Linking Process

• Creation and Usages

• Declaration and Definitions of Functions

• Need of Structure and Unions

Abacus – Addition and Subtraction

Napier’s Bones - Multiplication

• Leibniz's Stepped Reckoner

Leibniz's Stepped Reckoned

Practical Jacquards Loom

Sample Punch card

MainFrame Computers – 1955 - US

Mini Comp. ---Apple1 -- $600 ---1976

IBM PC ---- 1990

On the basis of On the basis of Size &

Main Frame Computer

Generation of Programming Languages

Next Lecture #2…….Online Lecture

Why number system conversion problems

Two Major classifications

• Non positional Number System

Decimal Number System

Binary Number System

Octal Number System

HexaDecimal Number System

• Fig. The list of digits in each Number System

Decimal to < Binary|Octal|HexaDecimal >

< Binary|Octal|HexaDecimal > to Decimal

Some more conversions

Lecture #4 Online Lecture

• Programming is a problem-solving activity.

• Problem-solving methods are covered in many subject

• Engineering and Science students use the engineering and science

• Programmers use the Software Development Method

Software Development Method

algorithm flowchart pseudocode

Modify the solution if necessary

Coding -------Write Program with some Programming Language

Execute & Test

• The algorithm is written in user language

Algorithms vs. programs

• The program is a set of instructions that can run by the

• The algorithm would consist of at least the

1- Input (Read the data)

Data Processing Output

CSEG1003 Programming for Problem Solving

• It is another way to display the algorithm.

• special geometric symbols connected by lines and contain

Indicate the beginning and ending of a set of

Indicate a process, such as calculations,

CSEG1003 Programming for Problem Solving

Use for making decision. Either True or False based

Use for doing a repetition or looping of certain steps.

Connection of flowchart on the same page.

Connection of flowchart from page to page.

CSEG1003 Programming for Problem Solving

Sequential Logic Structure

The Decision Logic Structure

Decision Logic Structure

The Loop Logic Structure

Types of Loop – Pre and Post Condition

One Minute Drill