computer science

project $2$

Search in Document

Home

Insert

Draw

Design

Layout

References

Mailings

Review

View

Calibri $($Body$)$

$11$

$A=A=$

A$.$

AaBbCcDdEe

AaBbCcDdEe

AaBbCcDc

AaBbccDder AaBbl

AaBbCcDdEe

AaBbCcDdEe

AaBbCcDdEe

Normal

No Spacing

Heading $1$

Heading $2$

Titie

Subtitle

Subtle Emph.

Emphasis

Styles

Styles

Pane

TASK $3$: Complete the main.c

Download the attached main. $c$

Follow the instructions written in the comments in the main $()$ function.

The main $()$ is the driver of the program. It calls the functions above to load the data from the CSV file and to run queries that the user asks for.

The name of the file will be passed in through command line arguments.

The user will enter a numeric value from the menu. You must handle the case in which the user enters invalid values $($e$.$g$.,$ strings$).$

Task $4$: Create a makefile

Create a makefile to compile and link all the files together. The grader will compile your code using your makefile.

Submission

Be sure that your code follows the class coding style requirements. Your output should be similar in format as compared to the sample output shown below. Create a folder named your abc$123,$ place all program files in this folder. Zip the folder and submit this abc$123.$zip file.

Rubric

The rubric below is out of $50$ points. However, the syllabus mentions that the project will be $40$ points. The $10$ points will be counted as extra credits. Your grade on Blackboard will be out of $40,$ but you can gain $50/40$ if you solve the entire project correctly.

Page $3$ of $9$

$2258$ words

English $($United States$)$

Focus

$117\%$What do you mean by space complexity and time complexity of an algorithm?

Write an algorithm$/$pseudo code for linear search and mention the best case and

worst case time complexity of Linear Search algorithm?

Explain modular programming with suitable example.

Write an algorithm$/$pseudocode to delete a node at the end of a doubly linked $(4$

list.