2. First Year Spring Semester Courses


CS-251 Logic Design & Switching Theory


CREDIT HOURS PREREQUISITE COURSES
Theory = 3 Nil
Practical = 1  

COURSE LEARNING OUTCOMES (CLOs)

S. No. CLOs Taxonomy PLO Mapping
1 Describe working of basic digital logic circuits design. Coginitive Level 2 PLO-2
2 Apply concepts of digital logic design to build gate level circuits. Coginitive Level 3* PLO-3
3 Practice designing and testing digital logic circuits of MSI (medium scale integration) level. Psychomotor Level 3* PLO-4

COURSE CONTENT

Truth Functions: Binary connectives, Evaluation of Truth Functions, Physical realisations, Sufficient set of connectives. Truth Functional calculus. Boolean Algebra, Duality, Fundamental Theorems of Boolean Algebra, Switches and Relays, Logic Circuits, Speed and Delays in Logic Circuits. Minimization of Boolean Functions: Minterm and Maxterm, Karnaugh map, Simplification of Boolean Functions, POS and SOP expressions. Tabular Minimization: Prime Implicants. Sequential Networks: Latches, Fundamental Mode, Synthesis of Sequential Networks, Minimization of the number of states, Clocked networks, Special realizations and codes: Binary adders, Coding of numbers, Decoders and code conversion. ROMS, NAND and NOR Implementation, Parity Checkers.

RECOMMENDED BOOKS
  1. Digital Logic and Computer Design, Morris M. Mano, 3rd ed., Prentice Hall,2016.
  2. Digital Fundamentals, Thomas Floyd, 11th ed., Prentice Hall, 2018.

CT-162 Discrete Structures


CREDIT HOURS PREREQUISITE COURSES
Theory = 3 Nil
Practical = 0  

COURSE LEARNING OUTCOMES (CLOs)

S. No. CLOs Taxonomy PLO Mapping
1 Comprehend the key concepts of discrete structures. Coginitive Level 2 PLO-1
2 Apply logical reasoning to real-world computing problems. Coginitive Level 3* PLO-2
3 Analyze discrete structures in the context of computer science. Coginitive Level 4* PLO-3

COURSE CONTENT

Mathematical logic, Sets, Functions, Algorithms, Complexity of Algorithms, Mathematical reasoning, Induction, Recursion, Sequences and Sums, Recursive Definitions, Recursive Algorithms, Counting, The Pigeonhole Principal, Permutations and Combinations, Binomial Coefficients, Discrete Probability, Expected Value and Variance, Recurrence Relations, Solving Recurrence Relations, Divide-and-Conquer Relations, Generating Functions, Inclusion Exclusion Relations and their Properties, Representing Relations, Closures of Relations, Equivalence Relations, Partial Ordering, Introduction to Graphs, Graph Terminology, Representing Graphs and Graph Isomorphism, Connectivity, Euler and Hamilton Paths, Shortest Path Problems, Introduction to Trees, Applications of Trees, Tree Traversal, Spanning Trees, Minimum Spanning Trees, Boolean Algebra, Boolean Functions, Representing Boolean Functions, Logic Gates, Minimization of Circuits, Modeling Computation, Languages and Grammars, Finite-State Machines with output, Finite-State Machines with no output, Language Recognition.

RECOMMENDED BOOKS
  1. Discrete Mathematics and its Applications, Kenneth H. Rosen, 8th ed., McGraw Hill Science/Engineering/Math, 2018.
  2. Mathematical Structures for Computer Science,Judith Lee MacKenzie Gersting,7th ed., William. H. Freeman,2014.

CT-260 Object Oriented Programming


CREDIT HOURS PREREQUISITE COURSES
Theory = 3 CT-175 Programming Fundamentals
Practical = 1  

COURSE LEARNING OUTCOMES (CLOs)

S. No. CLOs Taxonomy PLO Mapping
1 To recognize the principles of object-oriented paradigm. Coginitive Level 1 PLO-1
2 To comprehend the objects & their relationships to build object-oriented solution. Coginitive Level 2* PLO-2
3 To implement an object-oriented solution for a given case study. Coginitive Level 3* PLO-3

COURSE CONTENT

Evolution of Object-Oriented Programming (OOP), OO Concepts and principles, UML class diagrams and its notations, Problem solving inOO paradigm, Encapsulation, Constructors and Destructors, Polymorphism, Function Overloading, Operator Overloading, Inheritance, Types of Inheritance, Virtual functions, Abstract base class, Pure Virtual functions, Concept of containership, I/O file processing, Exception handling, OOP concepts implementation: Case studies, Code Refactoring, Overview of design patterns in OOP, Understanding Coupling and Cohesion.

RECOMMENDED BOOKS
  1. C++: How to Program,Paul Deitel and Harvey Deitel, 10th ed., Pearson,2017.
  2. The object oriented thought process,Matt Weisfeld,5th ed., Addison Wesley,2019.
  3. C++ Programming: From Problem Analysis to Program Design, Davender S. Malik, 8th ed.,  Cengage Learning, 2017.

