You are given a file called “std” and composed of “Number, Name, Address” fields. Write an algorithm that makes “insert,delete, update and retrieve”, processes on the records in the file. “Number” field is the key of each record. it should look like the one in the picture.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

You are given a file called “std” and composed of “Number, Name, Address” fields. Write an algorithm that makes “insert,delete, update and retrieve”, processes on the records in the file. “Number” field is the key of each record.

it should look like the one in the picture.

Algorithm ThreeDimensionalarrayApplication;
//This algoritm defines a 3 dimensional array called "Student" and keeps the points of 5 students.
Each student takes 4 courses and 3 points from each course. Here are the indexs will be used: "CNum"
keeps the course number; "stNum" keeps the student number; "Points" keeps the points of student that
takes from each exam of each course. "ExNum" is the count of exam of each course//
1.[Initialization]
StNum
CNum
ExNum
Polnt
Student[1:5, 1:4,1:3]1integer;
2
StNum-0;
4
2. [Repeat for all values of the StNum index]
Midterms
Courses
1
CNum-0;
2
3
M1
M2
Final
StNum-StNum+1;
4
If StNum>5 then Goto Step6;
C1
80
30
40
3. [Repeat for all values of the CNum Index]
3
2
3
C2
10
20
30
ExNum-0;
4
30
81
30
C3
CNum CNum+1;
If CNum>4 then goto step2;
C4
10
59
30
4
4.[Repeat for all values of the N Index]
ExNum- ExNum+1;
If ExNum>3 then goto step3;
5.[Read the point)
Read(Polnt);
Student[StNum, CNum, ExNum ]-Point;
Goto Step4;
Transcribed Image Text:Algorithm ThreeDimensionalarrayApplication; //This algoritm defines a 3 dimensional array called "Student" and keeps the points of 5 students. Each student takes 4 courses and 3 points from each course. Here are the indexs will be used: "CNum" keeps the course number; "stNum" keeps the student number; "Points" keeps the points of student that takes from each exam of each course. "ExNum" is the count of exam of each course// 1.[Initialization] StNum CNum ExNum Polnt Student[1:5, 1:4,1:3]1integer; 2 StNum-0; 4 2. [Repeat for all values of the StNum index] Midterms Courses 1 CNum-0; 2 3 M1 M2 Final StNum-StNum+1; 4 If StNum>5 then Goto Step6; C1 80 30 40 3. [Repeat for all values of the CNum Index] 3 2 3 C2 10 20 30 ExNum-0; 4 30 81 30 C3 CNum CNum+1; If CNum>4 then goto step2; C4 10 59 30 4 4.[Repeat for all values of the N Index] ExNum- ExNum+1; If ExNum>3 then goto step3; 5.[Read the point) Read(Polnt); Student[StNum, CNum, ExNum ]-Point; Goto Step4;
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY