Posts

WEB DESIGN ! WHAT IS WEB DESIGN AND ITS WORKING !

Image
What is Web Design? Web design refers to the design of websites that are displayed on the internet. It usually refers to the user experience aspects of website development rather than software development. Web design used to be focused on designing websites for desktop browsers; however, since the mid-2010s, design for mobile and tablet browsers has become ever-increasingly important. A web designer works on the appearance, layout, and, in some cases, content of a website. Appearance, for instance, relates to the colors, font, and images used. Layout refers to  how  information is structured and categorized. A good web design is easy to use, aesthetically pleasing, and suits the user group and brand of the website. Many webpages are designed with a focus on simplicity, so that no extraneous information and functionality that might distract or confuse users appears. As the keystone of a web designer’s output is a site that wins and fosters the trust of the target audience, removing as m

Carry look ahead adder in digital electronic

Image
Carry Look Ahead Adder- In  Ripple Carry Adder , each full adder has to wait for its carry-in from its previous stage full adder to start its operation which causes an unnecessary delay. Carry Look Ahead Adder is an improved version of the ripple carry adder which generates the carry-in of each full adder simultaneously without causing any delay. Logic Diagram for Carry Look Ahead Adder- Working of Carry Look Ahead Adder- The working of carry look ahead adder is based on the principle that the carry-in of any stage full adder is independent of the carry bits generated during intermediate stages and is only dependent of the following two parameters- Bits being added in the previous stages Carry provided in the beginning Since, the above two parameters are always known, the carry-in of any stage full adder can be evaluated at any instant of time. Thus, a full adder need not wait until its carry-in is generated by its previous stage full adder. Adv

Introduction to combinational circuit in digital electronic

Image
  Introduction to combinational circuit::- Combinational circuit is a circuit in which we combine the different gates in the circuit, for example encoder, decoder, multiplexer and demultiplexer. Some of the characteristics of combinational circuits are following − The output of combinational circuit at any instant of time, depends only on the levels present at input terminals. The combinational circuit do not use any memory. The previous state of input does not have any effect on the present state of the circuit. A combinational circuit can have an n number of inputs and m number of outputs. Block diagram We're going to elaborate few important combinational circuits as follows. Half Adder Half adder is a combinational logic circuit with two inputs and two outputs. The half adder circuit is designed to add two single bit binary number A and B. It is the basic building block for addition of two  single  bit numbers. This circuit has two outputs  carry and  sum

ALU organisation

Image
Arithmetic and Logic Unit (ALU): Arithmetic and Logic Unit is a like a calculator to a computer. ALU performs all arithmetic operations along with decision making functions. In modern CPU or Microprocessors, there can be more than one integrated ALU to speed up arithmetical and logical operations, such as; integer unit, floating point unit etc. Organization of ALU: Various circuits are required to process data or perform arithmetical operations which are connected to microprocessor's ALU. Accumulator and Data Buffer stores data temporarily. These data are processed as per control instructions to solve problems. Such problems are addition, multiplication etc. Functions of ALU: Functions of ALU or Arithmetic & Logic Unit can be categorized into following 3 categories 1. Arithmetic Operations: Additions, multiplications etc. are example of arithmetic operations. Finding greater than or smaller than or equality between two numbers by using subtraction  is

Introduction to cache memory

Image
Cache Memory in Computer Organization Cache Memory  is a special very high-speed memory. It is used to speed up and synchronizing with high-speed CPU. Cache memory is costlier than main memory or disk memory but economical than CPU registers. Cache memory is an extremely fast memory type that acts as a buffer between RAM and the CPU. It holds frequently requested data and instructions so that they are immediately available to the CPU when needed. Cache memory is used to reduce the average time to access data from the Main memory. The cache is a smaller and faster memory which stores copies of the data from frequently used main memory locations. There are various different independent caches in a CPU, which stored instruction and data. Levels of memory: Level 1 or Register – It is a type of memory in which data is stored and accepted that are immediately stored in CPU. Most commonly used register is accumulator, Program counter, address register etc. Level 2 or Cac

Memory hierarchy in computer hardware

Image
Memory Hierarchy Design and its Characteristics In the Computer System Design, Memory Hierarchy is an enhancement to organize the memory such that it can minimize the access time. The Memory Hierarchy was developed based on a program behavior known as locality of references.The figure below clearly demonstrates the different levels of memory hierarchy : This Memory Hierarchy Design is divided into 2 main types: External Memory or Secondary Memory – Comprising of Magnetic Disk, Optical Disk, Magnetic Tape i.e. peripheral storage devices which are accessible by the processor via I/O Module. Internal Memory or Primary Memory – Comprising of Main Memory, Cache Memory & CPU registers. This is directly accessible by the processor. We can infer the following characteristics of Memory Hierarchy Design from above figure: Capacity: It is the global volume of information the memory can store. As we move from top to bottom in the Hierarchy, the capacity increases. Acces

Redundancy check in computer network

Image
Redundancy :- Instead of repeating the entire data stream, a shorter group of bits may be appended to the end of each unit. This technique is called Redundancy because the extra bit are redundant to the information. They are discarded as soon as the accuracy of the transmission has been determined. These are the basically four types of redundancy check. 1. VRC (vertical redundancy check) 2. LRC (longitudinal redundancy check) 3. CRC ( cyclical redundancy check) Vertical redundancy check:- It is also known as parity check. It is least expensive mechanism for error detection. In this technique, the redundant bit called parity bit is appended to every data unit so that the total number 1s in the unit becomes even. Features:- VRC can detect all single bit errors . It can detect burst errors if the total number of  errors in each data unit is odd. VRC can not detect erros where the total number of bits changed is even. Drawback:- This