Skip to main content

Memory in computer (primary, secondary and cache memory)-computer world

 Memory : A memory just like a human brain.It is used to store data and instructions. Computer memory is the storage space in the computer, where data is to be processed and instruction  required processing are stored. Computer memory is classified into following types :

1. Cache memory : Cache memory is a very high speed semiconductor memory which can speed up the CPU. It act as buffer(small storage are ) Between the CPU and main memory. We can say that it is a high speed memory between CPU and RAM and it is used temporary store very active data and instruction during processing. 

2. Primary memory : Primary holds only that data and instruction on which the computer is currently working. Data holds by primary memory is lost when power is switched of. Primary is not fast as resisters.

Primary is divided into two subcategory's :

1. RAM(Random access memory) : Random access memory is a form of computer memory that can be read and change in any any order typically used to store working data and machine code.

2. ROM(Read only memory) : the memory from which we can only read but can not write on it this type of memory is non-volatile. Then information is stored permanently in such memory during manufacture. A ROM stores such information that are required to start a computer .Rom chip are not only used in computer but also in other electronic items washing machine, microwave oven storing data permanently into this this kind of memory is called "burning the data" because in such memory is stored by using fuse link.    

3. Secondary memory : Secondary memory store large amount of data permanently and this type of memory is also known as external memory or non volatile memory. The con taint of secondary memory are first transferred to the main memory and then the CPU can access it secondary storage memory divided into following types :

1. Sequential access memory : In-formations on a sequential access device can be retrieved in the same sequence only in which it is store.  

2. Direct access memory : Direct access memory is also known as random access device because out of all the information stored, any randomly piece of information can be accessed immediately.  

       

1  Database system vs file system

2 Nested relation

3 what is computer worm-computer world

4  What is google Search Engine

5 Logical database model and  Relational database management system

6 Definition of computer cables and types of cables

7 Register and type of register in computer Architecture

8 What is buffering

9 Definition of computer ports and types of ports

10 what is computer and what is the meaning of computer

11 Definition of computer cables and types of cables

12 Difference between Linux and Unix-computer world

13 Demand paging-oocomputer world

14  What is CSS-computer world

15 What is internet-computer world

16 Round-Robin Scheduling in operating system-computer  world

 17 Aggregation and Functional dependency in DBMS

18  Distributed transaction model

Labels:

Comments

Post a Comment

Popular posts from this blog

Deadlock in operating system-computer world

  Deadlock in operating system-computer world Deadlock :  In a multi-programming environment, many process may complete for a minute number of resources. A process make a request for a resource and if the resource is not available at that time, the process enter In a waiting state. A waiting state process is never again-able to change state because the resource it has requested is held by other waiting process. This situation is called deadlock. So we can say that a process is said to be deadlock when it is waiting for an event or resources which will never occurs.   so we can say that in this situation none of the process gets executed  since the resource it needs, is held by some other process which is also waits for some other resource to be released.  Let's assume that there are three process P1, P2, p3 and three different resources R1, R2 and R3. R1 is assigned to p1, R2 is assigned to P2 and R3 is assigned to P3.   After sometime P1 demands for R1 which is being used by  P2.
9 comments
Read more

CPU scheduling in operating system-computer world

  CPU scheduling in operating system CPU scheduling :  Whenever the CPU becomes idle, the operating system must select one of the processes. The selection process is carried by the short-term scheduler. The scheduler selects a process from the processes in memory that that are ready to execute and allocate the CPU to that process. The objective of time sharing is to skip the CPU among processes that user interact with each program while the program is in running position. As we discuss above the process scheduler selects an process for execution on the CPU. There will never more then one running process for a single processor system. If there are many processes, the process will have to wait until the CPU is free CPU Scheduling is basis of multi-programming operating system. In CPU scheduling many processes are kept in memory at a time. The CPU scheduler select a process from the many processes. The process scheduler scheduled different processes to be assigned to the CPU based on part
3 comments
Read more

Single partition allocation, Multiple-partition allocation and Fixed Equal-size partitions in operating system-computer world

  Single partition allocation, Multiple-partition allocation and Fixed Equal-size partitions in operating system Single partition allocation In this scheme operating system is residing in law memory and user process are executing in higher memory. Advantages It is simple  It is easy to understand and use Disadvantages User job is limited to the size of available memory. It leads to poor Utilization of processor and memory. Multiple-partition allocation  It is the simplest method for allocating  memory is divided memory into several fixed size partitions. Fixed Equal-size partitions It divides the main memory Into equal number of fixed sized partitions, operating system occupies some fixed portion and remaining portion of main memory is available for user processes. Advantages It supports multi programming. A process whose size is less then or equal to the partitions size can be loaded into any available partition. Disadvantages If a program is big to fit into a partition use overlay te
Post a Comment
Read more