Concurrent Executions, Serializability and Recoverability, Testing for Serializability. Concurrency Control — Lock-Based Protocols and Timestamp-Based Protocols, 9. Software Engineering Phases of Software Engineering: Definition, Design and Maintenance Phase. Definition Phase: Basics and Concepts Related to Software Engineering and Development, Software and Its Components, Software Characteristics, Problem of Size and Complexity, Evolving Role of Software, Changing Nature, Legacy Software and Software Myths, Software ngineering—A Layered Approach, CMMI, Technology, Product and Process, Software Process Models: Waterfall Model, Classic Life Cycle, Incremental Process Model: RAD, Evolutionary Models, Prototyping, Spiral, And Concurrent Models, ‘The Unitied Process: Phases and Work Products, Agile Process Models, SE Principles and Practices: Software Engineering Practices, Essence and Principles, System Modelling and Simulation, Business Process Reengineering, Object Oriented Analysis, Scenario Based and Flow Oriented Modelling. Design Phase: Concepts and Models, Process and Quality, Design Concept: Abstraction, Architecture, Pattern, Modularity, Information Hiding, Functional Independence, Refinement, Design Classes, Design Models—Data Elements, Interface Elements, Architecture Elements, User Interface Design- Process and Models, User Interface Design-The Golden Rules, Component- Level Design Maintenance Phase: Testing and Maintenance, Type of Testing. Unit, Integration, System, Acceptance Testings, Alpha and Beta Testing, Black Box and White Box Testing, Stress Testing, Types of Maintenance: Error Detection and Error Correction, Enhancement and Perfecting Maintenance, Legacy System and Related Issues. 10. Artificial Intelligence History and Applications: Artificial Intelligence, Foundations and History of Atti Intelligence, Defining Al: Acting Humanly (Turing Test Approach), Thinking Humanly (Cognitive Modelling Approach), Thinking Rationally (Laws of thought Approach), Acting Rationally (Rational Agent Approach), Foundations of Artificial Intelligence, Al Techniques, Expert Systems, Applications of Artificial Intelligence, Intelligent Agents, Structure of Intelligent Agents. Basic Concepts, Functional and Operational Knowledge Using Prolog/LISP: Introduction to Expert System, Robotics, Data Mining, and Datawarchouse (DM&DW). Natural Language Processing (NLP), Speech Recognition, Voice Recognition, Computer Vision, Neural Network, Deep Learning, Machine Leaming, Pattem Matching, Classification and Clustering, Theorem Proving, Block Chain and Smart Computing.Fractional Knapsack Problems, Backtracking: Introduction To Backtracking, Backtracking Technique: Pruned State Space Tree, Backtracking Algorithms for N-Queens, Sum-of-Subsets, Graph Colouring, and 0-1 Knapsack Problems Branch-And-Bound Method and Intractable Problems: Introduction to Branch-and-Bound Method, Solving 0-1 Knapsack Problem Using Branch-and-Bound Method: Breadth-First Search With Branch-And- Bound Pruning, Best-First Search with Branch-and- Bound Pruning, Solving Traveling Salesman Problem Using Branch-and-Bound Method, Randomized Algorithm with Examples, 7. Data Communication and Computer Networks Data Communication and Networking Overview: Communication Model, Data Communications, Data Transmission, Guided Media, Unguided Media, Direct Link, Point-To-Point and Multipoint Guided Configuration, Simplex, Half-Duplex, and Full-Duplex Transmission, Frequency, Spectrum, Bandwidth, Time Domain and Frequency Domain Concepts, Analog and Digital Data Transmission, Distortion, Delay Distortion, Noise, Channel Capacity, Computer Networks and Reference Models: Computer Networks and Its Applications, Broadcast and Point-To-Point Networks, Personal Area Networks, Local Area Networks, Metropolitan Area Networks, Wide Area Networks, Protocols, and Interfaces, Connection-Oriented and Connectionless Services. OSI Reference Model, TCP/IP Reference Model, Internet and Its Usage, Intemet Architecture, Connection-Oriented Networks: X.25, Frame Relay, and ATM, Ethernet, Wireless LANs - 802.11, Transmission Media: Twisted Pair, Coaxial Cable, Optical Fibre, Wireless Transmission: Antennas, Terrestrial Microwave, Data Link Layer: Error Detection and Correction, Error- Correcting Codes, Error-Detecting Codes, Simplex Stop-and-Wait Protocol, Sliding Window Protocols, High-Level Data Link Control (HDLC), Point-To-Point Protocol (PPP), Medium Access Control, Access Protocol- ALOHA (Pure and Slotted), Carrier Sense Multiple Access (CSMA), Ethernet, Wireless LANS-802.11 Protocol Stack, 802.11 Physical Layer, 802.11 MAC Sublayer Protocol, 802.11, The Network and Application Layer: Routing Algorithms, Shortest Path Routing, Flooding, Distance Vector Routing , Link State Routing, ete, Congestion Control Algorithms, IP Protocol, IP Addresses, Subnets, Subnet Mask, Internet Control Protocols, Domain Name System (DNS), DNS Name Space, Name Servers, Electronic Mail- Architecture and Services, User Agent, Message Formats, Simple Mail Transfer Protocol (SMTP), POP3, World Wide Web and Hyper Text Transfer Protocol 8, Database Management System Basic Concepts: Data, Database and DBMS, Database Vs. Traditional File System Approach, Three Schema Architecture of DBMS and Data Independence, Database Models: Hierarchical, Network and Relational Database Systems, High-Level or Conceptual Data Models, Physical Data Models, Object Data Models. Entity Relationship (ER) Model, Relational Constraints-Domain Constraints, Key Constraints, Entity Integrity and Referential Integrity Constraints, Relational Algebra Operations— Select, Project, Rename, Union, Intersection, Set Difference, Join, and Division Operations, Aggregate Functions and Groupings, Structured Query Language (SQL): DDL, DML and DCL Commands, EXISTS and UNIQUE Functions, Aggregate Functions, Introduction to PL/SQL, Functional Dependencies and Normalization: Functional Dependencies, Normalization Using Functional Dependencies — First Normal Form (INF), Second Normal Form (NF), Third Normal Form (NF), And Boyce-Codd Normal Form (BCNF), Multi- Valued Dependencies and Fourth Normal Form (4NF), Join Dependencies and Fifth Normal Form (SNF), Transaction Management and Concurrency Control; Transaction Concept, Transaction State, 37Graph Isomorphism, Euler and Hamiltonian Paths and Circuits. Spanning Tree, Number of Spanning Trees of a Graph, Some Graph Algorithms, 4. Data Structure Using C/C++/Java Stacks and Queues: Stack Data Structure, Push & Pop Operations, Representation and Implementation of Stack Using Array and Linked List, Applications of Stack: Conversion of Infix to Postfix Expressions, Parenthesis Matching, lowers of Hanoi, Recursive Functions. Various Queue Operations, Circular Queue, Representation and Implementation of Queues Using Array and Linked List, Deque, Applications of Queue, Trees: Binary Trees and their Properties, Representation of Binary Trees: Array-Based and linked Representations, Binary Tree Traversals, Binary Search Trees (BST), Operations on BST: Search. Insertion and Deletion, B-Tree: Search, Insertion and Deletion, B+~Trees, AVL Trees. AVL Tree Representation and its Operations, Trees: Search, Insertion and Deletion, Sorting and Searching: Insertion Sort, Bubble Sorting, Selection Sorting. Quick Sort, Merge Sort, Heap Sort, Shell Sort, Sequential Search, Binary Search, Introduction to Hashing, Hash Table Representation, Hash Functions, Collision and Overflows, Graphs and File Structure: Terminology & Representations, Graphs & Multi- Graphs Directed Graphs, Representations of Graphs, Tree and Shortest Path Finding Problems, Physical Storage Media File Organization, Organization of Records into Blocks. Sequential Files, Indexing and Hashing, Primary Indices, Secondary Indices, B+ Tree Index Files, B Tree Index Files, Indexing and Hashing Comparisons. 5. Operating System OS Primitives: Definition and Views of Operating System, Types of OS, Batch Systems, Multi Programming, Time—Sharing, Parallel, Distributed and Real-Time Systems, Operating System Structure, Operating System Components and Services, System Calls, System Programs. Virtual Machines, Process Management: Process Concept, Process Scheduling, Cooperating Processes, Threads, Inter Process Communication, CPU Scheduling Criteria, Scheduling Algorithms, Semaphores. Deadlocks, Memory Management -1 Logical and Physical Address Space, ‘Swapping, Contiguous Allocation, Paging, Segmentation, Virtual Memory, Demand Paging and its Performance, Page Replacement Algorithms, Allocation of frames. Thrashing, Page size and Other Considerations, Demand Segmentation, Paging And Segmentation, Secondary Storage Structure, File Handling and Organization, Disk Organization, Threats And Security, Linux ‘System Design Principles, Kernel! Modules, Process Management, Shell Programming 6. Analysis and Design of Algorithms. Algorithms Analysis and ADT: Fundamentals of Algorithms Design Techniques (ADT), Importance of Developing Efficient Algorithms, Worst, Best, Average Case Time Complexity Analysis, Notations: Big-O(O), Theta (Q), Big-Omega (Q), Small-O (o), and Small-Omega (2) Notations. Properties of Complexity Notations, Limit Approach To Determine Order, Master ‘Theorem, Divide and Conquer Approach, Design and Analysis of Binary Search (Recursive and Non-Recursive), Merger Sort, Quicksort, and Strassen’s Matrix Multiplication Algorithms, Advanced Case Studies, Dynamic Programming: Introduction to Dynamic Programming, Difference Between Divide-and- Conquer and Dynamic Programming Approaches, Using Dynamic Programming, Calculate Binomial Coefficient, Optimization Problem, Chained Matrix Multiplication and Longest Common Subsequence Problems, Travelling Salesman Problem, Greedy Approach: Introduction to Greedy Approach, Components of Greedy Approach: Selection Procedure, Feasibility Check, and Solution Check, Minimum Spanning Tree Generation: Prim’s and Kruskal’s Algorithms, Dijkstra’s Algorithm for Single-Source Shortest Paths. Huffman Code, The Knapsack Problem (Greedy Approach vs Dynamic Programming): 0-1 Knapsack and 56SYLLABUS FOR LECTURER, COMPUTER ENGINEERING/ AUTOMATION/COMPUTER SCIENCE / APPLICATION/ INFORMATION TECHNOLOGY GOVERNMENT POLYTECHNICS 1. Algorithm and Problem-Solving Using C/C++ Introduction to Programs and Algorithms, Problem Solving Aspect (Algorithm Devising), Algorithm Design Aspect (Top-Down Design). Algorithm Implementation Essential and Desirable Features of An Algorithm, Basic Algorithms — Exchanging the Values of Two Variables. Counting. Summation of a Set of Numbers, Factorial. Computation. Sine Funetion Computation. Generation of the Fibonacci Sequence, Reversing the Digits of An Integer. Base Conversion, etc. Flowchart: Generating Prime Numbers, Computing Prime Factors of An Integer, Generation of Pseudo Random Numbers, Raising a Number to a Large Power, Computing the Nth Fibonacci Number. Problems on Arrays Handling: Array Order Reversal, Array Counting, Finding the Maximum Number in a Set. Removing Duplicate Elements from an Ordered Array, Partitioning, an Array. Merging, Sorting and Searching Program Design Using C/C++: Input-Output Processing, Data Types and Structure Data Type: Conirol Structure, Conditional Statements and Loops. Implementations of Arrays and Pointers/Linked List, Structure, Union, Enumeration and Files. 2. Digital Computer Design Number System and Data Representation Binary, Octal, Decimal and Hexa-Decimal Number Systems, Base Conversions, Binary Arithmetic, Complements: (R-L'S and R’S Complement, Subtraction Using Complements, Floating and Fixed-Point Representation, Binary Codes for Decimal Digits: BCD Code, Error Detection Code, ASCII, EBCDIC Codes, Boolean Algebra and. Logie Gates: Boolean Algebra-Basic Definitions. Huntington’S Postulate, Switching Algebra, Basic Theorems and Properties, Boolean Functions: Digital Logic Gates: Basic Gates - AND, OR, NOT, Universal Gates, Simplification of Boolean Functions: Karnaugh Maps Method: Two Variables K-Map. Three, Four and Five Variables K-maps, Product of Sum Simplification, ‘Combinational Logic: Design Procedure, Design of Half and Full Adder, Half and Full Subtractor, Code Conversion, Decoders, Encoder, Multiplexers, De-Multiplexer, ROM and PLA, Sequential Logic: Flip-Flops: RS Flip Flop, Clocked RS, JK Flip Flop, Master Slave JK FR, D Type FF, T ‘Type FF, Flip Flop Input Functions, FF, Characteristic Tables, Registers: Register With Parallel Load, Shift Registers, Bidirectional Shift Register With Parallel Load, Serial, Addition Using Shift Registers. 3. Discrete Mathematical Structure Basic Structures: Set, Multi-Set and Sequences, Type of Sets, Set Operations, Relation, Functions, ‘Types of Functions, Inverse of a Functions, Compositions of Functions, Function Representation, Sequences, Special Integer Sequences, Summations, Algebraic Structures: Groups, Rings, Vector Space and their Applications, Equivalence Relation and Partial Order Relation, Equivalence Classes and Partitions, Lattices and Topological Sorting, Logic, Reasoning and Inferences Foundations of Logic, Propositions. Conditional Statements, Bi-Conditionals, Truth Table, Precedence of Logical Operators, De Morgan's Laws, Quanti Predicates, Quantifiers, Universal Quantifiers, Variables, Logical Equivalences, Rules of Inferences, Valid Arguments, Proof Techniques, Counting: Simple and Complex Counting Problems, Inclusion-Exclusion Principle, Tree Diagrams, The Pigconhole Principle, Permutations, Combinations, Binomial Coefficients, Examples and Applications, Binomial Coefficients, Binomial, Generating Permutations and Combinations, Graphs: Graph Models and Terminologies, types of Graphs, 35