Skip to main content

Computer Architecture lec-1 Introduction

Hi, today we are starting a very important subject of CS the (Computer Architecture) in this subject we'll going to know about:

* Structured Computer Organization
* Milestone in Computer Architecture
* Computer System Organization
* Processors 
* Primary Memory, Secondary Memory 
* The Digital logic Level
* The Micro Architecture Level 
* The Instruction Set Architecture Level
* The Operating System Machine Level
* The Assembly Language Level
* Parallel Computer Architectures
* Reading List And  Bibliography
And many more advanced topics of Computer Architecture.

Structured Computer Organization
A digital computer is an electronic machine that can solve problems for people by carrying
out instructions given to it. a sequence of instructions describing how to perform a certain task is called a program. the electronic circuits of each computer can recognize and directly execute a limited set of simple instructions into which all its programs must be converted before they can be executed. these basic instructions are rarely much more complicated than:

Add two numbers.

Check a number to see if it's zero.

Copy a piece of data from the one part of the computer’s memory to another.

Together, a computer's primitive instructions form a language in which people can communicate with the computer. Such a language is called a machine language. the people designing a new computer must decide what instructions to include in its machine language. usually they try to make the primitive instructions as simple as possible consistent with the computer's intended use and performance requirements, in order to reduce the complexity and cost of the electronics needed. Because most machine languages are so simple it is difficult for people to use them. this simple observation has over the course of time led to a way of structuring computers as a series of abstractions, each abstraction building on the one below it. in this way the complexity can be mastered and computer systems can
be designed in a systematic organized way. we call this approach structured
computer organization.

Note: read again and again until you properly understand it. 

Comments

Popular posts from this blog

Numerical Analysis lec-3 False Position Method

Hi, today we'll going to learn the second method of numerical analysis the False Position Method out of 40 methods FALSE POSITION METHOD False Position Method is an alternative method and is more efficient then bisection method, it is the oldest method for finding the real root of an equation F( X ) = 0 and is similar to the bisection method. Consider the equation F( X ) = 0 let [ X0 , X1 ] be two different values of X such that  F( X0 ) - F( X1 ) < 0. OR A simple modification of a secant method produces a method which is usually converges. the new method is called regula falsi (False Position) and also Linear interpolation . it needs two initial approximations X0 and X1 so that F( X0 ) F( X1 ) < 0 i.e the two functions must have the opposite signs. The Modified False Position Method In this method the F( X ) value of a stagnant end point is halved if that point has repeated twice or more. the end point that repeats its called a stagnant point, the excepti

Numerical Analysis lec-4 Newton Raphson method

Hi, Today we'll learn about  Newton-Raphson Method  " Newton's Method ". this method is for finding successively better approximate solutions to the roots of a function (real valued). so are you ready for this............you will. Newton's Method: The Newton's method is one of the most powerful and well known method used for finding a root of f(X) = 0 there are many ways to derive Newton-Raphson method . the simplest way to derive this formula is by using the first two terms in the Taylor series expansion of the form.  Instead of working with the chord joining points on the graph of y= f(X) as in bisection method and false position method s. Newton's method uses the tangent at one point on the graph of y= f(X) therefor it requires only one instead of two initial guesses. Suppose X is an initial guesses draw the tangent line at X= X0 and procedure it to meet the X - axis at X = X1 Newton's Method which shows in picture above. now from righ

Software Engineering lec-2 About Software Engineering!

Hi, today we'll going to learn about Software requirements, specifications, applications and lots of more let's start with software engineering definition. Software Engineering -Software engineering is an engineering discipline that is concerned with all aspects of   software production form the early stages of system specification through to maintaining   the system after it has gone into use. -The economies of all developed nations are dependent on software. -More and more systems are software controlled software engineering is concerned with   theories, methods and tools for professional software development. -Expenditure on software represents a significant fraction of GNP in all developed countries. - Engineering discipline:  Using appropriate theories and methods to solve problems bearing in mind organizational   and financial constraints. - All aspects of software productions:  Not just technical process of development also project management and the develop