License Syllabus
License Syllabus
Chapters 1-2 are fundamentals/principles of concepts in computer engineering; chapters 3-9 are related to
application of computer engineering principles in practice; and the last (10th) chapter is related to project
planning, design and implementation.
1
3.2 Pointers, structure and data files in C programming: Pointer Arithmetic, Pointer and array,
passing pointer to function, Structure vs Union, array of structure, passing structure to function, structure
and pointer, Input/output operations on files, and Sequential and Random Access to File. (ACtE0302)
3.3 C++ language constructs with objects and classes: Namespace, Function Overloading, Inline
functions, Default Argument, Pass/Return by reference, introduction to Class and object, Access
Specifiers, Objects and the Member Access, Defining Member Function, Constructor and its type, and
Destructor, Dynamic memory allocation for objects and object array, this Pointer, static Data Member and
static Function, Constant Member Functions and Constant Objects, Friend Function and Friend Classes.
(ACtE0301)
3.4 Features of object-oriented programming: Operator overloading (unary, binary), data conversion,
Inheritance (single, multiple, multilevel, hybrid, multipath), constructor/destructor in single/multilevel
inheritances. (ACtE0304)
3.5 Pure virtual function and file handling: Virtual function, dynamic binding, defining opening and
closing a file, Input / Output operations on files, Error handling during input/output operations, Stream
Class Hierarchy for Console Input /Output, Unformatted Input /Output Formatted Input /Output with ios
Member functions and Flags, Formatting with Manipulators. (ACtE0305)
3.6 Generic programming and exception handling: Function Template, Overloading Function
Template, Class Template, Function Definition of Class Template, Standard Template Library
(Containers, Algorithms, Iterators), Exception Handling Constructs (try, catch, throw), Multiple
Exception Handling, Rethrowing Exception, Catching All Exceptions, Exception with Arguments,
Exceptions Specification for Function, Handling Uncaught and Unexpected Exceptions. (ACtE0306)
2
5.1 Introduction to computer networks and physical layer: Networking model, Protocols and
Standards, OSI model and TCP/IP model, Networking Devices (Hubs, Bridges, Switches, and Routers)
and Transmission media. (ACtE0501)
5.2 Data link layer: Services, Error Detection and Corrections, Flow Control, Data Link Protocol,
Multiple access protocols, LAN addressing and ARP (Address Resolution Protocol), Ethernet, IEEE
802.3(Ethernet), 802.4(Token Bus), 802.5(Token Ring), CSMA/CD, Wireless LANs, PPP (Point to Point
Protocol), Wide area protocols. (ACtE0502)
5.3 Network layer: Addressing (Internet address, classful address), Subnetting, Routing Protocols (RIP,
OSPF, BGP, Unicast and multicast routing protocols), Routing algorithms (shortest path algorithm,
flooding, distance vector routing, link state routing) Routing Protocols (ARP, RARP, IP, ICMP), and
IPv6 (Packet formats, Extension headers, Transition from IPv4 to IPv6, and Multicasting). (ACtE0503)
5.4 Transport layer: The transport service, Transport protocols, Port and Socket, Connection
establishment & Connection release, Flow control & buffering, Multiplexing & de-multiplexing,
Congestion control algorithm (ACtE0504)
5.5 Application layer: Web (HTTP & HTTPS), File Transfer (FTP, PuTTY, Win SCP), Electronic Mail,
DNS, P2P Applications, Socket Programming, Application server concept, and Concept of traffic
analyzer (MRTG, PRTG, SNMP, Packet tracer, Wireshark). (ACtE0505)
5.6 Network security: Types of Computer Security, Types of Security Attacks, Principles of
cryptography, RSA Algorithm, Digital Signatures, securing e-mail (PGP), Securing TCP connections
(SSL), Network layer security (IPsec, VPN), Securing wireless LANs (WEP), Firewalls. (ACtE0506)
3
7. Data Structures and Algorithm, Database System and Operating System (ACtE07)
7.1 Introduction to data structure, list, linked lists and trees: data types, data structures and abstract
data types; time and space analysis of algorithms (Big oh, omega and theta notations), Linear data
structure (Stack and queue implementation); Stack application: infix to postfix conversion, and evaluation
of postfix expression, Array implementation of lists; Stack and Queues as list; and Static list structure,
Static and dynamic list structure; Dynamic implementation of linked list; Types of Linked list: Singly
Linked list, Doubly Linked list, and Circular Linked list; Basic operations on Linked list: creation of
linked list, insertion of node in different positions, and deletion of nodes from different positions; Doubly
linked lists and its applications, Concept of Tree, Operation in Binary tree, Tree search,
insertion/deletions in Binary Tree, Tree traversals (pre-order, post-order and in-order), Height, level and
depth of a tree, AVL balanced trees. (ACtE0701)
7.2 Sorting, searching, and graphs: types of sorting: internal and external; Insertion and selection sort;
Exchange sort; Merge and Redix sort; Shell sort; Heap sort as a priority queue; Big ‘O’ notation and
Efficiency of sorting; Search technique; Sequential search, Binary search and Tree search; General search
tree; Hashing: Hash function and hash tables, and Collision resolution technique, Undirected and Directed
Graphs, Representation of Graph, Transitive closure of graph, Warshall’s algorithm, Depth First Traversal
and Breadth First Traversal of Graph, Topological sorting (Depth first, Breadth first topological sorting),
Minimum spanning trees ( Prim’s, Kruskal’s and Round- Robin algorithms), Shortest-path algorithm
(Greedy algorithm, and Dijkstra’s Algorithm) (ACtE0702)
7.3 Introduction to data models, normalization, and SQL: Data Abstraction and Data Independence,
Schema and Instances, E-R Model, Strong and Weak Entity Sets, Attributes and Keys, and E-R Diagram,
Different Normal Forms (1st, 2nd, 3rd, BCNF), Functional Dependencies, Integrity Constraints and
Domain Constraints, Relations (Joined, Derived), Queries under DDL and DML Commands, Views,
Assertions and Triggering, Relational Algebra, Query Cost Estimation, Query Operations, Evaluation of
Expressions, Query Optimization, and Query Decomposition. (ACtE0703)
7.4 Transaction processing, concurrency control and crash recovery: ACID properties, Concurrent
Executions, Serializability Concept, Lock based Protocols, Deadlock handling and Prevention, Failure
Classification, Recovery and Atomicity, and Log-based Recovery. (ACtE0704)
7.5 Introduction to Operating System and process management: Evolution of Operating System,
Type of Operating System, Operating System Components, Operating System Structure, Operating
System Services, Introduction to Process, Process description, Process states, Process control, Threads,
Processes and Threads, and Types of scheduling, Principles of Concurrency, Critical Region, Race
Condition, Mutual Exclusion, Semaphores and Mutex, Message Passing, Monitors, and Classical
Problems of Synchronization. (ACtE0705)
7.6 Memory management, file systems and system administration: Memory address, Swapping and
Managing Free Memory Space, Virtual Memory Management, Demand Paging, Performance, and Page
Replacement Algorithms, introduction to File, Directory and File Paths, File System Implementation,
Impact of Allocation Policy on Fragmentation, Mapping File Blocks on The Disk Platter, File System
Performance, Administration Tasks, User Account Management, Start and Shutdown Procedures.
(ACtE0706)
4
design decisions, System organization, Modular decomposition styles, Control styles, Reference
architectures, Multiprocessor architecture, Client –server architectures, Distributed object architectures,
Inter-organizational distributed computing, Real –time software design, and Component-based software
engineering. (ACtE0802)
8.3 Software testing, cost estimation, quality management, and configuration management: Unit
Testing, Integration testing, System testing, Component testing, Acceptance Testing, Test case design,
Test automation, Metrics for testing, Algorithmic cost modeling, Project duration and staffing, Software
quality assurance, Formal technical reviews, Formal approaches to SQA, Statistical software quality
assurance, A framework for software metrics, Matrices for analysis and design model, ISO standards,
CMMI, SQA plan, Configuration management planning, Change management, Version and release
management, and CASE tools for configuration management. (ACtE0803)
8.4 Object-oriented fundamentals and analysis: Defining Models, Requirement Process, Use Cases,
Object Oriented Development Cycle, Unified Modeling Language, Building Conceptual Model, Adding
Associations and Attributes, and Representation of System Behavior. (ACtE0804)
8.5 Object-oriented design: Analysis to Design, Describing and Elaborating Use Cases, Collaboration
Diagram, Objects and Patterns, Determining Visibility, and Class Diagram. (ACtE0805)
8.6 Object-oriented design implementation: Programming and Development Process, Mapping Design
to Code, Creating Class Definitions, from Design Class Diagrams, Creating Methods from Collaboration
Diagram, Updating Class Definitions, Classes in Code, and Exception and Error Handling. (ACtE0806)
5
function, and Genetic Algorithm Parameters). (ACtE0905)
9.6 Neural networks: Biological Neural Networks Vs. Artificial Neural Networks (ANN), McCulloch-
Pitts Neuron, Mathematical Model of ANN, Activation functions, Architectures of Neural Networks, The
Perceptron, The Learning Rate, Gradient Descent, The Delta Rule, Hebbian learning, Adaline network,
Multilayer Perceptron Neural Networks, Backpropagation Algorithm, Hopfield Neural Network.
(ACtE0906)