M.Sc. in Computer Science And Engineering (MCSE)
1. Programs of Study
The M. Sc. in Computer Science & Engineering program under the Department of Computer
Science and Engineering, Faculty of Science and Engineering, IIUC.
2. Objectives of the M. Sc. In CSE Program
The M. Sc. Program in Computer Science and Engineering is designed to produce engineers with ability to apply technical knowledge and skills with creativity. This Program will develop competence necessary for effective computing involving computer hardware and software as well as the research and analytical skills. One of the main goals of the program is to produce skilled professionals to satisfy the growing demands of Computer Engineers at home and abroad. By pursuing a M.Sc. degree in CSE, the students will get the opportunity to obtain a broad knowledge in the vast fields of Computer. Finally the program will provide some freedoms to the students to tailor according to their individual needs.
3. Degree Requirement
Students from academic discipline, other than CS/CSE or equivalent will be required to complete a maximum of 24 credit hours prerequisite courses in addition to the 36 credit hours mentioned above and hence need to complete 60 credit hours at maximum. The duration of the course may vary from three to six semesters depending on how many prerequisite courses a student has to undertake. Generally, students who have completed the prerequisite courses prior to admission should be able to complete the required program within three semesters.
The summary of the total credit hours (C.H.) for the M. Sc. Program are given below:
No |
Background |
Total Credit |
Duration |
|
1 |
4 years B. Sc. Degree in CSE |
36 Credits |
3 |
Semester (6 Months each) |
2 |
4 years B. Sc. Degree other |
60 Credits |
5 |
Semesters (6 Months each) |
|
than CSE |
|
|
|
4. Duration of Studies
The minimum duration of the M.Sc. in CSE course shall normally be three semesters (for 36 credits) and 5 semesters (for 60 credits). A candidate for the Master’s degree must complete all the requirements for the degree within three academic years (for 36 credits) and four academic years (for 60 credits) from the date of the first admission in the program. A semester normally consists of 21 weeks of classes and 3 weeks of examination. Classes will be held in the evening and at weekends.
The summary of the total durations for the M. Sc. Program are given below:
No |
Background |
Total Credit |
Minimum Duration |
Maximum Duration |
|
1 |
4 years B. Sc. |
36 Credits |
3 Semester (6 Months |
6 |
Semester (3 years) |
|
Degree in CSE |
|
each) |
|
|
2 |
4 years B. Sc. |
60 Credits |
5 Semesters (6 Months |
8 |
Semesters (4 years) |
|
Degree other than |
|
each) |
|
|
|
CSE |
|
|
|
|
5. Admission Requirements
The requirements for admission to M. Sc. Program in Computer Science & Engineering are:
1.Completion of 4 years B.Sc. in CSE degree from an approved university or an accredited institution of higher education.
2.Completion of 4 years B.Sc. degree with strong background of Mathematics from an approved university or an accredited institution of higher education.
3.The applicant must have the CGPA of 2.5 or above (in a scale of 4.0), or at least second class in the B. Sc. degree.
4.The applicant must have completed the enlisted prerequisite courses or their equivalent.
5.Applicant, who has not completed the enlisted prerequisite course, will be admitted on condition that he/she will complete these.
Evaluation of applicants for admission is based primarily on the student’s academic record in relevant undergraduate coursework. Applicants are expected to have sufficient knowledge in
undergraduate level mathematics and be familiar with common software Packages. Provisional
admission can be given to an applicant awaiting the result of his/her B.Sc. degree.
6. Evaluation System
6.1Course Work: Each course will be evaluated in the following way:
I. Class Test/Assignment/Oral Test Or their combination |
20% Marks |
II. Midterm, Theory with Lab (if any) Exam |
30% Marks |
III. Final, Theory with Lab (if any) Exam |
50 %Marks |
_______________________________________________________________
Total Marks100% Marks
For Final Examination (50 Marks):
a)Two question setters for each subject, Question must be moderated.
b)Two separate examiner for Group A, and Group B
c)Each Group (25 marks): Answer 2 questions out of 3, each question caries 12.5 marks
6.2 Project / Thesis
Marks distribution for projects/thesis and general
1) |
Project/Thesis evaluation by Supervisor- |
35% |
|
2) |
Project/Thesis evaluation by Examiner- |
35% |
|
3) |
General |
30% |
|
Total |
100% |
7. Uniform Grading System
The Grading System for evaluating the courses is as follows:
Numerical Marks |
Letter Grade |
Grade Point |
Remarks/Status |
A+ |
4.00 |
Excellent |
|
A |
3.75 |
Very good |
|
A- |
3.50 |
|
|
B+ |
3.25 |
Good |
|
B |
3.00 |
|
|
B- |
2.75 |
Satisfactory |
|
C+ |
2.50 |
|
|
C |
2.25 |
Pass |
|
D |
2.00 |
|
|
F |
0.00 |
Fail |
Program Outline
A: CSE Graduates: 36 Credits
Thesis or Project
No |
Course Code |
Course Title |
Credit |
1 |
Thesis |
18 |
|
2 |
Project |
6 |
Core Course for all (3 Courses, 3X3 = 9 Credits
No |
Course Code |
Course Title |
Credit |
1 |
CSE6101 |
Advanced Database Systems |
3 |
2 |
CSE6102 |
Advanced Artificial Intelligence |
3 |
3 |
CSE6103 |
Advanced Computer Networking |
3 |
List of Elective Courses:
a.Thesis based: Any 3 Courses, 3X3 = 9 Credits
b.Project based: Any 7 Courses, 3X7 = 21 Credits
No |
Course Code |
Course Title |
Credit |
Contact |
|
|
|
Hours |
Hours |
1 |
CSE6201 |
Advanced Logic Design |
3 |
3 |
2 |
CSE6202 |
Advanced Microprocessor |
3 |
3 |
3 |
CSE6203 |
VLSI Layout Algorithms |
3 |
3 |
4 |
CSE6211 |
Advanced Algorithms |
3 |
3 |
5 |
CSE6212 |
Parallel Algorithms |
3 |
3 |
6 |
CSE6213 |
Advanced Graph Theory |
3 |
3 |
7 |
CSE6214 |
Graph Drawing |
3 |
3 |
8 |
CSE6215 |
Bioinformatics Algorithms |
3 |
3 |
9 |
CSE6221 |
Machine Learning |
3 |
3 |
10 |
CSE6222 |
Neural Networks |
3 |
3 |
11 |
CSE6223 |
Fuzzy Systems |
3 |
3 |
12 |
CSE6224 |
Advanced Digital Image Processing |
3 |
3 |
13 |
CSE6225 |
Speech Recognition |
3 |
3 |
14 |
CSE6231 |
Data Mining |
3 |
3 |
15 |
CSE6232 |
High Dimensional Data Management |
3 |
3 |
16 |
CSE6233 |
Distributed Search Techniques |
3 |
3 |
17 |
CSE6234 |
Distributed Computing Systems |
3 |
3 |
18 |
CSE6241 |
Information System Management |
3 |
3 |
19 |
CSE6242 |
Software Project Management |
3 |
3 |
20 |
CSE6243 |
Software Quality Assurance |
3 |
3 |
21 |
CSE6244 |
3 |
3 |
|
22 |
CSE6251 |
Network Security |
3 |
3 |
23 |
CSE6252 |
Wireless and Mobile Communication Networks |
3 |
3 |
24 |
CSE6253 |
Wireless Ad Hoc Networks |
3 |
3 |
25 |
CSE6254 |
Wireless Sensor Networks |
3 |
3 |
26 |
CSE6261 |
Computer Ethics and Cyber Law |
3 |
3 |
27 |
CSE6291 |
Research Methodology in Computer Science & Engineering |
3 |
3 |
28 |
CSE6292 |
Special Topics in Computer Science and Engineering |
3 |
3 |
B: Other Than CSE Graduates: 60 Credits
Prerequisite Courses (Graduates from Academic Discipline other than CSE or equivalent: Maximum 8X3 = 24 Credits)
No |
Course Code |
Course Title |
Credit |
Contact |
|
|
|
Hours |
Hours |
1 |
CSE5101 |
Discrete Mathematics |
3 |
3 |
2 |
CSE5102 |
3 |
3 |
|
3 |
CSE5103 |
Data Structures and Algorithms with Lab |
3 |
3 |
4 |
CSE5104 |
Database Management System with Lab |
3 |
3 |
5 |
CSE5105 |
Digital Logic Design with Lab |
3 |
3 |
6 |
CSE5201 |
Computer Architecture and Operating Systems with Lab |
3 |
3 |
7 |
CSE5202 |
Computer Networks with Lab |
3 |
3 |
8 |
CSE5203 |
Systems Analysis and Design with Lab |
3 |
3 |
9 |
CSE5204 |
Artificial Intelligence with Lab |
3 |
3 |
Detailed Syllabus
CSE6101: Advanced Database Systems
Credit Hours: 3 |
Contact Hours: 3 |
Object Oriented Database; Data Model, Design, Languages; Object Relational Database: Complex data types, Querying with complex data types, Design; Distributed Database: Levels of distribution transparency, Translation of global queries to fragment queries, Optimization of access strategies, Management of distributed transactions, Concurrency control, Reliability, Administration; Parallel Database: Different types of parallelism, Design of parallel database; Multimedia Database SystemsBasic concepts, Design, Optimization of access strategies, Management of Multimedia Database Systems, Reliability; Database
CSE6102: Advanced Artificial Intelligence
Credit Hours: 3 |
Contact Hours: 3 |
Introduction, Advanced search techniques in AI, Knowledge based system design, Advanced plan generating systems, Bayesian network and probabilistic reasoning, Learning in neural belief networks, Practical natural language processing, Computer vision, Introduction to Robotics.
CSE6103: Advanced Computer Networking
Credit Hours: 3 |
Contact Hours: 3 |
Network security- Authentication protocols and Digital signatures, email privacy; Modifications of TCP; TCP over ATM; ATM internetworking; ATM service categories and quality of services; ATM switch architectures and their performance; Digital switching; Traffic analysis; Fiber optics networks – optical packet switching; Metropolitan networks, Wide area networking, Gigabit Ethernet, ADSL.
CSE6201 Advanced Logic Design
Credit Hours: 3 |
Contact Hours: 3 |
Functional decomposition and Symmetric functions; Linear sequential machines;
design techniques; Digital logic circuit testing and testable design: testing of combinational and sequential logic circuits, design for testability and
CSE6202: Advanced Microprocessor
Credit Hours: 3 |
Contact Hours: 3 |
Review of different microprocessors: 80486, 68040, V70, Gmicro processors; Comparing the
architectures: RISC and CISC; Instruction set of machines: SPARC, INTEL, and MIPS; Study of
microprocessors: Pentium II, Alpha 21064, MIS 6400,
CSE6203: VLSI Layout Algorithms
Credit Hours: 3 |
Contact Hours: 3 |
VLSI design cycle, physical design cycle, design styles; Basic graph algorithms and computational geometry algorithms related to VLSI layout; Partitioning algorithms: group migration algorithms, simulated annealing and evaluation, performance driven partitioning; Floor planning and placement algorithms: constraint based floor planning, rectangular dualization and rectangular drawings, integer programming based floor planning, simulation based placement algorithms, partitioning based placement algorithms; Pin assignment algorithms; Routing algorithms: maze routing algorithms, line prob algorithms,
CSE6211: Advanced Algorithms
Credit Hours: 3 |
Contact Hours: 3 |
Randomized Algorithms: Las Vegas and Monte Carlo Algorithms; Randomized Data Structures:
Skip Lists; Amortized Analysis: Different methods, Applications in Fibonacci Heaps; Lower
Bounds: Decision Trees, Information Theoretic Lower Bounds, Adversary Arguments;
Approximation Algorithms: Approximation Schemes, Hardness of Approximation; Fixed
Parameter Tractability: Parameterized Complexity, Techniques of designing Fixed Parameter
Algorithms, Examples; Online Algorithms: Competitive Analysis, Online Paging Problem, k-
server Problem; External Memory Algorithms; Advanced Data Structures: Linear and
CSE6212: Parallel Algorithms
Credit Hours: 3 |
Contact Hours: 3 |
Introduction, Parallel processing, Parallel models, Performance of Parallel Algorithms, The
CSE6213: Advanced Graph Theory
Credit Hours: 3 |
Contact Hours: 3 |
Introduction, Fundamental concepts, Trees, Spanning trees in graphs, Distance in graphs, Eulerian graphs, Digraphs, Matching and factors, Cuts and connectivity,
CSE6214: Graph Drawing
Credit Hours: 3 |
Contact Hours: 3 |
Introduction to graph drawing: historical background of graph drawing, drawing styles, properties of drawings, applications of graph drawing; Graph theoretic foundations; Straight line drawing: shift method, realizer method, compact grid drawing; Convex drawing: convex drawing and convex testing, convex grid drawing; Rectangular drawing: rectangular drawing and matching, Thomassen's theorem, linear algorithms for rectangular drawing;
CSE6215: Bioinformatics Algorithms
Credit Hours: 3 |
Contact Hours: 3 |
Introduction; Molecular biology basics: DNA, RNA, genes, and proteins; Restriction mapping algorithm; Motif in DNA sequences, motif finding algorithms; Genome rearrangements, sorting by reversals and breakpoints; DNA sequence alignments; Gene prediction;
CSE6221: Machine Learning
Credit Hours: 3 |
Contact Hours: 3 |
Introduction, Supervised and Unsupervised learning in prepositional logic, Induction of decision trees, Noise and
CSE6222: Neural Networks
Credit Hours: 3 |
Contact Hours: 3 |
Fundamentals of Neural Networks; Back propagation and related training algorithms; Hebbian learning;
CSE6223: Fuzzy Systems
Credit Hours: 3 |
Contact Hours: 3 |
Basic Concepts of Fuzzy set theory; Fuzzy numbers; Aggregation operations of Fuzzy sets; The theory of approximate reasoning; Introduction to Fuzzy logic control; Fuzzy System Models and Developments; Fuzzy logic controllers; Defuzzification methods; Linguistic descriptions and
their analytical forms; The flexible structure of fuzzy systems; Practical Aspects of Neural Networks.
CSE6224: Advanced Digital Image Processing
Credit Hours: 3 |
Contact Hours: 3 |
Image sampling and quantization; Image smoothing , sharpening and contrast enhancement in spatial and frequency domains: basic gray level transformation, histogram processing, image subtraction, image averaging, Gaussian and Laplacian filters in spatial and frequency domains, convolution theorem; Image
CSE6225: Speech Recognition
Credit Hours: 3 |
Contact Hours: 3 |
Introduction, Speech signal: production, perception and characterization, Signal processing and
analysis; Pattern comparison techniques: distortion measures,
alignment and normalization; Recognition system design and implementation:
template training, performance analysis; Connected word models: two level DP, level building
algorithm,
CSE6231: Data Mining
Credit Hours: 3 |
Contact Hours: 3 |
Introduction; Data warehousing and OLAP technology for data mining; Data preprocessing; Data mining primitives, languages and systems; Descriptive data mining: characterization and
comparison; Association analysis; Classification and prediction; Cluster analysis; Mining complex types of data; Applications and trends in data mining.
CSE6232: High Dimensional Data Management
Credit Hours: 3 |
Contact Hours: 3 |
Spatial database systems; spatial data types; indexing and querying spatial data; spatial networks; temporal database systems; moving object data management systems; moving object indexing techniques; query processing on moving object data; multidimensional indexing methods; similarity search; dimension reduction methods; time series data; indexing techniques for massive time series data;
CSE6233: Distributed Search Techniques
Credit Hours: 3 |
Contact Hours: 3 |
CSE6234: Distributed Computing Systems
Credit Hours: 3 |
Contact Hours: 3 |
Distributed object systems, Retrieving and caching of distributed information, Distributed data replication and sharing, Performance issues, Algorithms for deadlock detection, Concurrency control and synchronization in distributed system, Models for distributed computation, Networking facilities and resource control and management methods in network and distributed operating systems, Collaborative applications, Wide area network computing, Web based commerce, Agent systems and Market based computing.
CSE6241: Information System Management
Credit Hours: 3 |
Contact Hours: 3 |
Information systems management: importance of information systems (IS) management, IS management's leadership role, strategic uses of IT, IS planning; managing essential technologies: distributed systems, managing telecommunications, managing information resources, and managing operations; managing system development: technologies for developing systems and management issues in system development; systems for supporting knowledge work: supporting decision making, collaboration, and knowledge works; acquisition of hardware, software, networks, and services: request for proposal, acquisition methods (buy, rent, or lease), software acquisition, and analysis of alternatives; people and technology: the challenges ahead.
CSE6242: Software Project Management
Credit Hours: 3 |
Contact Hours: 3 |
Foundations of software project management; organization structure and staffing; motivation, authority and influence; conflict management; proposal preparation; a large engineering software system management; client management; managing software project teams; project planning and scheduling; risk management; configuration management; pricing estimation and cost control; quality assurance and accreditation; factors affecting software quality; software quality assurance plans; business context and legal issues for software projects; software measurement: testing, upgrading and maintenance; network systems; and international project management.
CSE6243: Software Quality Assurance
Credit Hours: 3 |
Contact Hours: 3 |
Definition and concept of software quality assurance (SQA); quality models; specification of quality requirements; product development & delivery issues; software development processes & maturity; software quality management process: total quality management, improvement cycle, SQA planning & management, organizing the SQA effort; software verification & validation; typical software development errors; Fagan inspections; software audit; software testing: testing objectives & testing fundamentals, testing theory, coverage criteria, equivalence class testing,
testing, system testing; testing in
CSE6244:
Credit Hours: 3 |
Contact Hours: 3 |
Introduction to
CSE6251: Network Security
Credit Hours: 3 |
Contact Hours: 3 |
Network security policies, strategies and guidelines; Network security assessments and matrices; Different attacks: Denial of Service attack (DoS), Distributed Denial of Service (DDoS) attack, Eavesdropping, IP spoofing, Sybil attack, Blackhole attack, Grayhole attack,
Firewalls and Proxy server; Security for wireless network protocols: WEP, WPA, TKIP, EAP, LEAP; Security protocols for
CSE6252: Wireless and Mobile Communication Networks
Credit Hours: 3 |
Contact Hours: 3 |
Characteristics of cellular communications; QOS in cellular communications; Wireless LAN; Wireless ATM and media access protocols for WATM; Wireless application protocols; Wireless personal communications; Mobile IP; Spread spectrum techniques: DSSS, FHSS, CDMA, GSM, CPDP; satellite communications – internetworking via satellites; Mobile satellite communications.
CSE6253: Wireless Ad Hoc Networks
Credit Hours: 3 |
Contact Hours: 3 |
Introduction: applications and motivations; broadcasting protocols: algorithmic aspect,
optimization techniques,
CSE6254: Wireless Sensor Networks
Credit Hours: 3 |
Contact Hours: 3 |
Introduction: applications; Localization and tracking: tracking multiple objects; Medium Access
Control:
Based Routing: directed diffusion, rumor routing, geographic hash tables; Infrastructure
establishment: topology control, clustering, time synchronization; Sensor tasking and control:
aggregation, data indices and range queries, distributed hierarchical aggregation; Sensor network platforms and tools: sensor node hardware, sensor network programming challenges; Other state-
CSE6261: Computer Ethics and Cyber law
Credit Hours: 3 |
Contact Hours: 3 |
Computer Ethics: Introduction, Privacy, Security, Cybercrime, Intellectual Property, Community and Identity, Digital Divide, Emerging Technologies, Computer crime, Computer and software reliability, Computer in the workplace, Professional code of ethics, Computer ethics in Islamic Perspective. Cyber Law: Introduction, UNCITRAL Model Law, UNCITRAL Model Law for E- commerce, UNCITRAL Model Law for Electronic Fund Transfer, ICT ACT 2006, ICT ACT 2006 (Amended), Security and Cyber law, Islamic Viewpoint of Cyber Law.
CSE6291: Research Methodology in Computer Science and Engineering
Credit Hours: 3 |
Contact Hours: 3 |
Literature search, review and citation practices, Problem identification, formulating research questions, quantitative and qualitative methods, strengths and weaknesses, instrumentation and data logging, scientific paper writing, typesetting with Latex, data sampling, collection, testing data analysis with R, interpretation and limitations, validity, reliability, sources of error data management and presentation.
CSE6292: Special Topics in Computer Science and Engineering
Credit Hours: 3 |
Contact Hours: 3 |
Latest topics in computer science and engineering or related with computer field will cover in this course.
Detailed Syllabus of the Prerequisite Courses
Course code :
Course Title : Discrete Mathematics
Credit Hours: 3Contact Hours: 3 per Week
Set: Introduction to Set, Set operation, Representation of Sets, Algebraic Properties of Set,
Computer representation of set. Logic: Introduction to Logic, Prepositional Calculus,
propositional equivalences, Predicate and quantifier, Translating sentence into logical expressions. Function & Relation: Introduction to function, Some important functions, Properties of function, Rate of Growth: Big O Notation, Sequence and summation. Introduction to Relation, Representation of Relation, Properties of Relation, Composition of Relation, Equivalence Relations, Partition, Closures of Relation. Number Theory: Theorem of Arithmetic, Modular Arithmetic, GCD, LCM, Prime Number, Congruence, Application of Congruence, Application of Number Theory, Chinese Remainder Theory. Mathematical reasoning: Methods of Proof, Mathematical Induction, Recursion. Counting: Basic Counting principle,
Course code :
Course Title : Object Oriented Programming with Lab
Credit Hours: 3 |
Contact Hours: 3 per Week |
Introduction: Fundamentals of OOP: Class: Default constructor, abstract class, final class and
static class. Object: Definition of an object, object model, relation between an object and a class. History of JAVA, Java Class Libraries, Introduction to Java Programming, Characteristics of OOP in context of JAVA(Encapsulation, Inheritance, Polymorphism), Local variable, global variable, Introduction to Java Control Structures. Thread: Use of a thread, different ways to get a thread, how to start a thread, special character of start method of the Thread class, Runnable interface. Packages & Interface: Creating Package, Definition of an interface, use of interface, contents of an interface, an abstract class can be used as an interface, Introduction to Java Common Packages. Applet: Life cycle of an applet, major events in the life of an applet, looping problem of init method, embedding an applet to a web page, paint method, repaint method. Event Handling: Event source, different kind of listeners, registering the listener. Layout Management: Container, component, flow layout, border layout, grid layout, Introducing AWT. Exception & Network Programming: Exception: Definition of exception, how to generate, throw and handle an exception, exception ducking, Networking: Socket, server socket, Client Socket, connection and communication between client and server. Input Output: Stream, input stream, output stream, character stream, byte stream, Reader & Writer classes to handle input and output, String handling. Advanced Features of JAVA: Java Beans, Servlets, Swing.
In Lab, experiments related to Theory will be performed.
Course code :
Course Title : Data Structures and Algorithms with Lab
Credit Hours: 3 |
Contact Hours: 3 per Week |
Introduction: Elementary Data organization, Information; Data types; Data Structure, Data Structure operations; Algorithm;
Traversing LA, Insertion & Deletion in LA, Bubble Sort, Linear Search & binary Search. 2D Array & its representation in memory; Matrices; Algebra of matrices; Sparse matrices
Stack: its representation & applications; PUSH and POP operation on stack. Polish Notation, reverse polish notation; Evaluation of a postfix expression; Transforming infix expression into postfix expression. Queue – its representation; Insertion & deletion in Queue; Deques; Priority Queues. Recursion [Factorial function, Fibonacci sequence, Ackermann function, Towers of Hanoi] Linked list - Linked list & its representation in memory; Traversing, Searching, Insertion
&Deletion operation on Linked list; Header linked lists; Two way lists. Complexity of algorithms, Rate of growth: Big O notation; Complexity of Linear Search, Binary search & Bubble sort algorithm. Sorting - Insertion sort, selection sort, quick sort, merge sort; Searching
&data modification; Hashing: Hash function, collision resolution Tree- Tree terminology; representation of binary trees in memory; Traversing binary tree; Binary search tree; Insertion & deletion on binary search tree; Heap; Insertion & deletion on heap; Heapsort; B trees; General tree Graph – graph terminology; representation of graphs – adjacency matrix, path matrix, adjacency list; Traversing a graph – BFS & DFS
Algorithm and Data structure: Algorithm, Properties of good algorithm, Data Structure, Application Areas of Algorithm. Time and Space Complexity Analysis of Algorithms, Asymptotic Notations, Insertion Sort and its Complexity Analysis.
Divide and Conquer approach & Heaps: Divide and Conquer approach and Merge Sort, Algorithm of Merge Sort, Complexity Analysis Merge Sort, Quick Sort and its Algorithm, Complexity Analysis of Quick Sort, Heap Construction Algorithm, Heap sort, Application of Heap: Priority Queue.
Dynamic Programming: Algorithm of LCS, Dynamic Programming, Matrix Chain Multiplication Example, Algorithm of MCM, and Example of Longest Common Subsequence, Complexity Analysis.
Greedy Algorithm: Greedy Algorithm, Activity Selection Problem, Huffman Codes and it’s application, Knapsack problem, Traveling Salesperson Problem, Complexity Analysis
Graphs basic & traversal techniques: Representation of Graphs, Breadth First Search, Depth First Search, Algorithm of BFS and DFS, Minimum Spanning Tree, Kruskal and Prims Algorithm, Complexity Analysis.
Shortest Path: Single Source Shortest Paths, Dijkstra’s Algorithm, and
Recurrences & Backtracking: Recurrences,
Computational Geometry & Number Theory: Computational Geometry, Line Segment Properties, Convex Hull, Graham Scan Algorithm of Convex Hull, Number Theory, GCD, Modular Arithmetic, Prime Number generation, Complexity Analysis
In Lab, experiments related to Theory will be performed.
Course code :
Course Title : Database Management Systems with Lab
Credit Hours: 3 |
Contact Hours: 3+2 per Week |
Introduction: Database, data, database management system, Database system versus file system, Data model, Database language, Database user administration, Database system structure, Storage manager, Overview of Physical storage medium.
Concurrency control, Recovery System and Distribute databases:
In Lab, experiments related to Theory will be performed.
Course code :
Course Title : Digital Logic Design with Lab
Credit Hours: 3Contact Hours: 3 per Week
Bynary Systems, Bollean Algebra and Logic Gates: Number system, binary codes, binary logics, logic gates, boolean algebra, cannonical and standard forms.
Simplification of Boolean Functions: The Map Method.
Combinational Logic: Design Procedure, Adders, Subtractors, Code Conversion, Analysis Procedure, designing various types of combinational circuit using logic gates.
Combinational logic with MSI and LSI: MSI and LSI, Binary Parallel Adder, look ahead carry, decimal Adder, Magnitude Comparator, decoder, encoder, multiplexer & demultiplexer. Sequential Logic:
Digital Integrated Circuits: Bipolar transistor characteristics, RTL, DTL,
Registrars, Counters, and the Memory: Registers, shift registers, ripple counters, asynchronous counter, synchronous counter, memory, read only memory, programmable logic array, random access memory, memory unit.
Register Transfer and Processor Logic Design: Interregister transfer,
In Lab, experiments related to Theory will be performed.
Course code :
Course Title : Computer Architecture and Operating System with Lab
Credit Hours: 3 |
Contact Hours: 3 per Week |
Information representation, Performance measurement. Instruction and data access methods. Arithmetic Logic Unit (ALU): arithmetic and logical operations floating point operations, ALU design. The control unit (Single cycle Data path) : hardwired and micro programmed. The control unit (Multiple cycle Data path) : hardwired and micro programmed. Hazard; Exceptions; Pipelining. Memory organization. I/O systems, channels, interrupts, DMA
Principle of operating systems and Operating system structure: Definition of operating system, Different kinds of operating systems (Desktop, Multiprocessor, Distributed, Clustered, Real time, Handheld systems),
Process: process management, inter- process communication, Process scheduling, Process Concept, Operations on Processes, Inter process Communication, Communication in Client- Server Systems, Basic Concepts of Process Scheduling, Scheduling Criteria and Scheduling Algorithms. Multiprocessing and time sharing, Process coordination:
page replacement, LRU), Thrashing File systems: File Concept, |
Access Methods, Directory |
Structure, |
|
Implementation, Allocation Methods Protection and security: |
Protection, Principles of |
Protection, Domain of Protection, Access Matrix, Access Control, Revocation of Access Rights, The Security Problem, Program Threats, System and Network Threats, Cryptography as a Security Tool, User Authentication, Implementing Security Defenses, Fire walling to Protect Systems and Networks
In Lab, experiments related to Theory will be performed.
Course code :
Course Title : Computer Networks with Lab
Credit Hours: 3 |
Contact Hours: 3 per Week |
Introduction: Definition, Uses of Computer Networks, Network Topology, Network Media,
Network Devices, Different Types of Network: LAN, MAN, WAN etc.
IP addressing: Classful IP Addressing, Subnetmask, CIDR, Private IP Address, Public IP Address, Subnetting, VLSM etc.
Network Model: OSI Reference Model, TCP/IT Reference Model, ATM Reference Model, Functions of the Layers of different models, Network Protocols working at different layers.
Data Link Layer Design Issues, Framing: Character Count, Byte Stuffing, Bit Stuffing, Error
Detection: Cyclic Redundancy Check, Parity Bit Checking, and Correction: Hamming Code. Windowing
Protocols: Go back N ARQ, Selective repeat ARQ, Elementary Data Link Protocols,
Multiple Access: Random Access; ALOHA, CSMA, CSMA/CD, CSMA/CA,
Channelized Access; CDMA, TDMA, FDMA, Controlled Access; Rservation, Poling, Token Passing. Ethernet, Wireless LANs, and Bluetooth.
Switching: Circuit Switching, Packet Switching, Message Switching, Routing Algorithms, Virtual Circuit and Datagram, Congestion Control Algorithms, Quality of Service, Internetworking, Internetworking Devices etc.
Network Layer Protocols: Address Resolution Protocol, Internet Protocol, Internet Control Message Protocol, IPV6, Routing Information Protocol, Open Shortest Path First, Border Gateway Protocol, User Datagram Protocol, Transmission Control Protocol.
Network Security: Cryptography, Substitution Cipher, Transposition Cipher, One time Pads, Public Key Cryptography:RSA Encryption and Decryption, Authentication Protocol 1.0 to 5.0, Digital Signature, Key Distribution Center, Different symmetric Key Algorithm, Certificate Authority, DNS, Electronic Mail, World Wide Web.
Course code :
Course Title : System Analysis and Design with Lab
Credit Hours: 3 |
Contact Hours: 3 per Week |
Concepts of system and its environment: Information, Types of information, Quality of information, System, Types of systems, Components of system, Source of information. Information gathering: strategy, Information searching methods, Interviewing technique, System development methodologies and life cycle. Feasibility study & Cost/Benefit analysis: Feasibility considerations, steps in feasibility analysis, feasibility report, Cost and Benefit categories, procedure for cost and benefit determination, classification of cost and benefit, cost and benefit evaluation methods. Tools of analysis and design: Data Flow Diagram(DFD), DFD symbols, Constructing DFD; Data Dictionary; Decision Tree, Structured English, Decision Tables. System Design and Construction: The process of design, System design phases, Design
methodologies; Structured design;
In Lab experiments related to Theory will be performed.
Course code :
Course Title : Artificial Intelligence with Lab
Credit Hours: 3 |
Contact Hours: 3 per Week |
Concepts of Artificial Intelligence: Introduction, The Foundations of AI, The History of AI, AI
technique, The State of the Art; Problems and Problem Solving: Problems, Example of Problems, Problem Formulation,
Various Searching Techniques: Search Strategies, Uninformed (blind) search strategies like Breadth- First search, Uniform cost search,
Propositional and
Logic: Syntax, Semantics, Validity and Inference, Rules of Inference for Propositional logic;
Logic: Syntax and Semantics, Using
Inference in first order logic: Inference Rules Involving Quantifiers, Example Proof, Generalized Modus Ponens, Forward and Backward Chaining, Completeness, Resolution.
Game playing: Introduction, Perfect Decisions, Imperfect Decisions,
language processing: Introduction, Syntactic Processing, Semantic Analysis, Discourse and Pragmatic Processing.
Planning: Basic
Learning: Introduction to Learning, Inductive Learning, Learning Decision Trees, Neural Net Learning;
Probabilistic Reasoning: Probability and Bayes’ Theorem, Certainty Factors and
Systems, Bayesian Networks, Fuzzy Logic; Some Expert Systems: Representation and Using Domain Knowledge, Expert System Shells, Explanation, Knowledge Acquisition.
In Lab experiments related to Theory will be performed.