Which of the following statements isNOT true about abstract data types (ADTs)?A list is anexample of an ADT.ADTs hide theimplementation details of operations from users.Java provides allthe ADTs you need, therefore you do not need to create any newones.An ADT is anabstraction of a commonly appearing data structure.

Answer: True

Explanation: Direct recursion is the process when a function call for itself and indirect recursion is the recursion process where a function calls another function and the result driven is the actual function . The aim of both the recursion process to provide with appropriate result by calling function so this declares that both the process indirect and direct recursion requite same careful analysis .

C++ program - Insertion sort

#include <bits/stdc++.h>  

using namespace std;  

/* Defining function for sorting numbers*/

void insertionSort(int array[], int n)  

{  

   int i, k, a;  

  for(i=1;i<n;i++)

           {

              k=array[i];

               a=i-1;

            while(a>=0 && array[a] > k) // moving elements of array[0 to i-1] are greater than k, to one position //

                      {

                       array[a+1] = array[a];

                        a =a-1;

                      }

              array[a+1] =k;

             }  

}              

/* Driver function */

int main()  

{  

   int array[] = { 12,56,76,43,21};   //input integers

   int n = sizeof(array) / sizeof(array[0]);   //finding size of array

   insertionSort(array, n);   //Calling function

    for (int i = 0; i < n; i++)   //printing sorted array

        cout << array[i] << " ";  

    cout << endl;  

    return 0;  

}  

Answer:

The first graph in the picture describes a relation that is (a) Reflexive, transitive, and anti-symmetric.

Because a, b, c, d all are related to itself, so reflexive.

where (a, b) and (b, d) are in the relation, (a,d) is in the relation,    

for (c,a) and (a,b) there is (c,b).

so it's transitive.

for all a,b in the relation, (a,b) there is no (b,a) with a ≠b.

The second graph in the picture describes a relation that is (b) Reflexive, transitive, and neither symmetric nor anti-symmetric.

Because a, b, c, d all are related to itself, so reflexive.

where (a, b) and (b, a) are in the relation, (a,a) is in the relation,                                                    

where (c, d) and (d, d) are in the relation, (c,d) is in the relation,                                                    

so it's transitive.

Because, (a,b) and (b.a) are there, but for (c,d) there is no (d,c) in relation.

So, the relation is not symmetric.

(a,b) and (b,a) is in relation but, a≠b, so not anti symmetric.

Explanation:

For all a in a set,  if (a,a) in a relation then the relation is reflexive.

For all (a,b) in relation R, if (b,a) is also in R, then R is symmetric.

For all (a,b), (b,c) in relation R, if (a,c) is also in R, then R is transitive.

For all (a,b), (b,a) in R, a = b,  then R is an anti- symmetric relation.

Answer:

can't say without seeing more code

Explanation:

In the function calling, we pass the name of array, variable and direct value as well.

for example:

int y=3;

int x[] = {1,2,3,4};

fun(y,x);

so, we can't tell which is variable and which is array, without seeing the rest of code.

we can tell by seeing the initializing variable and function declaration or create function.

Answer:

A. Lookup

Explanation:

You would use the Lookup field to store a value from another table.

Answer:

A. vecList.erase(position)

Explanation:

Assuming vecList is a vector container, the expression vecList.erase(position) deletes all elements from the container.

Assuming vecList is a vector container, the expression vecList.erase(position) deletes all elements from the container. Thus, the correct option for this question is A.

A vector container may be defined as a type of sequence that significantly represents arrays that can change in size. They significantly utilize contiguous storage locations for their elements. This means that their elements can also be accessed using offsets on regular pointers to their elements, and just as efficiently as in arrays.

According to the context of this question, vecList.erase(position) is the tool of the vector container in order to delete all sorts of elements that have been expressed by the vector container.

Therefore, the expression vecList.erase(position) deletes all elements from the container. Thus, the correct option for this question is A.

