Assignment Questions

Question & Answer: I need your help on this weeks Java programming task. Below is the task for this week can you please help me with th…..

I need your help on this weeks Java programming task. Below is the task for this week can you please help me with this? I have one more task afte this one, and I’ll be finaly done with all my task.. The book for the class is Introduction to Java Programming, Comprehensive Version Y. Daniel Liang & Prentice Hall 11th Edition / 2018. We are currently working in Chapter 13. but this task covers all learned from week 1 through week 13. I would like to thank everyone that works for Chegg, if it were not for you guys I would not have passed this class. Thank you

Task for this week Write a program that will compile a list of instruments from different instrument families. A family of musical Instruments is a grouping of several different but related sizes or types of instruments. Ref: https://en.wikipedia.org/wiki/Family_(musical_instruments) Some commonly recognized families are:

Brass Family – A brass instrument is a musical instrument that produces sound by sympatheticvibration of air in a tubular resonator in sympathy with the vibration of the player’s lips.

Ref: https://en.wikipedia.org/wiki/Brass_instrument

Strings Family – String instruments, stringed instruments, or chordophones are musicalinstruments that produce sound from vibrating strings.

Ref: https://en.wikipedia.org/wiki/String_instrument

Woodwind Family – Woodwind instruments are a family of musical instruments within the moregeneral category of wind instruments. There are two main types of woodwind instruments:flutes and reed instruments (otherwise called reed pipes). What differentiates theseinstruments from other wind instruments is the way in which they produce their sound.

Ref: https://en.wikipedia.org/wiki/Woodwind_instrument

Percussion Family – A percussion instrument is a musical instrument that is sounded by beingstruck or scraped by a beater (including attached or enclosed beaters or rattles); struck, scrapedor rubbed by hand; or struck against another similar instrument.

Ref: https://en.wikipedia.org/wiki/Percussion_instrument

Constraints

Limit the number of families to the list aboveUse one separate (external to the main class) abstractsuper class: InstrumentUse three separate (external to the main class) abstract subclasses that extend Instrument:oBlownInstrumentoFingeredoStruckUse four separate (external to the main class) subclasses (families) that extend the appropriate three aboveoBrassoStringsoWoodwindoPercussion

Requirements

Display the menu shown in the example output belowRequest the number of instruments to be enteredAll instruments should be placed into an array (you can use one array per family or one array for all entered) so they may be displayedUse set and get methods where appropriateImplement a loop that will allow the user to enter more instrumentsUse exception handling and validation where appropriateThis assignment will use coding principles learned from week 1 through 13

Hints

Make sure you use Java coding conventions

Expected Output

Below is a sample run where instruments are entered for each family. User input is in BOLD

Select one of the following instrument families:

1.Brass

2.String

3.Woodwind

4.Percussion

5.Display all instruments

6.Exit

->: 1

How many brass instruments would you like to enter? ->: 3

Enter instrument #1->: bugle

Enter instrument #2->: trumpet

Enter instrument #3->: tuba

Display instruments?

(Y for Yes, N for No)->: n

Enter more instruments?

(Y for Yes, N for No)->: y

1.Brass

2.String

3.Woodwind

4.Percussion

5.Display all instruments

6.Exit

->: 2

How many string instruments would you like to enter? ->: 2

Enter instrument #1->: guitar

Enter instrument #2->: harp

Display instruments?

(Y for Yes, N for No)->: n

Enter more instruments?

(Y for Yes, N for No)->: y

1.Brass

2.String

3.Woodwind

4.Percussion

5.Display all instruments

6.Exit

->: 3

How many wood wind instruments would you like to enter? ->: 2

Enter instrument #1->: clarinet

Enter instrument #2->: oboe

Display instruments?

(Y for Yes, N for No)->: n

Enter more instruments?

(Y for Yes, N for No)->: y

1.Brass

2.String

3.Woodwind

4.Percussion

5.Display all instruments

6.Exit

->: 4

How many percussion instruments would you like to enter? ->: 2

Enter instrument #1->: drum

Enter instrument #2->: marimba

Display instruments?

(Y for Yes, N for No)->: n

Enter more instruments?

(Y for Yes, N for No)->: y

1.Brass

2.String

3.Woodwind

4.Percussion

5.Display all instruments

6.Exit

->: 5

The bugle is a brass instrument and is played by mouth.

The trumpet is a brass instrument and is played by mouth.

The tuba is a brass instrument and is played by mouth.

