Use Rice S Theorem Show Set S5 M Tm Accepts Least Five Inputs Undecidable Q43879121

Use Rice’s theorem to show that the set S5 = {<M>: M is aTM that accepts at least five inputs} is undecidable.

Expert Answer

---

Answer to Use Rice’s theorem to show that the set S5 = {: M is a TM that accepts at least five inputs} is undecidable….

Use Scenario Construct Entity Relationship Diagram Question Clearly Show Identifier Attrib Q43876532

Use scenario to construct an Entity -Relationship Diagram foreach question

• Clearly show identifier attribute(s) and all other attributes ofall the entities in the ERD.

• If a scenario doesn’t specify an identifier, make one for eachentity.

• Clearly indicate the cardinality mappings.

• Please write down any assumptions you make.

• You can Hand write or type or draw the answer

• Scenario  

• A piano manufacturer wants to keep track of all the pianos itmakes. Each piano has an identifying serial number and amanufacturing completion date. Each piano belongs to exactly onepiano model. A model number identifies each model and the companyalso stores a name of each model. Over time, the company oftenmanufactures thousands of pianos of a certain model, and the modeldesign is specified before any single piano exists.

0. A piano manufacturer employs piano technicians who areresponsible for inspecting the pianos before they are shipped tothe customers. Each piano is inspected by at least one technician(identified by their employee number). Technicians are expected toinspect multiple pianos simultaneously. For each separateinspection, the company needs to record its date and a qualitygrade.

Expert Answer

---

Answer to Use scenario to construct an Entity -Relationship Diagram for each question Clearly show identifier attribute(s) and all…

Use Shutil Modecreate Script Called Copyactivitiespy Function Called Stuactivities Followi Q43782533

Use shutil mode.Create a script calledcopy_activities.py with a function called stu_activities that doesthe following:

Finds files in ~/Downloads that contain the string Stu_Copies these files (using the folders naming convention) into thecorrect Week and Day directory within the CyberSecurity-Notesdirectory created in part 1.

This question has been posted but does not copy anythingto the files

This is what i have already created they need to be copied intothese dir

Create a script called create_notes_drs.py . In the file, defineand call a function called main that does the following: Creates adirectory called CyberSecurity-Notes in the current workingdirectory Within the CyberSecurity-Notes directory, creates 24sub-directories (sub-folders), called Week 1 , Week 2 , Week 3 ,and so on until up through Week 24 Within each week directory,create 3 sub-directories, called Day 1 , Day 2 , and Day 3

my code for this

import os

def main():

    #Storring folder name into avariable

    mainDir = “CyberSecurity-Notes”

    

    #isdir will check if the is an existingpath

    if os.path.isdir(mainDir):

        print(“Directoryalready exists”)

    

    os.mkdir(mainDir) #creating the dir ifit dint find a file name

    #This loop will create a folder 24times

    for week in range(1,25):

        os.mkdir(“{}/Week{}”.format(mainDir,week))

        #this folderwill loop 3 times ceating the days folder before it loops again inthe week loop

        for day inrange(1,4):

            os.mkdir(“{}/Week{}/Day{}”.format(mainDir,week,day))

        

         

main()

Expert Answer

---

Answer to Use shutil mode.Create a script called copy_activities.py with a function called stu_activities that does the following:…

Use Specific Function Dll File Created Visual Studio Python Q43802592

howto use specific function in a .dll file created in Visual studio inpython

Expert Answer

---

Answer to how to use specific function in a .dll file created in Visual studio in python…

Use Specific Function Dll File Created Visual Studio Python Q43802594

howto use specific function in a .dll file created in Visual studio inpython

Expert Answer

---

Answer to how to use specific function in a .dll file created in Visual studio in python…

Use Stackadt Class Stacktype Classes Given Ch 18 Code Supplied Complete Assignment Include Q43903976

Use the stackADT class and stackType classes given to you in Ch.18 and code supplied here to complete this assignment.

#include <iostream>

#include “myStack.h”

