Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

IN C PROGRAMMING LANGUAGE!!!!!!! Problem 1: I am a movie critic and I would like to digitally archive my database of reviewed movies. Each movie

IN C PROGRAMMING LANGUAGE!!!!!!!

image text in transcribed

Problem 1: I am a movie critic and I would like to digitally archive my database of reviewed movies. Each movie review contains the movie name, type of movie, rating of the movie (1-5 stars), and release date in year. Create a program that will read in a list of movies I have reviewed (file must be created first) and allow me the following options Search for, and display, a movie entered. Display the list of movies ordered by name or rating . . The file itself will start with the number of reviews in total, followed by each review. Structure your file like this #01 reviews name 1 type 1 Rating 1 (number only) release date 1 (number only) name2 type 2 Rating 2 (number only) release date 2 (number only) Since I can have as many reviews as I want, make sure you use dynamic memory to create your structure (malloc or calloc) Use command line arguments to supply the filename. Make sure vou use an array of structures! For your sorting algorithm, you should use this function You will need to create your own comparison function, and pass that function into the qsort function. This is called a function pointer. Make sure you functionalize your program, and free your memory correctly! Problem 1: I am a movie critic and I would like to digitally archive my database of reviewed movies. Each movie review contains the movie name, type of movie, rating of the movie (1-5 stars), and release date in year. Create a program that will read in a list of movies I have reviewed (file must be created first) and allow me the following options Search for, and display, a movie entered. Display the list of movies ordered by name or rating . . The file itself will start with the number of reviews in total, followed by each review. Structure your file like this #01 reviews name 1 type 1 Rating 1 (number only) release date 1 (number only) name2 type 2 Rating 2 (number only) release date 2 (number only) Since I can have as many reviews as I want, make sure you use dynamic memory to create your structure (malloc or calloc) Use command line arguments to supply the filename. Make sure vou use an array of structures! For your sorting algorithm, you should use this function You will need to create your own comparison function, and pass that function into the qsort function. This is called a function pointer. Make sure you functionalize your program, and free your memory correctly

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Design Application Development And Administration

Authors: Michael V. Mannino

3rd Edition

0071107010, 978-0071107013

More Books

Students also viewed these Databases questions

Question

What are Decision Trees?

Answered: 1 week ago

Question

What is meant by the Term Glass Ceiling?

Answered: 1 week ago