Answer:

**Answer:**

#include<iostream>

using namespace std;

//create the function which add two number

void addTwoNumber(int num_1,int num_2)

{

int result = num_1 + num_2; //adding

cout<<"The output is:"<<result<<endl; //display on the screen

}

//main function

int main(){

//calling the function

addTwoNumber(3,6);

return 0;

}

**Explanation:**

First, include the library iostream for using the input/output instructions.

then, create the function which adds two numbers. Its return type is void, it means the function return nothing and the function takes two integer parameters.

then, use the addition operation '+' in the programming to add the numbers and store the result in the variable and display the result.

create the main function for testing the function.

call the function with two arguments 3 and 6.

then, the program copies the argument value into the define function parameters and then the program start executing the function.

Using for loop . Input an integer and identify whether it's EVEN OR ODD ( without using modulo operator )using only . C++ programming

Write an if statement that assigns 100 to x when y is equal to 0.

Describe how a web browser and web server work together to send a web page to a user

Make a program that asks for input from the user, apply eval to this input, and print out the type of the resulting object and its value. Test the program by providing five types of input: an integer, a real number, a complex number, a list, and a tuple.

6 things you should consider when planning a PowerPoint Presentation.

Write an if statement that assigns 100 to x when y is equal to 0.

Describe how a web browser and web server work together to send a web page to a user

Make a program that asks for input from the user, apply eval to this input, and print out the type of the resulting object and its value. Test the program by providing five types of input: an integer, a real number, a complex number, a list, and a tuple.

6 things you should consider when planning a PowerPoint Presentation.

example to help you. The algorithm that you will write should be in everyday language

(no pseudocode or programming language). Write your instructions at the bottom of the

page.

Example: 1. Move

the orange box 2

spaces to the right.

2. Move the green

box one space

down. 3. Move the

green box two

spaces to the left.

Write your instructions. Review the rubric to check your final work.

Rules: All 6 colors (red, green, yellow, pink, blue, purple) must be move to their new location on the grid. Block spaces are

barriers. You cannot move through them or on them – you must move around them

**Answer:**

**Explanation:**

Pink: Down 5 then left 2.

Yellow: Left 3 and down 2.

Green: Right 7, down 4 and left 1.

Purple: Up 6 and left 9.

Red: Left 7, down 5 and left 1.

You can do the last one, blue :)

**Answer:**

**Explanation:**

u=up, d=down, r=right, l=left

yellow: l3d2

pink: d5l2

green: r7d4l1

purple: u6l9

red: l7d5l1

blue: r2u7l5

**Answer:**

c. 27

**Explanation:**

- In recursion method, a method calls itself until a condition becomes true and returned back. In mystery(), at first time, first is 0 and last is 4. Condition is checked and 0!=4 so else part is executed in which again mystery is called with first as 1 and last 4. This will go again and again until first=4.
- When first=4 it is also equal to last so if part is executed and alpha[4] is returned which is 9, now it comes alpha[3] +9 which is 8+9 =17 .
- It is returning values to its previous calls that is why it will reduce to alpha[0]+alpha[1]+alpha[2]+17 which is nothing but sum of all elements of a alpha
- Then, 1+4+5+8+9=27.

**Answer:**

// Here is code in C.

#include "stdio.h"

// create function to print all the combinations

void print_combi(char a,char b,char c)

{

// print all combinations of three characters

printf("%c%c%c %c%c%c %c%c%c %c%c%c %c%c%c %c%c%c\n",a,b,c,a,c,b,b,a,c,b,c,a,c,a,b,c,b,a);

}

// driver function

int main(void)

{

// create 3 char variable and initialize

char a='x',b='y',c='z';

// call the function

print_combi(a,b,c);

printf("\n");

// initialize with different character

a='1',b='2',c='3';

// call the function

print_combi(a,b,c);

printf("\n");

// initialize with different character

a='#',b='$',c='%';

// call the function

print_combi(a,b,c);

printf("\n");

return 0;

}