using namespace std;

  

int main()

{

stackType<int> stack1(50);

stackType<int> stack2(50);

stack1.initializeStack();

stack1.push(23);

stack1.push(45);

stack1.push(38);

stack2 = stack1;

if (stack1 == stack2)

cout << “stack1 and stack2 are identical” <<endl;

else

cout << “stack1 and stack2 are not identical” <<endl;

stack2.pop();

stack2.push(32);

cout << “**** After pop and push operations on stack2****” << endl;

if (stack1 == stack2)

cout << “stack1 and stack2 are identical” <<endl;

else

cout << “stack1 and stack2 are not identical” <<endl;

stack2.push(11);

cout << “**** After another push operation on stack2 ****”<< endl;

if (stack1 == stack2)

cout << “stack1 and stack2 are identical” <<endl;

else

cout << “stack1 and stack2 are not identical” <<endl;

return 0;

}

Modify the stack implementation such that it uses a vectors asthe container instead of an array.

Overload the pure virtual function push such that it takes avector as an argument which pushes multiple values onto thestack.  

Throw exceptions when:

·An attempt is made to pop from anempty stack (display message)

·An attempt is made to push onto afull stack (display message)

·top() is called on an empty stack(display message).

·A negative or zero value for stacksize is passed to the constructor (In this case, when handling theerror, automatically recall the constructor with a value of100).

Using the STL queue container, add multiple stackType classes toa queue.   Demonstrate an ability to use STL queuemethods such as front() and pop().

Useful notes:

Leverage the functions which are already given to you.

Submission requirements:

Submit all files required to make this program run asrequired.    Your solution can be a singlefile.

Submit source code, a screenshot with a time stamp of codeexecution, and a text file of the code. All code should includecomments.

Grading Criteria Assignments

Maximum Points

Program accomplishes requested operations per instructions

40

The code works and meets all assignment specifications

30

The code is organized and easy to follow and output is clear andclean

20

Uses software tools correctly and efficiently

10

Total

100

