All categories

3 years ago

Enum Digits {0, 1};

Computers and Technology

1 answer:

Arisa [49]3 years ago

3 0

Answer:

The code is given below with appropriate comments for better understanding

Explanation:

#include <bits/stdc++.h>

using namespace std;

enum Digits {

zero,

one

} ;

struct CellType

{

Digits bit;

CellType* next;

};

class Minimum

{

public:

struct CellType* head,*temp; // head to point MSB

Minimum(string s)

{

int sz = s.size(); // binary size as per question it indicates n.

for(int i=0;i<sz;i++)

{

if(s[i] == '0') // if the bit is zero , we add zero at the end of stream

addAtEnd(zero);

else // if the bit is one , we one zero at the end of stream

addAtEnd(one);

}

addOne();

showlist();

}

CellType* create(Digits x) // to create a node of CellType*

{

CellType* t = new CellType();

t->bit = x;

t->next = NULL;

return t;

}

void addAtEnd(Digits x)

{

if(head == NULL) // if list is empty , then that will be the only node

{

CellType* t;

t = create(x);

head = temp = t;

}

else

{ // other wise we add the node at end indicated by the temp variable

CellType* t ;

t = create(x);

temp->next = t;

temp=temp->next;

}

void showlist()

{

// this is just a normla method to show the list

CellType* t = head;

while(t!=NULL)

{

cout<<t->bit;

t=t->next;

}

void addOne()

{

here since we need to add from the end and it is a singly linked list we take a stack

and store in last in ,first out format .

Then we keep on changing all ones to zeroes until we find a zero int he list,

The moment a zero is found it should be changed to one.

If everything is one in the sequence , then we add a new zero digit node at the beginning of the list.

stack<CellType*> st;

CellType* t = head;

while(t!=NULL)

{

st.push(t);

t=t->next;

}

while(st.size()>0 && (st.top())->bit == one )

{

CellType* f = st.top();

f->bit = zero ;

st.pop();

}

if(st.size())

{

CellType* f = st.top();

f->bit = one ;

}

else

{

t = create(one);

t->next = head;

head = t;

}

};

int main()

{

Here i am taking an integer as input and then converting it to binary using a string varaible s

if you want to directly take the binary stream as input , remove the comment from "cin>>s" line.

long long int n,k;

cin>>n;

string s;

k = n;

while(k>0)

{

s = s + (char)(k%2 +48);

k=k/2;

}

reverse(s.begin(),s.end());

//cin>>s;

Minimum* g = new Minimum(s);

return 0;

}

You might be interested in

You work administrative assistant in an engineering firm. A co-worker constantly makes fun of the engineers by whispering commen

victus00 [196]

Answer:

Option 4

<u>WORST</u>

Explanation:

Option 4 is the best cus confronting is better than just watching and letting it happen which in option 2 that's the case

4 0

3 years ago

BRIANLIEST!!!!!!!!!!!!!!!!

oksano4ka [1.4K]

Answer:

First Line indent

Explanation:

should be correct

4 0

3 years ago

Read 2 more answers

Which of the following statements is true about biometrices as an authentication method

matrenka [14]

Answer:

what are the statements?

Explanation:

7 0

3 years ago

You create a storyboard at the _____ stage of web development

ddd [48]

Answer:

initial stage of web development.

4 0

4 years ago

Read 2 more answers

Write a program that dynamically allocates an array large enough to hold a user-defined number of test scores. Once all the scor

Anastasy [175]

Answer:

// Program written in C++

// Comments are used to explain some lines

#include <iostream>

#include <iomanip>

using namespace std;

// Functions

void getData(double *, int);

void selectionSort(double *, int);

double getAverage(double *, int);

void displayData(double *, int, double);

int main() //Main Method

{

double *ToTest, // To dynamically allocate an array

Average; // To hold the average of the scores

int Scores; // To hold number of scores

// Get number of scores

cout << "Number of average to find? ";

cin >> Scores;

// Allocate an array to number of scores

ToTest = new double[Scores];

getData(ToTest, Scores);

selectionSort(ToTest, Scores);

Average = getAverage(ToTest, Scores);

printData(ToTest, Scores, Average);

return 0;

}

//Get Data

void getData(double *ToTest, int Scores)

{

cout << "Enter each scores.\n";

for (int i = 0; i < Scores; i++)

{

cout << "Score #" << (i + 1) << ": ";

cin >> *(ToTest + i);

if (*(ToTest + i) < 0)

{

cout << "Scores must be greater than 0.\n"

<< "Re-enter ";

}

} while (*(Test + i) < 0);

}

// Selection Sort

void selectionSort(double *ToTest, int Scores)

{

int startscan, minIndex;

double minValue;

for (startscan = 0; startscan < (Scores - 1); startscan++)

{

minIndex = startscan;

minValue = *(ToTest + startscan);

for (int i = startscan + 1; i < Scores; i++)

{

if (*(ToTest + i) < minValue)

{

minValue = *(Test + i);

minIndex = i;

}

*(ToTest + minIndex) = *(ToTest + startscan);

*(ToTest + startscan) = minValue;

}

// Calculate Average

double getAverage(double *ToTest, int Scores)

{

double Total;

for (int i = 0; i < Scores; i++)

{

Total += *(ToTest + i);

}

return Total / Scores;

}

// Print Data

void printData(double *ToTest, int Scores, double Avg)

{

cout << "\n Test scores\n";

cout << "Number of scores: " << Scores << endl;

cout << "Scores in ascending-order:\n";

for (int i = 0; i < Scores; i++)

{

cout << "#" << (i + 1) << ": " << *(ToTest + i) << endl;

}

cout << fixed << showpoint << setprecision(2);

cout << "Average score: " << Avg << endl;

}

6 0

3 years ago