What does the phrase "Be qualified at the Tertiary level" mean in the context of a New Zealand listing for programming jobs?
Tertiary in New Zealand can be University or Polytechnic education. In other words, any formal education after Secondary School, which in New Zealand is the 5 years from age 12-14 to 17-19.
Qualifications would include a degree or diploma. So basically, your non New Zealand qualification has to fit the above definition to fit the job description.
As someone who hired software engineers from overseas, I would be happy to hear what qualification you have got and give a non-official assessment of whether it would qualify under the above criterion.
Perhaps they mean tertiary education?
It quite definitely means tertiary (i.e. university level) education.
Are you familiar with the terms Primary School (roughly like "grade school"), and Secondary School (i.e. High School)? What comes after primary and secondary? - yep, tertiary
Related
So, I'm new to BO Web Intelligence, so I'll try to explain my problem. I created a simple table below to represent my report. "Tom Smith" is a section break, which is followed by Ann Marie, etc. There is also a break on "Name", which represents clients. Client names are listed more than once since each has multiple "goals" and each goal was touched multiple times (time entered working on goals).
Basically, I want to find all the unique goals for each client in the "Goal" column of the report and see if there is a match in the "GoalTime" column. Goals in the "GoalTime" column are supposed to be the same goals as the "Goal" column, so if there is a goal that doesn't match, or an extra goal, this needs to be flagged and counted to produce totals, percentages, etc.
Is there a way to only display unique values for each client in "Goal"? I know there are ways of playing with the query, universes, filters, etc, to try to create the goal column so that only one goal type is displayed, but I'm looking for a simpler formula-based solution. I'm hoping there is some creative use of a "unique" or "distinct" function, or a creatve way of using "match" to achieve this, which can then be combined with flags to create a count.
Any help would be greatly appreciated!
Tom Smith:
Name: Goal: GoalTime:
Tim Buy a House Buy a House
Tim Find Employment Find Employment
Tim Buy a House Buy a Car
Tim Find Employment Find Employment
Chris Find Employment Find Employment
Chris Buy a House Buy a Car
Chris Buy a Car Buy a House
Chris Buy a Car Buy a Car
Ann Marie:
Name: Goal: GoalTime:
Tom Buy a House Buy a Car
Tom Find Employment Find Employment
I am creating a database for universities in my country. Particular database of name of the courses offered by each university.
I think I must consider the following points to create a database
Possible names of courses, let's assume 100 courses.
Name of courses offered by one university, let's assume 60.
Number of courses offered by university may differ from one university to another. One may offer 60 courses and other may offer just 50. Courses may overlap.
How do I create a relational database between table of point no.1 and table of point no.2, considering the point no.3. Please suggest a design pattern for this.
Normally, you would have a table listing all the available courses (in all universities) and another table including the university and the course (one record for each combination) using the ID of the course from the first table. This, of course, is just a very basic description. You may also wish to have a table for universities, course instances (meaning, the same course may run several times during the year, even overlapping within the same university to cope with high number of students), etc.
You could have:
university_course, which is a type of course at a university
a course_category that broadly collects each type of course together
Many course rows, which give the names of a course within a category.
So:
university_course.university_id -> university.id (a university has many university courses)
university_course.category_id -> category.id (a university course has one category)
course.category_id -> category.id (a category has many courses)
Thus, the set of courses (Computer Science, Networking, Computer Studies, Computer Hardware) can map to a category (Computer Science) and then each university course points to the category.
I am designing a database for a website of selling houses and lands. I have an issue that is the house may be in one or many lands, and the land may contain one or many lands depends on its area.
I came up with initial design and the relation between the land and the house is many to many:
House:
Id - Name – area –landID – noRooms – hasSwimmingPool
Land:
Id – name – area - location
Offer: (contain the offer of either a land or a house)
Id – userID – type – paymentMethod
Land_House:
houseID – landID
I still cannot relate Land_House table to the offer table.
Is there a better approach than what I did? And what is the best way?
One aproach could be to have a superior Property table, and house and land could have their primary key as a foreign key to this table. This way you could keep the land house relationship with out mixing what a land and a house are on one table, since they are different things, then add the property id on the Offer table, that could be of a house or a land.
It's like thinking of inheritence .
Hope this helps.
To answer your first question, you missed the obvious; your Offer table has no field for Property. How are you going to store what they made an offer on? I would suggest putting in a column for OfferType and storing either H (House) or L (Land), and then adding PropertyID. This way you can join back to the proper ID in either House or Land, depending on the value of OfferType.
Ideally, though, House and Land would be one table with a field for PropertyType.
Suppose we want to store university courses and their entry requirements in a database. So for example BSc Mathematics, BSc Fine Art, MSc Computer Science etc.
Each course has it's own set of requirements, and might have a different number of non-shared requirements. For example, to be eligible for the BSc Maths you might need a A in Maths and a B in Physics. Whereas the BSc Fine Art might require a A in Art and that the user has a portfolio. The MSc might have a minimum age of 25 etc.
Suppose we then have a student who has his own set of attributes. So they might have a A in Maths and a B in Physics and a C in Chemistry and be of age 19.
How can we structure our database such that it is geared towards efficient lookups. And given a student's attributes how can we retrieve all the courses which they are eligible for?
On an abstract level we are looking for all items whose requirements are a subset of the attributes given.
I'd like to implement this in MySQL. The schema could be:
courses
id
name
requirements
course_id
subject
grade
But then how to do query the table to get all eligible courses when the student has a A in Subject 1, a B in Subject 2 etc.
For a course to be a match, each one of its requirements must be satisfied.
Thanks in advance, I hope my explanation isn't too confusing.
Okay. I think you need a subject list, with a bunch of subject id's.
Now, for the query, you will start with (or generate) a bunch of subject id's and grades. The easiest thing to do is to make this into a temporary table with those columns.
Now, you can do your query, joining the subject id's, and adding a "where temp.grade <= course.grade.
The trick to this is to count the rows. If it has the same number of rows as the course has specified, then you have a successful match.
Is that enough to get you going?
I'm the one-man dev team on a fledgling military history website. One aspect of the site is a catalog of ~1,200 individual battles, including the nations & formations (regiments, divisions, etc) which took part.
The formation information (as well as the other battle info) was manually imported from a series of books by a 10-man volunteer team. The formations were listed in groups with varying formatting and abbreviation patterns. At the time I set up the data collection forms I couldn't think of a good way to process that data... and elected to store it all as strings in the MySQL database and sort it out later.
Well, "later" - as it tends to happen - has arrived. :-)
Each battle has 2+ records in the database - one for each nation that participated. Each record has a formations text string listing the formations present as the volunteer chose to add them.
Some real examples:
39th Grenadier Rgmt, 26th Volksgrenadier Division
2nd Luftwaffe Field Division, 246th Infantry Division
247th Rifle Division, 255th Tank Brigade
2nd Luftwaffe Field Division, SS Cavalry Division
28th Tank Brigade, 158th Rifle Division, 135th Rifle Division, 81st Tank Brigade, 242nd Tank Brigade
78th Infantry Division
3rd Kure Special Naval Landing Force, Tulagi Seaplane Base personnel
1st Battalion 505th Infantry Regiment
The ultimate goal is for each individual force to have an ID, so that its participation can be traced throughout the battle database. Formation hierarchy, such as the final item above 1st Battalion (of the) 505th Infantry Regiment also needs to be preserved. In that case, 1st Battalion and 505th Infantry Regiment would be split, but 1st Battalion would be flagged as belonging to the 505th.
In database terms, I think I want to pull the formation field out of the current battle info table and create three new tables:
FORMATION
[id] [name]
FORMATION_HIERARCHY
[id] [parent] [child]
FORMATION_BATTLE
[f_id] [battle_id]
It's simple to explain, but complicated to enact.
What I'm looking for from the SO community is just some tips on how best to tackle this problem. Ideally there's some sort of method to solving this that I'm not aware of. However, as a last resort, I could always code a classification framework and call my volunteers back to sort through 2,500+ records...
You've tagged your question as PHP related - but it's not.
You are proposing substituting the real identifiers with surrogate keys (ids) however the real identifiers are intrinsically unique - so you're just making your data structure more complicated than it needs to be. Having said that, the leaf part of the hierarchy may only be unique within the scope of the parent node.
The most important question you need to address is whether the formation tree is always going to be two levels. I suspect that sometimes it may be one and sometimes it may be more than 2. The structure you propose is not going to work very well with variable depth trees.
This may help:
http://articles.sitepoint.com/article/hierarchical-data-database
C.