CT-365 Software Engineering
| CREDIT HOURS | PREREQUISITE COURSES |
| Theory = 3 | Nil |
| Practical = 0 |
COURSE LEARNING OUTCOMES (CLOs)
| S. No. | CLOs | Taxonomy | PLO Mapping |
|---|---|---|---|
| 1 | Describe an understanding of current theories, models, and techniques of Software Engineering that provide a basis for the software lifecycle. | Coginitive Level 2 | PLO-1 |
| 2 | Prepare requirements and design specifications of a software project. | Coginitive Level 5* | PLO-8 |
| 3 | Apply software engineering knowledge effectively as an individual or team leader in a software project. | Coginitive Level 3* | PLO-6 |
COURSE CONTENT
Evolving role of Software, Definition and need of Software Engineering, Software Development Process, Software Process Models, Project Management concepts – People, Problem and Process, Software project estimations concepts & techniques. Metrics concepts types and their role, Software Quality Assurance, Introduction to Software testing concepts, Brief comparison of conventional methods for Software Engineering and new methods such as Object Oriented Software Engineering.
RECOMMENDED BOOKS- Software Engineering: A Practitioner’s Approach, Roger S. Pressman and Bruce Maxim , 9th ed., McGraw-Hill, 2019.
- Software Engineering, Ian Sommerville, 10th ed., Addison Wesley, 2015.
CT-353 Operating Systems
| CREDIT HOURS | PREREQUISITE COURSES |
| Theory = 3 | CT-159 Data Structures Algorithms & Applications |
| Practical = 1 |
COURSE LEARNING OUTCOMES (CLOs)
| S. No. | CLOs | Taxonomy | PLO Mapping |
|---|---|---|---|
| 1 | Describe the concepts, structure and design of operating systems. | Coginitive Level 2 | PLO-1 |
| 2 | Analyses operating system design and its impact on application design and performance. | Coginitive Level 4* | PLO-3 |
| 3 | Apply design and development principles in the construction of Operating Systems Components. | Coginitive Level 3* | PLO-3 |
COURSE CONTENT
Introduction to Operating System, Operating System Structure; Concurrent Processes; CPU Scheduling; Deadlocks, Memory Management; Virtual Memory; File System; Emphasis on Character Base OS (i.e., Dos and UNIX).
RECOMMENDED BOOKS- Operating Systems Concepts, Abraham Silberschatz, Peter B. Galvin and Greg Gagne, 10th ed., John Wiley & Sons, 2021.
- Operating Systems: Internals and Design principles, William Stallings, 9th ed., Prentice Hall, 2021.
- Modern Operating Systems, Andrew S. Tanenbaum, 5th ed., Prentice Hall, 2022.
CT-363 Design & Analysis of Algorithms
| CREDIT HOURS | PREREQUISITE COURSES |
| Theory = 3 | CT-159 Data Structure Algorithms & Applications |
| Practical = 0 |
COURSE LEARNING OUTCOMES (CLOs)
| S. No. | CLOs | Taxonomy | PLO Mapping |
|---|---|---|---|
| 1 | Understand the algorithm design & complexity. | Coginitive Level 1 | PLO-1 |
| 2 | Understand various techniques of designing algorithms | Coginitive Level 2* | PLO-2 |
| 3 | Analyze different algorithmic techniques to select appropriate solutions for real world problems. | Coginitive Level 4* | PLO-3 |
COURSE CONTENT
Introduction; Asymptotic notations; Recursion and recurrence relations; Divide-and-conquer approach; Sorting; Search trees; Heaps; Hashing; Graph algorithms; Shortest paths; Network flow; Disjoint Sets; Polynomial and matrix calculations; Classes of Efficient Algorithms; Divide and Conquer, Dynamic Programming, Greedy Algorithms, Branch and Bound, String Matching algorithms; NP-complete problems; Approximation algorithms.
RECOMMENDED BOOKS- Introduction to Algorithms, T. H. Cormen, C. E. Leiserson, and R. L. Rivest, 4th ed., MIT Press, McGraw-Hill, 2022.
- Algorithms, Robert Sedgewick and Kevin Wayne 4th ed., Princeton University Publisher: Addison-Wesley Professional, 2021.
MT-331 Probability & Statistics
| CREDIT HOURS | PREREQUISITE COURSES |
| Theory = 3 | Nil |
| Practical = 0 |
COURSE LEARNING OUTCOMES (CLOs)
| S. No. | CLOs | Taxonomy | PLO Mapping |
|---|---|---|---|
| 1 | Discuss the fundamental concepts in Probability and Statistics. | Coginitive Level 2 | PLO-2 |
| 2 | Analyze data to produce mathematical or probabilistic models in relevant engineering problems. | Coginitive Level 4* | PLO-3 |
COURSE CONTENT
Introduction, Types of data & variables, presentation to data, object, classifications, Tabulation, Frequency distribution, Graphical representation, Simple & Multiple Bar diagrams, Sartorial & Pie-Diagram, Histogram, Frequency Polygon, Frequency Curves & their types.
RECOMMENDED BOOKS- Probability & Statistics for Engineers and Scientists, Ronald E. Walpole and Raymond H. Myers, Sharon L. Myers and Keying Ye, 9th ed., Pearson, 2020.
- Applied Statistics & Probability for Engineers, Douglas C. Montgomery, 6th ed.,Wiley, 2013.
CT-364 Theory of Automata and Formal Languages.
| CREDIT HOURS | PREREQUISITE COURSES |
| Theory = 3 | Nil |
| Practical = 0 |
COURSE LEARNING OUTCOMES (CLOs)
| S. No. | CLOs | Taxonomy | PLO Mapping |
|---|---|---|---|
| 1 | Explain the different concepts in automata theory and formal languages including Turing machines. | Coginitive Level 1 | PLO-1 |
| 2 | Construct automata, RE and CFG | Coginitive Level 3* | PLO-2 |
| 3 | Transform between equivalent NFAs, DFAs and REs. | Coginitive Level 4* | PLO-3 |
COURSE CONTENT
Finite State Models, Formal Languages, Regular Expressions, Regular languages, Finite automata (FAs), Transition graphs (TGs), Deterministic and Non-Deterministic Finite automata , Kleene's theorem, Transducers (automata with output), Pumping lemma and non regular language Grammars, Pushdown Automara (PDA), Context free grammars, Derivations, ambiguity in grammars, Parse Trees, Normal form grammars, Decidability, Context sensitive languages, Chomsky's hierarchy of grammars, Turing Machines.
RECOMMENDED BOOKS- An Introduction to Formal Languages and Automata, Peter Linz, 6th ed., Jones & Bartlett Publishers,2016.
- Introduction to Automata Theory, Languages, and Computation, John Hopcroft and Jeffrey Ullman, 3rd ed., Pearson, 2006.