## A average Mark overall for all of one student subjects

Lets say i have a student table , a enlistment table that shows SubjectId and Results for each student how would i get the overall average mark for a student that has more than 3 subjects

Create table  a_Student( StudentId int(5) Not null, StudentForename varchar (30) Not null, StudentSurname varchar (45) Not null,  PRIMARY KEY(StudentId) ); Create table a_Enlistment( StudentId int(5) Not null, SubjectId char(6) Not null, results char (2), primary key (SubjectId,StudentId), foreign key (SubjectId) references a_Subject(SubjectId), foreign key (StudentId) references a_Student(StudentId) );   insert into a_Student (StudentId,StudentForename,StudentSurname) values ("33447","Alan","Burns"), ("33672","Mark","Harrison",);     Insert into a_Enlistment (StudentId,SubjectId,Results) values           ("33447","TMP243","78"),          ("33447","AWD169","45"),          ("33447","IIA887","48"),         ("33672","TMP243","57"),        ("33672","AWD169","67"),       ("33672","IIA887","48"), 

So i want lets say Alans overall mark for his 3 subjects how would i do that? Any help is welcomed thanks a lot

## Student Project Ideas using Openstack

I am a student at University and have completed all on my CompSci courses and am getting started in my concentration, security. I need to complete a Project, and want to dive right in. Generally, what I want to do is create and monitor a secure cloud environment using Openstack. Normally, I would be able to use the Private Cloud provided by my school, but may not be able to do this due to social distancing. Assuming that I do have access, what is a good idea for the project aim, especially for someone who is new to Openstack and the cloud in general? What should the clients of my Openstack orchestrated cloud be using this service to do? Additionally, in the case where I do not have a Private cloud available to utilize, would I be able to undertake a similar project using a public cloud like AWS? I apologize if these questions seem bad, but I am new to this environment and would appreciate any input I could get.

## As a first year CSE student how to start and become a master in coding?

I am currently a first year student but I Don’t know how to start my coding journey.Help me if anyone can I want to become a software developer..But currently I know little C just I want to know the resources and some YouTube channels from where I can start coding and I want to improve my logicc too.I haven’t converted a single statement into a good algorithm..please help….. I am a beggineer

## Create a class student with public member variables

Create a class Student with public member variables: Student name, student number, contact number, ID number. The following specifications are required:

 Add init() method of the class that initializes string member variables to empty strings and numeric values to 0.

 Add the method populate() to the class. The method is used to assign values to the member variables of the class.

 Add the method display() to the class. The method is used to display the member variables of the class.

 Create an instance StudentObj of the class Student in a main program.

 The main program should prompt the user to enter values for five students. The attributes should be assigned to the instance of Student using its populate() method, and must be displayed using the display() method of the instance of Student.

## MN Lambda student here

Good morning, all! I'm a stay-at-home dad from the balmy state of Minnesota. I'm currently attending Lambda School's Frontend WebDev program, and loving it. I'm an avid reader, movie buff, video game lover, and comic fanatic. I worked as a website support specialist for an ISP some 20+ years ago. Now that my kiddo is school age, I figured I'd delve officially back into my burgeoning love for coding. I'm excited to be a part of this community and can't wait to interact with you all!

## Student Course Allocation Problem with Many Constraints

Problem statement

In a university, there are $$t$$ course categories, $$m$$ courses, $$n$$ sections, $$p$$ students.

$$i$$th section has:

1. A student capacity: $$cap_i$$.
2. Two lecture timings. (Formally, each section has two elements from $$S$$ associated with itself, where $$S$$ contains all lecture timings.)
3. A parent course $$course_i$$. ($$m \leq n$$)

$$i$$th course has:

1. Some lecture section(s) under it. (As mentioned above.)
2. A parent course category $$category_i$$. ($$t \leq m$$)

Each student has ordered all $$n$$ sections from $$1$$ to $$n$$ on the basis of his/her preference.

Now, each student $$i$$ has to be allocated $$q_i$$ ($$2 \geq q_i \geq 1$$) sections such that:

1. No student has been allocated more than two or more section that have the same element(s) from $$S$$ associated with themselves. Formally, if the sets of lecture timings of allocated sections for a student $$i$$ are $$T_1$$, $$T_2$$, $$\cdots$$, $$T_{q_i}$$, then allocation should ensure that $$|T_1 \cup T_2 \cup \cdots \cup T_{q_i}| = 2{q_i}$$.
2. No student has been allocated two or more sections which have the same parent course.
3. No student has been allocated more than $$u$$ sections which have a parent course which have the same course category. ($$u \geq 1$$) Formally, let $$X$$ be a list of $$category_{course_{j}}$$ where $$j$$ is any section allocated to a student. The frequency of any element in $$X$$ should not exceed $$u$$.
4. No section $$j$$ is allocated to more than $$cap_j$$ students.
5. $$\sum_{j=1}^p cost(j)$$ is minimized. $$cost(x)$$ is defined as the sum of positions of the $$x$$th student’s allocated sections’ in his/her preference list. For example, a student had ordered the courses P, Q, R, S in the order: R, Q, S, P. If he/she was allocated Q and S, cost() function will return 5. (2+3)

Constraints:

• $$1 \leq t \leq 7$$
• $$3 \leq m \leq 9$$
• $$5 \leq n \leq 30$$
• $$250 \leq p \leq 700$$
• $$\sum_{i=1}^p q_i \leq \sum_{i=1}^n cap_i$$

My take

I tried to represent the problem in the form of a k-partite graph. Doing so would have helped flow network implement network flow algorithms like minimum-cost, maximum-flow. However, I have not been able to come up with any representation that satisfies all of the given constraints.

Any help appreciated!