Recent content by uknowwho

I know but I just need to know how to group the minterms please I really want to do this

You told how to store multiple bool values but did you tell what to do with them NO!. All I'm saying is that If you can explain what algorithm I'm supposed to apply, it would make things easier. I'm not saying I want to follow the Quine McCluskey (I already posted this in the previous post). No...

I know how to simplify on paper.but how do I tell the computer to make groups of consecutive 1's? or how to decide the size of the group e.g group of 2 or 4 or 8 minterms (1's)?

Its not part of an assignment or homework...I'm not particularly asking for the entire code.If you can explain in simple terms what the whole process would be without using the Quine -McCluskey algorithm then I'm sure I'll get that. Until now I've learned the basic loops,switch statement and...

Can you show this through code please just to let me start off? Im sorry but like I said I am a beginner at this so I am not really getting what you meant by the test routines and can you atleast tell that my approach is okay for the algorithm?

#include <iostream> using namespace std; int main() { int m0,m1,m2,m3,m4,m5,m6,m7,m8,m9,m10,m11,m12,m13,m14,m15; int arr[16]={m0,m1,m2,m3,m4,m5,m6,m7,m8,m9,m10,m11,m12,m13,m14,m15}; cout<<"Enter 1 or 0 in m0: "<< endl; cin>>m0; cout<<"Enter 1 or 0 in m1: "<< endl...

Maybe a more clear one?..I didn't quite get what you meant

Im a newbie at programming so can you help me out man..I know how to implement loops,arrays..but seeing the Quin Mccluskey algorithm, its very complex..can't I use something much more simple? Thanks

All I can think of is using ifs to check the minterms (m0 till m15) Assuming all min-terms equal to zero E.g if(m0==1){ cout <<"..." } else if(m0==1 && m2==1){ cout<<"..." } but then in this way the program won't go to the else-if part even if the other min-terms are 1 along with m0? how...

I need to make a karnaugh map for 4 variables(there is no need to involve don't care terms) which gives the output as the simplified function. There's no need to literally display the map itself I only need an algorithm that takes the input as min terms and displays the simplified output. Anyone...

I do get the De Morgan's Law but The question we were given was that how to implement the circuit made with NAND gates into NOR gates directly and we were given the hint of using bubbles to invert the circuits..Is it possible you can draw it out to give an example. I'm sure I'll get it then. I...

No need to get angry man..You're a pro..I'm just a newbie at this :)

Here's what I tried what you suggested

the last one

Okay what I originally did was that I assumed the AND's which we got from NAND gates and inverted their inputs as NOR=AND with inverted inputs and just inverted the OR gates formed with the NAND gates so that they become NOR so i guess that was wrong Do I have to put invertors(bubbles) infront...