HS-115 Academic Reading & Writing


CREDIT HOURS PREREQUISITE COURSES
Theory = 3 Nil
Practical = 0  

COURSE LEARNING OUTCOMES (CLOs)

S. No. CLOs Taxonomy PLO Mapping
1 Comprehend explicit and implicit information in various academic texts using relevant reading strategies. Coginitive Level 2 PLO-7
2 Compose organized, coherent, and effective texts of various academic genres using writing processes and strategies. Coginitive Level 6* PLO-7
3 Use paraphrasing, summarizing, and referencing skills to avoid plagiarism. Coginitive Level 3* PLO-7

COURSE CONTENT

Reading and Critical Thinking: Reading academic texts effectively, Using strategies for extracting and locating information in text and visuals; identifying main idea and purpose; separating main points from supporting details; drawing inferences and conclusions in a text. Identifying the writer’s intent (cause and effect, reasons, comparison and contrast, exemplification etc.). Interpreting charts and diagrams. Making appropriate notes using strategies mind maps, tables, lists, graphs. Reading and carrying out instructions for tasks, assignments and examination questions. Enhance academic vocabulary using appropriate skills and strategies; and identifying pronunciation through pronunciation key. Writing Academic Texts. Planning writing task: identifying audience, purpose and message (content). Collect information in various forms such as mind maps, tables, charts, lists. Argumentative, narrative, expository and descriptive forms of writing. Write good topic and supporting sentences and effective conclusions. Achieving unity, coherence, adequate development in writing. Use appropriate cohesive devices such as reference words and signal markers. Order & Organize information: Chronology for a narrative, listing, Stages of a process, from general to specific and vice versa, from most important to least important, advantages and disadvantages, comparison and contrast, problem solution pattern, for and against; using different methods of developing ideas like listing, comparison, and contrast, cause and effect, for and against. Revising/Redraft checking content, structure and language. Edit and proof read.

RECOMMENDED BOOKS
  1. Cambridge vocabulary for IELTS, Pauline Cullen, Cambridge University Press, 2008.
  2. Academic Listening Encounters: Human Behaviour, Miriam Espeseth, Cambridge University Press, 2004.
  3. Study Listening,Lynch, 2nd ed., Cambridge University Press, 2007.
  4. Study Reading,Glendining and Holmstrom,2nd ed.,Cambridge University Press,2007.
  5. Writing and the Write, Frank Smith, 2nd ed.,Heinemann Educational Books, 1994.

MT-171-Differential & Integral Calculus


CREDIT HOURS PREREQUISITE COURSES
Theory = 3 Nil
Practical = 0  

COURSE LEARNING OUTCOMES (CLOs)

S. No. CLOs Taxonomy PLO Mapping
1 Identify functions and define real and complex numbers. Coginitive Level 1 PLO-2
2 Apply differential, integral and vector calculus to engineering problems. Coginitive Level 3* PLO-3

COURSE CONTENT

Review of vectors, Vector derivatives. Line and Surface Integrals. The gradient of a Scalar. Complex Number: Argand diagram, De Moivre formula, the root of polynomial equations, curve and regions in the complex plane, standard functions and their inverses (exponential, circular and hyperbolic functions). Bounds and bounded sets, Limit point of sets, Sequences, Convergence of sequences monotonic sequences, Functions and their graph, limit of a function and continuous functions. Differentiation and Successive differentiation and its application; Leibnitz theorem, Taylor and Maclaurin theorems with remainders in Cauchy and Lagrange form, Taylor and Maclaurin series, L’ Hopitals rule, extreme values of a function of one variable using the first and second derivative test, asymptotes of a function, curvature and radius of curvature of a curve, partial differentiation, exact differential and its application in computing errors, Multivariate functions, Maxima and Minima for multivariate functions, Maxima Minima under certain conditions (Lagrange Multiplier). Indefinite integrals and their computational techniques, reduction formulae definite integrals and their convergence, Beta and Gamma functions and their identities, double and triple integration with applications (Area, volume, centroid, inertia, arc length). Scalar and Vector quantities, physical and geometrical meanings. Algebra of vectors. Scalar and Vector triple products.

RECOMMENDED BOOKS
  1. Engineering Mathematics, Anthony Croft, Robert Davison and Martin Hargreaves, 5th ed., Pearson Education Limited, 2017.
  2. Calculus, George B. Thomas and Ross L. Finney, 9th ed., Addison Wesley Longman, 2002.
  3. Engineering Mathematics, K. A. Stroud and Dexter J. Booth, 8th ed., Bloomsbury Academic, 2020..
  4. Calculus and Analytical Geometry, Howard Anton, 9th ed., Pearson ,1998.
  5. Complex Analysis for Mathematics and Engineering, John H. Mathews, 6th ed., Jones and Bartlett Publishers Inc, 2011.