To learn more about vector containers, refer to the link:

https://brainly.com/question/12949818

#SPJ5

Answer:

% here x and y is given which we can take as

x = 2:2:10;

y = 2:2:10;

% creating a matrix of the points

point_matrix = [x;y];

%  center point of rotation  which is 2,2 here

x_center_pt = x(2);

y_center_pt = y(2);

% creating a matrix of the center point

center_matrix = repmat([x_center_pt; y_center_pt], 1, length(x));

% rotation matrix with rotation degree which is 45 degree

rot_degree = pi/4;      

Rotate_matrix = [cos(rot_degree) -sin(rot_degree); sin(rot_degree) cos(rot_degree)];

% shifting points  for the center of rotation to be at the origin

new_matrix = point_matrix - center_matrix;  

% appling rotation  

new_matrix1 = Rotate_matrix*new_matrix;          

Explanation:

We start the program by taking vector of the point given to us and create a matrix by adding a scaler to each units with repmat at te center point which is (2,2). Then we find the rotation matrix by taking the roatational degree which is 45 given to us. After that we shift the points to the origin and then apply rotation ans store it in a new matrix called new_matrix1.

Answer: False.

Explanation:

The general case of recursive function is when the solution is obtained recursively by simplification at each step.

However, it is the base case in a recursive function when the solution is obtained directly.

The general case must be reducible to base to arrive at a solution else the recursion would be a infinite recursion.

Answer:

Cost Budgeting

Explanation:

Great question, it is always good to ask away and get rid of any doubts that you may be having.

The answer to this question is Cost Budgeting the keyword in the sentence that verifies this is "qualities". Cost Budgeting is the process of determining were to spend less money or more money, based on importance. In other words determining the which quality of product is better for the overall project activity.

I hope this answered your question. If you have any more questions feel free to ask away at Brainly.

Answer:

#include<iostream>

using namespace std;

int h(int i)

{

if(i==0 ||i==1||i==2)

 return 1;

else

 return(h(i-1)+h(i-2));

}

int main()

{

int n, result;

cout<<"Enter value for n:";

cin>>n;

result = h(n);

cout<<result;

}

Explanation:

The recurrence relation will be h(n)= h(n-1)+h(n-2), unless the recursion will not finish.

Answer:

#include <iostream>

using namespace std;

void hexadecimal(int dec)

{    

   char hexa[100];// character array to store hexadecimal number.

   int i = 0;

   while(dec!=0)

   {  

       int digit  = 0;

       digit = dec % 16;// storing remainder.

       if(digit < 10)//condition

       {

           hexa[i] = digit + 48;//storing digit according to ascii values.

           i++;

       }

       else

       {

           hexa[i] = digit + 55; //storing respective character according to ascii values..

           i++;

       }

       dec = dec/16;

   }

     cout<<"The corresponding Hexadecimal number is :- ";

   for(int j=i-1; j>=0; j--)// printing in reverse order .

       cout << hexa[j];

       cout<<endl;

}

void Binary(int dec)

{

   int bin[32];// integer array to store binary values.

   int i = 0;

   while (dec > 0) {

       bin[i] = dec % 2;// storing remainder

       dec = dec / 2;

       i++;

   }

 cout<<"The corresponding Binary number is :- ";

   for (int j = i - 1; j >= 0; j--) // printing in reverse order

       cout << bin[j];

       cout<<endl;

}

void Octal(int dec)

{

   int oct[100];// integer array to store octal values.

   int i = 0;

   while (dec != 0) {

       oct[i] = dec % 8;// storing remainder

       dec = dec / 8;

       i++;

   }

 cout<<"The corresponding Octal number is :- ";

   for (int j = i - 1; j >= 0; j--) // printing in reverse order

       cout << oct[j];

       cout<<endl;

}

int main() {

   int d,bin,oct,hex;

   cout<<"Enter decimal number"<<endl;

   cin>>d;//taking input.

   Binary(d);

   Octal(d);

   hexadecimal(d);

   return 0;

}

