
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
i need help debuging this
#include <stdio.h>
int printBin(int value);
int main(){
int num=10;
int tobinary= printBin(num);
printf("The number %d converted to binary as %d",num,tobinary);
}
unsigned int x = 1;
char *ccc = (char*)&x;
if (*ccc){
printf("This is Little endian");
}
else{
printf("This is Big endian");
}
getchar();
return 0;
}
int printBin(int value)
{
if(value<2)
return value;
return printBin(value / 2) *10 + value % 2;
}

Transcribed Image Text:1. Which end?
Write a simple C program that can determine whether a machine is little- or big-endian.
2. Printing binary
Write a function void printBin(int value) that will print an integer as a binary number.
Hint: You want to print a 1 or a O based on the high order bit, then you need to move the next to high order bit into the high order
bit. You will need to explicitly count the number of bits you have printed.
Write a main method that calls printBin multiple times with a few different values to test it. You should try at least a positive
number, a negative number and 0.
Your submission should answer the following questions about this program:
There are at least two approaches to testing the high order bit. Describe one that you did NOT use in your code.
• How could you suppress leading zeros in you display? If you did this already, you may just answer that you did.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by stepSolved in 2 steps with 2 images

Knowledge Booster
Similar questions
- i need help debuging this #include <stdio.h> int printBin(int value); int main(){ int num=10;int tobinary= printBin(num);printf("The number %d converted to binary as %d",num,tobinary);} unsigned int x = 1; char *ccc = (char*)&x; if (*ccc){ printf("This is Little endian"); } else{ printf("This is Big endian"); } getchar(); return 0; } int printBin(int value){ if(value<2)return value; return printBin(value / 2) *10 + value % 2; }arrow_forward#include<bits/stdc++.h> using namespace std; void bubbleSort(int arr[], int n) { for (int i = 0; i < n - 1; i++) { for (int j = 0; j < n - i - 1; j++) { if (arr[j] > arr[j + 1]) { int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } } int binarySearch(int arr[], int l, int r, int x, int& comp) { comp++; if (r >= l) { int mid = l + (r - l) / 2; if (arr[mid] == x) { return mid; } if (arr[mid] > x) { return binarySearch(arr, l, mid - 1, x, comp); } return binarySearch(arr, mid + 1, r, x, comp); } return -1; } int main() { int Num[8192]; srand(time(NULL)); for (int i = 0; i < 8192; i++) { Num[i] = rand() % 10001; } clock_t starting_time = clock(); bubbleSort(Num, 8192); clock_t ending_time = clock(); clock_t result =…arrow_forwardKindly fix the code:arrow_forward
- 1. Examine the following code segment. What will be printed?If there are any errors indicate the nature of the error. int a[8] ={16, 12, 10, 7, 15, 18, 17, 29}; int *ptr ; ptr = & a[ 5 ] ; for(int i = 0; i<= 4; i = i + 2) cout<<a[i]<<*( ptr + i )<<endl; cout<<” ”<<a[1]<<” ”<<*ptr<<” ”<<*ptr + 2<<” ”<<*(ptr + 3);arrow_forward#include #include using namespace std; int main() { double pi = 0; long i; long n; cin >> n; cout << "Enter the value of n: "; cout << endl; if (i % 2 == 0) else pi = pi + pi = pi T - (1/(2* i + 1)); (1/(2*1 + 1)); for (i = 0; i < n; i++) } { pi = 0; pi 4 pi; } cout << endl << "pi = " << pi << endl; return 0;arrow_forwardi need help debuging this #include <stdio.h> int printBin(int value); int main(){ int num=10;int tobinary= printBin(num);printf("The number %d converted to binary as %d",num,tobinary);} unsigned int x = 1; char *ccc = (char*)&x; if (*ccc){ printf("This is Little endian"); } else{ printf("This is Big endian"); } getchar(); return 0; } int printBin(int value){ if(value<2)return value; return printBin(value / 2) *10 + value % 2; }arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY

Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON

Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning

Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning

Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education

Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY