Course description: Builds strong foundation in discrete mathematics—logic, sets, functions, combinatorics, graphs, trees, Boolean algebra—for programming, algorithms, and system development.

• Develop the ability to think logically and construct valid mathematical arguments
• Apply set theory concepts to solve problems in databases, programming, and decision structures
• Analyze relations and functions using matrix and graph representations
• Use combinatorial techniques to solve real-life counting and arrangement problems
• Explore graph and tree structures, implement traversal algorithms (DFS, BFS), and apply in networking, compiler design, and OS

• Unit 1: Set Theory (6 hrs)
  • Basic Concepts: Sets, elements, roster and set-builder notation, cardinality
  • Set Relationships: Subsets, proper subsets, universal set, complement, disjoint sets
  • Set Operations: Union, intersection, difference, complement, symmetric difference
  • Venn Diagrams: Visual representation of set relationships and operations
  • Set Identities: Proof using algebraic and Venn diagram methods
  • Cartesian Products: Ordered pairs, cross product of two or more sets
  • Power Sets: Definition and computation of power sets
  • Applications: Use of sets in databases, computer programming, and decision structures
• Unit 2: Logic and Propositional Calculus (8 hrs)
  • Propositions and Logical Operators: Simple, compound, connectives (AND, OR, NOT, IMPLICATION, BICONDITIONAL)
  • Truth Tables: Constructing truth tables for logical expressions
  • Tautologies, Contradictions, and Contingencies
  • Logical Equivalence and Implications: De Morgan’s, distributive, associative laws
  • Predicate Logic and Quantifiers: Universal and existential quantifiers
  • Rules of Inference: Modus ponens, modus tollens, hypothetical syllogism
  • Proof Methods: Direct, indirect, contradiction, contrapositive, proof by cases
• Unit 3: Relations and Functions (8 hrs)
  • Relations: Definition, binary relation, representation, domain, range, operations on relations
  • Properties: Reflexive, symmetric, transitive, anti-symmetric
  • Relation Matrix and Digraph, Equivalence Relation & Classes, Compatibility Relation
  • Transitive Closure, Composite Relation, Converse
  • Partial Order Relations: Hesse diagrams, least/greatest members, minimal/maximal, LUB/GLB, posets, lattices
  • Functions: Definition, domain, co-domain, range; Injective, surjective, bijective
  • Inverse and composition of functions; Applications in programming and databases
• Unit 4: Mathematical Reasoning and Proof Techniques (6 hrs)
  • Mathematical Reasoning: Basic structure of arguments, logical flow
  • Mathematical Induction: Principle of induction, proof by induction, applications in series and recursive definitions
  • Strong Induction: Differences from regular induction, applications
  • Recursive Definitions: Defining sequences and structures recursively
  • Structural Induction: Proofs involving recursively defined structures like trees and lists
• Unit 5: Combinatorics and Counting Principles (5 hrs)
  • Basic Counting Principles: Rule of sum and rule of product, real-world examples
  • Permutations and Combinations: nPr, nCr, factorial notation — password generation, team selection
  • Pigeonhole Principle: Simple and strong pigeonhole principle, birthday paradox, drawer problems
  • Inclusion-Exclusion Principle: Set-based approach, solving problems with unions of up to three sets
• Unit 6: Graph Theory and Trees (12 hrs)
  • Graphs: Definition, nodes, edges, directed/undirected, multigraph, weighted, degree, indegree, outdegree
  • Subgraphs, Converse digraph, Path, Cycle, Reachability, Distance
  • Connectedness: Weakly, strongly, unilaterally connected; components, deadlock detection
  • Matrix Representation: Adjacency matrix, path matrix, Warshall’s algorithm
  • Graph Traversal: Breadth-First Search (BFS), Depth-First Search (DFS)
  • Trees: Definition, root, leaf, branch nodes; binary tree, m-ary tree, full binary tree
  • Tree Representations: Linked-list, converting m-ary tree to binary tree
  • Tree Traversals: Inorder, preorder, postorder
  • Applications: Networking, pathfinding, compiler syntax trees, file systems
• Unit 7: Algebraic Structures (3 hrs)
  • Binary Operations: Definition and examples on sets
  • Algebraic Systems: Semigroups, monoids, groups — axioms and properties
  • Boolean Algebra: Basic postulates and theorems, duality, Boolean functions
  • Logic Circuits: Simplification using Boolean expressions

Course description: Fundamentals of microprocessor, Intel 8085/8086 architecture, assembly programming, computer organization, pipelining, DMA, and memory hierarchy.

• Understand the basic components of a microprocessor
• Explain the block diagram of Intel 8085
• Demonstrate assembly language programming using Intel 8085
• Interpret timing diagrams, instruction cycles, and machine cycles
• Explain the role of control unit and CPU, differentiate RISC vs CISC
• Describe DMA, memory organization, pipelining, microprogramming
• Perform computer arithmetic operations (multiplication/division)

