All categories

3 years ago

What are some ways to insert a row or column? Check all that apply.

Computers and Technology

2 answers:

Allisa [31]3 years ago

7 0

Answer:b,d

Explanation:

e2020

kondaur [170]3 years ago

4 0

Answer:

There are two ways to insert the new column or row in the table.

Explanation:

<u>Method I</u>

i. Select the cell where you want to add a new row or column,

ii. Click on Home Tab

iii. Find insert button in Cells Group.

iv. Click on Insert Row or Insert Column button.

By following above mentioned steps we can add a row or column in Excel sheet.

<u>Method II</u>

i. Select the cell where you want to add a new row or column,

ii. Right Click on the selected Cell.

iii. Find Insert Button in drop down menu and Click on Insert.

iv. There are four options in POP menu, choose Entire Row or Entire Column to insert row or column.

You might be interested in

WILL GIVE BRAINLIEST!!!!!!!

Sedaia [141]

The answer is true !!!

4 0

3 years ago

Identify why research and a clearly written problem statement are important. Select all that apply. They result in a clear and c

saveliy_v [14]

Answer:

They result in a clear and concise statement of the problem

They ensure that all stakeholder needs are considered.

They result in a document that is easy to understand

Explanation:

Problem statement are very vital in research they are key notes that tells what the research is all about and solution it will provide. They are key notes to understand a research and the knowledge gap the research is filling.

Problem statement is a guide through which solution are measured, it gives a clear direction of what the research is all about.

Problem statement are usually easy to understand, they are written in ways that everyone who picks the paper up can understand why the research was conducted.

All this are why a problem statement is important.

7 0

3 years ago

Read 2 more answers

[1] Please find all the candidate keys and the primary key (or composite primary key) Candidate Key: _______________________ Pri

AVprozaik [17]

Answer:

Check the explanation

Explanation:

1. The atomic attributes can't be a primary key because the values in the respective attributes should be unique.

So, the size of the primary key should be more than one.

In order to find the candidate key, let the functional dependencies be obtained.

The functional dependencies are :

Emp_ID -> Name, DeptID, Marketing, Salary

Name -> Emp_ID

DeptID -> Emp_ID

Marketing -> Emp_ID

Course_ID -> Course Name

Course_Name -> Course_ID

Date_Completed -> Course_Name

Closure of attribute { Emp_ID, Date_Completed } is { Emp_ID, Date_Completed , Name, DeptID, Marketing, Salary, Course_Name, Course_ID}

Closure of attribute { Name , Date_Completed } is { Name, Date_Completed , Emp_ID , DeptID, Marketing, Salary, Course_Name, Course_ID}

Closure of attribute { DeptID, Date_Completed } is { DeptID, Date_Completed , Emp_ID,, Name, , Marketing, Salary, Course_Name, Course_ID}

Closure of attribute { Marketing, Date_Completed } is { Marketing, Date_Completed , Emp_ID,, Name, DeptID , Salary, Course_Name, Course_ID}.

So, the candidate keys are :

{ Emp_ID, Date_Completed }

{ Name , Date_Completed }

{ DeptID, Date_Completed }

{ Marketing, Date_Completed }

Only one candidate key can be a primary key.

So, the primary key chosen be { Emp_ID, Date_Completed }..

The functional dependencies are :

Emp_ID -> Name, DeptID, Marketing, Salary

Name -> Emp_ID

DeptID -> Emp_ID

Marketing -> Emp_ID

Course_ID -> Course Name

Course_Name -> Course_ID

Date_Completed -> Course_Name

For a relation to be in 2NF, there should be no partial dependencies in the set of functional dependencies.

The first F.D. is

Emp_ID -> Name, DeptID, Marketing, Salary

Here, Emp_ID -> Salary ( decomposition rule ). So, a prime key determining a non-prime key is a partial dependency.

So, a separate table should be made for Emp_ID -> Salary.

The tables are R1(Emp_ID, Name, DeptID, Marketing, Course_ID, Course_Name, Date_Completed)

and R2( Emp_ID , Salary)

The following dependencies violate partial dependency as a prime attribute -> prime attribute :

Name -> Emp_ID

DeptID -> Emp_ID

Marketing -> Emp_ID

The following dependencies violate partial dependency as a non-prime attribute -> non-prime attribute :

Course_ID -> Course Name

Course_Name -> Course_ID

So, no separate tables should be made.

The functional dependency Date_Completed -> Course_Name has a partial dependency as a prime attribute determines a non-prime attribute.

So, a separate table is made.

The final relational schemas that follows 2NF are :

R1(Emp_ID, Name, DeptID, Marketing, Course_ID, Course_Name, Date_Completed)

R2( Emp_ID , Salary)

R3 (Date_Completed, Course_Name, Course_ID)

For a relation to be in 3NF, the functional dependencies should not have any transitive dependencies.

The functional dependencies in R1(Emp_ID, Name, DeptID, Marketing, Date_Completed) is :

Emp_ID -> Name, DeptID, Marketing

This violates the transitive property. So, no table is created.

The functional dependencies in R2 ( Emp_ID , Salary) is :

Emp_ID -> Salary

The functional dependencies in R3 (Date_Completed, Course_Name, Course_ID) are :

Date_Completed -> Course_Name

Course_Name -> Course_ID

Here there is a transitive dependency as a non- prime attribute ( Course_Name ) is determining a non-attribute ( Course_ID ).

So, a separate table is made with the concerned attributes.

The relational schemas which support 3NF re :

R1(Emp_ID, Name, DeptID, Course_ID, Marketing, Date_Completed) with candidate key as Emp_ID.

R2 ( Emp_ID , Salary) with candidate key Emp_ID.

R3 (Date_Completed, Course_Name ) with candidate key Date_Completed.

R4 ( Course_Name, Course_ID ). with candidate keys Course_Name and Course_ID.

6 0

3 years ago

Question 1

blondinia [14]

Answer:

888 + 88 + 8 + 8 + 8 = 1000

Explanation:

Required

Add up to 1000 using only digit 8

There is no straight way to answer this question; so, we make use of trial by error method to arrive at our solution.

After several trials, I found out that:

888 + 88 + 8 + 8 + 8 = 1000

6 0

3 years ago

Identify what algorithm or concept the following code relates to. void Sort(int array[], int tempArray[], int left, int right) {

galina1969 [7]

Answer:

Binary sort

Explanation:

Binary sort is one of the fastest search techniques used on arrays and other iterable data types. It algorithm sorts the array in ascending order then gets the item in the middle from which it divides the array to be searched in two parts. If the searched term is less than the mid item, then it is searched for in the first part, else it would be in the second.

4 0

3 years ago