Upload folder using huggingface_hub

.gitattributes

@@ -57,3 +57,4 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text
 # Video files - compressed
 *.mp4 filter=lfs diff=lfs merge=lfs -text
 *.webm filter=lfs diff=lfs merge=lfs -text
+Transaction.csv filter=lfs diff=lfs merge=lfs -text

KC_Relationships.csv

@@ -0,0 +1,203 @@
+"id","from_knowledgecomponent_id","to_knowledgecomponent_id"
+595,54,53
+596,53,54
+397,53,56
+398,53,48
+501,59,57
+502,57,59
+505,96,94
+506,94,96
+402,56,53
+19,15,14
+20,14,15
+403,48,53
+305,26,22
+306,22,26
+314,89,81
+31,20,14
+32,14,20
+316,81,89
+419,40,32
+420,32,40
+424,64,67
+425,64,68
+426,64,69
+427,64,14
+513,99,95
+514,95,99
+429,67,64
+430,68,64
+517,42,33
+518,33,42
+537,102,93
+538,93,102
+541,91,97
+542,91,92
+543,91,94
+544,91,95
+545,97,91
+546,92,91
+547,94,91
+548,95,91
+551,98,95
+552,95,98
+557,55,53
+558,53,55
+345,80,89
+346,80,81
+348,80,85
+349,89,80
+350,81,80
+352,85,80
+359,56,50
+561,88,80
+562,88,81
+431,69,64
+363,50,56
+563,80,88
+564,81,88
+432,14,64
+567,103,93
+100,19,14
+568,93,103
+102,14,19
+587,21,32
+104,27,14
+588,21,28
+106,14,27
+589,21,22
+108,34,14
+590,21,23
+110,14,34
+591,32,21
+592,28,21
+593,22,21
+594,23,21
+386,28,35
+387,28,29
+388,28,30
+389,28,31
+391,35,28
+392,29,28
+393,30,28
+394,31,28
+456,93,92
+457,93,101
+461,92,93
+462,101,93
+473,52,19
+475,52,34
+476,52,27
+477,19,52
+479,34,52
+480,27,52
+201,77,76
+202,76,77
+407,45,56
+408,45,48
+409,45,51
+410,45,53
+499,84,81
+500,81,84
+597,12,4
+598,4,12
+507,90,82
+508,82,90
+411,56,45
+412,48,45
+413,51,45
+414,53,45
+515,100,95
+516,95,100
+519,71,72
+520,71,73
+521,71,74
+522,71,75
+523,72,71
+524,73,71
+421,44,32
+422,32,44
+308,16,70
+309,16,14
+525,74,71
+526,75,71
+529,58,49
+530,58,50
+433,83,82
+434,82,83
+443,36,32
+444,36,37
+445,36,38
+446,36,39
+531,58,47
+532,58,63
+447,32,36
+448,37,36
+288,81,86
+289,81,87
+449,38,36
+450,39,36
+295,86,81
+296,87,81
+465,33,32
+311,70,16
+312,14,16
+466,33,41
+323,57,60
+325,57,47
+328,60,57
+330,47,57
+333,66,16
+334,16,66
+343,24,22
+344,22,24
+533,49,58
+354,50,57
+469,32,33
+357,57,50
+367,46,56
+368,56,46
+375,82,81
+534,50,58
+378,82,86
+379,82,87
+380,81,82
+535,47,58
+383,86,82
+384,87,82
+395,25,22
+396,22,25
+470,41,33
+536,63,58
+481,43,33
+482,33,43
+491,94,93
+494,93,94
+539,65,64
+540,64,65
+549,79,76
+550,76,79
+553,18,52
+554,18,14
+555,52,18
+556,14,18
+559,61,57
+560,57,61
+565,78,76
+566,76,78
+569,4,6
+570,4,7
+571,4,8
+572,4,9
+573,4,10
+574,4,11
+576,4,13
+577,4,17
+578,6,4
+579,7,4
+580,8,4
+581,9,4
+582,10,4
+583,11,4
+585,13,4
+586,17,4

KCs.csv