VPN 14:55 1 100% .. Boost x = 1 Aa a a a The following abstract class stackADT defines these operations as an ADT: template colass Type> class stackADT publie: virtual void initializestack() =0; // Method to initialize the stack to an empty state. //Postconditions Stack is empty. virtual bool isimptystack() const .0 //Function to determine whether the stack is empty. //Postcondition. Return true if the stack is empty otherwise return false virtual bool Tarullstack() const -0 //Function to determine whether the stack is full //Postcondition: Returns true if the stack a full otherwise return false. virtual void push(const Types newItem) = 0 //Function to add newItem to the stack. //Precondition. The stack exiate and is not full. //Postcondition. The stack is changed and new Item is added to the top of the stack. Virtual Type top() const = 0; //Function to return the top element of the stack. //Precondition. The stack exiate and is not empty. //Postcondition. It the stack is empty, the program terminates otherwise, the top olement of the stack is returned virtual void pop() = 0; //Function to remove the top element of the stack. //Precondition. The stack exists and is not espty. //Postcondition. The stack is changed and the top elecent is removed from the stack. Figure 18-4 shows the UML class dia- gram of the class stackADT. 88 minutes. 194 pages left VPN 14:55 100% … Boost x = 1 Aa a a a element is removed from the stack. Figure 18-4 shows the UML class dia- gram of the class stackADT. Figure 18-4. stackADT<Type> +initializeStack(): void +isEmptyStack(): boolean +isFullstack(): boolean +push (Type): void +top(): Type +pop(): void UML class diagram of the class stackADT We now consider the implementation of our abstract stack data structure. Be- 87 minutes. 193 pages left VPN 14:56 100% … Boost x = Аа аа template celas Type> class stacktyper public stackADT<Type> publier const stackType Type>& operators (const stacktype Type>&) //Overload the assignment operator. void initializestack(); //Function to initialize the stack to an empty state. //Postcondition stackTop = 0 bool Lamptystack() consti //Function to determine whether the stack is empty. //Postcondition: Returns true if the stack is empty. otherwise returns talse. bool is Pullstack() const; //Function to determine whether the stack is full. //Postcondition Returns true if the stack is full, otherwise returns talse. void push(const Typek newItem); //Function to add newItem to the stack. //recondition. The stack exists and is not full //Postcondition. The stack a changed and bevite // is added to the top of the stack. Type top() consts //Function to return the top element of the stack. //Precondition. The atack exiate and is not empty. //Postcondition. It the stack is empty. the program terminates otherwise, the top element of the stack is returned. void pop(); //Function to remove the top element of the stack //Precondition. The stack exists and is not empty. //Postcondition. The stack is changed and the top element is removed from the stack stackType(int stackSize = 100) //constructor //Create an array of the size atacksize to hold //the stack elements. The default stack size is 100. //Postcondition. The variable liat contains the base address of the array otacktop=0 and maxstack size-stacksize. stacktype (const stacktypeType>k otherStack); // Copy constructor -stackType(); //Destructor //Remove all the elements from the stack. //Postcondition: The array (list) holding the stack elements is deleted. private: int maxStackSize; //variable to store the maximum stack size Ant stalo teto bont to the to the te 86 minutes. 205 pages left VPN 14:56 100% … Boost x 5 private int maxStackSize; //variable to store the maximum stack size int stackTop //variable to point to the top of the stack Type list, //pointer to the array that holds the //stack elements void copystack (const stackTypes Type> otherStack) //Punction to make a copy of otherStack. //Postcondition. A copy of otherstack is created and assigned to the stack. Figure 18-5 shows the UML class dia- gram of the class stackType. Figure 18-5. stackType<Type> -maxStackSize: int -stack Top: int – list: Type +operator= (const stackType<Type>&) : const stack Type Type> +initializeStack(): void +isEmptyStack() const: bool +isFullstack() const: bool +push(const Type) : void +top() const: Type +pop(): void -copyStack (const stackType<Type>): void +stack Type (int = 100) +stackType (const stackType<Type>) +-stackType() UML class diagram of the class stackType 86 minutes. 189 pages left Show transcribed image text VPN 14:55 1 100% .. Boost x = 1 Aa a a a The following abstract class stackADT defines these operations as an ADT: template colass Type> class stackADT publie: virtual void initializestack() =0; // Method to initialize the stack to an empty state. //Postconditions Stack is empty. virtual bool isimptystack() const .0 //Function to determine whether the stack is empty. //Postcondition. Return true if the stack is empty otherwise return false virtual bool Tarullstack() const -0 //Function to determine whether the stack is full //Postcondition: Returns true if the stack a full otherwise return false. virtual void push(const Types newItem) = 0 //Function to add newItem to the stack. //Precondition. The stack exiate and is not full. //Postcondition. The stack is changed and new Item is added to the top of the stack. Virtual Type top() const = 0; //Function to return the top element of the stack. //Precondition. The stack exiate and is not empty. //Postcondition. It the stack is empty, the program terminates otherwise, the top olement of the stack is returned virtual void pop() = 0; //Function to remove the top element of the stack. //Precondition. The stack exists and is not espty. //Postcondition. The stack is changed and the top elecent is removed from the stack. Figure 18-4 shows the UML class dia- gram of the class stackADT. 88 minutes. 194 pages left
VPN 14:55 100% … Boost x = 1 Aa a a a element is removed from the stack. Figure 18-4 shows the UML class dia- gram of the class stackADT. Figure 18-4. stackADT +initializeStack(): void +isEmptyStack(): boolean +isFullstack(): boolean +push (Type): void +top(): Type +pop(): void UML class diagram of the class stackADT We now consider the implementation of our abstract stack data structure. Be- 87 minutes. 193 pages left
VPN 14:56 100% … Boost x = Аа аа template celas Type> class stacktyper public stackADT publier const stackType Type>& operators (const stacktype Type>&) //Overload the assignment operator. void initializestack(); //Function to initialize the stack to an empty state. //Postcondition stackTop = 0 bool Lamptystack() consti //Function to determine whether the stack is empty. //Postcondition: Returns true if the stack is empty. otherwise returns talse. bool is Pullstack() const; //Function to determine whether the stack is full. //Postcondition Returns true if the stack is full, otherwise returns talse. void push(const Typek newItem); //Function to add newItem to the stack. //recondition. The stack exists and is not full //Postcondition. The stack a changed and bevite // is added to the top of the stack. Type top() consts //Function to return the top element of the stack. //Precondition. The atack exiate and is not empty. //Postcondition. It the stack is empty. the program terminates otherwise, the top element of the stack is returned. void pop(); //Function to remove the top element of the stack //Precondition. The stack exists and is not empty. //Postcondition. The stack is changed and the top element is removed from the stack stackType(int stackSize = 100) //constructor //Create an array of the size atacksize to hold //the stack elements. The default stack size is 100. //Postcondition. The variable liat contains the base address of the array otacktop=0 and maxstack size-stacksize. stacktype (const stacktypeType>k otherStack); // Copy constructor -stackType(); //Destructor //Remove all the elements from the stack. //Postcondition: The array (list) holding the stack elements is deleted. private: int maxStackSize; //variable to store the maximum stack size Ant stalo teto bont to the to the te 86 minutes. 205 pages left
VPN 14:56 100% … Boost x 5 private int maxStackSize; //variable to store the maximum stack size int stackTop //variable to point to the top of the stack Type list, //pointer to the array that holds the //stack elements void copystack (const stackTypes Type> otherStack) //Punction to make a copy of otherStack. //Postcondition. A copy of otherstack is created and assigned to the stack. Figure 18-5 shows the UML class dia- gram of the class stackType. Figure 18-5. stackType -maxStackSize: int -stack Top: int – list: Type +operator= (const stackType&) : const stack Type Type> +initializeStack(): void +isEmptyStack() const: bool +isFullstack() const: bool +push(const Type) : void +top() const: Type +pop(): void -copyStack (const stackType): void +stack Type (int = 100) +stackType (const stackType) +-stackType() UML class diagram of the class stackType 86 minutes. 189 pages left

