Solkar said:...and your own ansatz yet is?
Solkar said:If you have absolutely no idea how to implement a solution, write the test routines first.
There are only 2^(16) ~ 64k possible input tables, so the algorithm you develop can be tested completely.
By designing a test program, you will come to questions which are also crucial for the solution itself:
- How to store 16 boolean values efficiently? (consider e.g. std::valarray<bool>, std::bitset, std::vector<bool>)
- How to map their (linear? two-dimensional?) adresses to ABCD keys and vice-versa?
That will carry you right into the topic.
Solkar said:I've already given you advice about how to get started.
advice?Solkar said:If you have absolutely no idea how to implement a solution, write the test routines first.
#include <iostream>Solkar said:What could be unclear about this
advice?
Solkar said:OK, one more tip:
All possible input tables can simply be generated by counting for 0 to 0xFFFF in a loop.
That's the input of your to-be-written program.
The simplified formula must reproduce that table when you apply it on the 16 ABCD tuples.
uknowwho said: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?
Solkar said:Well, if even counting from 0 to 0xFFFF in a loop exceeds your current skill, then implementing Quine–McCluskey is way beyond your level.
I somehow get the feeling that you were just hoping for someone doing your homework for you.
The code you showed earlier had no evidence that you know anything about control structures such as loops and switch statements. Your code defined an array, but did nothing with the array after that.uknowwho said: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 simple array formation..Keeping that in mind if you can suggest something then that would be really helpful
Mark44 said:The code you showed earlier had no evidence that you know anything about control structures such as loops and switch statements. Your code defined an array, but did nothing with the array after that.
One way to start is with a particular example. How would you manually (using paper and pencil) produce the simplified function? Once you understand the technique, then you have a better chance of teaching it to the computer, which is essentially what you're doing when you write a program.
Solkar said:- How to store 16 boolean values efficiently? (consider e.g. std::valarray<bool>, std::bitset, std::vector<bool>)
you did not even include one of the respective headers.uknowwho said:#include <iostream>
using namespace std;
int main() {/* */}
Solkar said:I had given you three reasonable alternatives for storing multiple boolean values
but in your "code" (I'm somewhat reluctant to call that wild lot of characters "code")
you did not even include one of the respective headers.
So you haven't followed any advice yet, what would providing more advice be good for?
And again - your programming skills yet are apparently far below the level you need for implementing Quine -McCluskey.
Better postpone that endeavour and solve some easier assignments first.
I'm sure it would, but part of your work is to come up with or do the research to find an algorithm that you can implement.uknowwho said: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 inclined to agree with Solkar's advice - to get more experience in programming by tackling simpler problems.uknowwho said:I'm not saying I want to follow the Quine McCluskey (I already posted this in the previous post). No need to get angry man
Mark44 said:I'm sure it would, but part of your work is to come up with or do the research to find an algorithm that you can implement.
I'm inclined to agree with Solkar's advice - to get more experience in programming by tackling simpler problems.
First get an understanding of programming in general, then about C++, and until that postpone any musings about what you "need", let alone "want".uknowwho said:I know but I just need to know how to group the minterms please I really want to do this
A Karnaugh Map, also known as a K-Map, is a graphical method used to simplify Boolean expressions. It is commonly used in computer programming to simplify complex Boolean expressions, making them easier to understand and more efficient to execute. By using a Karnaugh Map, programmers can reduce the number of terms and operations in their code, resulting in a more streamlined and optimized C++ program.
In C++ programming, it is common to have Boolean expressions with up to four variables. Using a Karnaugh Map with four variables allows for the simplification of these expressions, reducing them to their most basic form. This means that the code will be easier to read and understand, and it will also be more efficient to execute.
Yes, a Karnaugh Map can be used to simplify C++ code even if there are "don't care" terms present. "Don't care" terms are variables whose value does not affect the outcome of the expression. They are represented as an "X" on the Karnaugh Map and can be ignored when simplifying the expression. This allows for even more efficient and concise code.
While having a basic understanding of Boolean algebra can be helpful, it is not necessary to use a Karnaugh Map for C++ simplification. The Karnaugh Map method is generally easy to understand and can be used by programmers of all levels. There are also various online resources and tools available to assist with the simplification process.
One limitation of using a Karnaugh Map for C++ simplification is that the number of variables is limited to four. If an expression has more than four variables, it cannot be simplified using a Karnaugh Map. Additionally, the Karnaugh Map method is best suited for simplifying expressions with a small number of terms. For highly complex expressions, other methods may be more effective.