@@ -0,0 +1,104 @@
+"id","name","description"
+56,Data Model,Data Models are fundamental entities to introduce abstraction in a DBMS. Data models define how data is connected to each other and how they are processed and stored inside the system.
+12,Subset,"If A and B are two sets, and every element of set A is also an element of set B, then A is called a subset of B"
+24,CREATE TABLE,"The CREATE TABLE statement is used to create a new relation schema by specifying its name, its attributes and, optionally, its constraints."
+33,Join,"When we want to retrieve data from more than one relation, we often need to use join operations."
+14,Relational data model,The relational model represents the database as a collection of relations.
+15,Domain,Domains are the sets of all possible values for attributes.
+19,Foreign key,A foreign key is a column or group of columns in a relational database table that provides a link between data in two tables.
+13,Tuple,A tuple is an ordered list of n elements.
+17,Relation,A relation is a subset of a Cartesian product of sets.
+20,Schema,A relation schema has a relation name and a list of attributes.
+7,Cardinality,the cardinality of a set is a measure of the number of elements of the set.
+23,Data type,Data Types define the type of value that can be stored in a table column.
+29,SELECT,SQL provides the SELECT statement for retrieving data from a database
+30,INSERT,The INSERT statement is used to add tuples into a relation.
+31,DELETE,The DELETE statement is used to remove tuples from a relation.
+32,Query,A query is a request for data or information from a database table or combination of tables.
+35,SELECT DISTINCT,"The SELECT DISTINCT statement is used to return only distinct (different) values. Inside a table, a column often contains many duplicate values; and sometimes you only want to list the different (distinct) values."
+37,COUNT,COUNT returns the total number of argument values
+38,MIN,MIN returns the minimum value of the arguments
+39,HAVING,We can use HAVING condition to add the condition on the groups.
+47,Relationship,Relationship types are represented as diamonds.
+27,Candidate key,A candidate key is a combination of attributes that can be uniquely used to identify a database record without referring to any other data.
+34,Primary Key,A primary key is a special relational database table column (or combination of columns) designated to uniquely identify all table records.
+55,Superclass,This type of relationship between subclass and superclass is often described as an ISA relationship type.
+60,One-To-Many,A one-to-many relationship is where one occurrence in an entity relates to many occurrences in another entity.
+6,Cartesian product,The Cartesian product operation takes an ordered list of sets and returns a set of tuples.
+42,Natural Join,"A natural join retains all the data of the two tables for only the matched rows, without duplication."
+65,Trivial,A FD is trivial if it can always be satisfied
+51,weak entity ,"A weak entity type is an entity type that does not have sufficient attributes
+to form a primary key."
+61,One-To-One,"One-to-one is where one occurrence of an entity relates to only one occurrence in another entity, eg if a man only marries one woman and a woman only marries one man, it is a one-to-one (1:1) relationship."
+48,Entity,"An entity is a real-world thing that can be distinctly identified as a person, place, or concept. It is an object which is distinguishable from others."
+16,Attribute,"Attributes are used to describe the properties of information. In the relational model, they usually refer to atomic data."
+57,Cardinality ratios,Specifies the maximum number of relationships that an entity can participate in.
+50,Data integrity,"Data integrity refers to the accuracy and consistency of data stored in a database or a data warehouse. Data with “integrity” is said to have a complete structure, i.e. all characteristics defining the data must be correct."
+11,Difference,The difference of two sets A and B is defined as the lists of all the elements that are in set A but that are not present in set B.
+25,DROP TABLE,The DROP TABLE statement is used to remove an existing relation schema from a database schema.
+45,Entity-Relationship Model,"An Entity–relationship model (ER model) describes the structure of a database with the help of a diagram, which is known as Entity Relationship Diagram (ER Diagram). An ER model is a design or blueprint of a database that can later be implemented as a database. "
+8,Equality,Set equality is the term that is used to indicate that two sets are equal.
+64,Functional dependencies,Functional Dependency (FD) is a constraint that determines the relation of one attribute to another attribute in a Database Management System (DBMS).
+41,Inner Join,Inner Join is tuples are included in the result only if there is at least one matching in both relations.
+36,GROUP BY,GROUP BY attribute list groups tuples for each value combination in the attribute list.
+10,Intersection,The intersection of two given sets is the set that contains all the elements that are common to both sets.
+52,Key attributes,A key attribute is the unique characteristic of the entity.
+59,Many-To-Many, a many-to-many relationship where many occurrences in an entity relate to many occurrences in another entity.
+9,union,The union of two sets is a set containing all elements that are in A or in B (possibly both).
+49,Total ,"It specifies that each entity present in the entity set must mandatorily participate in at least one relationship instance of that relationship set,for this reason, it is also called as mandatory participation"
+63,partial,It specifies that each entity in the entity set may or may not participate in the relationship instance in that relationship set.
+18,Superkey,A superkey SK of R is a subset of attributes of R.
+4,Set,"In mathematics, a set is nothing more than a collection of objects. Similarly, in databases, records within a table can be treated as objects in a set - i.e. the table becomes a set of records. The SET operator allows the tables of a database to be treated as objects in a set when performing a query."
+67,Implied,"To design a good database, we need to consider all possible FDs."
+69,Minimal Cover,A minimal cover of a set of FDs F is a minimal set of functional dependencies that is equivalent to F.
+70,Prime Attribute,A prime attribute is an attribute occurring in a candidate key
+76,Relational Algebra,Relational algebra (RA) provides an intermediate step for evaluating SQL.
+77,Projection,"choose certain attributes (i.e., columns)."
+85,SQL Injection,SQL injection attacks from internal and external users
+86,REVOKE,REVOKE takes away privileges from users.
+87,Specifying Privileges - Views,Views provide an important mechanism for discretionary authorization.
+97,Logging,Logging is a technique for recovery (assuring atomicity and durability of transactions).
+72,Lossless Join,To disallow the possibility of generating spurious tuples when a NATURAL JOIN operation is applied to the relations after decomposition.
+101,Read Uncommitted,Read Uncommitted is the least restrictive isolation level.
+22,DDL,"A data definition language (DDL) is a computer language used to create and modify the structure of database objects in a database. These database objects include views, schemas, tables, indexes, etc."
+81,Access Control,"Access control is done by creating user accounts and to control login process by the DBMS. So, that database access of sensitive data is possible only to those people (database users) who are allowed to access such data and to restrict access to unauthorized persons. "
+92,ACID Properties,"DBMSs ensure the following properties of transactions. Atomicity is the execution of each transaction is atomic, i.e., either all operations are completed or not done at all. Consistency is the states of a database that are consistent (w.r.t. defined business rules) before and after each transaction. Isolation is execution results of each transaction should be unaffected by other concurrently executing transactions. Durability is once a transaction has been successfully completed, its effects should persist in the database"
+26,ALTER TABLE,"ALTER TABLE is used to add, delete/drop or modify columns in the existing table. It is also used to add and drop various constraints on the existing table."
+89,Authentication,Authentication is the process of confirming that a user logs in only in accordance with the rights to perform the activities he is authorized to perform. User authentication can be performed at the operating system level or database level itself.
+74,Boyce-Codd normal form (BCNF),Boyce-Codd Normal Form (BCNF) is one of the forms of database normalization. A database table is in BCNF if and only if there are no non-trivial functional dependencies of attributes on anything other than a superset of a candidate key.
+66,Closure,"The set of all those attributes which can be functionally determined from an attribute set is called as the closure of that attribute set.
+"
+95,Concurrent Transactions,Concurrent transaction or execution includes multiple transactions which are executed concurrently or simultaneously in the system.
+80,Database Security,Database security refers to the collective measures used to protect and secure a database or database management software from illegitimate use and malicious cyber threats and attacks.
+46,Data structure,"The data structure is a data organization, management, and storage format that enables efficient access and modification. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data."
+73,Dependency preservation,To ensure that each functional dependency can be inferred from functional dependencies after decomposition.
+82,Discretionary access control (DAC),Based on the concept of access privileges for giving users such privileges. SQL support DAC; most commercial DBMSs also support DAC.
+28,DML,"A data manipulation language (DML) is a computer programming language used for adding (inserting), deleting, and modifying (updating) data in a database. A DML is often a sublanguage of a broader database language such as SQL, with the DML comprising some of the operators in the language."
+53,Enhanced Entity-Relationship,Enhanced entity-relationship diagrams are advanced database diagrams very similar to regular ER diagrams which represent requirements and complexities of complex databases.  It is a diagrammatic technique for displaying the Sub Class and Super Class; Specialization and Generalization; Union or Category; Aggregation. 
+83,GRANT,GRANT gives privileges to users.
+93,Isolation,"In database systems, isolation determines how transaction integrity is visible to other users and systems."
+84,Mandatory Access Control (MAC),Restrict access to objects based on the sensitivity of the information contained in the objects and the formal authorization of subjects to access information of such sensitivity.
+90,Trojan Horse attacks,"Trojan Horse attacks: If Steve tricks Bob into copying data from table R into table R0, then the access control on table R doesn’t apply to the copy of the data in table R0."
+75,Third normal form (3NF),The third normal form — or 3NF — is part of a set of concepts for database normalization that also includes first normal form (1NF) and second normal form (2NF).
+99,The Unrepeatable Read Problem,The unrepeatable problem occurs when two or more read operations of the same transaction read different values of the same variable.
+100,The Lost Update Problem,"In the lost update problem, an update done to a data item by a transaction is lost as it is overwritten by the update done by another transaction. "
+102,Read Committed,"Read Committed is One transaction only sees committed changes by other
+transactions."
+91,Transactions,A transaction is a sequence of database operations grouped together for execution as a logic unit in a DBMS.
+79,Renaming,"Renaming is used to rename either the relation name or the attribute names, or both."
+98,The Dirty Read Problem,"Dirty read is a read of uncommitted data. If a particular row is modified by another running application and not yet committed, we also run an application to read the same row with the same uncommitted data."
+103,Serializable,Serializable is the highest solution level. All transactions are totally isolated from other transactions. It is safe but may cause significant performance hit.
+68,Equivalent,"Two or more than two sets of functional dependencies are called equivalence if the right-hand side of one set of functional dependency can be determined using the second FD set, similarly, the right-hand side of the second FD set can be determined using the first FD set."
+40,EXCEPT,"The SQL EXCEPT clause/operator is used to combine two SELECT statements and returns rows from the first SELECT statement that are not returned by the second SELECT statement. This means EXCEPT returns only rows, which are not available in the second SELECT statement"
+44,EXISTS,"The EXISTS condition in SQL is used to check whether the result of a correlated nested query is empty (contains no tuples) or not. The result of EXISTS is a boolean value True or False. It can be used in a SELECT, UPDATE, INSERT or DELETE statement."
+43,Left Join,A left join retains all rows of the left table regardless of whether there is a row that matches on the right table.
+94,Locking,Locking protocols are used in database management systems as a means of concurrency control. Multiple transactions may request a lock on a data item simultaneously.
+96,Two-Phase Locking (2PL) Protocol,Two-Phase Locking Protocol is also known as 2PL protocol is a method of concurrency control in DBMS that ensures serializability by applying a lock to the transaction data which blocks other transactions to access the same data simultaneously. Two-Phase Locking protocol helps to eliminate the concurrency problem in DBMS.
+71,Normalisation,A common approach starts with a universal relation and applies decomposition to create new relations that satisfy certain normal forms (i.e. normalization).
+58,Participation constraints,Specifies whether the existence of any entity depends on its being related to another entity via the relationship type.
+88,Role-Based Access Control (RBAC),"Access rights are grouped by roles, and the use of resources is restricted to individuals assigned to specific roles.
+"
+78,Selection,"Select operation chooses the subset of tuples from the relation that satisfies the given condition mentioned in the syntax of selection. The selection operation is also known as horizontal partitioning since it partitions the table or relation horizontally.
+"
+21,SQL,SQL stands for Structured Query Language.  It is used for storing and managing data in a relational database management system (RDMS).
+54,Subclass,A subclass is a class derived from the superclass. It inherits the properties of the superclass and also contains attributes of its own.

