1 Introduction This Experiment Demonstrates The Count Sequence Of Binary Numbers And Their Use

Transcribed Image Text from this Question1 Introduction This experiment demonstrates the count sequence of binary numbers and their use as binary encodings of decimal numbers. It also serves as an introduction to the breadboard used in the laboratory and acquaints students with the oscilloscope. Reference material from the text that may be useful can be found in sections 1.2 and 1.7. 2 Binary-coded Decimal (BCD) The BCD representation uses binary numbers from 0000 to 1001 to represent the coded decimal digits from 0 to 9. IC 7493 can be operated as a BCD instead of binary) counter by making the external connections shown. Figure 1: BCD counter 5 14 Vcc 12 Input pulses A QA 9 1 B QB 7493 8 QC 2 R1 11 QD 3 R2 GND 10 QB and QD are connected to the two reset inputs R1 and R2. When both R1 and R2 are equal to 1, all four cells in the counter clear to 0 irrespective of the input pulse. 1. Connect the 7493 IC to operate as a BCD counter. Connect the input to a pulse button and the four outputs to indicator lamps (as in Experiment 1). Verify the binary count goes from 0000 to 1001 and then repeats. Describe the internal interaction (consider the resets R1 and R2) that takes place to realize that result. 2. When the pulses into the BCD counter are continuous, the counter keeps repeating from 0000 to 1001 and back. Predict the pattern of l’s and 0’s repeated every 10 pulses for each output bit, given the list of binary numbers from 0000 to 1001. (For example, QA produces a pattern of alternate l’s and O’s.) Disconnect the pulse button from the input and connect the clock function generator (frequency ¿1 kHz). Using the oscilloscope, by dual-tracing the clock in one channel and each output in turn on the other, draw a timing diagram (include at least 12 clock cycles) for the 4 outputs relative to the clock (as for the binary counter in Experiment 1). Do the patterns you observe for the four outputs match your predictions?

Lab 13 Do Not Change Main.cpp, I Want C Code For Bst.h And Bst.cpp
Lab 13 Do not change main.cpp, I want c code for bst.h and bst.cpp file Given the complete main() function and your BST class from Lab #12, extend the class declaration and class implementation to include search and delete features.. The following new member functions are required: delNode(int v) removes a single node from the BST with value = v no return value displays “v cannot be deleted, empty tree” when the tree is empty displays “v cannot be deleted, does not exist” when v is not in the BST searchNode(int v) determines if the BST contains a node with value = v returns true if the value v is found in the BST and false otherwise A description of all of these functions is available in the textbook’s chapter 19 (which you should have already studied). The textbook design utilizes helper functions for the delete node and search node functions. Your implementation must follow the textbook design. NOTE: Your BST class should NOT be templated. Example: If the input is: 5 52 4 93 67 11 52 where 5 is the number of data items, the next five numbers are node values, and the 52 is the value to search for and then delete, the output is: 4 11 52 67 93 Search found 52 4 11 67 93 NOTE: Each node value is followed by a single space. main.cpp #include #include “bst.h” using namespace std; int main() { bst myBST; int nodes = 0; int dataValue = 0; cin >> nodes; for (int i=0; i> dataValue;    myBST.addNode(dataValue); } myBST.displayInOrder(); cout <> dataValue; if (myBST.searchNode(dataValue)) cout << "Search found " << dataValue << endl; else cout << "Search did not find " << dataValue << endl; myBST.delNode(dataValue); myBST.displayInOrder(); cout << endl; return 0; } bst.h #ifndef BST_H #define BST_H struct intNode { int data; intNode* left; intNode* right; }; class bst { public: // TODO: Copy your solution from Lab #12    // TODO: Implement the searchNode() and delNode() member functions as specified private: intNode* root;    // TODO: Copy your solution from Lab #12    // TODO: Implement private member functions (helpers) for searchNode() and delNode() }; #endif bst.cpp #include #include “bst.h” // TODO: Copy your solution from Lab #12 // TODO: implement the member functions The Diagram Shown Below Is A Small Microarchitecture. The Datapath Consists Of 7 General Transcribed Image Text from this QuestionThe diagram shown below is a small microarchitecture. The datapath consists of 7 general purpose registers: RO, R1, R2, R3, R4, R5 and R6. R6 is set to 1 which cannot be change. Output Enables A-bus B-bus Firo 00 0 1 Function A AW elo A-bus B-bus 10 11 A ADD(A,B) AND(A.B Six 4 bit register 0 Write 1 Enables 2 C-bus F1F0 ALU Write a control sequence to compute RO (R1 R2)(RIO R2)(R1 – R2)R3-1. Q6. Draw An Activity Diagram For The Following Scenario. Scenario: Activity Is Started By Q6. Draw an activity diagram for the following scenario.    Scenario: Activity is started by Traveler (actor) who needs to buy a ticket. The ticket system will confirm the information by asking different questions about: •   Domestic or International •   Economy or Business class •   Time and date confirmation After confirming all queries from the traveler, the machine will calculate the payment, generate receipt, and ask for payment options (Cash or Card). After payment is completed, the ticket will be issued to the traveler. Based On The C Program Below, Give The Simple Description For The Functions Computer Science Assignment Writing ServiceBased on the c program below, give the simple description for the functions and results of code execution using static analysis.. #include #include struct node {    int item;    node*next; }; class list { private:    node*head;    int size;    node*finde(int); public:    list();    ~list();    void insert(int,int);    void removed(int index);    void display();    void recdisplay(node*);    int getsize(){return size;}    node*gethead(){return head;}    bool isempty(){return bool(size==0);} void sort();    void sortn(); }; list::list() {    head=NULL;    size=0; } node*list::finde(int index) {    if(indexsize)        return NULL;    else    {        node*cur;        cur=head;        for(int i=1;inext;        return cur;    } } void list::insert(int index ,int value) {    size=size 1;    if(indexsize)    {        cout<<"out of range"<next=head;                head=temp;            }            else            {                node*per=finde(index-1);                temp->next=per->next;                per->next=temp;            }        }    } } void list ::removed(int index) {    if(indexsize)        cout<<"out of range"next;            per->next=cur->next;        }        cur->next=NULL;        delete cur;    } } list::~list() {    while(!isempty())        removed(1); } void list::display() {    node*cur;    cur=head;    while(cur!=NULL)    {        coutcur->item)            {                int temp;                temp=cur->item;                cur->item=befor->item;                befor->item=temp;            }        }    } } void list::sortn() {    node*before;    node*second;    node*first;    for(int d=1;d<=size;d )    {        for(int j=1;jitem>second->item)            {            first->next=second->next;            if(before==NULL)                head=second;            else                before->next=second;            second->next=first;            }                   }    } }                          void main() { list bilal; //load (file->list) int item; ifstream infile(“bilal.txt”); infile>>item; while(infile!=NULL) {    bilal.insert(1,item);    infile>>item; } infile.close(); bilal.display(); cout<next;    bilal.removed(counter);    }    else    {        counter ;        cur=cur->next;    } } cout<