Browse

A computer is basically a programmable machine capable to perform arithmetic and logical operations automatically and sequentially. It is also known as a data processor, as it can store, process, and retrieve data as per the wish of the user.

Data processing involves the following three activities −

Input of data
Manipulation/processing of data
Giving output (i.e. management of output result)
In computer system, data is arranged orderly and systematically.

The term “computer” is derived from a Latin term “compute,” which means ‘to calculate.’ Initially, the computer system had been designed to calculate; it was intended to be a computing device. However, over a period of time, this device technically advanced; at present, it can perform a wide range of desirable works apart from data processing.
Major Functions of Computer System
Following are the core functions of a computer system −


A computer accepts the command and/or data as input given by the user.


A computer follows the instructions and stores the data given by the user.


A computer processes the data as per the instructions given by the user.


A computer gives the desirable results in the form of output.


Salient Features of Computer System
Following are the salient features of a Computer System −


Automation − The operating system of a computer system is automatic, as no human intervention is required; simply you need to give the command and then it will do the work automatically.


Speed − Depending upon the power of the computer, it can perform, it can take Millions of instructions per second.


Storage − A computer system can store enormous quantity of data in different format. The storage capacity of a computer system is normally expressed in terms of Kilobytes (KB), Megabytes (MB), Gigabytes (GB), or Terabytes (TB).


Accuracy − The accuracy of a computer system is very high.


Versatility − A computer system is capable of performing a wide range of tasks.


Diligence − A computer neither get tired nor lose concentration.


Reliability − As a computer system always gives accurate result; therefore, its reliability is very high.


Vast memory − A computer system can have a wide range of memory which can recall the desired data at any point of time.


Evolution of Computer System
The present Computer System has evolved after centuries of efforts from different intellectuals who contributed their works during different periods of time.
Abacus is (most likely) considered as the earlier counting device.
Let us now read about the innovators who contributed immensely in the development of a computer system.
John Napier
Napier was a Scottish mathematician who invented logarithms.
Further, Napier also invented a computing device, which consisted of sticks with numbers imprinted on them. Napier named sticks ‘bones,’ as they were made up of bones.
Blaise Pascal
Pascal was a French mathematician who invented a machine based on gear wheels, which helped greatly in calculation.
Charles Babbage
Babbage was an English Polymath, Mathematician, Mechanical Engineer, Philosopher, and Inventor. In 1822, he developed a machine capable to calculate the successive difference of expression and prepared a table which helped him in his calculations.
Lady Ada Lovelace
Lovelace was an English mathematician, who researched on Babbage’s work. She has given the concept that ‘computers can be programmed’. Her work helped a great deal in the advancement of computer system.
John Atanstoff
With the assistance of Berry, John Atanstoff developed the Atanstoff Berry Computer (more popular as ABC) in 1937. It marked the beginning of the development of electronic digital computer.
John Mauchly and Eckart
In 1947, John Mauchly and Eckart developed the first large scale Electronic Digital Computer. It was called the Electronic Numerical Integrator and Calculator (ENIAC).
Maurice V. Wilkes
In 1949, Wilkes (at Cambridge University) designed Electronic Delay Storage Automatic Calculator (EDSAC). It was the first computer that started its operating system on the stored program concept.



 

Technology integration is the use of technology tools in general content areas in education in order to allow students to apply computer and technology skills to learning and problem-solving.
Creates more engaged and successful teachers.
Using technologies like virtual lesson plans and internet resources can help free up time — both in developing and delivering the curriculum. This allows teachers to spend more time with the students who are struggling, ensuring the whole class is better prepared for tests and advancement.
As an educator, integrating technology into the curriculum is key. In other words, don’t just add a piece of technology to a lesson plan just because you can. Make sure you understand:

How to use the technology
How to train students on using the technology
How the technology supports your curriculum
What benefits the technology brings to your lesson

An easy way to introduce technology is to start small.

A data structure is a specialized format for organizing, processing, retrieving and storing data. There are several basic and advanced types of data structures, all designed to arrange data to suit a specific purpose. Data structures make it easy for users to access and work with the data they need in appropriate ways. Most importantly, data structures frame the organization of information so that machines and humans can better understand it.
In computer science and computer programming, a data structure may be selected or designed to store data for the purpose of using it with various algorithms. In some cases, the algorithm's basic operations are tightly coupled to the data structure's design. Each data structure contains information about the data values, relationships between the data and -- in some cases -- functions that can be applied to the data.
For instance, in an object-oriented programming language, the data structure and its associated methods are bound together as part of a class definition. In non-object-oriented languages, there may be functions defined to work with the data structure, but they are not technically part of the data structure.

Why are data structures important?
Typical base data types, such as integers or floating-point values, that are available in most computer programming languages are generally insufficient to capture the logical intent for data processing and use. Yet applications that ingest, manipulate and produce information must understand how data should be organized to simplify processing. Data structures bring together the data elements in a logical way and facilitate the effective use, persistence and sharing of data. They provide a formal model that describes the way the data elements are organized.
Data structures are the building blocks for more sophisticated applications. They are designed by composing data elements into a logical unit representing an abstract data type that has relevance to the algorithm or application. An example of an abstract data type is a "customer name" that is composed of the character strings for "first name," "middle name" and "last name."
It is not only important to use data structures, but it is also important to choose the proper data structure for each task. Choosing an ill-suited data structure could result in slow runtimes or unresponsive code. Five factors to consider when picking a data structure include the following:

What kind of information will be stored?
How will that information be used?
Where should data persist, or be kept, after it is created?
What is the best way to organize the data?
What aspects of memory and storage reservation management should be considered?




How are data structures used?
In general, data structures are used to implement the physical forms of abstract data types. Data structures are a crucial part of designing efficient software. They also play a critical role in algorithm design and how those algorithms are used within computer programs.
Early programming languages -- such as Fortran, C and C++ -- enabled programmers to define their own data structures. Today, many programming languages include an extensive collection of built-in data structures to organize code and information. For example, Python lists and dictionaries, and JavaScript arrays and objects are common coding structures used for storing and retrieving information.
Software engineers use algorithms that are tightly coupled with the data structures -- such as lists, queues and mappings from one set of values to another. This approach can be fused in a variety of applications, including managing collections of records in a relational database and creating an index of those records using a data structure called a binary tree.