All categories

3 years ago

What are examples of object types that can be viewed in the Navigation pane? Check all that :

Computers and Technology

1 answer:

TiliK225 [7]3 years ago

8 0

Answer:

2.) Forms

4.) Queries

6.) Tables

Explanation:

You might be interested in

The______for our newest game keeps changing as we develop our concept and refine our goals.

antiseptic1488 [7]

I think d is the best here

6 0

3 years ago

Read 2 more answers

Finish and test the following two functions append and merge in the skeleton file:

avanturin [10]

Answer:

Explanation:

#include <iostream>

using namespace std;

int* append(int*,int,int*,int);

int* merge(int*,int,int*,int);

void print(int*,int);

int main()

{ int a[] = {11,33,55,77,99};

int b[] = {22,44,66,88};

print(a,5);

print(b,4);

int* c = append(a,5,b,4); // c points to the appended array=

print(c,9);

int* d = merge(a,5,b,4);

print(d,9);

}

void print(int* a, int n)

{ cout << "{" << a[0];

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

cout << "," << a[i];

cout << "}\n";

}

int* append(int* a, int m, int* b, int n)

{

int * p= (int *)malloc(sizeof(int)*(m+n));

int i,index=0;

for(i=0;i<m;i++)

p[index++]=a[i];

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

p[index++]=b[i];

return p;

}

int* merge(int* a, int m, int* b, int n)

{

int i, j, k;

j = k = 0;

int *mergeRes = (int *)malloc(sizeof(int)*(m+n));

for (i = 0; i < m + n;) {

if (j < m && k < n) {

if (a[j] < b[k]) {

mergeRes[i] = a[j];

j++;

}

else {

mergeRes[i] = b[k];

k++;

}

i++;

}

// copying remaining elements from the b

else if (j == m) {

for (; i < m + n;) {

mergeRes[i] = b[k];

k++;

i++;

}

// copying remaining elements from the a

else {

for (; i < m + n;) {

mergeRes[i] = a[j];

j++;

i++;

}

return mergeRes;

}

4 0

3 years ago

what is the largest possible number of internal nodes in a redblack tree with black height k? what is the smallest possiblenumbe

Elina [12.6K]

Answer:

A Red Black Tree is a type of self-balancing(BST) in this tree ,each node is red or black colored. The red black tree meets all the properties of the binary search tree, but some additional properties have been added to a Red Black Tree.

A Red-Black tree's height is O(Logn) where (n is the tree's amount of nodes).

In a red-black tree with black height k

The maximum number of internal nodes is $2^{2k}$ $-1$ .

The smallest possible number is $2^{k}$ $-1$ .

7 0

3 years ago

Which of the following is a preferable method to secure wireless access in a SOHO?

NARA [144]

Use a Ghost program follow throught with 2hyttlg5:6\:56

6 0

3 years ago

Match the appropriate color mode with the correct definition

Gemiola [76]

Answer:

1.RGB: Best for projects intended to be used on the web or video

Explanation:

On websites or making project RGB combination of colors is used. This combination of colors is used to store images in electronic components.

2. CMYK: best for professional printing projects using process colors

Explanation:

Printing professional use CMYK combinations of color for better printing results.

3.) indexed:The only colors saved are the colors used in the image

To manage digital images we use Indexed mode of colors.

Explanation:

4.) bitmap: uses black and white

Explanation:

bitmap is the combination of the black and white colors. As the images are large in size so that, to reduce the size of the image we store image in bitmap to reduce the size.

5.) gray scale: uses different shades of grey

Explanation:

The different shades of gray colors are found in the gray scale. These shades are used to produce images.

4 0

3 years ago