The clarinet is a woodwind instrument and is played by mouth.

The oboe is a woodwind instrument and is played by mouth.

The guitar is a string instrument and is played with fingers.

The harp is a string instrument and is played with fingers.

The drum is a percussion instrument and is struck.

The marimba is a percussion instrument and is struck.

Enter more instruments?

(Y for Yes, N for No)->: n

Goodbye

Expert Answer

 

package display_music_array;

import java.util.Scanner;

Read more

Question & Answer: Compare a VR or AR technology from the 60’s-70’s with a technology from the 90’s-00’s. Hav…..

Compare a VR or AR technology from the 60’s-70’s with a technology from the 90’s-00’s. Have individual’s expectations for the use of these types of technologies changed? Why or why not?

Expert Answer

 

Comparison between Vi

Read more

Question & Answer: All code must be written using C++ programming language……

All code must be written using C++ programming language.

You will construct a class that defines a parser. This parser will be able to break up a string into tokens. A token is a distinct string of text – it can be a word, a symbol, or a combination of these. Your parser will eliminate whitespace and break string snippets into individual tokens (where single-character tokens are defined at runtime).

Your parser should behave as follows:

1) Whitespace (spaces, tabs, and new lines) is used only to separate tokens – otherwise, it is ignored.
2) Most tokens are made up of strings of text separated punctuation and other symbols.
3) In addition, single-character tokens (punctuation and/or other symbols) may be defined.

The parser should treat symbols like any other text character. The default behavior will that all characters not separated by whitespace will be part of the same token. However, the parser will provide several functions that will allow the user to define additional, single-character symbols as token as well.

Target Output:

Input strings
————-
[{Oh what a loon() I am! Don’t you agree?}]
[I’ll sing “Amazing Grace” for $5.
Please call1 the #867-5309.]

Output Delimiting/Parsing by Whitespace only:
—————
[ {Oh what a loon() I am! Don’t you agree?} ]
[ I’ll sing “Amazing Grace” for $5. Please call1 the #867-5309. ]

Output Delimiting/Parsing by Block markers:
————–
[ { Oh what a loon ( ) I am! Don’t you agree? } ]
[ I’ll sing ” Amazing Grace ” for $5. Please call1 the #867-5309. ]

Output Delimiting/Parsing by Punctuation added:
——————
[ { Oh what a loon ( ) I am ! Don ‘ t you agree ? } ]
[ I ‘ ll sing ” Amazing Grace ” for $5 . Please call1 the #867-5309 . ]

Output Delimiting/Parsing by Symbols added:
————–
[ { Oh what a loon ( ) I am ! Don ‘ t you agree ? } ]
[ I ‘ ll sing ” Amazing Grace ” for $ 5 . Please call1 the # 867 – 5309 . ]

Expert Answer

 

//TokenParser.h
//Include the needed header files

Read more

Question & Answer: Perform research beyond the textbook to identify metrics that can be used to determine issues with network congest…..

Perform research beyond the textbook to identify metrics that can be used to determine issues with network congestion or bottlenecking of data on a network. Then in your own words, identify how these metrics can be used to diagnosis and resolve network congestion.

Expert Answer

 

Network congestion:

In computer networking and queuing theory reduced s

Read more

Question & Answer: Assessment item 1…..

Assessment item 1
Project Management Methodologies
Value: 5%
Due date: 11-Aug-2017
Return date: 01-Sep-2017
Submission method options
Alternative submission method
Task
In topics 1 & 2 you have been introduced to various project methodologies and processes. In 700 words, demonstrate your knowledge of these.

Ensure you address the following areas:
1. Define what a methodology is and the role it serves in project management.
2. Familiarise yourselves with the various methodologies in the list below. Choose two methodologies from this list to compare and contrast, analysing the similarities and differences between them both.
3. Finally, identify how your chosen methodologies and processes relate to the project life cycle (PLC):

List of project methodologies and processes
• Project Management Body of Knowledge (PMBOK)
• PRINCE2
• SDLC
• Waterfall
• Agile

Rationale
In this assessment you will be covering the following learning outcomes as outlined in the MSI:

be able to identify, critically analyse, reflect on and synthesise the key elements of the IT project management framework, including project stakeholders, communication management, the project management knowledge areas, common tools and techniques, and project success factors;

Marking criteria
Criterion High Distinction Distinction Credit Pass Fail
Provides a definition of a project methodology.

(10 marks) Explains and critically evaluates the definition of a project methodology using language, detailed judgement and evaluation of sources. Explains and analyses the definition of a project methodology using their own words, reinforced with a range of informed opinions Explains and examines the definition of a project methodology using their own words and a range of terminology. Explains and discusses the definition of a project methodology in their own words and using appropriate language. An extremely basic explanation of the definition of a project methodology, and the answer is expressed poorly or not in own words.
Provides an explanation of the role project methodology plays in relation to project management.

(20 Marks) Explains and critically evaluates the role of project methodology and the relationship to project management. Explains and analyses the role project methodology plays in relation to project managemen. Explains and examines role project methodology plays in relation to project management. Explains and discusses the role of project methodology in relation to project management. An extremely basic explanation of the role of project methodology.
Two selected methodologies are compared and contrasted.

(20 Marks) Explains and critically evaluates the comparisons and contrasts between two selected methodologies. Explains and analyses the comparisons and contrasts between two selected methodologies Explains and examines the comparisons and contrasts between two selected methodologies. Explains and discusses the comparisons and contrasts between two selected methodologies. An extremely basic explanation of the comparisons and contrasts between two selected methodologies.
The similarities and differences between the methodologies are provided.

(20 Marks) Explains and critically evaluates the similarities and differences between the methodologies chosen. Explains and analyses the similarities and differences between the methodologies chosen Explains and examines the similarities and differences between the methodologies chosen. Explains and discusses the similarities and differences between the methodologies chosen. An extremely basic explanation of the similarities and differences between the methodologies chosen.
Methodologies are related to the project life cycle.

(20 Marks) Explains and critically evaluates the methodologies related to the project life cycle. Explains and analyses the methodologies related to the project life cycle. Explains and examines the methodologies related to the project life cycle. Explains and discusses the methodologies related to the project life cycle. An extremely basic explanation of the methodologies related to the project life cycle.
Correct referencing of sources (APA 6th ed citation) to reinforce findings.

(10 Marks) The sources are valid and are derived from wide range of resources. They are all correctly sourced and presented. The sources are commendable and are all correctly sourced and presented. The sources are adequate and largely correctly sourced, and presented. The sources are adequate and largely correctly sourced, and presented. The sources are extremely limited and incorrectly sourced.

Expert Answer

Read more

Question & Answer: Solve the recurrence relation USING BACK SUBTITUTION OR RECURRENCE TREE : T(n) = T(n/2) + n 3 . T(1)=1…..

Solve the recurrence relation USING BACK SUBTITUTION OR RECURRENCE TREE : T(n) = T(n/2) + n 3 . T(1)=1

Expert Answer

 

Solution :

Read more

Question & Answer: s are clogged with the dozens of spam email messages they receive each…..

Introduction

Jee-mail, a small email service provider, has been receiving complaints from customers claiming that their inboxes are clogged with the dozens of spam email messages they receive each day. Consequently, Jee-mail has contracted with the Fruggle Corporation to design and build a spam detection system. Of course, since Fruggle gets all of its labor by exploiting El Camino students, you’ll be doing all of the programming.

Given one or more email messages, your program will have to classify each one as either spam or legitimate. Jee-mail wants you to build a point-based anti-spam system. Your program is to look for certain suspicious features in the email, such as frequent use of exclamation points (!), use of words like FREE, or excessive use of uppercase letters. Each time such a suspicious feature is found, you increase a score that indicates how suspicious an email is. If an email’s score exceeds 100 points, then it is classified as spam; otherwise, it is deemed legitimate. The detailed rules for scoring a message are in the Spam Rules section below.

Sample Transcript

Here is a sample transcript of the program, with boldface text representing the user’s input.

Enter the subject line of the email: MAKE MONEY FAST XTFWAQQQ
Enter the body of the email.  Press Enter on an empty line to finish.
THIS IS YOUR CHANCE TO MAKE lots of moolah!
CLICK ON www.lotsofmoolah.com FOR MORE INFORMATION!
        ← the user just hit the enter key on this line
This email is classified as spam, because its spam score is 115.
Would you like to classify another email (y or n)? Quit
Please enter y or n.
Would you like to classify another email (y or n)? Y
Please enter y or n.
Would you like to classify another email (y or n)? y
Enter the subject line of the email: hi mom
Enter the body of the email.  Press Enter on an empty line to finish.
Hi mom,
I hope you're doing OK.  My CS class is great, but the instructor is WEIRD!
I love you!
        ← the user just hit the enter key on this line
This email is classified as legitimate, because its spam score is 0.
Would you like to classify another email (y or n)? n

Number of spam messages: 1
Number of legitimate messages: 1

Input and Output Specification

The first line that your program must print out is exactly this (with one space after the colon):

Enter the subject line of the email:

Your program must then read the subject line the user types in. (It is not an error if the subject line is the empty string.) After that, your program must print out exactly this line:

Enter the body of the email.  Press Enter on an empty line to finish.

Your program must then read the message body lines the user types in. The message body consists of zero or more lines. After your program reads an empty line, which indicates the end of the message, it must print out exactly one of these two messages, depending on whether applying the spam rules classified the message as spam or not:

This email is classified as spam, because its spam score is number.

or

This email is classified as legitimate, because its spam score is number.

In these messages, number is to be replaced by the appropriate spam score, such as 115, or 0, or 5.

After printing the classification message, your program must print exactly this (with one space after the question mark):

Would you like to classify another email (y or n)?

Your program must then read the line the user types in. If the user types only a lowercase y, the program must process another email, starting with the step where it prints the prompt for the subject line of the email.

If instead, the user types only a lowercase n, the program must print an empty line, then print the following two lines, then terminate:

Number of spam messages: number
Number of legitimate messages: number

In these messages, the first number is the number of messages that were classified as spam, and the second is the number that were classified as legitimate.

If the user types anything other than a single lowercase y or n in response to the question, the program must print out exactly the line:

Please enter y or n.

and repeat the prompt about classifying another email. It must repeatedly prompt the user until y or n is selected.

Spam Rules

The Jee-mail spam experts have come up with five rules, each of which can contribute some points to the spam score of a message. If the total spam score for the message is more than 100, the message is classified as spam; otherwise, it is considered a legitimate message. You must use only these five rules; do not improvise and make up your own. (Save that for when you start your own competing spam filter company.)

First, some definitions: a word in a string is a contiguous sequence of letters delimited either by non-letter characters or by the start or the end of the string. A letter may be upper- or lowercase. As an example, the string It’s like the old-fashioned 1980s! has these seven words:  It s like the old fashioned s. A consonant is a letter other than one of these ten: aeiouAEIOU.

Here are the five rules. The first three relate to the subject line of the email, while the last two are concerned with the body of the message.

If the subject line has at least one word, and more than 90% of the words in the subject line consist of only uppercase letters, then add 30 points to the spam score. For example, a subject line of

GET A DIPLOMA FREE!!

meets this criterion.

If the last word of the subject line contains more than 3 consecutive consonants, then add 40 points to the spam score. Spammers often place random words at the end of a subject line to confuse some anti-spam software; this rules detects many of those random words. For example, this subject line earns the 40 point addition to the score:

This stock is going up, up, up!  mqafrpxo!

If the subject line contains 3 or more contiguous exclamation points, then add 20 points to the spam score. This subject line qualifies for the 20 points, for example:

Make money fast!!!  No experience necessary!!!!!

If the body of the message has at least one word, and more than 50% of the words making up the body of the email consist entirely of uppercase letters, then add 40 points to the score. For example, this email:

Subject:  Greetings from your good friend
Body:
        THIS IS YOUR CHANCE TO MAKE lots of moolah!
        GO TO www.lotsofmoolah.com FOR MORE INFORMATION!

earns the 40 points because there are 17 words in the body of the email, 11 of which (64.7%) are entirely uppercase.

Each time one of the following special words is found in the body of the email, add 5 points to the spam score for that message. The letters in these words may be in either case (e.g., SeX is the same as sex):

buy
cheap
click
diploma
enlarge
free
lonely
money
now
offer
only
pills
sex

For example, this message would score 35 points, 5 for each of the words indicated in boldface:

Subject:  Looking for cheap tickets?
Body:
        You can find cheap! tickets ONLY on our website.  Save money with this
        great OfFeR!!  Don't be a cheapskate.  Click now for this offer!

Notice that the “cheap” in the subject line is ignored by this rule, as is the word “cheapskate” in the second line of the body.

Functions You Must Write

We know that this will be the most complex program that many of you will have written in your programming careers to date, so we will make it easier for you by decomposing the problem for you.

To get full credit for this project, you must implement all of the following functions, using the exact function names, parameters types, and return types shown in this specification. The functions must not use any global variables whose values may change. (Global constants are all right.) In addition to testing your program as a whole, we will also test each of the following functions separately. That way, if your program doesn’t work overall but you correctly implemented some of the functions, you’ll still get some credit.

The functions you must implement are

        getFirstWord
        getLastWord
        extractWord
        isUppercase
        makeUppercase
        hasMultipleExclamations
        isGibberishWord

Your solution should use these functions where appropriate (although you might not use every one of them). One reason is to help you get partial credit in the case where most of your program is correct, but a few of the function implementations are incorrect.

To help you implement these functions, you might choose to write additional functions as well. While we won’t test those additional functions separately, using them may help you structure your program more readably. If you find it helpful, you might have some of these seven required functions call other functions in that list.

When you turn in your solution, none of these seven required functions, nor any functions that they call, may read any input from cin or write any output to cout. (Of course, during development, you may have them write whatever you like to help you debug.) If you want to print things out for debugging purposes, write to cerr instead of cout.  cerr is the standard error destination; items written to it by default go to the screen. When we test your program, we will cause everything written to cerr to be discarded instead — we will never see that output, so you may leave those debugging output statements in your program if you wish.

string getFirstWord(string text)

This function returns the first word in the string variable text. If text has no words, this function returns the empty string (i.e. “”). Here is an incomplete test driver for this function:

        void test()
        {
              // This writes "Hello"
            cerr << getFirstWord("!!Hello, Fred") << endl;

              // This writes "greetings 9"
            string msg = "greetings, mom, how are you?";
            string result = getFirstWord(msg);
            cerr << result << " " << result.size() << endl;

              // This writes "0"
            string s = getFirstWord(" $@#%!!");
            cerr << s.size() << endl;
        }

Hint: The string substr function may be of use in the implementation of this function.

string getLastWord(string text)

This function returns the last word in the string variable text. If text has no words, this function returns the empty string (i.e. “”). As an example, getLastWord(“MAKE MONEY FAST!!”) returns “FAST”.

Hint: The string substr function may be of use in the implementation of this function.

string extractWord(string& text)

This function returns the first word in the string that text is a reference to. If that string has no words, this function returns the empty string.

This function also modifies the string that text refers to. If that string has no words, then this function sets text to the empty string. Otherwise, it removes from text the first word of text and all non-letters preceding that first word. Here is an incomplete test driver:

        void test()
        {
            string s = "***AMAZING!*** Do it, now!!";
            string w = extractWord(s);
              // This writes "AMAZING" and "!*** Do it, now!!"
            cerr << w << endl << s << endl;

            w = extractWord(s);
              // This writes "Do" and " it, now!!" (space before "it")
            cerr << w << endl << s << endl;

            w = extractWord(s);
              // This writes "it" and ", now!!"
            cerr << w << endl << s << endl;

            w = extractWord(s);
              // This writes "now" and "!!"
            cerr << w << endl << s << endl;

            w = extractWord(s);
              // This writes "" and "" (both empty strings)
            cerr << w << endl << s << endl;
        }

Hint: The string substr function may be of use in the implementation of this function.

bool isUppercase(string text)

This function returns true if and only if every letter in the string text is uppercase. (For a string with no letters, this means the function returns true.) Non-letter characters in the string text, if any, have no effect on the result of this function.

string makeUppercase(string text)

This function returns a new string identical to the value of the string text, except that each lowercase letter of text appears as its uppercase equivalent in the result string. For example, makeUppercase(“Earn *big* MONEY at home!!”) returns “EARN *BIG* MONEY AT HOME!!”.

bool hasMultipleExclamations(string text)

This function returns true if and only if the string text contains three consecutive exclamation marks. For example, it returns true for the strings “Wow!!!” and “Congrats!!!! Good luck”, and false for the strings”W!I!N!” and “!! !”.

bool isGibberishWord(string text)

This function returns true if and only if the string text contains more than three consecutive consonants. For example, it returns true for the strings “AGPQrxab” and “xxxxozzzz”, and false for the strings “mortgage” and “discount prescriptions”.

Programming Guidelines

The correctness of your program must not depend on undefined program behavior. Your program must never access out of range positions in a string.

You must use your best programming style, including commenting where appropriate. Be sure that your program builds successfully, and try to ensure that your functions do something reasonable for at least a few test cases. That way, you can get some partial credit for a solution that does not meet the entire specification. To test your program effectively, you should unit test each of your functions individually, and system test your entire program to ensure that all of the functions work together as expected.

One way to organize your program so that you can easily switch between testing individual functions and running the whole program normally is to do something like this:

        const bool unitTesting = true;

        int main()
        {
            if (unitTesting)
            {
                doUnitsTests();
                return 0;
            }
            …  // code for the normal behavior goes here
        }

The doUnitTests function does all your unit tests. To test the whole program normally, just change the value of the unitTesting variable from true to false (and make sure it’s false when you turn in the program).

There are a number of ways you might write doUnitTests. One way is to interactively accept test strings:

        void doUnitTests()
        {
            string s;
            for (;;)
            {
                cerr << "Enter text: ";
                getline(cin, s);
                if (s == "quit")
                    break;
                cerr << "isUppercase returns ";
                if (isUppercase(s))
                    cerr << "true" << endl;
                else
                    cerr << "false" << endl;
                cerr << "getFirstWord returns ";
                cerr << getFirstWord(s) << endl;
            }
        }

While this is flexible, you run the risk of not being able to reproduce all your test cases if you make a change to your code and want to test that you didn’t break anything that used to work.

Another way is to hard-code various tests and report which ones the program passes:

        void doUnitTests()
        {
            if (getFirstWord("hello there") == "hello")
                cerr << "Passed test 1: getFirstWord("hello there") == "hello")" << endl;
            if (!isUppercase("WoW"))
                cerr << "Passed test 2: !isUppercase("WoW")" << endl;
            …
        }

This can get rather tedious. Fortunately, the library has a facility to make this easier: assert. If you include the header <cassert> you can call assert in the following manner:

        assert(some boolean expression);

During execution, if the expression is true, nothing happens and execution continues normally; if it is false, a diagnostic message is written telling you the text and location of the failed assertion, and the program is terminated. As an example, here’s a very incomplete set of tests:

        #include <cassert>

        …

        void doUnitTests()
        {
            assert(getFirstWord("hello there") == "hello");
            assert( isUppercase("WOW!!") );
            assert( !isUppercase("WoW!!") );
            string s = "***hello there";
            assert( extractWord(s) == "hello"  &&  s == " there" );
            assert( extractWord(s) == "there"  &&  s == "" );
            assert( extractWord(s) == ""  &&  s == "" );
            …
            cerr << "All tests succeeded" << endl;
        }

The reason for writing one line of output at the end is to ensure that you can distinguish the situation of all tests succeeding from the case where one function you’re testing silently crashes the program.

Expert Answer

 

//main.cpp

#include <iostream>

Read more

Question & Answer: ers (each bit of these registers) using PIC 16F1829 datasheet. ·…..

1. Clearly explain these registers (each bit of these registers) using PIC 16F1829 datasheet. ·

TRISA or TRISB or TRISC

· LATC

· OSCCON

· OPTION_REG

· INTCON

· ANSELA

· IOCAF

· IOCAN

· ADCON0

· ADRESH

Expert Answer

Read more

Question & Answer: Compare the following two methods for sending a message using AES session key s and private key of Alice. D…..

6. Compare the following two methods for sending a message using AES session key s and private key of Alice. Does one method has advantage over the other. Justify for credit. Em, time, rand EP( h(m)) i Exss a(m) Enl h(m), time, rand

Compare the following two methods for sending a message using AES session key s and private key of Alice. Does one method has advantage over the other. Justify for credit. i. E_AES-s(m time, rand) E_Pr_A(h(m)) ii. E_AES-s (m) E_Pr_A(h(m), time, rand)

Expert Answer

 

ANSWER::

Read more

Question & Answer: IEnumerable interface ICIonable interface [SeriaIizable] attribute ISerializable interface…..

computer Science C#

Question 29 For an object to be Serialilzed/Deseralized it must have an/a IEnumerable interface IClonable interface (Serializable] attribute u.instructure.com/courses/437443/quizzes/822471/take Quiz: Final Exam ISerializable interface 0 [Clonablel attribute Question 30 A delegate variable may be declared using the following syntax. O delegate void MDel(int iv,double dv) Predicatecint> MDel; delegate (nt xretum xo2:) O Action<int,double> MDel All of the Above None of the Above

For an object to be Serialilzed/Deseralized it must have an/a IEnumerable interface ICIonable interface [SeriaIizable] attribute ISerializable interface [Clonable] attribute A delegate variable may be declared using the following syntax. delegate void MDel (int iv, double dv): Predicate MDel: delegate (int x) {return x > 2;} Action MDel: All of the Above None of the Above

Expert Answer

Read more
Still stressed from student homework?
Get quality assistance from academic writers!