Expert Answer

---

Answer to Use the stackADT class and stackType classes given to you in Ch. 18 and code supplied here to complete this assignment….

Use Stuct Node Create Following Function Int Getnode Struct Node Searches First Node Valid Q43817305

use your stuct node, and create the following function:

int get_node(struct node*);

which searches for the first node where valid=0.

Return that index, or if no such node is found, return -1.

Expert Answer

---

Answer to use your stuct node, and create the following function: int get_node(struct node*); which searches for the first node wh…

Use Substitutioncryptosystem Key Scjaxufbqktprwezhvligydnmo Encrypt Gold Hidden Garden B U Q43824643

How to code those two problems in Sage?
(a) Use SubstitutionCryptosystem with key SCJAXUFBQKTPRWEZHVLIGYDNMO to encrypt “The gold is hidden in the garden” (b) Use SubstitutionCryptosystem with the same key to decrypt IBXLX JVXIZ SLLDE VAQLL DEVAU QLB Show transcribed image text (a) Use SubstitutionCryptosystem with key SCJAXUFBQKTPRWEZHVLIGYDNMO to encrypt “The gold is hidden in the garden” (b) Use SubstitutionCryptosystem with the same key to decrypt IBXLX JVXIZ SLLDE VAQLL DEVAU QLB

Expert Answer

---

Answer to (a) Use SubstitutionCryptosystem with key SCJAXUFBQKTPRWEZHVLIGYDNMO to encrypt “The gold is hidden in the garden” (b) U…

Use Truth Tables Show Following Pairs Expressions Logically Equivalent P Q P Q Q P Prove F Q43908078

do A

Do B

Do A and B

