Bachelor of Software Engineering program is designed to equip students with a strong foundation in computer science, engineering principles, and practical software development skills. With a curriculum aligned to industry standards and emerging technologies, students gain hands-on experience in designing, developing, testing, and maintaining reliable software systems. Whether your passion lies in building intelligent applications, enhancing cybersecurity, or driving digital transformation, our program prepares you to lead and thrive in a dynamic global tech landscape.
", "id": "646e1312-7699-4473-b5e7-53f4ae78d0ec" }, { "type": "heading", "value": { "text": "Program Educational Objectives", "alignment": "left", "size": "h2" }, "id": "74bbcf76-969c-4932-94a5-d1f1dc9dcd31" }, { "type": "body", "value": "Domain Elective Courses
Domain Elective -1 (Software Verification and Validation (Testing & QA))
Domain Electives -2 (Object Oriented Analysis & Design)
Domain Electives -3 (Computer Architecture)
Domain Electives -4 (Theory of Automata)
Domain Electives -5 (HCI & Computer Graphics)
Domain Electives -6 (Web Technologies)
Domain Electives -7 (Advanced Database Management)
Introduction to ICT:
Books:
Introduction to IT, Hardware, Computer Software, Internet and Web, Introduction to Data Communication and Computer Networks, Development, Introduction to Software Engineering
Programming Fundamentals:
Books:
Introduction to programming languages, Introduction to C++, C/C++ Programming Basics, Loops and Decisions, Structures, Pointers, Functions, Arrays and Strings.
Digital Logic Design
Books:
Number systems, Logical Analysis, Combinational Logic, Sequential Logic, Data Processing, manipulation, data storage, logic families and logic design, FPGAs, Hardware description language like VERILOG
Object Oriented Programming
Books:
Evolution of Object Oriented (OO) programming, OO concepts and principles, problem solving in OO paradigm, OO program design process, classes, methods, objects and encapsulation, constructors and destructors, operator and function overloading, virtual functions, derived classes, inheritance and polymorphism, I/O and file processing, exception handling
Computer Organization and Assembly Language:
Books:
Introduction to microprocessors and computers, System Buses, Internal Memory, External Memory, Input/Output, Interrupts, DMA/IO Channels, Computer Arithmetic, Addressing Modes, CPU Structure and Functions, Control Unit Operations
Data Structure and Algorithms:
Books:
Introduction to Data structures and types of data structures, Definition of algorithm, running time of algorithm, examples, role of efficient algorithms, Definition of Recursion, Direct and Indirect Recursion, Examples of Recursive Functions, Linear Queue & Its Features, Linear Queue Implementation, Circular Queue, Linked List & Its Features, Linked List Implementation, Doubly Linked List & its Implementation, Stack & Its Implementation, Postfix Notation Concept, Implementation Of Postfix Notation, Binary Trees, Strictly Binary Tree, Complete Binary Tree, Almost Complete Binary Tree, Binary Tree Applications, Traversing Trees, Pre-Order Traversing In-Order Traversing, Post-Order Traversing, Bubble Sort, Quick Sort, Binary Sort, Merge Sort, Insertion Sort, Heap, Heap Construction, Heap Sort, Heap Sort Implementation. Hashing & its Implementation, Linear and Binary Search, What Are Graphs, Representation Of Directed Graphs, Graph Vocabulary, Graph Operations (Add Vertex, Add Edge), C++ Implementation, Hashing, dictionaries and hash tables, hashing function, hashing implementation using array and linked list.
Discrete Structures:
Books:
Mathematical reasoning, propositional and predicate logic, rules of inference, proof by induction, proof by contraposition, proof by contradiction, proof by implication, set theory, relations, equivalence relations and partitions, partial orderings, recurrence relations, functions, mappings, function composition, inverse functions, recursive functions, Number Theory, sequences, series, counting, inclusion and exclusion principle, pigeonhole principle, permutations and combinations, elements of graph theory, planar graphs, graph coloring, euler graph, Hamiltonian path, rooted trees, traversals.
First order differential equations, separation of variables, homogeneous, exact and linear first order ODE, higher order differential equations, Cauchy Euler differential equations, the method of variation of parameters, power series method, Laplace transformation, linearity and first shifting theorem dirac delta and gamma functions, differentiation and integral theorems, inverse Laplace transformation, system of linear differential equations, partial differential equations, method of separation of variables, solution of one dimensional heat and wave equations D'Alembert to solve wave equation
Design & Analysis of Algorithms
Books:
Proof techniques, Induction, Summations, basic algorithms on numbers, complexity classes, Searching and Sorting, Asymptotic analysis , Divide-and-conquer: merge-sort, closest pair problems, collaborative filtering, Karatsuba algorithm, deterministic Selection, Greedy algorithms: Huffman codes, Minimum Spanning Tree, Interval Scheduling Dynamic programming: Weighted Independent Set in Paths, Weighted Interval Scheduling, Knapsack Problem, Sequence Alignment, Single Source Shortest Paths (Bellman-Ford Algorithm), BFS, DFS, Topological Sort, Shortest paths, The Class P and NP, Decision, Optimization and Search problems, NP Complete Problems, Reduction, P vs NP Question, Ford Fulkerson Algorithm, Max Flow-Min Cut Algorithm, Edmond Karp Algorithm, Applications, Standard Form, Geometry of LP, Simplex Algorithm, Closest pair in linear-time, Universal and uniform hashing, Randomized Selection, Randomized Quicksort, Minimum Cut algorithm, Easy vs. hard problems, Approximation Algorithm with absolute approximation guarantees, Hardness of Approximation, Relative Approximation Algorithm, Max Cut , Set Cover, Vertex Cover, Parallel machine scheduling, PTAS and FPTAS for Knapsack problem, Approximation algorithms for TSPLP- rounding based Approximation Algorithms
Theory of Automata:
Books:
Finite State Models: Language definitions preliminaries, Regular expressions/Regular languages, Finite automata (FAs), Transition graphs (TGs), NFAs, Kleene’s theorem, Transducers (automata with output), Pumping lemma and non-regular language Grammars and PDA: CFGs, Derivations, derivation trees and ambiguity, Simplifying CFLs, Normal form grammars and parsing, Decidability, Context sensitive languages, grammars and linear bounded automata (LBA), Chomsky’s hierarchy of grammars Turing Machines Theory: Turing machines, Post machine, Variations on TM, TM encoding, Universal Turing Machine, Defining Computers by TMs.
Database Systems:
Books:
Basic database concepts, Database approach vs file based system, database architecture, three level schema architecture, data independence, relational data model, attributes, schemas, tuples, domains, relation instances, keys of relations, integrity constraints, relational algebra, selection, projection, Cartesian product, types of joins, normalization, functional dependencies, normal forms, entity relationship model, entity sets, attributes, relationship, entity-relationship diagrams, Structured Query Language (SQL), Joins and sub-queries in SQL, Grouping and aggregation in SQL, concurrency control, database backup and recovery, indexes, NoSQL systems.
Operating Systems:
Operating systems basics, system calls, process concept and scheduling, inter-process communication, multithreaded programming, multithreading models, threading issues, process scheduling algorithms, thread scheduling, multiple-processor scheduling, synchronization, critical section, synchronization hardware, synchronization problems, deadlocks, detecting and recovering from deadlocks, memory management, swapping, contiguous memory allocation, segmentation & paging, virtual memory management, demand paging, thrashing, memory-mapped files, file systems, file concept, directory and disk structure, directory implementation, free space management, disk structure and scheduling, swap space management, system protection, virtual machines, operating system security
Software Engineering:
Books:
Nature of Software, Overview of Software Engineering, Professional software development,Software engineeringpractice, Software process structure, Software process models, Agile software Development, Agile process models, Agile development techniques, Requirements engineering process, Functional and non-functional requirements, Context models, Interaction models, Structural models, behavioral models, model driven engineering, Architectural design, Design and implementation, UML diagrams, Design patterns, Software testing and quality assurance, Software evolution, Project management and project planning, configuration management, Software Process improvement.
Artificial Intelligence:
Books:
Introduction (Introduction, basic component of AI, Identifying AI systems, branches of AI, etc.); Reasoning and Knowledge Representation (Introduction to Reasoning and Knowledge Representation, Propositional Logic, First order Logic); Problem Solving by Searching (Informed searching, Uninformed searching, Local searching.); Constraint Satisfaction Problems; Adversarial Search (Min-max algorithm, Alpha beta pruning, Game-playing); Learning (Unsupervised learning, Supervised learning, Reinforcement learning) ;Uncertainty handling (Uncertainty in AI, Fuzzy logic); Recent trends in AI and applications of AI algorithms (trends, Case study of AI systems, Analysis of AI systems).
Computer Networks:
Books:
Introduction to Computer Networks, Network Hardware, LAN, MAN, WAN, Inter Networks and the Internet, End Systems, Client and Servers, Connectionless and Connection Oriented Services, The Network Core: Circuit Switching and Packet Switching, Network Access and Physical Media, ISPs and Internet Backbones, Delay and Loss in Packet Switched Networks, Protocol Layering, Design Issues for Layers, Service Models. OSI Reference Model, Principles of Application-Layer Protocols, The Web and HTTP, FTP, DNS, WWW, Electronic Mail, Multimedia, Transport Layer Introduction, Transport Protocols, UDP, TCP/IP, Network Layer Introduction, Routing Algorithms, Congestion and Congestion Control Algorithms, QoS, Tunneling, Inter-network Routing and Addressing, Introduction to MAC and Channel Allocation, MAC Protocols, Bridges, Spanning Tree, Remote Bridges, Repeaters, Hub, Bridges, Switches, Routers, and Gateways, Introduction to Data Link Layer, Framing, Error Control, Flow Control, Error Detection and Correction
Parallel & Distributed Computing:
Books:
Introduction, Parallel and Distributed Computing, Parallel and Distrubuted Architectures, Socket programming, Parallel Performance, Shared Memory and Threads, Parallel Algorithms, Parallel Algorithms, OpenMP, Scalable Algorithms, Message Passing, Distributed Systems, MapReduce, Clusters, Distributed Coordination, Security, Distributed File Systems, Security, Distributed Shared Memory, Peer-to-Peer, Cloud Computing
Information Security:
Books:
Information security foundations, security design principles; security mechanisms, symmetric and asymmetric cryptography, encryption, hash functions, digital signatures, key management, authentication and access control; software security, vulnerabilities and protections, malware, database security; network security, firewalls, intrusion detection; security policies, policy formation and enforcement, risk assessment, cybercrime, law and ethics in information security, privacy and anonymity of data.
", "id": "6fc195c9-d9f6-4c6c-a365-aeac07ed6d30" }, { "type": "heading", "value": { "text": "Eligibility", "alignment": "left", "size": "h2" }, "id": "fabceda7-2c54-40be-8b04-f7924b14f477" }, { "type": "body", "value": "Focus Areas:
Eligibility Criteria
*HSSC Pre-Medical/ Equivalent applicants, if admitted, will be required to study additional two Mathematics courses, worth 6 credit hours, during first year of studies at the institution.
", "id": "501f1f3d-2325-4d69-812b-2d73a705cff7" }, { "type": "table", "value": { "caption": "", "table": { "data": [ [ "Number of Seats", null ], [ "Computer Science", "100" ], [ "Artificial Intelligence", "50" ], [ "Data Science", "50" ], [ "Software Engineering", "50" ] ], "cell": [], "mergeCells": [], "table_header_choice": "row", "table_caption": "", "first_row_is_table_header": true, "first_col_is_header": false }, "style": "default" }, "id": "238bd8e5-783e-4482-bb78-b3e97e74e1c8" } ] }