Skip to main content

SCRUMble ! - New Book about SCRUM

 SCRUMble ! Hello Blog Readers! Thank you for all your support and encouragement. I have something exciting for you all. I have recently written and published a new book called 'SCRUMble !'. It is currently available on pothi store. It will be soon available on Amazon and Flipkart as well. Please get your copy and do let me know your reviews. -Abhishek Sathe SCRUMble ! Written and Published by: Abhishek Sathe                                                                              Distributed by: pothi.com Order your copy now:  https://store.pothi.com/book/abhishek-sathe-scrumble/ Coming soon on Amazon and Flipkart About the book: Scrum is a framework for solving complex problems largely adapted by Software Development field. There are multiple ag...
Post a Comment

Karnaugh Maps

Karnaugh map is a method to simplify Boolean algebra expressions. It was introduced it in 1953 by Maurice Karnaugh at Bell Labs. It can also be described as a special arrangement of truth tables.

Consider the following Truth Table:



A
B
Output
0
0
P
0
1
Q
1
0
R
1
1
S


  It can be mapped to a K-map as:



                                               A B                
0
1
0
P
Q
1
R
S
 


Example:

Consider the following map. The function plotted is: Z = f(A,B) = A + AB





Pairs of 1 are grouped together as shown in the figure as groups of one,two,four or eight. Each group corresponds to the product of minterms. Then simplification rules are applied to these product of minterms to minimize the simplified expressions.

Using algebraic simplification rules,






Z = A + AB
Z = A( + B)




Z=A is the simplified expression.







Labels:

Comments

Post a Comment

Popular posts from this blog

Mobile Automation using Appium-Java

Appium is an open-source, UI automation tool for automating mobile apps. This tutorial is helpful for setting up a Java-Selenium based project in Eclipse IDE for you to be able to execute test automation scripts for your mobile application. Please note that, we assume you already have an existing project for importing locally or cloning from git.  Steps to be performed for setup required for automation of mobile applications using Appium Mobile Automation tool using Java-Selenium: Below is the list of steps that needs to be performed for setting up the environment for execution of test cases on Windows: JDK Installation. Setting PATH variable. Installation of Android SDK. Installation of Eclipse. Importing a project in Eclipse. Install Eclipse ADT plugin. Install other required softwares. Install Appium. JDK Installation: Install JDK from http://www.oracle.com/technetwork/java/javase/downloads/index.html. After installation of java software...
Post a Comment
Read more

Cookies

What is a Cookie? A typical application is likely to involve a number of interactions between the client and the server. There must be some mechanism for the client to identify itself to the server each time it sends an HTTP request to the server. For this, cookies are used. Cookies are the most popular mechanism of maintaining state information. Working of Cookies: 1. When you interact with a website for the first time, the site might want you to register yourself. Here, you enter details line name, address etc. on a web page. 2. Server stores this information on its database. Additionally, it creates a unique id for you. It stores this id in the database and also sends it to you in the form of a cookie. 3. Next time when you interact with the server using a website, it would automatically send the id(i.e. Cookie) along with HTTP request for a particular page to the server. 4. The server matches this id in the database and knows that you are a registered user. Accordingly...
Post a Comment
Read more

Bipartite and semihamiltonian graphs

Bipartite Graph: A graph is bipartite if its vertex set can be partitioned into two subsets X and Y so that every edge has one end in X and one end in Y; such a partition (X,Y) is called bipartition of the graph, and X and Y its parts. ex.- Notation: We denote a bipartite graph G with bipartition (X,Y) by G[X,Y]. Complete Bipartite Graph: If G[X,Y] is simple and every vertex in X is joined to every vertex in Y, then G is called a Complete Bipartite graph. ex.- Semi-Hamiltonian Graph: A semi-Hamiltonian graph is a graph that contains a Hamiltonian path, but not a Hamilton cycle. Hamiltonian Path: A Hamiltonian path in an undirected or directed graph is a path which visits each vertex exactly once. ex.- C-A-D-B-E is a Hamiltonian path Hamiltonian Cycle: A Hamiltonian cycle or a Hamiltonian Circuit is a Hamiltonian path which is a cycle. This post will be useful in understanding a question: "The nabhi kamal grapg is:" (A)Bipartite graph (B)Semi-...
6 comments
Read more