**Explanation:**

Create three char variables a, b, c. First initialize them with x, y, z. then call the function print_combi() with three parameters . this function will print all the combinations of those characters.We can test the function with different values of all the three char variables.

**Output:**

**xyz xzy yxz yzx zxy zyx**

**123 132 213 231 312 321**

**#$% #%$ $#% $%# %#$ %$#**

**A C program to find all combinations of character variables:**

void main ()

{

char f;

char s;

char t;

f = 'x';

s = 'y';

t = 'z';

System.out.print("" + f + s + t + " " + f + t + s + " " + s +f + t +

" " + s + t + f + " " + t + f + s + " " + t + s + f);

}

}

**Answer:**

**Following are the statement in the c++ language **

ifstream inFile; // declared a variable inFile

ofstream outFile;//declared a variable outFile

**Explanation:**

The ifstream and ofstream is the file stream object in the c++ Programming language .The ifstream file stream object is used for reading the contents from the file whereas the ofstream file stream object is used for writting the contents into the file.

- We can create the variable for the ifstream and ofstream These variable is used for reading and writing into the File.

- Following are the syntax to create the ifstream variable and ofstream variable

ifstream variablename;

ofstream variablename

**Answer:**

Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit. Greedy algorithms are used for optimization problems. An optimization problem can be solved using Greedy if the problem has the following property: At every step, we can make a choice that looks best at the moment, and we get the optimal solution of the complete problem.

If a Greedy Algorithm can solve a problem, then it generally becomes the best method to solve that problem as the Greedy algorithms are in general more efficient than other techniques like Dynamic Programming. But Greedy algorithms cannot always be applied. For example, the Fractional Knapsack problem (See this) can be solved using Greedy, but 0-1 Knapsack cannot be solved using Greedy.

The following are some standard algorithms that are Greedy algorithms.

1) Kruskal’s Minimum Spanning Tree (MST): In Kruskal’s algorithm, we create an MST by picking edges one by one. The Greedy Choice is to pick the smallest weight edge that doesn’t cause a cycle in the MST constructed so far.

2) Prim’s Minimum Spanning Tree: In Prim’s algorithm also, we create an MST by picking edges one by one. We maintain two sets: a set of the vertices already included in MST and the set of the vertices not yet included. The Greedy Choice is to pick the smallest weight edge that connects the two sets.

3) Dijkstra’s Shortest Path: Dijkstra’s algorithm is very similar to Prim’s algorithm. The shortest-path tree is built up, edge by edge. We maintain two sets: a set of the vertices already included in the tree and the set of the vertices not yet included. The Greedy Choice is to pick the edge that connects the two sets and is on the smallest weight path from source to the set that contains not yet included vertices.

4) Huffman Coding: Huffman Coding is a loss-less compression technique. It assigns variable-length bit codes to different characters. The Greedy Choice is to assign the least bit length code to the most frequent character. The greedy algorithms are sometimes also used to get an approximation for Hard optimization problems. For example, the Traveling Salesman Problem is an NP-Hard problem. A Greedy choice for this problem is to pick the nearest unvisited city from the current city at every step. These solutions don’t always produce the best optimal solution but can be used to get an approximately optimal solution.

class

object

abstract class

**Answer:**

Operation the correct answer for the given question.

**Explanation:**

An operation is a template that is used as a template parameter .An operation defined the services and behaviors of the class .The operation is directly invoked on instance .

Attribute define the property of an entity it is not defined the services and behaviors of the class. so this option is incorrect.

Class is the class of variable of method it is not defined the services and behaviors of the class so this option is incorrect.

Object are the rub time entity .object are used access the property of a class it is not defined the services and behaviors of the class so this option is incorrect.

Abstract class is the class which have not full implementation of all the method .it is not defined the services and behaviors of the class so this option is incorrect.

So the correct answer is operation.