• Unit 1: Introduction to Microprocessor (3 hrs)
  • Definition, components (Registers, ALU, Control, Buses), microprocessor system, applications
• Unit 2: 8085 Microprocessor (12 hrs)
  • Functional block diagram, pin configuration, registers, flags, multiplexed address/data bus
  • Addressing modes, instruction cycle, machine cycle (opcode fetch, memory read/write), T states
  • Timing diagrams: MOV, LDA, STA, MVI
  • Instruction set: Data transfer (MOV, MVI, STA, LDA, LXI, LDAX, STAX, XCHG)
  • Arithmetic: ADD, ADI, ADC, SUB, SUI, SBB, INR, DCR, INX, DCX
  • Logic: ANA, ANI, ORA, ORI, XRA, XRI, CMA, CMB
  • Branching: JMP, JNZ, JZ, JNC, JC
  • Assembly programming: 8/16-bit addition/subtraction, 8-bit multiplication/division, array searching, loops
• Unit 3: 8086 Microprocessor (4 hrs)
  • Logical block diagram, BIU, EU, flag register, pipeline concept, memory segmentation, segment registers
• Unit 4: Basic Computer Architecture and Design (6 hrs)
  • Stored program organization, computer registers, common bus, instruction cycle
  • Micro-operations: arithmetic, logic, shift operations
• Unit 5: Microprogrammed Control Unit (5 hrs)
  • Hardwired vs microprogrammed CU, control memory, address sequencing, microinstruction format, symbolic/binary microprogram
• Unit 6: Central Processing Unit (6 hrs)
  • General register organization, stack organization, RISC vs CISC architecture
• Unit 7: Computer Arithmetic (3 hrs)
  • Addition/subtraction with signed magnitude and 2’s complement, Booth multiplication algorithm
• Unit 8: I/O and Memory Organization (5 hrs)
  • Peripheral devices, I/O interface, isolated vs memory-mapped I/O, interrupt, DMA, memory hierarchy, RAM/ROM, address decoding, cache memory
• Unit 9: Pipelining (4 hrs)
  • Concept of pipelining, Flynn’s classification, speed-up ratio, arithmetic/instruction pipeline, hazards, data dependency

Course description: In-depth introduction to OOP principles using Java: classes, objects, inheritance, polymorphism, exception handling, multithreading, collections, generics, file I/O, and advanced concepts like Lambda and Streams API.

• Understand OOP principles and implement them in Java
• Install Java compiler and IDE, compile and run Java programs
• Design and develop Java applications using classes, objects, and interfaces
• Use exception handling, collections, generics, and file I/O
• Apply advanced OOP concepts (Design patterns, Lambda, Streams API)
• Build a small-scale Java project using OOP best practices

• Unit 1: Introduction to Java and OOP (6 hrs)
  • History, features, Java architecture (JVM, JDK, JRE), procedural vs OOP, setup, sample programs, command-line arguments, Scanner class
• Unit 2: Basics of Java Programming (8 hrs)
  • Comments, tokens, data types (primitive/user-defined), variables, control statements, arrays (single/multi-dimensional jagged), type conversion, garbage collection, String & StringBuffer
• Unit 3: Classes and Objects (8 hrs)
  • Class definition, methods, objects, abstraction, encapsulation, constructors (default, parameterized, copy), ‘this’ keyword, static, recursion, nested classes, varargs, packages
• Unit 4: Inheritance and Polymorphism (8 hrs)
  • Inheritance types (single, multi-level, hierarchical, multiple via interfaces), ‘super’, method overloading/overriding, Object class, ‘final’, abstract classes, access control, interfaces
• Unit 5: Exception Handling and Multithreading (6 hrs)
  • Exception hierarchy, try-catch-throw-throws-finally, built-in/user-defined exceptions, Thread class, Runnable, priorities, synchronization, inter-thread communication
• Unit 6: File Handling (6 hrs)
  • Console I/O, byte streams (FileInputStream/OutputStream), character streams (FileReader/Writer), serialization, RandomAccessFile
• Unit 7: Collections and Generics (6 hrs)
  • Wrapper classes, Collection Framework (List, Set, Map), ArrayList, LinkedList, HashSet, HashMap, Iterator, Comparator, generic classes/methods, wildcards, restrictions
• Unit 8: Advanced OOP Concepts (4 hrs)
  • Design patterns (Singleton, Factory, Observer), Lambda expressions, Stream API, Optional class, method references

Course description: Limits, continuity, derivatives, integration, differential equations, and computational methods including Simplex, Gauss elimination, Bisection, Newton-Raphson.