Question_Choices.csv

@@ -0,0 +1,757 @@
+"id","choice_text","is_correct","question_id"
+5,Relation,false,2
+6,Function,false,2
+7,Set,true,2
+8,Tuple,false,2
+9,"{1, 2, 3}",false,3
+10,"{1, 3, 5, 7, 9}",true,3
+11,"{1, 2, 5, 9}",false,3
+12,"{1, 5, 7, 9, 11}",false,3
+13,"{(1, a), (1, b), (2, a), (b, b)}",false,4
+14,"{(1, 1), (2, 2), (a, a), (b, b)}",false,4
+15,"{(1, a), (2, a), (1, b), (2, b)}",true,4
+16,"{(a, 1), (a, 2), (b, 1), (b, 2)}",false,4
+17,True,false,5
+18,False,true,5
+19,"10",false,6
+20,"5",true,6
+21,"3",false,6
+22,"20",false,6
+23,"A = {1, 2} and B = {1}",false,7
+24,"A = {1, 2} and B = {1, 2, 3}",false,7
+25,"A = {1, 2, 3} and B = {2, 1, 3}",true,7
+26,"A = {1, 2, 4} and B = {1, 2, 3}",false,7
+27,"A = {p, q} and B = {x, y}",true,8
+28,"A = {p, q, x} and B = { y}",false,8
+29,"A = {p} and B = {q, x, y}",false,8
+30,"A ={x, y} and B = {p, q}",false,8
+31,"{2,3}",true,9
+32,"{6,7}",false,9
+33,"{2,3,4,5}",false,9
+34,"{4,5,6,7}",false,9
+35,"{2,3}",true,10
+36,"{6,7}",false,10
+37,"{2,3,4,5}",false,10
+38,"{4,5,6,7}",false,10
+39,"{2, 4, 5, 9, 10, 11, 8}",false,11
+40,"{2, 3, 4, 5, 6, 7, 8, 9}",true,11
+41,"{1, 4, 9, 7,8,11,10}",false,11
+42,"{4, 5,7,8,9,10,11}",false,11
+43,"{2, 3, 4}",false,12
+44,"{6, 7}",true,12
+45,"{2, 3, 8, 9}",false,12
+46,"{4, 5}",false,12
+47,"{6,7}",false,13
+48,"{2,3}",false,13
+49,"{4,5}",true,13
+50,"{8,9}",false,13
+51,"{(2, 2), (7, 7), (5, 5), (3, 3), (4, 4),(4,7)}",false,14
+52,"{(2, 5), (2, 7), (3, 5), (3, 7), (3,4), (4,3)}",false,14
+53,"{(2, 5), (2, 7), (3, 5), (3, 7), (4,5), (4,7)}",true,14
+55,True,false,15
+56,False,true,15
+57,True,true,16
+58,False,false,16
+59,True,false,17
+60,False,true,17
+61,"{1,2,3,5}",false,18
+62,"{1,2}",false,18
+63,"{3,5}",true,18
+64,"{1,2,3}",false,18
+65,"{1, 2, 3}",false,19
+66,"{(1,1), (1,2), (2,1), (2,2)}",true,19
+67,"{1, 2}",false,19
+68,"{1, 2, 3}",false,20
+69,"{(1,1), (1,2), (1,3)}",false,20
+70,"{(1,3), (2,3)}",true,20
+71,"{(1,1), (2,2)}",false,21
+72,"{(1,1), (1,2), (1,3)}",false,21
+73,"{(1,3), (2,3)}",true,21
+74,"1",true,22
+75,"2",false,22
+76,"3",false,22
+77,"4",false,22
+78,"A = {1, 2, 3}, B = {2, 3, 4}",false,23
+79,"A = {1, 2, 3}, B = {1, 2, 3, 4}",false,23
+80,"A = {1, 2, 3}, B = {2, 3, 1}",true,23
+81,"A = {1, 2, 3, 4, 5, 6}, B = {2, 3, 4, 5, 1}",false,23
+82,A ∩ B,true,24
+83,A U B,false,24
+84,A,false,24
+85,B,false,24
+86,A,false,25
+87,(A U B) -B,true,25
+88,A ∩ B,false,25
+89,B- (A ∩ B),false,25
+90,A U B,false,26
+91,(A U B) – (A ∩ B),true,26
+92,A – B,false,26
+93,A ∩ B,false,26
+94,A U C  –  B,false,27
+95,B – A – C,true,27
+96,(A ∩ C) ∩ B,false,27
+97,(AUC) – (B ∩ A) – (B ∩C),false,27
+98,"5",false,28
+99,"6",true,28
+100,"12",false,28
+101,"24",false,28
+102,"11",false,29
+103,"12",false,29
+104,"13",true,29
+105,"14",false,29
+106,"{(1,c) ,(2,c),(3,a),(3,b),(3,c)}",true,30
+107,"{(1,a), (1,b) , (2,a) , (2,b)}",false,30
+108,"{(1,a),(1,b),(1,c),(2,a),(2,b),(2,c)}",false,30
+109,True,false,31
+110,False,true,31
+111,True,false,32
+112,False,true,32
+113,True,true,33
+114,False,false,33
+115,True,true,34
+116,False,false,34
+117,True,true,35
+118,False,false,35
+119,Range,false,36
+120,Domain,false,36
+121,Relation,true,36
+122,Tuple,false,36
+123,Table,false,37
+124,Tuple,false,37
+125,Attribute,false,37
+126,Domain,true,37
+127,Row,false,38
+128,Column,true,38
+129,Value,false,38
+130,Tuple,false,38
+131,Attribute,false,39
+132,Tuple,true,39
+133,Field,false,39
+134,Instance,false,39
+135,Relations,false,40
+136,Attributes,true,40
+137,Tuples,false,40
+138,Instances,false,40
+140,Important; Important,false,41
+143,Domain,false,42
+144,Subkey,false,42
+145,Superkey,true,42
+146,Foreign key,false,42
+147,Candidate key,false,43
+148,Foreign key,true,43
+149,Superkey,false,43
+150,Primary key,false,43
+139,Important; Not important,false,41
+141,Not important; Important,true,41
+142,Not important; Not important,false,41
+151,A superkey is an attribute or a set of attributes that can uniquely identify a tuple in a relation,true,44
+54,"{(2, 5), (3, 7), (5, 5), (4, 7), (2,7), (3,5)}",false,14
+152,A superkey is a tuple or a set of multiple tuples that can uniquely identify an attribute in a relation,false,44
+153,Every superkey is a candidate key,false,44
+154,A superkey is an attribute or a set of attributes that distinguish the relation from other relations,false,44
+155,Referenced,false,45
+156,Referencing,true,45
+157,"{a,b,c} must not be a superkey",false,46
+158,"{a,b,c} must not be a candidate key",true,46
+159,"{a,b,c} must be a primary key",false,46
+160,"{a,b,c} must be a superkey",true,47
+161,"{a,b,c} must not be a superkey",false,47
+162,"{a,b,c} must be a candidate key",false,48
+163,"{a,b,c} must be a superkey",true,48
+164,{a} must be a superkey,false,48
+165,"{a,b} must not be a superkey",false,49
+166,"{a,c} must be a candidate key",false,49
+167,{a} must be a candidate key,true,49
+168,A superkey is always a candidate key,false,50
+169,A candidate key is always a superkey,true,50
+170,A superkey is always a primary key,false,50
+171,A candidate key is always a primary key,false,50
+172,Char(n),false,51
+173,String(n),true,51
+174,Varchar(n),false,51
+175,Bit(n),false,51
+176,create table(…),true,52
+177,create relation(…),false,52
+178,New table(…),false,52
+179,New relation(…),false,52
+180,Drop table R,true,53
+181,Drop relation R,false,53
+182,Delete table R,false,53
+183,Delete from R,false,53
+184,Alter table R delete A,false,54
+185,Alter table R drop column A,true,54
+186,Alter table drop A from R,false,54
+187,Delete A from R,false,54
+188,DML,false,55
+189,DDL,true,55
+190,DCL,false,55
+191,TCL,false,55
+192,"Fixed, Fixed",false,56
+193,"Variable, Variable",false,56
+194,"Fixed, Variable",true,56
+195,"Variable, Fixed",false,56
+196,Select,true,57
+197,Update,false,57
+198,Delete,false,57
+199,Create,false,57
+203,Create,false,58
+204,Alter Table,false,59
+205,Add row,false,59
+206,Insert,true,59
+207,Append,false,59
+208,"enter into D (a, b, c);",false,60
+209,"insert into D values (a, b, c);",true,60
+210,"insert into D (a, b, c);",false,60
+211,"insert (a, b, c) values into D;",false,60
+212,delete table R,false,61
+213,drop table R,false,61
+214,delete from R,true,61
+215,drop from R,false,61
+216,Select,false,62
+217,Join,true,62
+218,Union,false,62
+219,Show all rows and columns of table “person”,true,63
+220,Show the number of rows of table “person”,false,63
+221,Show the number of columns of table “person”,false,63
+222,Show all rows and columns of table “person”,false,64
+223,Show the number of rows of table “person”,true,64
+224,Show the number of columns of table “person”,false,64
+225,"CREATE TABLE Enrol(StudentID INT; CourseNo VARCHAR(20); Semester VARCHAR(50)),",false,65
+226,"CREATE TABLE Enrol(StudentID INT, CourseNo VARCHAR(20), Semester VARCHAR(50)),",false,65
+227,"CREATE TABLE Enrol(StudentID INT, CourseNo VARCHAR(20), Semester VARCHAR(50));",true,65
+228,At least one of the attributes in the primary key is not null,false,66
+229,None of the attributes in the primary key can be null,true,66
+230,All the attributes in the primary key can be null,false,66
+233,StudentID cannot be null in Student,false,67
+234,StudentID cannot be null in Enrol,false,67
+235,"6",true,68
+236,"4",false,68
+237,"2",false,68
+238,"0",false,68
+239,"3",false,69
+240,"2",false,69
+241,"1",true,69
+242,"0",false,69
+243,"3",false,70
+244,"2",true,70
+245,"1",false,70
+246,"0",false,70
+247,"4",false,71
+248,"3",true,71
+249,"2",false,71
+250,"1",false,71
+251,"4",true,72
+252,"3",false,72
+253,"2",false,72
+254,"1",false,72
+255,"4, 6",false,73
+256,"3, 4",false,73
+257,"6, 4",true,73
+258,"4, 3",false,73
+259,"6",false,74
+260,"4",true,74
+261,"2",false,74
+262,"1",false,74
+263,"4",false,75
+264,"3",false,75
+265,"2",true,75
+266,"1",false,75
+267,"6",false,76
+268,"5",false,76
+269,"4",true,76
+270,"3",false,76
+271,"4",false,77
+272,"3",false,77
+273,"2",false,77
+274,"1",true,77
+275,"28",true,78
+276,"12",false,78
+277,"7",false,78
+278,"4",false,78
+279,"28",false,79
+280,"12",false,79
+281,"7",true,79
+282,"4",false,79
+283,"28",false,80
+284,"12",false,80
+285,"7",true,80
+286,"4",false,80
+287,"13",false,81
+288,"8",true,81
+289,"4",false,81
+290,"1",false,81
+291,"12",false,82
+292,"9",false,82
+293,"7",false,82
+231,Every StudentID appearing in Enrol must exist in Student,true,67
+294,"3",true,82
+295,"11",false,83
+296,"8",false,83
+297,"7",true,83
+298,"4",false,83
+299,"11",false,84
+300,"7",false,84
+301,"4",false,84
+302,"3",true,84
+303,"7",false,85
+304,"3",false,85
+305,"2",true,85
+306,"1",false,85
+307,"1,2",true,86
+308,"3,3",false,86
+309,"3,2",false,86
+310,"1,3",false,86
+311,"SELECT CourseNo, COUNT(*) AS NoOfStudents      FROM Enrol      WHERE Year = 2019      GROUP BY CourseNo;",true,87
+313,"SELECT CourseNo, COUNT(*) AS NoOfStudents      FROM Student      WHERE Year = 2019      GROUP BY CourseNo;",false,87
+314,"SELECT CourseNo, COUNT(*) AS NoOfStudents      FROM Student      WHERE Year = 2019      GROUP BY StudentID;",false,87
+312,"SELECT CourseNo, COUNT(*) AS NoOfStudents      FROM Enrol   WHERE Year = 2019      GROUP BY StudentID;",false,87
+201,Alter Table,false,58
+200,Drop Table,false,58
+202,Update,true,58
+232,Every  StudentID appearing in Student must exist in Enrol,false,67
+315,Primary key constraint,true,91
+316,Foreign key constraint,false,91
+317,Domain constraint,false,91
+318,Diamond,false,92
+319,Rectangle,false,92
+320,Double diamond,false,92
+321,Double rectangle,true,92
+322,Fitness centre,false,93
+323,Fitness class,true,93
+324,Trainers’ speciality,false,93
+325,Equipment ID,false,93
+326,Report of each maintenance event,false,94
+327,Status type of equipment,false,94
+328,Employee of fitness centre,true,94
+329,Time slot of fitness class,false,94
+330,Associate member,false,95
+331,Employee ID,true,95
+332,Fitness class,false,95
+333,Fitness centre,false,95
+334,Weight gain,false,96
+335,Weight loss,false,96
+336,Strength building,false,96
+337,Speciality,true,96
+338,Equipments' status,false,97
+339,Fitness class,false,97
+340,Associate member,true,97
+341,Trainers’ speciality,false,97
+342,Phone number of technician,false,98
+343,Date of maintenance event,false,98
+344,Name of employee,false,98
+345,Time slot of fitness class,true,98
+346,Attribute and domain,false,99
+347,Entity and relationship,false,99
+348,Superclass and subclass,true,99
+349,Entity and attribute,false,99
+350,"1 : 1",false,100
+351,"1: N",false,100
+353,Partial,true,101
+354,Total,false,101
+355,Partial,false,102
+356,Total,true,102
+357,"1 : 1",false,103
+358,"1: N",true,103
+360,Partial,true,104
+361,Total,false,104
+362,Partial,false,105
+363,Total,true,105
+365,"Model ""trainer"" as an entity and model ""speciality"" as an attribute",false,106
+366,"Model ""trainer"" as an entity and model ""speciality"" as a multi-valued attribute",true,106
+368,Landline number,false,107
+369,Address,false,107
+370,ID,true,107
+371,Name,false,107
+372,For each fitness class the start date must be before the end date.,false,108
+373,Each piece of equipment should be maintained at least twice a year.,false,108
+374,Each fitness class is instructed by only one trainer and not all trainers deliver fitness classes.,true,108
+375,"Each piece of equipment has a unique ID and must have one of the following three status types: new, working or broken.",false,108
+359,N:N,false,103
+376,XY→XYZ,false,109
+377,X→YZ,false,109
+378,XYZ→Z,true,109
+379,YZ→X,false,109
+380,A,false,110
+381,AB,false,110
+382,ABC,true,110
+383,ABCD,false,110
+384,True,false,111
+385,False,true,111
+386,True,true,112
+387,False,false,112
+388,A,false,113
+389,AB,false,113
+390,ABC,false,113
+391,ABCD,true,113
+392,True,true,114
+393,False,false,114
+394,True,true,115
+395,False,false,115
+396,True,false,116
+397,False,true,116
+398,True,true,117
+399,False,false,117
+400,True,false,118
+401,False,true,118
+402,True,false,119
+403,False,true,119
+404,True,true,120
+405,False,false,120
+406,True,false,121
+407,False,true,121
+408,True,true,122
+409,False,false,122
+410,True,true,123
+411,False,false,123
+412,True,false,124
+413,False,true,124
+414,True,true,125
+415,False,false,125
+416,True,false,126
+417,False,true,126
+418,True,true,127
+419,False,false,127
+420,True,true,128
+421,False,false,128
+422,True,false,129
+423,False,true,129
+352,N:N  ,true,100
+364,"Model ""speciality"" as an entity type",false,106
+367,"Model ""trainer"" as an entity type and model ""speciality"" as a weak entity type that is related to the entity type ""trainer""",false,106
+436,"A relation schema R is in BCNF if whenever a non-trivial FD X→ A holds in R, then A is a prime attribute.",false,133
+437,"A relation schema R is in 3NF if whenever a non-trivial FD X→ A holds in R, then X is a superkey.",false,133
+438,"A relation schema R is in BCNF if whenever a non-trivial FD X→ A holds in R, then X is a superkey.",true,133
+439,"A relation schema R is in 3NF if whenever a non-trivial FD X→ A holds in R, then A is a prime attribute.",false,133
+440,R is in 3NF and R is in BCNF.,true,134
+441,R is in 3NF and R is not in BCNF.,false,134
+442,R is not in 3NF and R is not in BCNF.,false,134
+443,R is not in 3NF and R is in BCNF.,false,134
+444,R is in 3NF and R is in BCNF.,true,135
+445,R is in 3NF and R is not in BCNF.,false,135
+446,R is not in 3NF and R is not in BCNF.,false,135
+447,R is not in 3NF and R is in BCNF.,false,135
+448,R is in 3NF and R is in BCNF.,false,136
+449,R is in 3NF and R is not in BCNF.,false,136
+450,R is not in 3NF and R is not in BCNF.,true,136
+451,R is not in 3NF and R is in BCNF.,false,136
+452,R is in 3NF and R is in BCNF.,true,137
+453,R is in 3NF and R is not in BCNF.,false,137
+454,R is not in 3NF and R is not in BCNF.,false,137
+455,R is not in 3NF and R is in BCNF.,false,137
+456,R is in 3NF and R is in BCNF.,false,138
+457,R is in 3NF and R is not in BCNF.,true,138
+458,R is not in 3NF and R is not in BCNF.,false,138
+459,R is not in 3NF and R is in BCNF.,false,138
+460,BCNF is a a less restrictive normal form compared to 3NF.,false,139
+461,BCNF can only minimise (not necessarily eliminate) redundancy.,false,139
+462,BCNF eliminates redundancy. ,true,139
+463,"3NF is a a more restrictive normal form compared to BCNF.",false,140
+464,"3NF can only minimise (not necessarily eliminate) redundancy.",true,140
+465,"3NF eliminates redundancy. ",false,140
+466,"If R is in BCNF, then R must be in 3NF.",true,141
+467,"If R is in 3NF, then R must be in BCNF.",false,141
+468,"If R is in BCNF, then R cannot be in 3NF.",false,141
+469,"If R is in 3NF, then R cannot be in BCNF.",false,141
+470,BCNF decomposition is always a dependency-preserving decomposition.,false,142
+471,"3NF decomposition is always a dependency-preserving decomposition.",true,142
+472,BCNF decomposition cannot be a dependency-preserving decomposition.,false,142
+473,"3NF decomposition cannot be a dependency-preserving decomposition.",false,142
+474,The BCNF decomposition is always unique for any R and Σ.,false,143
+475,The 3NF decomposition is always unique for any R and Σ.,false,143
+476,There exists an algorithm that can always generate a lossless and dependency-preserving decomposition into 3NF.,true,143
+477,There exists an algorithm that can always generate a lossless and dependency-preserving decomposition into BCNF.,false,143
+426,Does not fulfil the lossless join property but fulfils the dependency preserving property.,false,130
+424,Fulfils both lossless join and dependency preserving properties.,true,130
+427,Fulfils neither the lossless join property nor the dependency preserving property.,false,130
+425,Fulfils the lossless join property but does not fulfil the dependency preserving property.,false,130
+430,Does not fulfil the lossless join property but fulfils the dependency preserving property.,false,131
+428,Fulfils both lossless join and dependency preserving properties.,false,131
+431,Fulfils neither the lossless join property nor the dependency preserving property.,false,131
+429,Fulfils the lossless join property but does not fulfil the dependency preserving property.,true,131
+434,Does not fulfil the lossless join property but fulfils the dependency preserving property.,false,132
+432,Fulfils both lossless join and dependency preserving properties.,true,132
+435,Fulfils neither the lossless join property nor the dependency preserving property.,false,132
+433,Fulfils the lossless join property but does not fulfil the dependency preserving property.,false,132
+478,"6",false,146
+479,"4",true,146
+480,"2",false,146
+481,"0",false,146
+482,"3",false,147
+483,"2",true,147
+484,"1",false,147
+485,"0",false,147
+486,"4",false,148
+487,"3",true,148
+488,"2",false,148
+489,"1",false,148
+490,"4",false,149
+491,"3",true,149
+492,"2",false,149
+493,"1",false,149
+494,"6",false,150
+495,"5",false,150
+496,"4",true,150
+497,"3",false,150
+498,"4",false,151
+499,"3",false,151
+500,"2",false,151
+501,"1",true,151
+502,"4",false,152
+503,"3",false,152
+504,"2",true,152
+505,"1",false,152
+506,"28",true,153
+507,"12",false,153
+508,"7",false,153
+509,"4",false,153
+510,"28",false,154
+511,"12",true,154
+512,"7",false,154
+513,"4",false,154
+514,"28",false,155
+515,"12",false,155
+516,"7",true,155
+517,"4",false,155
+518,"28",false,156
+519,"12",false,156
+520,"7",true,156
+521,"4",false,156
+522,"16",false,157
+523,"12",false,157
+524,"8",false,157
+525,"4",true,157
+526,"12",false,158
+527,"9",false,158
+528,"7",false,158
+529,"3",true,158
+530,"28",false,159
+531,"21",true,159
+532,"12",false,159
+533,"7",false,159
+534,"16",true,160
+535,"8",false,160
+536,"4",false,160
+537,"0",false,160
+538,"28",false,161
+539,"17",true,161
+540,"12",false,161
+541,"7",false,161
+542,"16",false,162
+544,"8",false,162
+545,"5",false,162
+546,Yes,true,163
+547,No,false,163
+548,Yes,false,164
+549,No,true,164
+550,Yes,false,165
+551,No,true,165
+552,Yes,false,166
+553,No,true,166
+554,Yes,true,167
+555,No,false,167
+557,only B,false,168
+559,neither A nor B,false,168
+560,only A,false,169
+561,only B,false,169
+562,both A and B,true,169
+563,neither A nor B,false,169
+564,only A,false,170
+565,only B,false,170
+566,both A and B,false,170
+567,neither A nor B,true,170
+568,only A,false,171
+569,only B,true,171
+570,both A and B,false,171
+571,neither A nor B,false,171
+572,only A,false,172
+573,only B,false,172
+574,both A and B,false,172
+575,neither A nor B,true,172
+576,only A,false,173
+577,only B,true,173
+578,both A and B,false,173
+579,neither A nor B,false,173
+580,only A,false,174
+581,only B,false,174
+582,both A and B,false,174
+583,neither A nor B,true,174
+584,only A,false,175
+585,only B,false,175
+586,both A and B,true,175
+587,neither A nor B,false,175
+588,only A,false,176
+589,only B,false,176
+590,both A and B,true,176
+591,neither A nor B,false,176
+592,only A,false,177
+593,only B,false,177
+594,both A and B,true,177
+595,neither A nor B,false,177
+596,only A,true,178
+597,only B,false,178
+598,both A and B,false,178
+599,neither A nor B,false,178
+600,A specified attribute,false,179
+601,A specified tuple,true,179
+602,An entire relation,false,179
+603,None of the above,false,179
+604,Data encryption,false,180
+605,Access controls,false,180
+606,Auditing,true,180
+607,Authentication,false,180
+608,With grant privilege,false,181
+609,Allow grant privilege,false,181
+610,Allow grant option,false,181
+611,With grant option,true,181
+612,Use different levels of security to classify users and data.,true,182
+613,Allow owners of objects to determine who has access to their objects,false,182
+614,Control a list of authorized users using the GRANT and REVOKE commands,false,182
+615,Manage access control lists by assigning roles to users,false,182
+616,SQL injection may occur when an input is used in the construction of an SQL query without being adequately constrained or sanitized,false,183
+617,SQL injection allows an attacker to access a SQL database and execute SQL commands under the privileges of a user who connects to the database,false,183
+620,GRANT select ON salary TO Tom no cascade;,false,184
+621,REVOKE select ON salary FROM Tom restrict;,true,184
+622,GRANT select ON salary TO Tom no restrict;,false,184
+623,REVOKE select ON salary FROM Tom cascade;,false,184
+624,A user who creates a view can always receive the select and update privileges on that view.,false,185
+625,A user who creates a view can always receive the update privilege on that view if the user has the update privilege on the underlying tables/views used to define the view.,false,185
+626,A user who creates a view does not necessarily receive all privileges on that view.,true,185
+627,A user who creates a view receives all privileges on that view.,false,185
+628,Objects that do not have an owner cannot be modified.,false,186
+629,The database administrator is an owner of each object.,false,186
+630,"For each object, the database administrator can grant privileges to other users at their own discretion.",false,186
+631,Each object has an owner who has full control on managing the privileges to the object.,true,186
+632,"DAC relies only on the identity of a user, leaving room for Trojan Horse attacks.",true,187
+633,"DAC relies on certificates of a user, leaving room for attackers to use those certificates.",false,187
+634,"DAC does not rely on the identity of a user, leaving room for Trojan Horse attacks.",false,187
+635,"DAC does not regulate the role of a user, leaving room for Trojan Horse attacks.",false,187
+642,"var City; City = Request.form (""City""); var SQL = ""select * from OrdersTable where City = '"" + City + ""'"";",true,189
+643,"var SQL = ""select * from OrdersTable where City = ‘Canberra’"";",false,189
+644,"var City; City =‘Canberra’; var SQL = ""select * from OrdersTable where City = '"" + City + “'"";",false,189
+645,None of the above,false,189
+646,"File, printer, and mailbox roles.",false,190
+647,"Sales, marketing, management, and production roles.",true,190
+648,User and workstation roles.,false,190
+649,Resource and department roles.,false,190
+650,A method of restricting user access to a database system,true,191
+651,A method of restricting user access to data in a database system,false,191
+652,A method of restricting operations on data stored in a database system,false,191
+653,All of the above,false,191
+654,Both Amy and Peter have the select privilege on Event,false,192
+636,Access control list and Ownership,false,188
+638,Group membership and Role,false,188
+639,User security clearance and Data classification,true,188
+543,"4",true,162
+558,both A and B,true,168
+556, only A,false,168
+655,"Amy has the select privilege on Event, but Peter does not have this privilege",true,192
+656,"Peter has the select privilege on Event, but Amy does not have this privilege",false,192
+657,None of Amy and Peter have the select privilege on Event,false,192
+658,Both Amy and Peter have the select privilege on Event,false,193
+659,"Amy has the select privilege on Event, but Peter does not have this privilege",false,193
+660,"Peter has the select privilege on Event, but Amy does not have this privilege",true,193
+661,None of Amy and Peter have the select privilege on Event,false,193
+662,Confidentiality,false,194
+663,Availability,false,194
+664,Integrity,true,194
+665,Accountability,false,194
+666,Write down rule,false,195
+667,Write up rule,false,195
+668,Read down rule,true,195
+669,Read up rule,false,195
+670,A Trojan is a small malicious program that runs hidden on the infected system.,false,196
+671,A Trojan is created with the intent and it can infect the system by misleading a user.,false,196
+672,A Trojan works in the background and steals sensitive data.,false,196
+673,"A Trojan can self-replicate, as a virus does.",true,196
+674,A method that is used to secretly pass information and not normally used for communication,true,197
+675,A method that is used to transmit secret or top secret data,false,197
+676,A trusted channel that is used for communication,false,197
+677,Any channel that crosses the security perimeter,false,197
+678,Authentication by what you have,false,198
+679,Authentication by what you know,false,198
+680,Authentication by what you are,false,198
+681,Two-factor authentication,true,198
+618,SQL injection can be prevented by removing the privileges of a user who connects to the database,true,183
+682,None of the above,false,183
+683,Recover manager,false,199
+684,Concurrency control,true,199
+685,Storage manager,false,199
+686,File manager,false,199
+688,T1 and T2 produce correct results if T1 is executed after T2 commits,false,200
+689,T1 and T2 produce correct results if T1 and T2 are executed concurrently but do not access any common data items,false,200
+690,All of the above,true,200
+691,Read committed,true,201
+692,Read uncommitted,false,201
+693,Serializable,false,201
+694,Repeatable read,false,201
+695,Consistency,false,202
+696,Serializability,true,202
+697,Atomicity,false,202
+698,All of the above,false,202
+699,Read,false,203
+700,Write,false,203
+701,Read and write,true,203
+702,Update,false,203
+703,"Once a transaction has released a lock, this transaction can not acquire any more locks",false,204
+704,A transaction can release all its locks when this transaction commits,false,204
+705,A transaction can acquire all the locks which it needs when this transaction begins,false,204
+706,All of the above,true,204
+707,Unrepeatable read,false,205
+708,Phantom read,true,205
+709,Dirty read,false,205
+710,Lost update,false,205
+711,Increase throughput,false,206
+712,Reduce average response time,false,206
+713,Increase utilisation,false,206
+714,All of the above,true,206
+715,Atomicity and integrity,false,207
+716,Atomicity and durability,true,207
+717,Atomicity and isolation,false,207
+718,Durability and isolation,false,207
+719,Lost update,false,208
+720,Dirty read,true,208
+721,Unrepeatable read,false,208
+722,Phantom read,false,208
+723,Lost update,false,209
+726,Phantom read,false,209
+727,Lost update,true,210
+728,Dirty read,false,210
+729,Unrepeatable read,false,210
+730,Phantom read,false,210
+731,"66 and 82",false,211
+732,"81 and 90",false,211
+733,"66 and 90",true,211
+734,None of the above,false,211
+735,"66 and 82",false,212
+736,"81 and 90",false,212
+737,"66 and 90",true,212
+738,None of the above,false,212
+739,"66, 81, 82 and 90",false,213
+740,"66, 76, 81, 82, 87, and 90",true,213
+741,"66, 78, 81, 82, 88, and 90",false,213
+742,"66 and 90",false,213
+743,None of the above,false,213
+744,Undo the changes before commit,false,214
+745,Clear all changes,false,214
+746,Redo the changes before commit,false,214
+747,Nothing,true,214
+752,Schedule 1and Schedule 2,false,216
+753,Schedule 2 and Schedule 3,false,216
+754,Schedule 3 and Schedule 4,false,216
+759,"None of 1, 2 and 3",false,217
+760,"Redo the operations that have not been committed, i.e., write(A) and write(B) from T1",false,218
+761,"Undo the operations that have not been committed, i.e., write(A) and write(B) from T1",true,218
+762,"Redo the operations that have not been committed, i.e., write(B) from T1",false,218
+763,"Undo the operations that have not been committed, i.e., write(B) from T1",false,218
+764,"Redo the operations that have been committed, i.e., write(D) from T2 and write(A) from T1",false,219
+765,"Undo the operations that have been committed, i.e., write(D) from T2 and write(A) from T1",false,219
+766,"Redo the operations that have been committed, i.e., write(D) from T2",true,219
+767,"Undo the operations that have been committed, i.e., write(D) from T2",false,219
+756,Schedule 1,false,217
+757,Schedule 2,false,217
+724,Dirty read,false,209
+725,Unrepeatable read,true,209
+758,Schedule 3,true,217
+687,A schedule of T1 and T2 can be serialized if T1 and T2 are executed under the two phase locking protocol,false,200
+755,Schedule 1 and Schedule 4,false,216
+768,Schedule 2 and Schedule 4,true,216

