EECE 330 Project Solution, Fall 2011

Changed: deletewaitlists function (use get pointer) add comments to NOT USED setgrade addanddrop in admissions and in { addstudentcourse, removestudentcourse in functionsII } everything related to class average updated menu search by title,instructor name, student lists in courses This is a simple test data with the following errors: 1- SE440 is offered while it is not active! 2- One section of IT130 is asked for by two instructors. IT110 for student 201100037 had no grade inputted. Grade was assumed equal to GPA. IT130 for student 201100037 had no grade inputted. Grade was assumed equal to GPA. IT140 for student 201100037 had no grade inputted. Grade was assumed equal to GPA. IT120 for student 200900004 had no grade inputted. Grade was assumed equal to GPA. IT220 for student 200900004 had no grade inputted. Grade was assumed equal to GPA. IT230 for student 200900004 had no grade inputted. Grade was assumed equal to GPA. IT240 for student 200900004 had no grade inputted. Grade was assumed equal to GPA. BT410 for student 200900001 had no grade inputted. Grade was assumed equal to GPA. BT420 for student 200900001 had no grade inputted. Grade was assumed equal to GPA. BT430 for student 200900001 had no grade inputted. Grade was assumed equal to GPA. BT440 for student 200900001 had no grade inputted. Grade was assumed equal to GPA. SA410 for student 200900002 had no grade inputted. Grade was assumed equal to GPA. SA420 for student 200900002 had no grade inputted. Grade was assumed equal to GPA. SA430 for student 200900002 had no grade inputted. Grade was assumed equal to GPA. SA440 for student 200900002 had no grade inputted. Grade was assumed equal to GPA. SE110 for student 200900003 had no grade inputted. Grade was assumed equal to GPA. BT410 for student 200900005 had no grade inputted. Grade was assumed equal to GPA. BT420 for student 200900005 had no grade inputted. Grade was assumed equal to GPA. BT430 for student 200900005 had no grade inputted. Grade was assumed equal to GPA. BT440 for student 200900005 had no grade inputted. Grade was assumed equal to GPA. SE410 for student 200900007 had no grade inputted. Grade was assumed equal to GPA. SE420 for student 200900007 had no grade inputted. Grade was assumed equal to GPA. SE410 for student 200900008 had no grade inputted. Grade was assumed equal to GPA. SE420 for student 200900008 had no grade inputted. Grade was assumed equal to GPA. SE410 for student 200900009 had no grade inputted. Grade was assumed equal to GPA. SE420 for student 200900009 had no grade inputted. Grade was assumed equal to GPA. BT410 for student 200900011 had no grade inputted. Grade was assumed equal to GPA. BT420 for student 200900011 had no grade inputted. Grade was assumed equal to GPA. BT430 for student 200900011 had no grade inputted. Grade was assumed equal to GPA. BT440 for student 200900011 had no grade inputted. Grade was assumed equal to GPA. BT410 for student 200900012 had no grade inputted. Grade was assumed equal to GPA. BT420 for student 200900012 had no grade inputted. Grade was assumed equal to GPA. BT430 for student 200900012 had no grade inputted. Grade was assumed equal to GPA. BT440 for student 200900012 had no grade inputted. Grade was assumed equal to GPA. BT410 for student 200900013 had no grade inputted. Grade was assumed equal to GPA. BT420 for student 200900013 had no grade inputted. Grade was assumed equal to GPA. BT430 for student 200900013 had no grade inputted. Grade was assumed equal to GPA. BT440 for student 200900013 had no grade inputted. Grade was assumed equal to GPA. SA410 for student 200900014 had no grade inputted. Grade was assumed equal to GPA. SA420 for student 200900014 had no grade inputted. Grade was assumed equal to GPA. SA430 for student 200900014 had no grade inputted. Grade was assumed equal to GPA. SA440 for student 200900014 had no grade inputted. Grade was assumed equal to GPA. SA410 for student 200900016 had no grade inputted. Grade was assumed equal to GPA. SA420 for student 200900016 had no grade inputted. Grade was assumed equal to GPA. SA430 for student 200900016 had no grade inputted. Grade was assumed equal to GPA. SA440 for student 200900016 had no grade inputted. Grade was assumed equal to GPA. SA410 for student 200900017 had no grade inputted. Grade was assumed equal to GPA. SA420 for student 200900017 had no grade inputted. Grade was assumed equal to GPA. SA430 for student 200900017 had no grade inputted. Grade was assumed equal to GPA. SA440 for student 200900017 had no grade inputted. Grade was assumed equal to GPA. SE410 for student 200900018 had no grade inputted. Grade was assumed equal to GPA. SE420 for student 200900018 had no grade inputted. Grade was assumed equal to GPA. SA410 for student 200900019 had no grade inputted. Grade was assumed equal to GPA. SA420 for student 200900019 had no grade inputted. Grade was assumed equal to GPA. SA430 for student 200900019 had no grade inputted. Grade was assumed equal to GPA. SA440 for student 200900019 had no grade inputted. Grade was assumed equal to GPA. IT120 for student 200900020 had no grade inputted. Grade was assumed equal to GPA. IT410 for student 200900022 had no grade inputted. Grade was assumed equal to GPA. IT420 for student 200900022 had no grade inputted. Grade was assumed equal to GPA. IT430 for student 200900022 had no grade inputted. Grade was assumed equal to GPA. SE410 for student 200900023 had no grade inputted. Grade was assumed equal to GPA. SE420 for student 200900023 had no grade inputted. Grade was assumed equal to GPA. IT110 for student 200900025 had no grade inputted. Grade was assumed equal to GPA. IT130 for student 200900025 had no grade inputted. Grade was assumed equal to GPA. IT140 for student 200900025 had no grade inputted. Grade was assumed equal to GPA. IT340 for student 200900028 had no grade inputted. Grade was assumed equal to GPA. IT420 for student 200900036 had no grade inputted. Grade was assumed equal to GPA. IT430 for student 200900036 had no grade inputted. Grade was assumed equal to GPA. IT440 for student 200900036 had no grade inputted. Grade was assumed equal to GPA. IT110 for student 201100038 had no grade inputted. Grade was assumed equal to GPA. IT120 for student 201100038 had no grade inputted. Grade was assumed equal to GPA. IT130 for student 201100038 had no grade inputted. Grade was assumed equal to GPA. IT140 for student 201100038 had no grade inputted. Grade was assumed equal to GPA. IT110 for student 201100039 had no grade inputted. Grade was assumed equal to GPA. IT120 for student 201100039 had no grade inputted. Grade was assumed equal to GPA. IT130 for student 201100039 had no grade inputted. Grade was assumed equal to GPA. IT140 for student 201100039 had no grade inputted. Grade was assumed equal to GPA. 200900001,BT410,1 200900001,BT420,1 200900001,BT430,1 200900001,BT440,1 200900002,SA410,1 200900002,SA420,1 200900002,SA430,1 200900002,SA440,1 200900003,SE410,1 200900003,SE420,1 200900003,SE430,1 200900004,IT120,1 200900004,IT220,1 200900004,IT230,1 200900004,IT240,1 200900005,BT410,1 200900005,BT420,1 200900005,BT430,1 200900005,BT440,1 200900006,IT410,1 200900006,IT420,1 200900006,IT430,1 200900006,IT440,1 200900007,SE410,1 200900007,SE420,1 200900007,SE430,1 200900008,SE410,1 200900008,SE420,1 200900008,SE430,1 200900009,SE410,1 200900009,SE420,1 200900009,SE430,1 200900010,IT110,1 200900010,IT120,1 200900010,IT130,1 200900010,IT140,1 200900011,BT410,1 200900011,BT420,1 200900011,BT430,1 200900011,BT440,1 200900012,BT410,1 200900012,BT420,1 200900012,BT430,1 200900012,BT440,1 200900013,BT410,1 200900013,BT420,1 200900013,BT430,1 200900013,BT440,1 201100039,IT110,1 201100039,IT120,1 201100039,IT130,1 201100039,IT140,1 200900014,SA410,1 200900014,SA420,1 200900014,SA430,1 200900014,SA440,1 200900015,BT410,1 200900015,BT420,1 200900015,BT430,1 200900015,BT440,1 200900016,SA410,1 200900016,SA420,1 200900016,SA430,1 200900016,SA440,1 201100038,IT110,1 201100038,IT120,1 201100038,IT130,1 201100038,IT140,1 200900017,SA410,1 200900017,SA420,1 200900017,SA430,1 200900017,SA440,1 200900018,SE410,1 200900018,SE420,1 200900018,SE430,1 200900019,SA410,1 200900019,SA420,1 200900019,SA430,1 200900019,SA440,1 200900020,IT120,1 200900020,IT420,1 200900020,IT430,1 200900020,IT320,1 200900021,SA410,1 200900021,SA420,1 200900021,SA430,1 200900021,SA440,1 200900022,IT410,1 200900022,IT420,1 200900022,IT430,1 200900023,SE410,1 200900023,SE420,1 200900023,SE430,1 200900024,BT410,1 200900024,BT420,1 200900024,BT430,1 200900024,BT440,1 200900025,IT110,1 200900025,IT120,1 200900025,IT130,1 200900025,IT440,1 200900026,SE410,1 200900026,SE420,1 200900026,SE430,1 200900027,BT410,1 200900027,BT420,1 200900027,BT430,1 200900027,BT440,1 200900028,IT340,1 200900028,IT410,1 200900028,IT420,1 200900028,IT430,1 200900028,IT440,1 200900029,SE410,1 200900029,SE420,1 200900029,SE430,1 200900030,SA410,1 200900030,SA420,1 200900030,SA430,1 200900030,SA440,1 201100037,IT110,1 201100037,IT120,1 201100037,IT130,1 201100037,SA140,1 200900031,SA410,1 200900031,SA420,1 200900031,SA430,1 200900031,SA440,1 200900032,SE410,1 200900032,SE420,1 200900032,SE430,1 200900033,SA410,1 200900033,SA420,1 200900033,SA430,1 200900033,SA440,1 200900034,SE420,1 200900034,SE430,1 200900035,BT410,1 200900035,BT420,1 200900035,BT430,1 200900035,BT440,1 200900036,IT420,1 200900036,IT430,1 200900036,IT440,1 #ifndef adm_h #define adm_h #include "bst.h" #include <iostream> #include <string> #include "eecomp1.h" #include "kecomp1.h" using namespace std; class instructor; class student; class registrar; class admissions { private: BST<string,student,KEComp1,EEComp1>* studentlist; LList<instructor>* ilist; int instructorsnumber; bool addanddrop; public: admissions(); void addinstructor(instructor c); instructor* findinstructor(string id); void addstudent (string id,string name,string prog,char stat); BinNode<student>* getroot(); student* findstudent(string ID); void callendofsem(registrar* reg,ofstream&output); void callendaddanddrop(registrar*reg,ofstream & output); void callendofauto(registrar*reg,ofstream & output); void endofauto(BinNode<student>* subroot, registrar* reg,ofstream & output); void preorderendofsem(BinNode<student>* subroot, registrar* reg,ofstream&output); void endaddanddrop(BinNode<student>* subroot, registrar* reg,ofstream & output); bool addanddroppassed(); }; #endif #ifndef alist_h #define alist_h #include <iostream> #include "list.h" using namespace std; static const int size=10; // This is the file to include in your code if you want access to the // complete AList template class // First, get the declaration for the base list class template <class Elem> // Array-based list implementation class AList { private: int maxSize; // Maximum size of list int listSize; // Actual number of elements in list int fence; // Position of fence Elem* listArray; // Array holding list elements public: AList() { // Constructor maxSize = size; listSize = fence = 0; listArray = new Elem[maxSize]; } ~AList() { delete [] listArray; } // Destructor void clear() { delete [] listArray; listSize = fence = 0; listArray = new Elem[maxSize]; } bool insert(const Elem&); bool append(const Elem&); bool remove(Elem&); void setStart() { fence = 0; } void setEnd() { fence = listSize; } void prev() { if (fence != 0) fence--; } void next() { if (fence < listSize) fence++; } int leftLength() const { return fence; } int rightLength() const { return listSize - fence; } bool setPos(int pos) { if ((pos >= 0) && (pos <= listSize)) fence = pos; return (pos >= 0) && (pos <= listSize); } bool getValue(Elem& it) const { if (rightLength() == 0) return false; else { it = listArray[fence]; return true; } } Elem* getpointer() { return &listArray[fence]; } void print() const { int temp = 0; cout << "< "; while (temp < fence) cout << listArray[temp++] << " "; cout << "| "; while (temp<listSize) cout << listArray[temp++] << " "; cout << ">\n"; } }; template <class Elem> // Insert at front of right partition bool AList<Elem>::insert(const Elem& item) { if (listSize == maxSize) return false; // List is full for(int i=listSize; i>fence; i--) // Shift Elems up listArray[i] = listArray[i-1]; // to make room listArray[fence] = item; listSize++; // Increment list size return true; } template <class Elem> // Append Elem to end of the list bool AList<Elem>::append(const Elem& item) { if (listSize == maxSize) return false; listArray[listSize++] = item; return true; } // Remove and return first Elem in right partition template <class Elem> bool AList<Elem>::remove(Elem& it) { if (rightLength() == 0) return false; // Nothing in right it = listArray[fence]; // Copy removed Elem for(int i=fence; i<listSize-1; i++) // Shift them down listArray[i] = listArray[i+1]; listSize--; // Decrement size return true; } #endif /*template <class Elem> // Array-based list implementation class AList : public List<Elem> { private: int maxSize; // Maximum size of list int listSize; // Actual number of elements in list int fence; // Position of fence, first element of right partition Elem* listArray; // Array holding list elements public: AList() { // Constructor maxSize = size; listSize = fence = 0; listArray = new Elem[maxSize]; } ~AList() { delete [] listArray; } // Destructor void clear() { delete [] listArray; listSize = fence = 0; listArray = new Elem[maxSize]; } bool insert(const Elem& item) { if (listSize == maxSize) return false; for(int i=listSize; i>fence; i--) // Shift Elems up to make room listArray[i] = listArray[i-1]; listArray[fence+1] = item; listSize++; // Increment list size cout<<2<<endl; return true; } bool append(const Elem& item) { if (listSize == maxSize) return false; listArray[listSize++] = item; return true; } bool remove(Elem& it) { if (rightLength() == 0) return false; it = listArray[fence]; // Copy Elem for(int i=fence; i<listSize-1; i++) // Shift them down listArray[i] = listArray[i+1]; // Decrement size listSize--; return true; } void setStart() { fence = 0; } void setEnd() { fence = listSize-1; } void prev() { if (fence != 0) fence--; } // void next() { if (fence <= listSize) fence++; } void next() { if (fence < listSize) fence++; } int leftLength() const { return fence+1; } int rightLength() const { return listSize - fence-1; } bool setPos(int pos) { if ((pos >= 0) && (pos <= listSize)) fence = pos; return (pos >= 0) && (pos <= listSize); } bool getValue(Elem& it) const { if (rightLength() == 0) return false; else { it = listArray[fence+1]; return true; } } void print() const {} }; */ #include <iostream> #include <string> #include "student.h" #ifndef binnode_h #define binnode_h using namespace std; template <class Elem> class BinNode { public: virtual Elem& val() =0; virtual void setVal(const Elem&) =0; virtual BinNode* left() const =0; virtual BinNode* right() const =0; virtual void setLeft (BinNode *) =0; virtual void setRight (BinNode *) =0; virtual bool isLeaf() =0; }; #endif #include <iostream> #include <string> #include "binnode.h" #ifndef binnodeptr_H #define binnodeptr_H using namespace std; template <class Elem> class BinNodePtr: public BinNode<Elem> { private: Elem it; BinNodePtr *lc; BinNodePtr *rc; public: BinNodePtr() { lc = rc = NULL; } BinNodePtr(Elem e, BinNodePtr* l = NULL, BinNodePtr* r= NULL) { it=e ; lc = l ; rc = r; } Elem& val() { return it;} void setVal (const Elem & e) { it =e;} void setLeft(BinNode<Elem> *b) { lc=(BinNodePtr*)b; } void setRight(BinNode<Elem> *b) { rc=(BinNodePtr*)b; } BinNode<Elem> *right() const {return rc;} BinNode<Elem> *left() const {return lc;} bool isLeaf(){return lc==NULL&&rc==NULL;} }; #endif #include <iostream> #include <string> #include "binnode.h" #include "dict.h" #ifndef BST_H #define BST_H using namespace std; // BST CLASS template <class Key,class Elem, class KEComp, class EEComp> class BST// : public Dictionary <Key,Elem,KEComp, EEComp> { private: BinNode <Elem>* root; int nodecount; BinNode<Elem>* inserthelp (BinNode<Elem> * subroot, Elem& val) { if (subroot==NULL) { return new BinNodePtr<Elem>(val,NULL,NULL);} if (EEComp::lt(val, subroot->val())) { //cout<<"Is less than"<<endl; subroot->setLeft(inserthelp(subroot->left(),val)); } else { //cout<<"Not less than"<<endl; subroot->setRight(inserthelp(subroot->right(),val)); } return subroot; } void clearhelp(BinNode <Elem>* root) { if (root == NULL) return; clearhelp(root->left()); clearhelp(root->right()); delete root; } void printhelp(BinNode <Elem>*subroot) {subroot->val().print();} BinNode <Elem>* removehelp(BinNode<Elem> * subroot, const Key& K, BinNode<Elem>* & t) { if (subroot == NULL) return NULL; else if (KEComp::lt(K,subroot->val())) subroot->setLeft(removehelp(subroot->left(),K,t)); else if (KEComp::gt(K,subroot->val())) subroot->setRight(removehelp(subroot->left(),K,t)); else { BinNode<Elem> *temp;t=subroot; if (subroot ->left()==NULL) subroot=subroot->right(); else if (subroot ->right()==NULL) subroot=subroot->left(); else { deletmin(subroot->right(),temp); Elem te=subroot->val(); subroot->setVal(temp->val()); temp->setVal(te); t=temp; } } return subroot; } BinNode<Elem>* deletmin(BinNode<Elem>* subroot, BinNode<Elem>* &min) { if (subroot->left()==NULL) { min=subroot; return subroot->right(); } else { subroot->setLeft(deletmin(subroot->left(),min)); return subroot; } } bool findhelp (BinNode<Elem>* subroot, const Key& K, Elem*& e) const { if (subroot == NULL) return false; else if (KEComp::lt(K,subroot->val())) { //cout<<"Is less than"<<endl; return findhelp(subroot->left(),K,e); } else if (KEComp::gt(K,subroot->val())) { //cout<<"Is greater than"<<endl; return findhelp(subroot->right(),K,e); } else { //cout<<"Is equal"<<endl; e=&(subroot->val()); return true; } } public: BST() { root = NULL; nodecount=0; } ~BST() { } void clear() { clearhelp(root); root =NULL; nodecount=0; } BinNode<Elem>* getroot() { return root; } virtual bool insert( Elem& e) { root=inserthelp(root,e); nodecount++; return true; } bool remove(const Key& K,Elem&e) { BinNode<Elem>* t=NULL; root=removehelp(root,K,t); if (t==NULL) return false; e=t->val(); nodecount--; delete t; return true; } bool find(const Key& K, Elem*& e) const { return findhelp(root, K, e); } virtual void Print(int sel) { if (sel==1) {preorder(root);} else if (sel==2) {postorder(root);} else if (sel==3) {inorder(root);} } void preorder(BinNode<Elem>* subroot) { if (subroot==NULL) return; printhelp(subroot); preorder(subroot->left()); preorder(subroot->right()); } void postorder(BinNode<Elem>* subroot) { if (subroot==NULL) return; postorder(subroot->left()); postorder(subroot->right()); printhelp(subroot); } void inorder(BinNode<Elem>* subroot) { if (subroot==NULL) return; inorder(subroot->left()); printhelp(subroot); inorder(subroot->right()); } int size() {return nodecount;} }; #endif #ifndef course_h #define course_h #include <iostream> #include <string> #include "linkedlist.h" #include "coursestudent.h" using namespace std; class course { private: string title,year; string code; char status; public: course () { title=year=code=""; status='1'; } void settitle (string ntitle) { title=ntitle; return;} void setcode (string ncode) { code=ncode; } void setyear (string nyear) { year=nyear; return;} void setstatus (char nst) { status=nst; return;} string gettitle () { return title;} string getcode () { return code;} string getyear () { return year;} char getstatus () { return status;} string getprog() { return (code.substr(0,2)); } void print () { cout<<"Name: "<<title<<" "<<"Code: "<<code<<" Status: "<<status<<endl; } }; #endif IT110 added to courses database. IT120 added to courses database. IT130 added to courses database. IT140 added to courses database. IT210 added to courses database. IT220 added to courses database. IT230 added to courses database. IT240 added to courses database. IT310 added to courses database. IT320 added to courses database. IT330 added to courses database. IT340 added to courses database. IT410 added to courses database. IT420 added to courses database. IT430 added to courses database. IT440 added to courses database. BT110 added to courses database. BT120 added to courses database. BT130 added to courses database. BT140 added to courses database. BT210 added to courses database. BT220 added to courses database. BT230 added to courses database. BT240 added to courses database. BT310 added to courses database. BT320 added to courses database. BT330 added to courses database. BT340 added to courses database. BT410 added to courses database. BT420 added to courses database. BT430 added to courses database. BT440 added to courses database. SE110 added to courses database. SE120 added to courses database. SE130 added to courses database. SE140 added to courses database. SE210 added to courses database. SE220 added to courses database. SE230 added to courses database. SE240 added to courses database. SE310 added to courses database. SE320 added to courses database. SE330 added to courses database. SE340 added to courses database. SE410 added to courses database. SE420 added to courses database. SE430 added to courses database. SE440 added to courses database. SA110 added to courses database. SA120 added to courses database. SA130 added to courses database. SA140 added to courses database. SA210 added to courses database. SA220 added to courses database. SA230 added to courses database. SA240 added to courses database. SA310 added to courses database. SA320 added to courses database. SA330 added to courses database. SA340 added to courses database. SA410 added to courses database. SA420 added to courses database. SA430 added to courses database. SA440 added to courses database. IT110 section 1 added to offered courses. IT120 section 1 added to offered courses. IT130 section 1 added to offered courses. IT140 section 1 added to offered courses. IT210 section 1 added to offered courses. IT220 section 1 added to offered courses. IT230 section 1 added to offered courses. IT240 section 1 added to offered courses. IT310 section 1 added to offered courses. IT320 section 1 added to offered courses. IT330 section 1 added to offered courses. IT340 section 1 added to offered courses. IT410 section 1 added to offered courses. IT420 section 1 added to offered courses. IT430 section 1 added to offered courses. IT440 section 1 added to offered courses. BT110 section 1 added to offered courses. BT110 section 2 added to offered courses. BT120 section 1 added to offered courses. BT120 section 2 added to offered courses. BT120 section 3 added to offered courses. BT120 section 4 added to offered courses. BT130 section 1 added to offered courses. BT140 section 1 added to offered courses. BT210 section 1 added to offered courses. BT220 section 1 added to offered courses. BT230 section 1 added to offered courses. BT240 section 1 added to offered courses. BT310 section 1 added to offered courses. BT320 section 1 added to offered courses. BT330 section 1 added to offered courses. BT340 section 1 added to offered courses. BT410 section 1 added to offered courses. BT420 section 1 added to offered courses. BT430 section 1 added to offered courses. BT440 section 1 added to offered courses. SE110 section 1 added to offered courses. SE120 section 1 added to offered courses. SE130 section 1 added to offered courses. SE140 section 1 added to offered courses. SE210 section 1 added to offered courses. SE220 section 1 added to offered courses. SE230 section 1 added to offered courses. SE240 section 1 added to offered courses. SE310 section 1 added to offered courses. SE320 section 1 added to offered courses. SE330 section 1 added to offered courses. SE410 section 1 added to offered courses. SE420 section 1 added to offered courses. Course SE440 not active this semester! SA110 section 1 added to offered courses. SA120 section 1 added to offered courses. SA130 section 1 added to offered courses. SA140 section 1 added to offered courses. SA210 section 1 added to offered courses. SA220 section 1 added to offered courses. SA230 section 1 added to offered courses. SA240 section 1 added to offered courses. SA310 section 1 added to offered courses. SA320 section 1 added to offered courses. SA330 section 1 added to offered courses. SA340 section 1 added to offered courses. SA410 section 1 added to offered courses. SA420 section 1 added to offered courses. SA430 section 1 added to offered courses. SA440 section 1 added to offered courses. IT Course 1,IT110,A,Y1 IT Course 2,IT120,A,Y1 IT Course 3,IT130,A,Y1 IT Course 4,IT140,A,Y1 IT Course 5,IT210,A,Y2 IT Course 6,IT220,A,Y2 IT Course 7,IT230,A,Y2 IT Course 8,IT240,A,Y2 IT Course 9,IT310,A,Y3 IT Course 10,IT320,A,Y3 IT Course 11,IT330,A,Y3 IT Course 12,IT340,A,Y3 IT Course 13,IT410,A,Y4 IT Course 14,IT420,A,Y4 IT Course 15,IT430,A,Y4 IT Course 16,IT440,A,Y4 BT Course 1,BT110,A,Y1 BT Course 2,BT120,A,Y1 BT Course 3,BT130,A,Y1 BT Course 4,BT140,A,Y1 BT Course 5,BT210,A,Y2 BT Course 6,BT220,A,Y2 BT Course 7,BT230,A,Y2 BT Course 8,BT240,A,Y2 BT Course 9,BT310,A,Y3 BT Course 10,BT320,A,Y3 BT Course 11,BT330,A,Y3 BT Course 12,BT340,A,Y3 BT Course 13,BT410,A,Y4 BT Course 14,BT420,A,Y4 BT Course 15,BT430,A,Y4 BT Course 16,BT440,A,Y4 SE Course 1,SE110,A,Y1 SE Course 2,SE120,A,Y1 SE Course 3,SE130,A,Y1 SE Course 4,SE140,A,Y1 SE Course 5,SE210,A,Y2 SE Course 6,SE220,A,Y2 SE Course 7,SE230,A,Y2 SE Course 8,SE240,A,Y2 SE Course 9,SE310,A,Y3 SE Course 10,SE320,A,Y3 SE Course 11,SE330,A,Y3 SE Course 12,SE340,A,Y3 SE Course 13,SE410,A,Y4 SE Course 14,SE420,A,Y4 SE Course 15,SE430,A,Y4 SE Course 16,SE440,C,Y4 SA Course 1,SA110,A,Y1 SA Course 2,SA120,A,Y1 SA Course 3,SA130,A,Y1 SA Course 4,SA140,A,Y1 SA Course 5,SA210,A,Y2 SA Course 6,SA220,A,Y2 SA Course 7,SA230,A,Y2 SA Course 8,SA240,A,Y2 SA Course 9,SA310,A,Y3 SA Course 10,SA320,A,Y3 SA Course 11,SA330,A,Y3 SA Course 12,SA340,A,Y3 SA Course 13,SA410,A,Y4 SA Course 14,SA420,A,Y4 SA Course 15,SA430,A,Y4 SA Course 16,SA440,A,Y4 IT110,1,MWF8,5 IT120,1,MWF9,5 IT130,1,MWF10,5 IT140,1,MWF11,5 IT210,1,MWF12,5 IT220,1,MWF13,5 IT230,1,MWF14,5 IT240,1,MWF15,5 IT310,1,MWF8,5 IT320,1,MWF9,5 IT330,1,MWF10,5 IT340,1,MWF11,5 IT410,1,MWF12,5 IT420,1,MWF13,5 IT430,1,MWF14,5 IT440,1,MWF15,5 BT110,1,MWF8,5 BT110,2,TR8,5 BT120,1,MWF9,5 BT120,2,TR8,5 BT120,3,TR9,5 BT120,4,TR10,5 BT130,1,MWF10,5 BT140,1,MWF11,5 BT210,1,MWF12,5 BT220,1,MWF13,5 BT230,1,MWF14,5 BT240,1,MWF15,5 BT310,1,MWF8,5 BT320,1,MWF9,5 BT330,1,MWF10,5 BT340,1,MWF11,5 BT410,1,MWF12,5 BT420,1,MWF13,5 BT430,1,MWF14,5 BT440,1,MWF15,5 SE110,1,MWF8,5 SE120,1,MWF9,5 SE130,1,MWF10,5 SE140,1,MWF11,5 SE210,1,MWF12,5 SE220,1,MWF13,5 SE230,1,MWF14,5 SE240,1,MWF15,5 SE310,1,MWF8,5 SE320,1,MWF9,5 SE330,1,MWF10,5 SE410,1,MWF12,5 SE420,1,MWF13,5 SE440,1,MWF15,5 SA110,1,MWF8,5 SA120,1,MWF9,5 SA130,1,MWF10,5 SA140,1,MWF11,5 SA210,1,MWF12,5 SA220,1,MWF13,5 SA230,1,MWF14,5 SA240,1,MWF15,5 SA310,1,MWF8,5 SA320,1,MWF9,5 SA330,1,MWF10,5 SA340,1,MWF11,5 SA410,1,MWF12,5 SA420,1,MWF13,5 SA430,1,MWF14,5 SA440,1,MWF15,5 200900001,BT110,60 200900001,BT120,77 200900001,BT130,80 200900001,BT140,74 200900001,BT210,82 200900001,BT220,81 200900001,BT230,99 200900001,BT240,62 200900001,BT310,85 200900001,BT320,88 200900001,BT330,66 200900001,BT340,79 200900002,SA110,94 200900002,SA120,77 200900002,SA130,99 200900002,SA140,100 200900002,SA210,62 200900002,SA220,71 200900002,SA230,90 200900002,SA240,84 200900002,SA310,61 200900002,SA320,68 200900002,SA330,67 200900002,SA340,90 200900003,SE110,55 200900003,SE120,60 200900003,SE130,97 200900003,SE140,80 200900003,SE210,98 200900003,SE220,70 200900003,SE230,95 200900003,SE240,97 200900003,SE310,71 200900003,SE320,77 200900003,SE330,84 200900003,SE340,87 200900004,IT110,61 200900004,IT130,80 200900004,IT140,73 200900004,IT210,63 200900005,BT110,64 200900005,BT120,81 200900005,BT130,64 200900005,BT140,70 200900005,BT210,86 200900005,BT220,99 200900005,BT230,89 200900005,BT240,86 200900005,BT310,91 200900005,BT320,84 200900005,BT330,78 200900005,BT340,100 200900006,IT110,76 200900006,IT120,55 200900006,IT130,69 200900006,IT140,98 200900007,SE110,83 200900007,SE120,65 200900007,SE130,76 200900007,SE140,76 200900007,SE210,60 200900007,SE220,83 200900007,SE230,99 200900007,SE240,82 200900007,SE310,91 200900007,SE320,96 200900007,SE330,77 200900007,SE340,88 200900008,SE110,79 200900008,SE120,92 200900008,SE130,65 200900008,SE140,97 200900008,SE210,92 200900008,SE220,87 200900008,SE230,71 200900008,SE240,68 200900008,SE310,86 200900008,SE320,67 200900008,SE330,62 200900008,SE340,73 200900009,SE110,65 200900009,SE120,92 200900009,SE130,70 200900009,SE140,78 200900009,SE210,96 200900009,SE220,97 200900009,SE230,66 200900009,SE240,75 200900009,SE310,91 200900009,SE320,68 200900009,SE330,97 200900009,SE340,70 200900010,IT110,55 200900010,IT120,55 200900010,IT130,55 200900010,IT140,55 200900011,BT110,61 200900011,BT120,66 200900011,BT130,78 200900011,BT140,82 200900011,BT210,70 200900011,BT220,63 200900011,BT230,99 200900011,BT240,95 200900011,BT310,73 200900011,BT320,99 200900011,BT330,63 200900011,BT340,62 200900012,BT110,68 200900012,BT120,95 200900012,BT130,86 200900012,BT140,87 200900012,BT210,89 200900012,BT220,75 200900012,BT230,68 200900012,BT240,81 200900012,BT310,60 200900012,BT320,88 200900012,BT330,97 200900012,BT340,70 200900013,BT110,81 200900013,BT120,72 200900013,BT130,84 200900013,BT140,60 200900013,BT210,91 200900013,BT220,75 200900013,BT230,86 200900013,BT240,78 200900013,BT310,96 200900013,BT320,93 200900013,BT330,73 200900013,BT340,77 200900014,SA110,99 200900014,SA120,97 200900014,SA130,85 200900014,SA140,75 200900014,SA210,86 200900014,SA220,64 200900014,SA230,91 200900014,SA240,97 200900014,SA310,83 200900014,SA320,65 200900014,SA330,62 200900014,SA340,83 200900015,BT110,95 200900015,BT120,97 200900015,BT130,60 200900015,BT140,64 200900015,BT210,86 200900015,BT220,92 200900015,BT230,64 200900015,BT240,96 200900015,BT310,61 200900015,BT320,94 200900015,BT330,89 200900015,BT340,67 200900016,SA110,100 200900016,SA