## Combinational circuits using Decoder

Prerequisite- Binary Decoder, Multiplexers A Decoder is a combinational circuit that converts binary information from input lines to unique output lines. Apart from the Input… Read More »

- Difference between DELETE and TRUNCATE
- Difference between SJF and LJF CPU scheduling algorithms
- Write Through and Write Back in Cache
- Difference between Left, Right and Full Outer Join
- Difference between CSMA/CA and CSMA/CD
- Difference between SCAN and CSCAN Disk scheduling algorithms
- Difference between 2NF and 3NF in DBMS
- Ackermann Function
- Difference between Type Casting and Type Conversion
- Top 5 PSUs for Computer Science Engineers in India
- Difference between JOIN and UNION in SQL
- Difference between order by and group by clause in SQL
- Difference between E-R Model and Relational Model in DBMS
- Difference between Register and Memory
- Subjectwise Important Topics for GATE 2020 Computer Science
- Design Issues in Network Layer
- Closure properties of Regular languages
- Difference between Natural join and Cross join in SQL
- Difference between Demand Paging and Segmentation
- Difference between Static Allocation and Heap Allocation
- Difference between Primary Key and Foreign Key
- IIT Madras M. Tech Interview Experience
- Difference between 3NF and BCNF in DBMS
- Difference between Contiguous and Noncontiguous Memory Allocation
- Memory Organisation in Computer Architecture
- Difference between Natural join and Inner Join in SQL
- Difference between DELETE, DROP and TRUNCATE
- Monitor vs Semaphore
- Difference between Compiler and Interpreter
- Relationship between User level thread and Kernel level thread

Prerequisite- Binary Decoder, Multiplexers A Decoder is a combinational circuit that converts binary information from input lines to unique output lines. Apart from the Input… Read More »

Prerequisite – Counters Johnson counter also known as creeping counter, is an example of synchronous counter. In Johnson counter, the complemented output of last flip… Read More »

Prerequisite – Properties of Boolean algebra, Minimization of Boolean Functions Redundancy theorem is used as a Boolean algebra trick in Digital Electronics. It is also… Read More »

Frames are the units of digital transmission particularly in computer networks and telecommunications. Frames are comparable to the packets of energy called photons in case… Read More »

We have discussed Pushdown Automata (PDA) and its acceptance by empty stack article. Now, in this article, we will discuss how PDA can accept a… Read More »

The previous article covered the Binomial Distribution. This article talks about another Discrete Probability Distribution, the Poisson Distribution. Introduction – Suppose an event can occur… Read More »

Prerequisite – Buddy System Two strategies for managing free memory that is assigned to kernel processes: 1. Buddy system – Buddy allocation system is an… Read More »

Prerequisite – Context Free Grammars, Simplifying Context Free Grammars A context free grammar (CGF) is in Greibach Normal Form (GNF) if all production rules satisfy… Read More »

A grammar is a set of production rules which are used to generate strings of a language. In this article, we have discussed how to… Read More »

First things first, I hope you are familiar to some of the concepts relating to Transactions. What is a Recoverable Schedule? What are Cascading Rollbacks… Read More »

The previous articles talked about some of the Continuous Probability Distributions. This article covers one of the distributions which are not continuous but discrete, namely… Read More »

The previous two articles introduced two Continuous Distributions: Uniform and Exponential. This article covers the Normal Probability Distribution, also a Continuous distribution, which is by… Read More »

The previous article covered the basics of Probability Distributions and talked about the Uniform Probability Distribution. This article covers the Exponential Probability Distribution which is… Read More »

BCD stand for binary coded decimal. Suppose, we have two 4-bit numbers A and B. The value of A and B can varies from 0(0000… Read More »

Prerequisite – Combinatorics Basics, Generalized PnC Set 1, Set 2 Definition : Generating functions are used to represent sequences efficiently by coding the terms of… Read More »