Question_KC_Relationships.csv

@@ -0,0 +1,403 @@
+"id","question_id","knowledgecomponent_id"
+239,56,22
+240,56,23
+241,38,16
+242,39,13
+243,39,14
+246,41,13
+247,41,14
+248,42,18
+249,43,19
+250,44,18
+326,17,10
+251,57,29
+252,66,34
+253,66,20
+399,71,35
+401,72,29
+1097,218,97
+887,165,68
+888,165,76
+901,169,33
+902,169,77
+903,169,78
+289,59,30
+405,64,29
+295,60,30
+296,61,31
+297,62,33
+298,62,28
+327,17,12
+328,18,9
+329,18,11
+330,19,13
+331,19,6
+409,74,37
+410,74,36
+335,20,11
+336,20,13
+411,74,29
+412,75,36
+337,20,6
+413,75,29
+305,3,4
+306,4,6
+307,5,6
+308,6,7
+309,7,8
+310,8,6
+311,9,11
+312,10,10
+313,10,11
+314,11,9
+338,21,11
+339,21,13
+317,12,9
+318,12,10
+340,21,6
+341,22,10
+342,22,7
+343,23,8
+344,23,11
+345,24,10
+346,25,9
+347,25,11
+348,28,6
+349,28,7
+350,29,9
+351,29,10
+352,29,7
+353,30,11
+354,30,6
+414,75,39
+415,76,9
+357,31,12
+358,31,6
+416,76,29
+417,77,40
+363,49,18
+364,49,27
+365,48,18
+366,48,27
+367,46,18
+368,46,27
+418,77,29
+419,78,29
+422,79,41
+374,2,4
+423,79,29
+424,81,43
+425,81,29
+426,80,42
+381,40,16
+382,40,17
+427,80,29
+428,82,29
+385,55,24
+386,55,23
+389,63,29
+390,65,24
+391,65,20
+321,13,10
+437,83,44
+322,13,11
+396,68,29
+438,83,29
+441,85,32
+442,85,29
+165,16,9
+166,16,12
+446,87,36
+447,87,29
+448,86,32
+449,86,44
+450,86,29
+451,84,44
+452,84,29
+453,14,6
+455,67,24
+456,67,19
+457,58,28
+187,26,9
+188,26,10
+189,26,11
+190,27,10
+191,27,11
+470,15,9
+471,15,12
+202,32,12
+203,32,6
+204,33,12
+205,33,6
+206,34,12
+207,34,6
+208,35,12
+209,35,6
+475,92,48
+476,92,51
+477,92,45
+478,92,46
+217,36,14
+218,45,19
+219,45,20
+482,91,50
+483,91,34
+484,91,45
+228,50,18
+229,50,27
+230,51,22
+231,51,23
+232,52,24
+233,53,25
+234,54,25
+235,54,26
+236,37,15
+881,163,68
+882,163,76
+885,164,68
+522,109,64
+523,109,65
+886,164,76
+889,166,68
+890,166,76
+893,167,68
+894,167,76
+529,111,64
+530,111,17
+531,111,18
+532,110,64
+533,110,66
+534,112,64
+535,112,67
+536,113,64
+537,113,66
+538,114,64
+539,114,17
+540,114,18
+541,115,64
+542,115,67
+545,117,64
+546,117,67
+547,118,64
+548,118,67
+904,170,33
+905,170,77
+553,121,64
+554,121,69
+555,122,64
+556,122,69
+908,171,33
+909,171,77
+910,172,76
+560,123,64
+561,123,17
+562,123,27
+563,124,64
+564,124,17
+565,124,27
+566,125,64
+567,125,17
+568,125,27
+569,126,64
+570,126,17
+571,126,27
+911,173,10
+912,173,76
+576,128,64
+577,128,17
+578,128,27
+579,129,64
+580,129,17
+581,129,27
+915,174,10
+916,174,76
+917,175,9
+918,175,76
+919,176,9
+920,176,76
+921,177,76
+922,178,76
+923,179,81
+591,133,74
+924,179,82
+925,179,83
+926,180,80
+927,181,82
+596,136,74
+597,136,75
+928,181,83
+929,182,81
+600,138,64
+601,138,74
+602,138,75
+603,139,74
+604,139,71
+605,140,75
+606,140,71
+607,141,74
+608,141,75
+609,141,71
+610,142,73
+611,142,75
+612,143,72
+613,143,73
+614,143,75
+930,182,84
+932,184,86
+618,131,72
+619,131,73
+620,131,71
+621,127,64
+622,127,70
+623,132,72
+624,132,73
+625,132,71
+933,185,87
+934,186,82
+641,130,72
+642,130,73
+643,130,71
+644,134,74
+645,134,75
+646,135,74
+647,135,75
+648,137,74
+649,137,75
+656,119,64
+657,119,68
+658,120,64
+659,120,68
+660,116,64
+661,116,68
+807,146,76
+808,146,77
+815,148,76
+816,148,77
+821,150,9
+822,150,76
+823,150,77
+824,150,78
+825,151,11
+826,151,76
+827,151,77
+828,151,78
+833,152,11
+834,152,76
+835,152,77
+836,152,78
+837,153,6
+838,154,76
+839,154,77
+840,154,6
+843,155,33
+844,155,76
+845,156,33
+846,156,76
+847,157,33
+848,157,76
+849,158,33
+850,158,76
+851,158,78
+854,159,33
+855,159,76
+856,160,76
+857,160,77
+858,160,6
+859,160,79
+860,161,33
+861,161,76
+862,161,79
+867,149,9
+868,149,76
+869,149,77
+870,149,78
+935,187,82
+937,189,85
+939,191,89
+940,192,83
+941,192,86
+942,193,83
+943,193,86
+944,194,80
+945,195,84
+946,196,90
+947,197,80
+948,198,89
+1098,219,91
+1099,200,91
+952,188,84
+953,183,85
+1100,162,33
+1101,162,76
+1102,162,77
+1103,162,79
+1104,147,76
+1105,147,78
+1115,100,57
+1116,100,59
+1121,103,57
+980,201,93
+1122,103,60
+982,203,91
+983,204,96
+985,206,95
+986,207,97
+987,202,95
+1129,95,16
+1130,96,16
+1132,98,52
+1133,99,54
+1134,99,55
+1135,93,48
+1136,93,45
+1137,93,46
+1138,94,48
+1139,97,51
+1140,101,58
+1141,101,63
+1142,102,49
+1143,102,58
+1144,104,58
+1145,104,63
+1146,105,49
+1147,105,58
+1148,106,16
+1149,106,48
+1150,106,46
+1151,107,52
+1152,108,48
+1153,108,45
+1154,108,46
+1158,190,88
+1161,168,33
+1162,168,77
+1163,168,78
+1165,69,29
+1166,70,29
+1167,208,98
+1168,208,95
+1171,210,100
+1043,211,93
+1044,211,103
+1045,212,91
+1046,212,93
+1047,212,102
+1048,213,101
+1049,213,93
+1050,213,102
+1051,213,103
+1052,214,91
+1172,210,95
+1176,217,101
+1177,205,95
+1180,216,96
+1181,47,18
+1182,47,27
+1183,209,99
+1184,209,95
+1185,73,37
+1186,73,29
+1187,73,38
+1188,199,92
+1189,199,93
+1190,199,94