OUTPUT:-

Enter decimal number

10

The corresponding Binary number is :- 1010

The corresponding Octal number is :- 12

The corresponding Hexadecimal number is :- A

Enter decimal number

256

The corresponding Binary number is :- 100000000

The corresponding Octal number is :- 400

The corresponding Hexadecimal number is :- 100

Explanation:

I have built 3 function of type void Hexadecimal,Binary,Octal all the functions take decimal integer as argument.They print their respective number after conversion.

So main approach is that :-

1.Take an array to store the digit on dividing.

2.Find the remainder on dividing it by corresponding number (for ex:- if binary divide by 2).

3.Store each remainder in the array.

4.Divide the number until it becomes 0.

5.Print the array in reverse.

Answer:

#include<iostream>

using namespace std;

int main(){

   //initialization

  int arr1[10] = {2,4,6,1,7,9,0,3,5,8};

  int temp;

   int size_arr;

   //nested for loop

  for(int i=0;i<size_arr-1;i++){

   for(int j=0;j<size_arr-i-1;j++){

       if(arr1[j]>arr1[j+1]){ //compare

               //swapping

           temp = arr1[j];

           arr1[j]=arr1[j+1];

           arr1[j+1]=temp;

       }

   }

  }

  //display the each element

  for(int i=0;i<10;i++){

   cout<<arr1[i]<<" ";

  }

    return 0;

}

Explanation:

Create the main function and declare the variable and defining the array with 10 values.

take the nested for loop, nested loop means loop inside another loop.

the outer loop traverse in the array from 0 to size-1.

and inside loop traverse from 0 to size -i-1, because for every cycle of the outer loop the one element is sorted at the end. so, we do not consider the element from the last for every cycle of the outer loop. That's why (size-i-1)

In the bubble sort, the first element compares with the second element and if the first id greater than the second then swap the value. so, for the above algorithm, we take the if statement and it checks the condition if the condition becomes true then the swap algorithm executes.

we take a third variable for swapping. after that, if the outer loop condition false it means all elements will traverse and then the loop will terminate.

and finally, take another for loop and display the output.

Final answer:

The answer provides a Python program example that uses the bubble sort algorithm to sort an array of 10 integers. The program defines a function, bubble_sort, which sorts the array in ascending order and then prints the sorted array.

Explanation:

To sort an array of 10 integers using the bubble sort algorithm, you can use the following program as a reference. Bubble sort compares adjacent elements and swaps them if they are in the wrong order. Here's a basic example in Python:

def bubble_sort(arr):
   n = len(arr)
   for i in range(n):
       swapped = False
       for j in range(0, n-i-1):
           if arr[j] > arr[j+1]:
               arr[j], arr[j+1] = arr[j+1], arr[j]
               swapped = True
       if not swapped:
           break
   return arr

# Example array:
numbers = [64, 34, 25, 12, 22, 11, 90, 88, 66, 23]
sorted_numbers = bubble_sort(numbers)
print("Sorted array is:", sorted_numbers)

This program will sort the given array of integers in ascending order. The function bubble_sort takes an array as input, performs the bubble sort algorithm, and returns the sorted array.

Answer:

8 bit

Explanation:

we have given that the instruction consist 150 different operation

we know that [tex]2^{8}[/tex] = 256

but we have only 150 operation

so now we check [tex]2^{7}[/tex]=128

which is less than 150 so we need 8 bit for the opcode

so the 8 bit are needed for the opcode because when we take 7 bit then [tex]2^{7}[/tex]=128 which is less than 150 and not useful so we need 8 bit

Answer:

b. Associativity

Explanation:

Associativity specifies the order in which operators are processed vis a vis operands/values in an expression. For example: Consider the expression: a + b + c. Here a + b is evaluated first before adding the result with c as the '+' operator is left associative. The default associativity can also be overridden by the use of parentheses. For example a + (b + c) . In this case b+c will be evaluated first.

