Course Profiles of CSE Core Courses
CSE400
Credit Hours and Teaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
0
|
1 in the 1st semester (X grade)
2 in the 2nd semester (X grade) 3 in the 3rd semester (grade on total 6 credits) |
6
|
|
Contact Hours
|
0
|
2 Hours/Week for 13 Weeks in the 1st semester
4 Hours/Week for 13 Weeks in the 2nd semester 6 Hours/Week for 13 Weeks in the 3rd semester |
156 Hours in a year
|
Prerequisite:Students must complete at least 105 credits.
Course Objective: Capstone is a metaphor used to describe a final achievement that builds upon previous works and encapsulates them. This course is intended to provide a culminating experience that allows a student to demonstrate proficiency in several of the learning outcomes that are set forth by students’ degree program.Capstone project will integrate multidisciplinary subjects and professional skills that are difficult to impart in a traditional lectured course.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Identify and examine various problem domains (literature review); justify and finalize problem statement; write project proposal for the capstone project.
|
|
CO2
|
Perform and completerequirement analysis; outline, justify, and finalize design methodologies for the finalized project.
|
|
CO3
|
Design hardware and/or software for the finalized project incorporating societal, environmental, and ethical considerations; build the proposed system incorporating project management and financial principles and justify (test) the deliverable system.
|
|
CO4
|
Use different visualization tools andwrite and present (oral and/or poster) technical report incorporating different evaluation matrices including efficiency, cost; and ethical, societal, economic, and environmental impacts.
|
The capstone project will consists of the work on the topic finalized for the project. The project must be done in a group of three to four students.
Work Component and Assessment Levels
|
Course Topic
|
CO
|
|---|---|
|
Finalization of problem statement
|
CO1
|
|
Design methodology
|
CO2
|
|
Designing and building of deliverable system
|
CO3
|
|
Technical report and presentation
|
CO4
|
CSE487
Credit Hours andTeaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
3
|
0
|
3
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
0
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite: CSE405 Computer Networks
Course Objective:This course builds up the fundamental concepts of cryptography, computer security and cyber security. Standard methodologies and tools for the evaluation and application of organizational security policies related to confidentiality, integrity and availability will also be covered.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Interpretthe basic concepts related to computer security, and identify security vulnerabilities of networked systems.
|
|
CO2
|
Interpret and apply cryptographic algorithms for authentication, cryptanalysis and steganography.
|
|
CO3
|
Interpret, use, and analyze the security threats on networked systems, assess the existing state of security and deduce realistic security policies.
|
|
CO4
|
Examine and justifyrealistic prevention of intrusion and disaster recovery; demonstrate this knowledge and write report justifying the actions and policies.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Fundamental concepts of computer security
|
CO1
|
|
Well-known attack types and vulnerabilities
|
CO1
|
|
Social engineering attacks
|
CO1
|
|
Cryptography and classical cryptosystems
|
CO2
|
|
Authentication protocols and Public Key Infrastructure
|
CO2
|
|
IPSec, VPNs, E-commerce issues
|
CO2
|
|
Attack classification and vulnerability analysis
|
CO3
|
|
Security models and policy issues
|
CO3
|
|
Security evaluation and auditing of networked systems
|
CO3
|
|
Intrusion Detection, Prevention, Response, Containment (Digital forensic evidence) and Disaster Recovery
|
CO3
|
|
Network defense tools: Firewalls, VPNs, Intrusion Detection, and filters
|
CO3
|
|
Assignment with report and presentation
|
CO4
|
CSE479
Credit Hours and Teaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
3
|
1
|
4
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
2 Hours/Week for 13 Weeks
|
5 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite: CSE302 Database Systems
Course Objective:The objective of this course is to build up knowledge on different tools and techniques for real world web applications.Student will learn to develop static and dynamic web applications.Knowledge of this course will be needed as prerequisite knowledge for CSE489 Mobile Application Development.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Understand the basic concept and technology of web application development and its architecture for developing static web applications.
|
|
CO2
|
Use web programming languages for developing dynamic web applications.
|
|
CO3
|
Apply and examine security tools and techniques for developing secured web applications.
|
|
CO4
|
Choose software and hardware tools, perform and demonstrate skills, and write report to design, build, and test web applications.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Web Fundamentals, Programming Languages for the Web
|
CO1
|
|
HTML Basics and the working environment
|
CO1
|
|
Fundamentals of PHP language
|
CO1
|
|
HTML with PHP, forms, sessions,cookies, etc.
|
CO2
|
|
CSS and templates
|
CO2
|
|
Database manipulation in PHP
|
CO2
|
|
Programming the browser and forms withJavaScript
|
CO2
|
|
Dynamic programming using Asp.net
|
CO2
|
|
AJAX basics,DHTML
|
CO3
|
|
Security pitfalls and basic solutions
|
CO3
|
|
Lab exercises
|
CO4
|
|
Mini project
|
CO4
|
CSE442
Credit Hours and Teaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credits Hours
|
3
|
1
|
4
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks + Final Exam in the 14th Week
|
2 Hours/Week for 13 Weeks
|
5 Hours/Week for 13 Weeks + Final Exam in the 14th week
|
Prerequisite: CSE360 Computer Architecture
Course Objective: This course provides basic concept of architecture of microprocessor, addressing mode, interfacing of bus and memory with microprocessor, and handling of interrupts. The course also addresses interfacing of microcontroller with peripheral devices. Knowledge of this course will be needed as prerequisite knowledge for CSE493 Embedded Systems.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Understand, use, and examine the architecture and instruction sets of microprocessor.
|
|
CO2
|
Use and examineinterfacing of bus and memory with microprocessor.
|
|
CO3
|
Implement and examineinterfacing of microcontroller with peripheral devices.
|
|
CO4
|
Use, examine, and justifydifferent hardware and software tools;demonstrate skills, and write report to design, build, and test microprocessor and microcontroller based systems.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Introduction to microprocessors, Memory and I/O system
|
CO1
|
|
Architecture of Microprocessor and its Registers
|
CO1
|
|
Addressing Modesof Microprocessor
|
CO1
|
|
Hardware Specificationsof Microprocessor
|
CO1
|
|
Memory Interfacing
|
CO2
|
|
Interrupts handling
|
CO2
|
|
Microcontrollers and Embedded Processors, Structure and Functions of Microcontroller
|
CO3
|
|
Addressing Modes of Microcontrollers
|
CO3
|
|
Programming of Microcontroller using Assembly Language
|
CO3
|
|
Interfacing Microcontroller and Peripherals
|
CO3
|
|
Interrupts of Microcontroller
|
CO3
|
|
Lab exercises
|
CO4
|
|
Mini project
|
CO4
|
CSE 412
Credit Hours andTeaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
3
|
1
|
4
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
2 Hours/Week for 13 Weeks
|
5 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite: CSE347 Information System Analysis and Design
Course Objective: The objective of this course is to learn different principles and practices of modern software engineering. It also builds the understanding of the challenges faced in the industry and their resolutions. This course enhances the skills of using different modern tools and languages to analyze, design and evaluate a real-life complex software system. These software engineering knowledge will be needed in CSE430 Software Testing and Quality Assurance course.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Identifyand useappropriate software development model for developing software projects.
|
|
CO2
|
Understand and analyze software requirements and apply tools for software modeling.
|
|
CO3
|
Use and examine different software testing techniques and estimate project costs for project evaluation.
|
|
CO4
|
Select, use, and justify different software tools; demonstrate skills and write report to design, build, and test software for complex real-life applications.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Introduction to Software Engineering, review of Software development lifecycle (SDLC)
|
CO1
|
|
Overview of Software Process Models, Prototyping
|
CO1
|
|
Iterative process models, Incremental software development, Agile Software Development, Agile – UX and Lean – UX, Extreme programming, SCRUM
|
CO1
|
|
Software requirements, Requirement analysis, Requirement elicitation techniques and Questionnaire Designing
|
CO2
|
|
Software modeling, UML diagrams, Behavioral modeling: Use case diagram &class diagram
|
CO2
|
|
Interaction diagrams:Sequence and activity diagram
|
CO2
|
|
Code complexity analysis: Cyclomatic complexity, Halstead’s complexity
|
CO3
|
|
Project cost estimation techniques, Functional Point Analysis, FP counting method for determining software cost
|
CO3
|
|
Software Testing Basics- white box & black box testing, UAT, Integration and System Testing
|
CO3
|
|
Lab exercises
|
CO4
|
|
Mini project
|
CO4
|
CSE405
Credit Hours and Teaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
3
|
1
|
4
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
2 Hours/Week for 13 Weeks
|
5 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite:CSE246 Algorithms
Course Objective:This course explores the field of computer networking and communication, emphasizing network architecture and software issues. Student will learn the basic performance and engineering trade-offs in the design and implementation of computer networks. Knowledge of this course will be needed as prerequisite knowledge for future courses such as CSE406 Internet of Things,CSE453 Wireless Networks, and CSE457 Cellular Networks.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Understand, use, and characterizenetwork layers and related issues for designing computer networks.
|
|
CO2
|
Understand, use, analyze, and justifydifferent network algorithms and protocols for effective design of computer networks.
|
|
CO3
|
Design networks and subnets with IP calculations.
|
|
CO4
|
Choose software tools, perform and demonstrate skills,and write report for designing, testing, and evaluating complex computer networks.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Introduction to computer networks, layers, transmission media
|
CO1
|
|
Data link layer design issues, framing.
|
CO1
|
|
Protocol verification: finite state machine & petri net models
|
CO1
|
|
MAC, Channel allocation problem, CSMA/CD
|
CO2
|
|
Contention period, BEB CSMA
|
CO2
|
|
Collision-free protocols: bit-map, binary countdown, limited contention protocol
|
CO2
|
|
Introduction to network layer,distance vector routing, count-to-infinity problem
|
CO2
|
|
Link state routing, Hierarchical routing, Broadcast & Multicast routing
|
CO2
|
|
Internet Protocol (IP), IPv4 header, IP addresses and subnets
|
CO3
|
|
Network address translation (NAT), ICMP, ARP, RARP, BOOTP, DHCP
|
CO1
|
|
QoS, leaky bucket algorithm, token bucket algorithms, RSVP, Internetworking, tunneling, fragmentation
|
CO2
|
|
Congestion and congestion control algorithms in network layer
|
CO3
|
|
Transport service, primitives, connection establishment, data transfer & connection release
|
CO1
|
|
TCP/UDP header, Congestion control in Transport layer
|
CO2
|
|
Lab exercises
|
CO4
|
|
Mini project
|
CO4
|
CSE399
Credit Hours andTeaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
3
|
0
|
3
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
0
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite:none
Course Objective: This course builds up the concepts of ethical and legal framework in the context of computing and information technology. With in-depth analysis of several moral and legal issues related to computing and IT, this course prepares the student to act in compliance with the ethical and applicable legal frameworks, towards becoming a professional.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Interpretand comply with the professional codes of conduct and ethical frameworks as an ICT professional.
|
|
CO2
|
Describeand comply withthe legislation related to ICT and Computer Science and Engineering.
|
|
CO3
|
Interpret, apply, and justify the standard ethical frameworks within computing.
|
|
CO4
|
Analyze, evaluate and formulate documents, terms and policies related to computing profession, in accordance with the legal frameworks; demonstrate these knowledge and write report justifying the actions and policies.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Computer and Information Ethics at Stanford Encyclopedia of Philosophy
|
CO1
|
|
ACM Code of Ethics and Professional Conduct
|
CO1
|
|
Software Engineering Code of Ethics and Professional Practice
|
CO1
|
|
Data Protection Act, Computer Misuse Act, Impact of the Computer Misuse Act
|
CO2
|
|
Copyright, Designs and Patents Act, Freedom of Information Act, Security of Internet Communications
|
CO2
|
|
Bangladesh: Information Communication Technology Act of 2006 and its amendment in 2013
|
CO2
|
|
CO2
|
|
|
CO2
|
|
|
Pornography: Pornography Act 2012
|
CO2
|
|
Ethical Frameworks: Deontological Ethics (Duty-based ethics), Utilitarian ethics (Outcome-based ethics), Aristotelian ethics (Virtue ethics)
|
CO3
|
|
Applications of Ethical Frameworks: Deontological Ethics (Duty-based ethics), Utilitarian ethics (Outcome-based ethics), Aristotelian ethics (Virtue ethics)
|
CO3
|
|
Assignment with presentation (Analysis, Evaluation, and Design of Terms of Service (ToS), End User License Agreement (EULA), Privacy Policy)
|
CO4
|
CSE370
Credit Hours and Teaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
3
|
1
|
4
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
2 Hours/Week for 13 Weeks
|
5 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite:CSE110 Object Oriented Programming
Course Objective:The objective of this course is to build up the programming knowledge for mobile devices. This course also emphasizes software and hardware interfacing, cross platform programming, and networking and testing of mobile program.Knowledge of this course will be needed as prerequisite knowledge for CSE489 Mobile Application Development.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Understand the aspects of programming for mobile devices.
|
|
CO2
|
Understand and applysoftware and hardware interfacing for mobile programming.
|
|
CO3
|
Understand, use, and justify cross platform programming, networking and testing of mobile devices.
|
|
CO4
|
Chooseand justifysoftware tools, perform and demonstrate skills, and write report to design, build, and test software for mobile programming.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Introduction to Mobile programming
|
CO1
|
|
Exploring new hardware capabilities and requirement for mobile programming
|
CO1
|
|
Mobile hardware and other interfacing aspect
|
CO2
|
|
Software life cycle implementation in mobile devices
|
CO2
|
|
Mobile cross platform programming
|
CO3
|
|
Design interfaces for mobile devices
|
CO3
|
|
End user requirement handling
|
CO3
|
|
Networking and testing of mobile program
|
CO3
|
|
Lab exercises
|
CO4
|
|
Mini project
|
CO4
|
CSE360
Credit Hours and Teaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
3
|
0
|
3
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
0
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite:CSE325 Operating Systems
Course Objective:The objective of this course is to study the structure, behaviour, and characteristics of computer systems. This course will exhibit the design of the various functional units of digital computers, discuss different types of memories and their properties, and introduce basics of parallel computer architecture. Knowledge of this course will be needed as prerequisite knowledge for future course, such as CSE442 Microprocessors and Microcontrollers and CSE493 Embedded Systems.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Understand the architectural concept of digital computers.
|
|
CO2
|
Understand,determine and analyze performance of processor, memory, and I/O subsystems.
|
|
CO3
|
Understand, implement, examine, and justify instruction set design for performance improvement, execute and demonstratethis knowledge,and write reportfor problem solving.
|
|
CO4
|
Implement, examine, and justify processor and control unit design,executeand demonstratethis knowledge, andwrite report to synthesize functional units of digital computers.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Computer Fundamentals: development history of computer hardware and software, review of computer functions and sturctures, and performance evaluation of the computer system
|
CO1
|
|
Computer interconnection structructures: bus interconnection, PCI, future Bus plus
|
CO2
|
|
Computer memory system: cache memory principles, element of cache design, Pentium and PowerPC cache organization
|
CO2
|
|
Computer memory system: Internal memory, semiconductor main memory, error correction, advanced DRAM organization
|
CO2
|
|
Computer memory system: external memory, magnetic disk, RIAD, optical memory, and magnetic tape
|
CO2
|
|
Input/Output: External Devices, I/O modules, Programmed I/O, Interrupt-driven I/O
|
CO2
|
|
Input/Output: Direct memory access, I/O channels and processors, external interface
|
CO2
|
|
Computer Arithmetic: ALU, Interger representation and arithmetic, and floating point representation and arithmetic
|
CO3
|
|
Instruction Sets: Machine instruction, operands, operations, and assembly language, Instruction Sets: addressing, and instruction format
|
CO3
|
|
CPU structure and function: processor and registers organization
|
CO4
|
|
CPU structure and function: instruction cycle and instruction pipelining
|
CO4
|
|
RISC: instruction execution, registers, and RISC architecture
|
CO4
|
|
Assignments with reports and presentations
|
CO3, CO4
|
CSE347
Credit Hours and Teaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
3
|
1
|
4
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
2 Hours/Week for 13 Weeks
|
5 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite: CSE302 Database Systems
Course Objective:This course introduces the knowledge and skills required to analyze and design information system. This course will focus on analysis, design, development, and implementation of organizational information systems. Knowledge of thiscourse will be needed as prerequisite knowledge for future courses such as CSE412 Software Engineering, CSE423 Software Architecture, CSE425 Human Computer Interactions, and CSE430 Software Testing and Quality Assurance.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Understandproject management and system development life cycle.
|
|
CO2
|
Analyze feasibility and construct application architecture and modeling.C3C4
|
|
CO3
|
Design and examineinformation systems.
|
|
CO4
|
Chooseand examinesoftware and hardware tools, perform and demonstrate skills, and write report to design, build, and test information systems.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Introduction to Information System Analysis and Design
|
CO1
|
|
Project management
|
CO1
|
|
System development life cycle
|
CO1
|
|
Requirements analysis, sampling and investigating data
|
CO2
|
|
Modeling system requirements
|
CO2
|
|
Feasibility Analysis
|
CO2
|
|
Application Architecture and Modeling
|
CO2
|
|
Input-Output design and prototyping
|
CO3
|
|
User Interface design
|
CO3
|
|
Object‐Oriented Design and Modeling
|
CO3
|
|
Lab exercises
|
CO4
|
|
Mini project
|
CO4
|
CSE345
Credit Hours and Teaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
3
|
1
|
4
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
2 Hours/Week for 13 Weeks
|
5 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite: CSE251Electronic Circuit
Course Objective:This course introduces the fundamental concepts and practices of gate-level and MSI-level design of digital circuits. This course also emphasizes computer-aided design of digital circuits using Verilog Hardware Description Language (HDL). Knowledge of this course will be needed as prerequisite knowledge for future courses such as CSE360 Computer Architecture and CSE442 Microprocessors and Microcontrollers.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Interpret and applybinary number system and Boolean algebra for design and analysis of combinatorial and sequential circuits.
|
|
CO2
|
Apply and examine Boolean algebraic techniques for combinational circuit design and analysis.
|
|
CO3
|
Apply and examine state transition techniques for sequential circuit design and analysis.
|
|
CO4
|
Choose software and hardware tools, perform and demonstrate skills, and write report to design, build, and test digital circuits.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Binary number system, binary arithmetic, and Binary codes
|
CO1
|
|
Boolean algebra, Logic gates
|
CO1
|
|
Minimization of Boolean functions using K-map
|
CO1
|
|
Combinational circuit design and analysis
|
CO2
|
|
Design of parallel adder/subtractor
|
CO2
|
|
Design and use of encoder and decoder
|
CO2
|
|
Design and use of multiplexer and demultiplexer
|
CO2
|
|
Design of Combinational circuits using Verilog HDL
|
CO2
|
|
Flip-Flops
|
CO3
|
|
Representation and analysis of sequential circuits
|
CO3
|
|
Design of sequential circuit
|
CO3
|
|
Design of registers
|
CO3
|
|
Design of counters
|
CO3
|
|
Design of sequential circuits using Verilog HDL
|
CO3
|
|
Lab exercises
|
CO4
|
|
Mini project
|
CO4
|
CSE325
Credit Hours and Teaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
3
|
1
|
4
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
2 Hours/Week for 13 Weeks
|
5 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite: None
Course Objective:This course introduces the principles and techniques for the design and implementation of operating systems. This course also emphasizes the implementationof various techniques required for management, scheduling, allocation and communication of resources used in operating system.Knowledge of this course will be needed as prerequisite knowledge for future courses such as CSE360 Computer Architectureand CSE452 Distributed Systems and Algorithms.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Interpret,use, and characterizedifferent components of modern operating system for examining design goals.
|
|
CO2
|
Describe, use, and characterizedifferent methods of resource management and communication for operating system performance analysis.
|
|
CO3
|
Interpret,apply,and characterize resource management techniques for solving resource constained problems.
|
|
CO4
|
Interprete, apply, characterize, and justify memory organization and I/O mangement techniques; implement functional, pre-emptive, multi-tasking operating system modules including scheduler, file manager, memory manager, storage manager, and synchronization components; demonstrateand masterthese knowledge and write report for realisticproblem solving.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Basic concept of operating system
|
CO1
|
|
Operating systems Hardware Interaction
|
CO1
|
|
Process and thread management
|
CO2
|
|
Inter Process Communication (IPC)
|
CO2
|
|
Scheduling algorithms for multi-tasking
|
CO3
|
|
Mutual exclusion principles and deadlock handling
|
CO3
|
|
Memory and I/O management
|
CO4
|
|
Storage Management
|
CO4
|
|
Implementing File Management
|
CO3
|
|
Mini projects with reports and presentations
|
CO4
|
CSE302
Credit Hours andTeaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|
Credit Hours
|
3
|
1.5
|
4.5
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
3 Hours/Week for 13 Weeks
|
6 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite:CSE106Discrete Mathematics
Course Objective:This course introduces the fundamental concepts and practices of designing and implementing database system. It also enables the student to design and perform complex query operations on relational databases. It builds the capability of optimizing the databases efficiently by applying different techniques. Knowledge of this course will be needed as prerequisite knowledge for future courses such as CSE347 Information System Design, CSE412Software Engineering, CSE430Software Testing and Quality Assurance, and CSE487 Big Data Analytics.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Understand basic concepts of relational database,constructand interpret algebraic expressions to represent relations.
|
|
CO2
|
Performand organizedifferent query operations for data manipulation.
|
|
CO3
|
Discuss, use and examine different models and optimization techniques to design efficient relational database system.
|
|
CO4
|
Useand examinesoftware tools, demonstrate skills and write report to design, build and test real life database.
|
Course Contents
|
Course Topic
|
CO
|
|
Introduction to Database Management Systems and relational model
|
CO1
|
|
Writing Queries using SQL (basic to advanced level Structured Query Language)
|
CO2
|
|
Using relational algebra for representing relations
|
CO1
|
|
Designing a database using E-R Model
|
CO3
|
|
Database Indexing and Hashing Techniques
|
CO3
|
|
Basic concept of transactions and concurrency control protocols
|
CO3
|
|
Database Normalization, Lossy Decomposition, Functional Dependency, First, second and third normal Form, Boyce-Codd Normal Form
|
CO3
|
|
Lab Exercises
|
CO4
|
|
Mini Project
|
CO4
|
CSE251
Credit Hours and Teaching Scheme:
|
|
Theory | Laboratory | Total |
|---|---|---|---|
| Credit Hours | 3 | 1 | 4 |
| Contact Hours | 3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
2 Hours/Week for 13 Weeks | 5 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite: CSE209 Electrical Circuits
Course Objective:This course provides fundamental knowledge of electronic devices such as semiconductor diodes, operational amplifiers (op-amp), bipolar and field effect transistors and their use in the design and analysis of useful electronic circuits. This course also emphasizes on building, testing and analyzing performance of electronic circuits. Knowledge of this course will be needed as prerequisite knowledge for future courses such as CSE345 Digital Logic Design, CSE350 Data Communications, CSE360 Computer Architecture, CSE442 Microprocessor and Microcontrollers and CSE490 VLSI Design.
Course Outcomes (COs):
After completion of this course students will be able to:
| CO1 | Understandthe operation and characteristics of different electronic circuit elements. |
| CO2 | Discuss and determinethe responses of electronic circuits for appropriate applications. |
| CO3 | Applyand examine the concept of basic electronic devices to design different electronic amplifiers and instrumental circuits. |
| CO4 | Use software and circuit tools, perform and demonstrate skillsand write report to design, build and test electronic circuits. |
Course Contents
| Course Topic | CO |
|---|---|
| Operation and characteristics of semiconductor diode,Load-line analysis. | CO1 |
| Applications of Diode: Rectifier circuits. | CO2 |
| Applications of Diode: Clipperand Clamper. | CO3 |
| Operation and Characteristics of ideal Op amp, Comparator circuits. | CO1 |
| Application of Op amp: Inverting and non-inverting, Voltage follower, Adder and Difference amplifiers, Integrator and Differentiator. | CO2 |
| Design of different amplifier and instrumentation circuits using op-amps. | CO3 |
| Device Structure and Physical Operation of BJT, Modes of Operation, Current-Voltage Characteristics. | CO1 |
| BJT as an amplifiers and switch, DC biasing and small signal operations of BJT. | CO2 |
| Device Structure and Physical Operation of MOSFET, Modes of Operation, Current-Voltage Characteristics, Channel Length Modulation Effect. | CO1 |
| MOSFET as an Amplifier and Switch, DC biasing and small signal operations of MOSFET. | CO2 |
| Small signal equivalent models of MOSFET, Designing different circuit parameters of MOSFET. | CO3 |
| Lab exercises | CO4 |
| Mini Project | CO4 |
CSE246
Credit Hours and Teaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
3
|
1.5
|
4.5
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
3 Hours/Week for 13 Weeks
|
6 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite: CSE207 Data Structures
Course Objective:This course introduces students to the general tools and techniques for analyzing and designing computer algorithms. Initially necessary mathematical preliminaries required for analyzing and designing computer algorithms are taught. Then this course familiarizes students with several algorithmic approaches and corresponding problems. Knowledge of this course will be needed as prerequisite knowledge for future courses such as CSE366 Artificial Intelligence, CSE405 Computer Networks, and CSE471 Compiler Design.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Discuss and determinethe computational complexities ofalgorithmsfor performance analysis.
|
|
CO2
|
Discuss, applyand explainappropriate algorithmic design approaches for modeling engineering and computational problems in different domains.
|
|
CO3
|
Apply major algorithmic techniques forgraph problems.
|
|
CO4
|
Choose and examinedifferent algorithms; perform and demonstrate skills and write report to design, build, and testcomplex computational problems.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Introduction to algorithms, complexity analysis, asymptotic notations, typical running time functions, classifying functions by their asymptotic growth rates etc.
|
CO1
|
|
Graphs, graph based algorithm – breadth-first search (BFS), depth-first search (DFS), edge identification.
|
CO3
|
|
Modification of DFS to find the Topological sort, strongly connected component, articulation points, bridges and bi-connected components.
|
CO3
|
|
Sorting algorithms: selection sort, bubble sort, insertion sort, mergesort, quicksort, heap sort. Minimal spanning tree: basic terminology, applications and algorithms
|
CO1
|
|
Single source shortest path algorithms: Dijkstra’s algorithm, Bellman-Ford algorithm, shortest path in DAG.
|
CO3
|
|
Floyd-Warshall algorithm, Transitive closure. Algorithm strategy, structure and problem types.
|
CO3
|
|
Divide and Conquer algorithms: Binary search, Closest pair of points, Counting inversion. Greedy algorithms: Coin changing, fractional Knapsack, Huffman codes, Optimal codes, Activity selection. Suitability of all these algorithms in greedy approach.
|
CO2
|
|
Dynamic programming (DP) and Memorized algorithms: Longest increasing subsequence (LIS), 0-1 Knapsack, Longest common subsequence (LCS), Rock climbing.
|
CO2
|
|
Network Flow, Max Flow, Min-Cut, Residual Network, Augmenting paths, Ford-Fulkerson and Edmonds-Karp algorithms.
|
CO2
|
|
Euclid’s algorithm for GCD, Extended Euclid’s algorithm and Number theoretic algorithms.
|
CO2
|
|
Recurrence relation. Iteration, Substitution, Recursion tree and Master methods.
|
CO1
|
|
Pattern matching and String matching algorithms (Rabin-Karp algorithm). Computing the transition function and diagram for Strings.
|
CO2
|
|
P and NP classes, algorithm completeness, discussion on other complex techniques of algorithm design and analysis.
|
CO2
|
|
Lab exercises
|
CO4
|
|
Mini project
|
CO4
|
CSE209
Credit Hours and Teaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
3
|
1
|
4
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
2 Hours/Week for 13 Weeks
|
5 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite: None
Course Objective: This course provides the students with fundamental knowledge ofanalyzing electrical circuits. This course also provides hands-on experience in building and testing electrical circuits. Knowledge of this course will be needed as prerequisite knowledge for future courses such as CSE251 Electronic Circuits, CSE 345 Digital Logic Design, CSE 350 Data Communications, CSE 360 Computer Architecture, CSE 442 Microprocessor and Microcontroller, and CSE 490 VLSI design.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Discuss the concepts and applications of different electrical circuit variables and elements.
|
|
CO2
|
Explainand usefundamental laws and theorems for circuit analysis.
|
|
CO3
|
Apply and examinecircuit laws, theorems, and solution techniques for solving electrical circuits.
|
|
CO4
|
Use software and circuit tools, perform and demonstrate skills and write report to design, build and test electrical circuits.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Basic Concepts of DC circuit, charge and current, voltage, power and energy, Circuit elements.
|
CO1
|
|
Ohm’s Law, Kirchhoff’s Voltage Law, Kirchhoff’s Current Law, Series-Parallel connections, Voltage and Current Division, Wye-delta Transformations.
|
CO2
|
|
Circuit Analysis Methods: Nodal and Mesh methods
|
CO3
|
|
Linearity and Superposition, Source Transformation, Thevenin and Norton’s equivalents, Maximum power transfer.
|
CO2
|
|
Basic Concepts of AC circuit, Sinusoids, Phasors, Phasor relationships for Circuit Elements, Impedance and admittance.
|
CO1
|
|
Kirchhoff’s laws in Frequency domain, Impedance Combinations, Superposition, Source Transformation, Thevenin and Norton equivalents, Nodal and Mesh Analysis
|
CO3
|
|
Instantaneous and average power; Maximum average power transfer, Effective or RMS value, apparent power and power factor, Complex power
|
CO3
|
|
Lab exercises
|
CO4
|
|
Mini project
|
CO4
|
CSE207
Credit Hours and Teaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
3
|
1
|
4
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
2 Hours/Week for 13 Weeks
|
5 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite:CSE110 Object Oriented Programming
Course Objective:The course develops students’ skills for designing and analyzing linear and non-linear data structures. It strengthens students’ ability to identify and apply the suitable data structure for solving real world problems. Knowledge of this course will be needed as prerequisite knowledge for future courses such as CSE246 Algorithms, CSE366 Artificial Intelligence, CSE405 Computer Networks, CSE471 Compiler Design.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Understand and apply basic data structures for storage and retrieval of ordered and unordered data.
|
|
CO2
|
Implement and characterize algorithms for creation and manipulation of data structures like stacks, queues, linked list, etc.
|
|
CO3
|
Interpret and apply appropriate data structures for implementing problem solving algorithms such as searching, insertion, deletion, traversing mechanism, etc., on various data structures.
|
|
CO4
|
Compute and Characterize the efficiency of data structures for complex problem-solving algorithms; perform and demonstrate this knowledge and write report for realistic problem solving.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Pointers, Structures, dynamic memory allocation and Abstract Data Type
|
CO1
|
|
Linked List Implementation and its application
|
CO1
|
|
Stack Implementation and its Application
|
CO2
|
|
Queue Implementation and its Application
|
CO2
|
|
Iterative Solution and Recursive Solution design
|
CO1
|
|
Basic Tree Concepts, Tree Traversals, Binary Trees and their applications
|
CO2
|
|
Binary Search Trees, Insert, Delete, Search and Traversal Algorithms
|
CO3
|
|
AVL Tree
|
CO3
|
|
Binary Heap and Priority queue
|
CO4
|
|
Graph representation, Terminology, Graph traversal techniques
|
CO4
|
|
Spanning Tree, MST, Shortest Path Problem
|
CO4
|
|
Hashing: Methods, Hashed Search
|
CO3
|
|
Lab Exercises
|
CO4
|
|
Mini Project
|
CO4
|
CSE200
Credit Hours and Teaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
0
|
1
|
1
|
|
Contact Hours
|
0
|
2 Hours/Week for 13 Weeks
|
2 Hours/Week for 13 Weeks
|
Prerequisite: None
Course Objective:This course introduces students to the standards and conventions of engineering drawing. This course emphasizes on the use of CAD software to generate computer models and technical drawings. The fundamental principles of orthogonal projections as well as isometric projections and views are also covered in this course.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Understandand use drawing instruments and geometric constructions in creating engineering drawings.
|
|
CO2
|
Applyand examine orthographic sketching techniques, orthographic projections of lines, planes and solids.
|
|
CO3
|
Apply and examineisometric sketching techniques, isometric projections and conversion of views.
|
|
CO4
|
Use AutoCAD to draw sectional views and multi-view projections, perform and demonstrate these skills and write report on a complete design.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Introduction to drawing instruments, Lines, Lettering and Dimensioning.
|
CO1
|
|
Scales: Plain, Diagonal and Vernier Scale.
|
CO1
|
|
Curves used in engineering practice: ellipse, parabola, hyperbola
|
CO1
|
|
Orthographic Projection, First & Third angle projection methods.
|
CO2
|
|
Projection of Lines: Oblique Lines, Traces. Applications of Projection of Lines.
|
CO2
|
|
Projection of Planes: Polygonal Lamina, Circular Lamina.
|
CO2
|
|
Projection of Solids: Cube, Prism, Pyramid, Cylinder, Cone. Suspended Solids.
|
CO2
|
|
Isometric Projections: Isometric Lines, Planes and Scale.
|
CO3
|
|
Conversion of given 2D views to Isometric Projection/View.
|
CO3
|
|
Conversion of given 3D View to 2D representation.
|
CO3
|
|
Auto CAD Drafting: Drafting Basics, Drawing Commands, Modify Commands.
|
CO4
|
|
Auto CAD Drafting: 2D and Isometric drawing, 3D geometric, surface and solid modeling.
|
CO4
|
|
Mini Project
|
CO4
|
CSE110
Credit Hours and Teaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
3
|
1.5
|
4.5
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
3 Hours/Week for 13 Weeks
|
6 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite:CSE106 Discrete Mathematics
Course Objective: This course presents a conceptual and practical introduction to object oriented programming (OOP). The course will cover general principles of programming in object oriented frameworks to enhance transferable skills, such as programming, designing, and problem-solving skills. This course introduces object oriented concepts and develops OOP programs which provides solutions to real world object oriented problems. Knowledge of this course will be needed as prerequisite knowledge for future courses, such as CSE207 Data Structures, CSE246 Algorithms, CSE370 Mobile Programming, and CSE425 Numerical Methods.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Identify issues related to the definition, creation and usage of classes and objects.
|
|
CO2
|
Use the principles of inheritance and polymorphism and analyseproblemsfor design of abstract classes and interfaces.
|
|
CO3
|
Apply programming skills and examine key issues to the design of object oriented software.
|
|
CO4
|
Choose software tool, perform and demonstrate skills, and write report to design, build, and test realistic object orientedprograms.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Implementclasses, objects, member functions and data members, and also incorporate separating interface
|
CO1
|
|
Design object oriented program using flow control and control structures
|
CO2
|
|
Design object oriented program using functions and recursions
|
CO2
|
|
Design object oriented program using arrays, character, pointers, and dynamic memory allocation
|
CO2
|
|
Design object oriented program to implement arrays of objects, friend functions, constructors and destructors with dynamic memory allocation.
|
CO3
|
|
Design object oriented program to implement multiple, multilevel, hierarchical, and hybrid inheritance, and virtual base classes
|
CO3
|
|
Design polymorphic object-oriented program to implement pointers to base class, virtual members abstract base classes, and pure virtual members
|
CO3
|
|
Design object oriented program to implement operator overloading, templates, and exception handling
|
CO3
|
|
Lab exercises
|
CO4
|
|
Mini project
|
CO4
|
CSE106
Credit Hours and Teaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
3
|
0
|
3
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
0
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite: CSE103 Structured Programming
Course Objective: This course builds up the students’ ability to think and express logically and mathematically. The course will address mathematical reasoning, combinatorial analysis, algorithmic thinking, and discrete structures. Knowledge of this course will be needed as prerequisite knowledge for future courses such as CSE 110 Objected Oriented Programming, CSE207 Data Structures, CSE246 Algorithms, CSE302 Database Systems, CSE366 Artificial Intelligence, CSE405 Computer Networks, and CSE471 Compiler Design.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Interpret and apply propositional logic, predicate logic, and theorem proving for mathematical reasoning.
|
|
CO2
|
Interpret and apply counting, permutations, and combinations for combinatorial analysis.
|
|
CO3
|
Interpret and apply the growth of functions, complexity analysis of algorithms, and integer algorithms for algorithmic thinking; demonstratethis knowledge and write report for realistic problem solving.
|
|
CO4
|
Interpret and apply discrete structures such as sets, functions, relations, graphs, and trees for modeling discrete objects; demonstratethis knowledge and write report for realistic problem solving.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Propositional Logic, Propositional Equivalences
|
CO1
|
|
Predicates and Quantifiers, Nested Quantifiers
|
CO1
|
|
Rules of Inference, Introduction to Proofs
|
CO1
|
|
Mathematical Induction
|
CO1
|
|
Sets, Set Operations
|
CO4
|
|
Functions
|
CO4
|
|
Relations and Their Properties
|
CO4
|
|
The Basics of Counting, The Pigeonhole Principle, Permutations and Combinations
|
CO2
|
|
Algorithms, The Growth of Functions, Complexity of Algorithms
|
CO3
|
|
The Integers and Division, Primes and Greatest Common Divisor
|
CO3
|
|
Graphs, Graph Terminologies and Special Types of Graphs, Representing Graphs and Graphs Isomorphism
|
CO4
|
|
Introduction to Trees
|
CO4
|
|
Assignments with reports and presentations
|
CO3, CO4
|
CSE103
Credit Hours and Teaching Scheme:
|
|
Theory
|
Laboratory
|
Total
|
|---|---|---|---|
|
Credit Hours
|
3
|
1.5
|
4.5
|
|
Contact Hours
|
3 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
3 Hours/Week for 13 Weeks
|
6 Hours/Week for 13 Weeks +
Final Exam in the 14th week |
Prerequisite:None
Course Objective:The purpose of this course is to introduce the students to computer programming using structured language. The students will be able to enhance their analyzing and problem-solving skills and use the same for writing programs using C language. Knowledge of this course will be needed as prerequisite knowledge for future courses such as CSE106 Discrete Mathematics, CSE110 Object Oriented Programming, CSE207 Data Structures, CSE246 Algorithms, CSE302 Database Systems, CSE366 Artificial Intelligence, CSE405 Computer Networks and many others.
Course Outcomes (COs):
After completion of this course students will be able to:
|
CO1
|
Explain the fundamentals of programming and basic structure of C programming language.
|
|
CO2
|
Compare and applythe appropriate decision making and control statements, arraysand functions to solve computational problems.
|
|
CO3
|
Applyappropriate data structures like pointers, structures, unions, user defined data types, and dynamic memory to solve computational problems.
|
|
CO4
|
Compare and apply language constructs and data structures; perform and demonstrate skills and write report to design, build, and test moderately complex computational problems.
|
Course Contents
|
Course Topic
|
CO
|
|---|---|
|
Introduction to computers and programming languages, data representation in computer, flowchart construction for problem solving
|
CO1
|
|
Introduction to C Programming (input, output, variables, data types, operators, expressions, assignments)
|
CO1
|
|
Conditional control statements (if, if-else, nested if-else, switch)
|
CO2
|
|
Loop statement (while, for and do…while) and nested loop statement, break and continue statements
|
CO2
|
|
Introduction to arrays (arrays, declaring arrays, manipulating arrays)
|
CO2
|
|
Multidimensional array
|
CO2
|
|
Characters and strings (various types of string manipulation)
|
CO2
|
|
Introduction to functions (function definitions, function prototypes and argument, header files). Solving complex problems in modular fashion using user defined function
|
CO2
|
|
Introduction to recursive definition and solving problem using recursive function
|
CO2
|
|
Pointers (pointer variable declarations, pointer operators, passing arguments to functions by reference with pointers, pointer expressions and pointer arithmetic, arrays of pointers, and function pointers)
|
CO3
|
|
Structures (structure definitions and initialization, accessing structure members, structure with function and pointer)
|
CO3
|
|
File management (files and streams, creating a file, reading data from file, writing data to file, and updating files)
|
CO3
|
|
Dynamic memory allocation and linked lists
|
CO3
|
|
Lab exercises
|
CO4
|
|
Mini project
|
CO4
|
