How can I find binary number pattern in C?

Question

0.00/5 (No votes)

See more:

I am writing a code that converts the number entered into a binary number without repetitive and array sentences and compares it with the pattern I entered. I wonder if this can be done using only bit operators

What I have tried:

C++

#include <stio.h>
int main(void)
{
	int num;
	int pattern;
	char answer;

	printf("Enter a number from 1 to 255: ");
	scanf_s("%d", num);

	printf("Enter a a four-digit pattern you want to find (ex: 0100): ");
	scanf_s("%d", pattern);

	
	
	/* Only use bitwise operator, i have to compare 'num' and 'pattern'
		ex) num = 15(00001111)
			pattern = 0111
			output : pattern 0111 found!
			
	   without conditional statements or arrangements
	   This is what I'm curious about.*/




	answer = (/* here too*/) ? "found!" : "not found";

	printf("pattern %d %c", pattern, answer);

	return 0;
}

Posted 3-Oct-22 22:13pm

Member 15786985

Updated 4-Oct-22 11:44am

Dave Kreskowiak

v2

Add a Solution

Comments

BernardIE5317 4-Oct-22 8:40am

I have no suggestions re/ the code per se Only a matter of UI. What's wrong w/ entering 0 to 255? Also if it was I I would state "four digit bit pattern" Also why a fixed bit pattern length? Any number of binary digits [1, 8] seems reasonable. Congratulations Mr. MacCutchan for doing homework for poster. Perhaps I am mistaken but a simpler algorithm may exist i.e. to wit allow the STL to do all the work in perhaps two statements.

jeron1 4-Oct-22 13:27pm

Seems a bit harsh, Richard posted no code at all.

2 solutions

Add a Solution

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Richard MacCutchan · Answer 1 · 2022-10-03T22:43:00

Solution 1

You need to convert the pattern into its correct representation. What you are doing is converting it to a decimal number. If you enter "0111" as the pattern it reads that as a decimal number which is 0110 1111 in binary. You need to read it as a string and build the bit mask from it: 1 character in the string equals one bit in the mask.

Posted 3-Oct-22 22:43pm

Richard MacCutchan

Comments

CPallini 4-Oct-22 5:25am

5.

Richard MacCutchan 4-Oct-22 5:58am

:thumbsup:

merano99 · Answer 2 · 2022-10-04T11:44:00

You read the two numbers in the variables "num" and "pattern" in different place value systems both as decimal numbers.
If you want to compare both, both must be in the same place value system. The two place value systems work according to these patterns:

for "pattern":

for "num":

While for "num" each bit already has its "correct" value, for "pattern" the "correct" value would have to be calculated first. Since the result is to be represented as a dual number and the "correct" value is not required here, it would be more favorable to convert "num" into the same system in which "pattern" already exists.
Then you can compare both and output them decimal with up to 8 leading zeros.

Converting "num" to the desired format is trivially easy, but it is probably a homework that I will not do here.

PS: The suggestion to make strings out of both numbers and compare them would be possible, but much more time consuming, because you would have to convert both numbers and then compare strings.

Finally, one more thing: Since "answer" is obviously a string, it cannot be output with %c.

How can I find binary number pattern in C?

2 solutions

Solution 1

Solution 2

Add your solution here

Preview 0

How can I find binary number pattern in C?

2 solutions

Solution 1

Solution 2

Add your solution here

Preview 0

Existing Members

...or Join us