Specialization.csv

@@ -0,0 +1,9 @@
+"id","title"
+5,College of Arts and Social Sciences
+6, College of Asia and the Pacific
+7, College of Business and Economics
+8, College of Engineering and Computer Science
+9, College of Health and Medicine
+10, College of Law
+11,College of Science
+12,Other Academic Units

Student_Specialization.csv

@@ -0,0 +1,409 @@
+"id","specialization_id","student_id"
+1,,1
+2,,5
+3,8,11
+4,8,12
+5,8,6
+6,7,17
+7,7,20
+8,7,26
+9,8,36
+10,8,41
+11,8,68
+12,8,55
+13,7,71
+14,7,79
+15,8,102
+16,8,65
+17,8,112
+18,7,78
+19,7,66
+20,8,118
+21,11,142
+22,8,135
+23,8,148
+24,8,119
+25,8,155
+26,8,154
+27,8,186
+28,8,123
+29,8,214
+30,8,215
+31,8,224
+32,7,226
+33,8,84
+34,8,178
+35,8,246
+36,7,249
+37,8,165
+38,7,126
+39,8,173
+40,8,245
+41,7,260
+42,8,272
+43,8,180
+44,7,275
+45,8,111
+46,7,280
+47,8,51
+48,8,132
+49,7,150
+50,8,131
+51,8,294
+52,8,39
+53,8,32
+54,7,320
+55,7,327
+56,8,164
+57,11,120
+58,7,281
+59,11,336
+60,8,181
+61,8,122
+62,8,216
+63,8,53
+64,8,352
+65,8,209
+66,8,312
+67,11,206
+68,7,237
+69,8,328
+70,8,24
+71,8,376
+72,8,188
+73,8,122
+74,7,144
+75,7,396
+76,7,101
+77,8,243
+78,8,403
+79,7,364
+80,8,37
+81,8,426
+82,5,434
+83,8,438
+84,8,444
+85,7,441
+86,8,455
+87,8,459
+88,8,460
+89,7,428
+90,8,458
+91,8,446
+92,7,466
+93,8,470
+94,8,474
+95,8,475
+96,8,482
+97,8,484
+98,8,487
+99,8,489
+100,8,504
+101,8,496
+102,8,508
+103,8,512
+104,8,516
+105,8,472
+106,8,525
+107,8,527
+108,9,529
+109,11,533
+110,8,534
+111,8,522
+112,8,540
+113,8,542
+114,6,509
+115,8,486
+116,8,573
+117,8,541
+118,8,513
+119,8,582
+120,8,538
+121,5,555
+122,8,556
+123,8,507
+124,8,499
+125,8,517
+126,5,590
+127,5,590
+128,11,553
+129,12,587
+130,8,593
+131,11,595
+132,8,468
+133,8,580
+134,8,599
+135,8,601
+136,8,497
+137,8,609
+138,7,495
+139,8,617
+140,11,619
+141,7,625
+142,8,628
+143,8,634
+144,8,635
+145,8,641
+146,8,643
+147,8,644
+148,8,650
+149,8,665
+150,8,667
+151,8,673
+152,7,681
+153,8,684
+154,8,686
+155,8,654
+156,8,690
+157,8,680
+158,7,694
+159,8,691
+160,7,698
+161,8,702
+162,8,703
+163,8,702
+164,7,707
+165,8,669
+166,8,711
+167,7,721
+168,8,723
+169,7,689
+170,8,724
+171,7,741
+172,8,645
+173,8,742
+174,7,621
+175,8,666
+176,8,750
+177,8,752
+178,11,755
+179,5,758
+180,8,739
+181,7,759
+182,8,532
+183,7,588
+184,5,769
+185,7,421
+186,11,786
+187,7,796
+188,8,536
+189,8,745
+190,8,800
+191,8,800
+192,8,753
+193,11,786
+194,9,826
+195,12,505
+196,8,735
+197,8,735
+198,8,704
+199,8,33
+200,8,853
+201,8,872
+202,8,844
+203,8,583
+204,8,506
+205,8,881
+206,8,747
+207,7,649
+208,7,488
+209,8,912
+210,8,498
+211,5,491
+212,8,862
+213,8,876
+214,8,662
+215,8,797
+216,8,868
+217,7,868
+218,8,954
+219,7,780
+220,8,630
+221,7,950
+222,8,810
+223,7,956
+224,8,692
+225,7,679
+226,7,965
+227,7,659
+228,8,970
+229,7,964
+230,8,982
+231,8,873
+232,8,728
+233,7,967
+234,7,987
+235,8,935
+236,7,967
+237,8,975
+238,8,1008
+239,8,1011
+240,7,816
+241,8,1016
+242,8,1021
+243,7,1024
+244,8,1027
+245,8,768
+246,8,1019
+247,8,1050
+248,7,1005
+249,8,1079
+250,8,1080
+251,9,1082
+252,8,1078
+253,8,1084
+254,11,1088
+255,8,1095
+256,8,1096
+257,8,1100
+258,8,1091
+259,8,1076
+260,8,1092
+261,8,1118
+262,8,1106
+263,11,1120
+264,8,1103
+265,8,1122
+266,8,1125
+267,10,1110
+268,7,1128
+269,8,1081
+270,8,1131
+271,8,1131
+272,8,1117
+273,8,1077
+274,8,1075
+275,8,1147
+276,8,1156
+277,7,1160
+278,8,1168
+279,8,1168
+280,8,1172
+281,8,1163
+282,8,1183
+283,8,1184
+284,11,1145
+285,8,1190
+286,11,1194
+287,8,1164
+288,8,1202
+289,5,1204
+290,8,1203
+291,8,1208
+292,8,1211
+293,7,1153
+294,8,1214
+295,8,1225
+296,7,1144
+297,8,1227
+298,8,1216
+299,8,1215
+300,8,1165
+301,8,1231
+302,8,1186
+303,9,1236
+304,8,1218
+305,7,1240
+306,8,1255
+307,8,1256
+308,8,1251
+309,8,1279
+310,8,1223
+311,8,1188
+312,8,1293
+313,8,1294
+314,8,392
+315,8,392
+316,8,392
+317,8,392
+318,8,392
+319,8,392
+320,8,392
+321,8,392
+322,8,392
+323,8,392
+324,8,392
+325,8,392
+326,8,392
+327,8,392
+328,8,392
+329,8,392
+330,8,392
+331,8,392
+332,8,392
+333,8,392
+334,8,392
+335,8,392
+336,8,392
+337,8,1298
+338,8,1305
+339,8,1306
+340,8,1212
+341,11,1312
+342,7,1331
+343,11,1159
+344,11,1159
+345,8,1342
+346,8,1265
+347,7,1343
+348,7,1193
+349,8,1303
+350,7,1138
+351,8,1258
+352,8,1354
+353,8,1282
+354,8,1282
+355,11,1364
+356,8,1239
+357,8,1375
+358,11,1389
+359,7,1339
+360,11,1398
+361,8,1400
+362,8,1403
+363,7,1385
+364,7,1385
+365,8,1394
+366,8,1416
+367,8,1275
+368,7,1316
+369,8,1349
+370,8,1430
+371,8,1371
+372,11,1149
+373,8,1217
+374,7,1374
+375,8,1271
+376,8,1405
+377,7,1463
+378,5,1459
+379,8,1357
+380,7,1191
+381,11,1470
+382,8,1471
+383,7,1503
+384,11,1148
+385,7,1391
+386,8,1379
+387,8,1492
+388,8,1510
+389,11,1264
+390,8,1472
+391,8,1467
+392,8,1443
+393,8,1557
+394,8,1559
+395,8,1569
+396,8,1572
+397,8,1573
+398,8,1561
+399,8,1564
+400,8,1558
+401,8,1566
+402,8,1571
+403,8,1583
+404,8,1562
+405,8,1584
+406,8,1579
+407,8,1563
+408,8,1590

Transaction.csv

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c5f554ed776bce9ce9a556b21afcab894e963bf8ea5adae94668a98282c13af6
+size 16882652