• Understand limit, continuity and connection to derivative
• Differentiate functions, geometrical meaning, applications
• Integrate functions, surface/volume integrals, numerical integration
• Solve ordinary and partial differential equations
• Calculate optimization problems using graphical and numerical methods

• Unit 1: Limit and Continuity (7 hrs)
  • Epsilon-delta definition, left/right hand limits, algebraic properties, continuity/discontinuity of algebraic, trigonometric, exponential functions
• Unit 2: Derivatives (7 hrs)
  • Definition, geometrical meaning, first principle, rules (sum, product, chain, quotient), derivatives of inverse circular, hyperbolic, implicit functions, higher order, partial derivatives
• Unit 3: Applications of Derivatives (8 hrs)
  • Increasing/decreasing functions, tangents/normals, L’Hospital’s rule, maxima/minima, concavity, Rolle’s theorem, Cauchy MVT, Taylor/Maclaurin series, economics applications, rate measures
• Unit 4: Anti-derivative and Applications (8 hrs)
  • Geometrical meaning, basic formulas, trigonometric substitution, integration by parts, partial fractions, improper integrals, definite integrals (Riemann sum), area between curves, surface/volume integrals, Trapezoidal & Simpson’s rule
• Unit 5: Differential Equations (8 hrs)
  • Order, degree, first order first degree: variables separable, homogeneous, exact, linear, reducible to linear form, partial differential equations (basic examples)
• Unit 6: Computational Methods (10 hrs)
  • Linear programming, graphical solution, Simplex method (up to 3 variables), duality, matrix inversion, Gauss elimination, Gauss-Seidel, Bisection method, Newton-Raphson method

Course description: Fundamentals of User Experience and User Interface design: UX research, interaction design, UI components, wireframing, prototyping, usability testing, VUI/NLP interfaces.

• Understand UX vs UI and core principles (usability, accessibility, simplicity)
• Conduct user research, create personas, journey maps
• Design graphical/web interfaces with proper UI components
• Apply color theory, typography, visual hierarchy, responsive design
• Create wireframes, mockups, interactive prototypes
• Perform usability testing and heuristic evaluation

• Unit 1: Fundamentals of UX and UI (6 hrs)
  • UX vs UI, tasks of UX/UI designer, UX principles (usability, accessibility, simplicity), core disciplines, interface types (CLI, GUI, VUI, NLP), good design properties, tools (Figma, Adobe XD, Sketch)
• Unit 2: User Interaction Design (6 hrs)
  • UX design process, user-centered design, mindmaps, user research (interviews, surveys, competitive analysis), personas, journey mapping, ideation (mood boards, brainstorming, sketching)
• Unit 3: User Interface Design (6 hrs)
  • Graphical/web interfaces, interaction styles (command line, menu selection, form fill-in, direct manipulation), UI design principles, GUI design process, human/technological considerations
• Unit 4: UI Components (12 hrs)
  • System menus (formatting, types: menu bar, pull-down, cascading, popup), windows (tiled, overlapping, cascading; primary/secondary, dialog boxes), screen controls (buttons, toolbars, textboxes, radio buttons, checkboxes, list boxes, sliders, tabs, date picker, tree view), meaningful graphics/icons
• Unit 5: UI Design Considerations (6 hrs)
  • Page layout, color schemes, typography, responsive design, visual hierarchy (alignment, contrast, proximity, size), navigation models (global, utility, associative, hub-and-spoke, tree, flat)
• Unit 6: Wireframing and Prototyping (6 hrs)
  • Wireframes, mockups, low/high-fidelity prototyping, interactive prototyping, storyboarding, clickable prototypes
• Unit 7: Design Evaluations (6 hrs)
  • Formative/summative evaluation, usability testing (moderated/unmoderated), heuristic evaluation, DECIDE framework, task analysis, performance metrics
• Unit 8: Advanced Techniques (4 hrs)
  • Command vs conversational UI, personas/avatars, speech recognition, dialog management, wearable devices design

Course description: Introduction to management concepts, planning, decision-making, organizing, leading, and contemporary leadership challenges in IT organizations. Delivered in seminar format with student presentations.

• Unit 1: Introduction to Management
  • Concept of management, forms of business, management process, types of managers, managerial roles and skills, integrated management framework, ethics, diversity, social responsibility, role of IT in management
• Unit 2: Planning and Decision Making
  • Concept of planning, planning process, types of plans, organizational goals, SWOT analysis, decision-making process, use of IT in planning and decision-making
• Unit 3: Organizing
  • Elements of organizing, job design, job description/specification, authority distribution, forms of organizational design
• Unit 4: Leading
  • Nature of leadership, generic/situational/emerging approaches, managing teams in crisis, leadership challenges in IT organizations