Answer:

The answer to this question is A. 0.

Explanation:

In this segment of code #define MAX 50 is used.It is a pre-processor directive and in pre processor directive it is a MACRO means whenever the compiler encounters the word MAX in the execution it replaces MAX with 50.

So the size of the array becomes 50 and the indexing starts from 0 and upto 49.

Answer: The query to delete rows for the given scenario is  

DELETE

FROM Review

WHERE Id < 100 OR Id = 100;

Explanation:

In SQL, the table can be removed using either DROP, TRUNCATE or DELETE commands.

DROP command is used to delete the whole structure of the table. The general syntax is given below.

DROP TABLE table_name;

After this command, the whole structure of the specified table will be deleted. This table will have to be created again in order to use it and put data in this table.

SELECT *

FROM table_name;

This command when executed after the DROP command, will show an error.

This command can be used to drop database objects like constraints, index and the others.

The TRUNCATE command removes all the rows from a table. The structure of the table remains intact and data can be put again in this table.

This command only removes the data currently present in the table.

The general syntax is given below.

TRUNCATE TABLE table_name;

The command below will compile but it will not return any rows.

SELECT *

FROM table_name;

Alternatively, DELETE keyword is used to drop only the rows from a given table.

The general syntax for deleting rows from a table is given below.

DELETE

FROM table_name

WHERE [condition];

The WHERE clause is optional in a DELETE query.

SELECT *

FROM table_name;

The above command will compile and return rows if rows are present in the table other than the deleted rows.

The table used in the given query is Review table. We assume that Id is the primary key for the Review table. The query becomes

DELETE

FROM Review;

The condition for this deletion is that Id should be less than or equal to 100. The final query is written as

DELETE

FROM Review

WHERE Id < 100 OR Id = 100;

True.

Update expression conditions the iterations of a for loop. Counter++ is the most basic form of use, but others like total += sales are also valid.

Hope this helps.

r3t40

Answer: Current Situation Evaluation, Improvement Planning, Improvement Implementation, Improvement Evaluation are the elements of SPI

Explanation:

SPI modle plans to achieve a desired task of software development in terms of Current Situation Evaluation, Improvement Planning, Improvement Implementation, Improvement Evaluation, with each having a specified and detailed role to play in the software development.

Answer:

red

Explanation:

public class CarTest {

public static void main(String[] argvs) {

//below line will create an object of CarTest class Object

CarTest carTest = new CarTest();

//This will call runDemo method

carTest.runDemo();

}

public void runDemo() {

//Below line will create an object of Car class  with color blue and 4 wheel

Car c = new Car("blue", 4);

//Bellow Line will change the color from blue to red, see the logic writteen in chnageColor method definition

changeColor(c, "red");

//Below line will print the color as red

System.out.println(c.getColor());

}

public void changeColor(Car car, String newColor) {

//This line will set the color as passed color in the car object

car.setColor(newColor);

}

}

Answer:

5KHz

Explanation:

The formula for calculating the output frequency when the input frequency and the number of flip-flops are given.

[tex]out put Frequency = \frac{in put frequency}{2^{N}}[/tex]

here, N is the number of filp-flops.

Note: The input frequency must be in Hz.

first convert given input frequency (MHz) into HZ.

[tex]in put frequency = 20.48 *10^{6}Hz[/tex]

apply the formula:

[tex]out put Frequency = \frac{20.48*10^{6}}{2^{12}}[/tex]

which comes out to be 5000Hz or 5KHz.

Answer: True

Explanation:

Yes, an expression tag contains a scripting language expression that is evaluated. As, expression tag is used to display the output of the data in the generated page. If data is placed in expression tag then, it prints on the output stream and then it automatically convert data into the string and the output are displayed.

Answer: True

Explanation:

In shielded twisted pair (STP) we have two wires which are twisted together and they have a shielding layer outside them which helps them to avoid interference from outside noise. STP thus having the advantage with an additional layer of shield covering the two wires together makes them more durable compared to unshielded twisted pair.

Answer:

traversed

Explanation:

B-tree is a self balancing tree and it is a data structure which allows insertion, deletion operations.

inorder, preorder and post order, they all are traversing algorithms in the tree data structure.

inorder: first print left, then root and then right.

preorder: first print root, then left and then right.

postorder: first print left, then right and then root.

Therefore, the answer is traversed.

Answer:

Global variables:

1. It is declare outside of all functions.

2. Cannot be declare the two global variable with same name.

3. It can be used in any where in the program, the is no problem with scope.

Local variables:

1. It is declare inside the functions.

2. Can be declare the two or more local variable with same name in the different functions.

3. It is available until that functions are executed.

Explanation:

Global variables are declare outside of all function,, we can access that variable anywhere in the program

for example:

int num = 10;

int main(){

statement;

fun(){

statement;

}

}

The variable is outside of all functions. So, it is a global variable.

It is not declare in the function or block, this is reason it has no problem with availability. it is available until the program is executed.

Other side, local variable is declare in the function.

for example:

int main(){

int num = 10;

statement;

fun(){

int num = 10;

statement;

}

}

Here, the  variable num is local variable and it can be more than one time with same name but in the different function.

it is available untill that function executed.

Answer:

var N; // Text

N = 1;

document.write( N );

document.write(" by ");

document.write(N + 3);

document.write(" by ");

document.write(N + 8);

Explanation:

var N; // Text

N = 1;

document.write( N );

document.write(" by ");

document.write(N + 3);

document.write(" by ");

document.write(N + 8);

Answer:    C. Employer-paid insurance

Explanation:  Employees can receive benefits i.e. financial payments in two ways, direct and indirect payments. Direct financial payments are all those paid directly by the employer to the employee, which means the employee can use those payments immediately after payment, such as wages, salaries, various bonuses, commissions, etc. Indirect benefits are all those paid by the employer to an employee from which the employee will benefit during or after a fixed period of time. These are, for example, life, health, so all kinds of insurance, paid holidays, pension funds, etc.

Answer:

private int[ ] testMethod ( int x )

Explanation:

Before going to the reason first understand the syntax of declare the function.

Syntax:

Access_modifier return_type name (argument_1, argument_2,...);

Access_modifier is used for making the restriction to access the values.

it is public, private and protected.

Return_type:  it is used to define return type of the function.

it can be int, float, double.

In the question:

Option 1:  private array testMethod ( int x )

it is not valid because array is not valid return type.

Option 2: private int[ ] testMethod ( int x )

int[ ]  denotes the integer array. so, the function return the integer array.

Option 3: private double[5] testMethod ( int x )

it is not valid because double[5] is not valid return type. we cannot enter the size of the array.

if we replace double[5] to double[ ], then it valid and the function return double type array.

Option 4: private double testMethod[ ] ( int x )

it return type is double. So, it return the decimal value but not array.

Therefore, the correct option is (b).

Answer:

 17

Explanation:

length() is the function which is used to find the number of character the string.

character include space as well.

initially declare the string user with input  "Martha and George".

then call length function which count the character within the double quotes""

total number is 17 (15 letters and 2 spaces).

and it then store in the integer.

finally print the value.

Therefore, the output is 17.

Answer:

A - Peek

Explanation:

The peek method retrieves the element at the top of a stack without deleting/removing it, the only exception that can occur is when the stack used is empty. It would look as follows when you use the method >> STACK.peek().

Answer: Sequential access file enables the computer system to read or write file in sequential manner whereas random access file enables to read or write randomly in a data file.

Explanation:

Sequential file access is faster than random file access, however random access uses index searches. In random access higher number of seek operations are involved whereas in sequential access the number of seek operation is less.