Use truth tables to show that the following pairs of expressions are logically equivalent. (a) p-q and (p q) ^ (q – p) Prove that the following pairs of expressions are not logically equivalent. (a) p-q and a-p Solution Ifp= Tand q – F, then p-q is false and apis true. Also, when p = F and q = T, then p +q is true and q pis false. (b) bad- pue b- d- Translate each English sentence into a logical expression using the propositional variables defined below. Then negate the entire logical expression using parentheses and the negation operation. Apply De Morgan’s law to the resulting expression and translate the final logical expression back into English. • p: the applicant has written permission from his parents • e: the applicant is at least 18 years old • s: the applicant is at least 16 years old (a) The applicant has written permission from his parents and is at least 16 years old. (b) The applicant has written permission from his parents or is at least 18 years old. Feedback? Show transcribed image text Use truth tables to show that the following pairs of expressions are logically equivalent. (a) p-q and (p q) ^ (q – p)
Prove that the following pairs of expressions are not logically equivalent. (a) p-q and a-p Solution Ifp= Tand q – F, then p-q is false and apis true. Also, when p = F and q = T, then p +q is true and q pis false. (b) bad- pue b- d-
Translate each English sentence into a logical expression using the propositional variables defined below. Then negate the entire logical expression using parentheses and the negation operation. Apply De Morgan’s law to the resulting expression and translate the final logical expression back into English. • p: the applicant has written permission from his parents • e: the applicant is at least 18 years old • s: the applicant is at least 16 years old (a) The applicant has written permission from his parents and is at least 16 years old. (b) The applicant has written permission from his parents or is at least 18 years old. Feedback?

Expert Answer

---

Answer to do A Do B Do A and B…

Use Two Transfer Function Matlab Ve Written Code Correct Isn T Please Help Ne Write New Ma Q43834468

Inother to use the two transfer function on Matlab. I’ve written thiscode. Is it correct. and if it isn’t please help ne write a newmathlab code.Thank you

This is the formulas for finding response. The two transfer functions will be calculated as follows: = ((SB_+ Kxs) (K. + M52 +.5))/(M2,54M + (M. Bus + B, M, + M, B,) S8 + (Kus M, + KM, + Bus B. + M, K) 32 + (Bus K 1 Kus B) S+ks k.) = (s Bus B. + (Bus K.+Kus B.) S+Kus<)/ (MU, SAM+ (M. Bus + BME + M, B.) 5* + (KM, + KM + Bus B. + M., K) 52 + (Bus K + K5B) S sale all clear all ks – 900;% Suspension Stiffness (N/m) kt – 2500; kus – kt; Tire stiffness. (N/m) ms – 2.45;% Sprung Mass (kg) mu – 1; + Unsprung. Mass (kg) mus – mu; Unsprung. Mass (kg) bs. – 7.5;% Suspension Inherent Damping coefficient (ses/m) bus – 5; # Tire Inherent Damping coefficient (sec/m) s – tf.([1,0], [1]); ((s bus+kus) (ks+ms *s*2+bss))/(mus*s*4*ms+ (ms bus+bs *ms+mus *bs) *s3+ (kus*ms+ksms+bus *bs+mus*ks) *^2+ (bus *ks+kus *bs) *s+kusks) (5^2* bus bs+ (bus*ks+kus bs) s+kus*ks) / (mus*s*4*ms+ (ms bus+bs*ms+mus bs) *s3+ (kus*ms+ks *ms+bus*bs+mus*ks) ‘s ^2+(bus*ks+kus bs) *s+kus*ks) damp.(zu) damp.(2) Show transcribed image text This is the formulas for finding response. The two transfer functions will be calculated as follows: = ((SB_+ Kxs) (K. + M52 +.5))/(M2,54M + (M. Bus + B, M, + M, B,) S8 + (Kus M, + KM, + Bus B. + M, K) 32 + (Bus K 1 Kus B) S+ks k.) = (s Bus B. + (Bus K.+Kus B.) S+Kus

Expert Answer

---

Answer to In other to use the two transfer function on Matlab. I’ve written this code. Is it correct. and if it isn’t please help …