Faculty : Faculty of Engineering and Applied Sciences
School : Computer Science and Engineering
Prerequisit Course : CSE312 and CSE313
Credit Hours : 2.00
Offered For : Under Graduate
Course Description :
Software process models; Software development life cycle; Software project management; software tools and environments; Requirements engineering; Software design techniques; Software construction, verification and validation; Software evolution; Software reliability; Formal methods.
CSE323 - Software Engineering Lab
Faculty : Faculty of Engineering and Applied Sciences
School : Computer Science and Engineering
Prerequisit Course :
Credit Hours : 1.00
Offered For : Under Graduate
Course Description :
Practical implementation of the concepts introduced in CSE 322; software projects for different types of software testing and verification.
CSE324 - Embedded Systems
Faculty : Faculty of Engineering and Applied Sciences
School : Computer Science and Engineering
Prerequisit Course : CSE311
Credit Hours : 2.00
Offered For : Under Graduate
Course Description :
Introduction to embedded systems; basic design and analysis problems for developing an embedded system; systems that include both digital computing and communication components on one hand and physical analog components on the other hand; modeling techniques through the use of a testbed language Acumen.
CSE325 - Embedded Systems Lab
Faculty : Faculty of Engineering and Applied Sciences
School : Computer Science and Engineering
Prerequisit Course :
Credit Hours : 1.00
Offered For : Under Graduate
Course Description :
Practical implementation of the course material of CSE 324; IoT projects; microcontrollers and/or Arduino projects.
CSE326 - Analysis and Design of Algorithms
Faculty : Faculty of Engineering and Applied Sciences
School : Computer Science and Engineering
Prerequisit Course : CSE312 and CSE317
Credit Hours : 3.00
Offered For : Under Graduate
Course Description :
Different asymptotic notations such as big-O, big-theta; basic paradigms for designing an algorithm; greedy algorithms; divide-and-conquer algorithms; dynamic programming; basic sorting and searching algorithms with their analyses such as quick and merge sorts and hashing; preliminary introduction to complexity classes such as P and NP and the question whether they are equal.
