Finite Automata: Languages: Alphabets, String, Language, Basic Operations on language, Concatenation, Kleene Star 04L
[1] : [chap. 2 p7-18] Regular Expressions, Finite Automata and Regular languages, Deterministic and Nondeterministic Finite Automata 10L
[1] : [chap. 4 p31-48], [Ch. 5p52-71], [Ch. 7 p135-141], [Ch. 9 p169-185] Pumping Lemma, Closure properties of Regular Languages 06L
[1] : [chap.. 10 (pumping lemma) p190-195]
[3]: [§4.2 p122-135]
Context Free languages: Context free grammars, Parse Trees, Ambiguities in grammars and languages, Pushdown automata 10L
[1]: [chap.. 12 p224-254][ Ch. 14 p289-311]
Chomsky’s Normal Form, Pumping Lemma, Properties of Context free languages. 06L
[1]: [chap.. 13(CNF only) p278-282][ Ch. 16 p351-364]
[3]: [§7.3 p264-273]
Computability: Turing Machines: Turing machine as a model of Computation 06L
[2]:[ §4.1 p179-190,§4.2 p194-200] Universal Turing machine, Language Acceptability, Decidability, Halting Problem. 06L
[2]:[ §5.2 , §5.3, §5.4 p247-256]
FOUR YEAR UNDERGRADUATE PROGRAMME IN COMPUTER SCIENCE
51
Reading Recommended Material
Text Books 1. Daniel I.A.Cohen, Introduction to Computer Theory, Second edition, John Wiley,1997.
Month: October 2017
Microprocessors
Microprocessor architecture: 2 L Internal architecture, Programming model [1] Article 2.1 Page 51 to 58
Memory Addressing: 6L Real mode and protected mode operation, Program invisible register [1] Article 2.2-2.3 Page 58 to 68
Addressing modes: 5 L Data addressing modes, Program memory addressing modes and Stack memory addressing modes [1] Article 3.1-3.3 Page 78 to 105
Microprocessor programming: 8L Machine language, Instruction formats, String data transfer instructions, Program control instructions, Assembly language programming [1] Article 4.1-4.5, 6.1-6.3 Page 112 to 142, 192 to 212
8088/8086 Hardware Specifications : 6L Pin-outs and pin functions, Clock generator, Bus buffering and latching, bus timing [1] Article 9.1-9.5 Page 302 to 322
Memory Interfacing: 6L Memory address decoding, 8-bit and 16-bit memory interfacing. [1] Article 10.2-10.4 Page 340 to 363
I/O interfacing: 7L Introduction to I/O interface, address decoding, Programmable Peripheral Interface, Timer [1] Article 11.1 (Up to page 380), 11.2, 11.3, 11.4 Page 377 to 379, 387-398, 414- 420, 423-428
Interrupts & Direct Memory Access 8L Interrupt controller, DMA controller [1]Article 12.1- 12.2, 13.1-13.2 (Up to page 516) Page 451 to 465, 490 to 506
Recommended Reading Material
Text Books 1. Barry B. Brey, The Intel Microprocessors : Architecture, Programming and Interfacing. 8th edition, Pearson Education, 2009
(8th Edition) Barry B. Brey-The Intel Microprocessors-Prentice Hall (2008)(1)
Some content on this page was disabled on July 16, 2020 as a result of a DMCA takedown notice from Pao Lopez. You can learn more about the DMCA here:
Probability Theory and Statistical Computing
Introduction to the notion of probability, Random experiment, Sample space & Events, Probability defined on events, Algebra of events, Conditional probabilities,
Independent events, Bayes’ theorem. 5L [1]: [chap 1: 1.1 – 1.6]
Random Variables, cumulative distribution functions, probability mass/density functions, Discrete Random Variables (Binomial, Poisson and Geometric). 4L [1]: [chap 2: 2.1, 2.2]
Continuous Random Variables (Normal, Exponential, Uniform and Gamma). 2L [1]: [chap 2: 2.3]
Expectation of a Random Variable (Discrete & Continuous cases). Expectation of Function of a Random Variable. Variance of a Random Variable. 2L [1]: [chap 2: 2.4]
Jointly distributed Random Variables, Joint distribution functions, Independent Random Variables, Co-variance of Random Variables. Joint probability Distribution of Function of Random Variables, Moment Generating Functions. 8 L [1]: [chap 2: 2.5, 2.6]
Introduction to Conditional Probability – Discrete and Continuous, Conditional Expectation, Matching Rounds Problem, Quicksort 5L [1]: [chap 3: 3.1 – 3.4 upto pg117]
Conditional Variance, Variance in Matching Rounds Problem, Best Prize Problem 2L [1]: [chap 3: 3.4.1, 3.5]
Some more Applications: List Model, Random Graphs, Left Skip free random walks 4L [1]: [chap 3: 3.6.1, 3.6.2, 3.6.6]
Limits and bounds : Markov inequality, Chebyshev’s inequality, Chernoff’s bound, Central Limit Theorem, Strong Law of Large Numbers. 3L [1]: [chap 2: 2.8]
Markov Chains: Introduction to stochastic processes, Chapman–Kolmogrov equations, classification of states, Limiting and Stationery probabilities. 7L [1]: [chap 4: 4.1-4.5.2]
Statistical Analysis: Simple Linear Regression Model, Linear Probabilistic Model, Estimating Model Parameters, Sample Correlation Coefficient, Inferences about the Population Correlation Coefficient. 6L [2]: [chap 12: 12.1, 12.2, 12.5]
Recommended Reading Material
Text Books
1. Sheldon Ross, Introduction to Probability Models, Tenth Edition, Academic Press/Elsevier, 2012.
introduction-to-probability-model-S.Ross-math-
2. Jay L. Devore, Probability and Statistics for Engineering and the Sciences, Eighth Edition, Cengage Learning,2012
Design and Analysis of Algorithms
Iterative Techniques: 8L Sequential search, insertion sort, bubble sort, selection sort, merging two sorted arrays, correctness and analysis. [1]: [chap 3: 3.5 up to 3.5.3]: [2]: [chap 2: Sec. 2.1 up to p20, p24-p28, p31-p33]:
Divide and Conquer: 8L Binary search, Merge sort, quick sort, Heap sort, correctness and analysis. [1]: [chap 3: 3.5.7]: [2]: [chap 2 :p34-p37, chap 6: 6.1-6.4, chap 7: 7.1-7.4]:
Dynamic Programming and Greedy algorithms: 8L Fractional knapsack problem, 0-1 knapsack problem, activity selection problem, rod cutting, longest common subsequence. [2]: [chap 15: 15.1, 15.4, ch16: 16.1, 16.2]:
Linear time Sorting and Searching techniques: 6L Count sort, radix sort, bucket sort, finding minimum and maximum, order statistic in expected linear time, their analysis. [2]: [chap 8: 8.2-8.4, ch9: 9.1,9.2]:
String Matching: 4L Brute force method, KMP Algorithm: computing fail links, analysis. [1]: [chap 11: 11.1-11.3]:
Height Balanced Trees: 4L Red Black Trees: rotation, insertion, deletion, analysis of operations [2]: [chap 13: 13.1-13.4]:
Graph Traversal Algorithms: 6L Representation of graphs, breadth first search, depth first search, analysis of traversal methods, applications. [2]: [chap 22: 22.1-22.5]:
Minimum Spanning Tree and shortest path: 4L
Prim’s algorithms, Kruskal’s algorithm, Dijkstra’s algorithm, analysis of these algorithms. [2]: [chap 23: 23.1,23.2, ch24: 24.3]:
Recommended Reading Material
Text Books 1. Sara Baase, Computer Algorithms:Introduction to design and analysis, Third Edition, Pearson,2002.
2. T.H.Cormen, C.E. Leiserson, R.L.Rivest, C.Stein, Introduction to Algorithms, Third Edition, Prentice Hall of India, 2010.
Different Book
Some content on this page was disabled on July 16, 2020 as a result of a DMCA takedown notice from Pao Lopez. You can learn more about the DMCA here:
Database Systems
Introduction: Database concepts, characteristics of database approach, data models, data independence, database users, and database system architecture. 5L
[1]: [1.1 to 1.8, 2.1 to 2.6]
Relational Data Model: Relational model concepts, relational database constraints. 6L
[1]: [3.1 to 3.4] The Relational Algebra and Relational Calculus 6L
[1]: [6.1 to 6.5]
SQL Programming: 8L Data Definition Language, Data Manipulation Language, basics of SQL, query designing in SQL using aggregate functions and nested queries.
[1]: [4.1 to 4.5]
Entity Relationship (ER) Modeling: Entity types, entity set, attribute and key, relationships, relation types, entity relationship, ER modeling, ER diagrams, database design using ER diagrams. 5L
[1]: [7.1 to 7.7]: Enhanced Entity-Relationship (EER) model. 5L
[1]: [8.1 to 8.5]
Database Design: Relational database design by ER and EER-to-Relational Mapping. 3L
[1]: [9.1 to 9.2] Functional dependencies, Normal forms. 8L
[1]: [15.1 to 15.7]
Transaction Processing: 2L Introduction to Transaction Processing Concepts and Theory.
[1]: [21.1 to 21.3]
Recommended Reading Material
Text Books 1. R. Elmasri, S.B. Navathe, Fundamentals of Database Systems, 6th edition, Pearson Education, 2010
Some content on this page was disabled on July 16, 2020 as a result of a DMCA takedown notice from Pao Lopez. You can learn more about the DMCA here:
Data Structures
Single and Multidimensional arrays, Sequential Allocation, Address Calculations, Sparse matrices and their efficient representation. 6L [2]: [chap 7: 7.1, 7.3,7.4.1, 7.4.2 up to Pg 256, 7.4.3 (up to pg. 261)]
Recursion, Application of stacks to recursion problems. 5L [1]: [chap 5: 5.1 to 5.9]
Singly & Double Linked Lists, Operations on all these structures and applications of these structures. 6L [1]: [chap 3: 3.1, 3.2]
Circular Linked Lists , Self Organizing Lists 4L [1]: [chap 3: 3.3, 3.5]
Stacks, Applications of stacks eg.: Infix to Postfix. Queues, Overview of priority queue 6L [1]: [chap 4: 4.1 to 4.3]
Trees, Binary Trees, Complete Binary trees and almost complete Binary trees, BST, Tree traversal algorithms, Searching in Binary Search Tree. Introduction to Threaded Trees. 5L [1]: [chap 6: 6.1 to 6.4.3 upto pg 235]
BST Insertion & Deletion 3L [1]: [chap 6: 6.5(pg 241-242), 6.6 (pg 244-250)]
Sorting Techniques (without efficiency): Bubble Sort, Selection Sort, Insertion Sort. 4L [3]: [chap 6: 6.2(pg 339-341), 6.3(pg 352-353), 6.4(upto pg 365)]
Searching Techniques (without efficiency): Linear search, Binary search, Hashing with Collision handling methods. 5L [3]: [chap 7: 7.1(pg 384-390, 394-396), Ref. [1]: [ch10: 10.1 to 10.3 (pg 525-538) ]
Multiway trees – B-Tree, B+ Tree. 4L [1]: [chap 7 : (pg 301-316) ]
FOUR YEAR UNDERGRADUATE PROGRAMME IN COMPUTER SCIENCE
25
Recommended Reading Material
Text Books
1. Adam Drozdek, Data Structures and algorithm in C++, Third Edition, Cengage Learning, 2012.
2. Sartaj Sahni, Data Structures, Algorithms and applications in C++, Second Edition, Universities Press, 2011.
D.S Malik, Data Structure using C++, Second edition, Cengage Learning, 2010.
Data Structures, Algorithms and Applications in C++
Data_Structure_And_Algorithms_In_C++2nd.ed-Adam.Drozdek
Data_Structures_Using_CPP_DS_Malik_2nd
AdamDrozdek__DataStructures_and_Algorithms_in_C_4Ed
Some content on this page was disabled on March 7, 2018 as a result of a DMCA takedown notice from Cengage Learning. You can learn more about the DMCA here:
https://wordpress.com/support/copyright-and-the-dmca/
Some content on this page was disabled on December 7, 2018 as a result of a DMCA takedown notice from Cengage Learning. You can learn more about the DMCA here:
Linear Algebra for Computer Science
Determinants 3L Determinants, Cofactors, Evaluation and properties of determinants [1]: [chap 4: 4.1 – 4.4]
Matrices & System of Linear Equations 10 L Introduction, Matrix Algebra, Transpose of a Matrix, Elementary row operations on a Matrix, Echelon form of a Matrix, Rank of a Matrix, Inverse of a matrix, Solution of System of Homogeneous & Non-Homogeneous Equations: Gauss elimination, Cramer’s rule. Numerical Methods: Gauss Jordan, Jacobi and Gauss Sidel Methods. [1]: [chap 1: 1.1 – 1.6, ch2: 2.2] [2]: [chap 1: 1.2, 1.6]
Vector Spaces 7L Definition of a Vector Space, Sub-spaces, Linear Combinations, Linear Span, Convex Sets, Linear Independence/Dependence, Basis & Dimension, Application to Graphs and Networks [1]: [chap 2: 2.1, 2.3, 2.4, 2.5] [2]: [chap 2: 2.1-2.6]
Linear Transformation 7 L Linear transformation on finite dimensional vector spaces, Kernel & Image of a Linear transformation, Matrix and coordinates of a Linear transformation with respect to an ordered basis, Similar matrices. [1]: [chap 2: 2.6]
[2]: [chap 3.1-3.4, 3.7]
Inner Product Spaces 6 L Inner Product, Definition& examples, Parallelogram Law, Schwarz Inequality, Gram-Schmidt Orthogonalization Process, Orthonormal Basis [1]: [chap 3: 3.1 – 3.4] [2]: [chap 8: 8.1, 8.2]]
Eigen Values & Eigen Vectors of linear transformations and matrices 7L Definition of Eigen Value and Eigen Vector, Characteristic Polynomial, Eigen spaces, Diagonalization, Cayley Hamilton Theorem, Applications to Markov Matrices and Economic Models. [1]: [chap 5: 5.1 – 5.3] [2]: [chap 6: 6.1, 6.2]]
Positive Definite Matrices 3L Positive Definite Matrices, Singular Value Decomposition. [1]: [chap 6: 6.1 – 6.3]
Applications to Linear Programming 5L LU Factorization, Linear Inequalities, Feasible Set and the cost function, Graphical Method, Simplex Method -. [1]: [chap 8: 8.1, 8.2]
Recommended Reading Material
Text Books 1. Gilbert Strang, Wellesey, Introduction to Linear Algebra, Fourth Edition, , Cambridge Press/Cengage Learning,2009
2. K Hoffman& R Kunze, Linear Algebra 2/e, PHI, 2000
649cec743021c1819241d75d6ba4e0bc
Introduction to Linear Algebra, 4th edition–Gilbert Strang 清晰扫æ版
Some content on this page was disabled on March 9, 2018 as a result of a DMCA takedown notice from Siam Books. You can learn more about the DMCA here:
Computer Systems Architecture
Digital Logic Gates: Boolean algebra, Logic Gates [1] (Pages 1-12)
Digital Circuits: Flip-flops and counters, Combinational circuits, Decoders, Multiplexers, Flip-flops, Sequential circuits. [1] Pages ( 2.2, 2.3,.43-50)
Basic Computer Organization and Design: Computer registers, Common bus system, Instruction set, Control and Timing, Instruction cycle, Instruction formats and Types of instructions, Interrupt cycle. [1] Pages(.125-158)
Micro programmed Organization: Micro programmed control, Instruction formats, Arithmetic and logical micro-operations [1] Pages ( 215-232)
Central Processing Unit: Register organization, , Stack organization, Instruction format, Addressing modes. [1] Pages (243-268)
Memory Organization: Random Access Memory, ROM, EPROM, Associative memory, Cache memory. [1] [1] Pages (447-471)
Input-output Organization: Input / Output: External Devices, I/O Modules, Programmed I/O, Interrupt-Driven I/O, Direct Memory Access, I/O Channels. [2] Pages(.202- 216,221- 227, .227-229).
Recommended Reading Material
Text Books: 1. M. M. Mano, Computer System Architecture, 3rd Edition, Prentice Hall of India, 2008. 2. W. Stallings, Computer Organization and Architecture- Designing for Performance, 7th Edition, Pearson Education/PHI, Inc., 2008
Logic_and_Computer_Design_Fundamentals_-_4th_International_Edition
computer-system-architecture-3rd-ed-morris-mano-p98
computer-system-architecture mano
Some content on this page was disabled on July 16, 2020 as a result of a DMCA takedown notice from Pao Lopez. You can learn more about the DMCA here:
https://wordpress.com/support/copyright-and-the-dmca/
Some content on this page was disabled on July 16, 2020 as a result of a DMCA takedown notice from Pao Lopez. You can learn more about the DMCA here:
Design and Analysis of Algorith
Iterative Techniques: Sequential search, insertion sort, bubble sort, selection sort, merging two sorted arrays, correctness and analysis.
Divide and Conquer: Binary search, Merge sort, quick sort, Heap sort, correctness and analysis.
Dynamic Programming and Greedy algorithms: Fractional knapsack problem, 0-1 knapsack problem, activity selection problem, rod cutting, longest common subsequence.
Linear time Sorting and Searching techniques: Count sort, radix sort, bucket sort, finding minimum and maximum, order statistic in expected linear time, their analysis.
String Matching: Brute force method, KMP Algorithm: computing fail links, analysis.
Height Balanced Trees: Red Black Trees: rotation, insertion, deletion, analysis of operations.
Graph Traversal Algorithms: Representation of graphs, breadth first search, depth first search, analysis of traversal methods, applications.
Minimum Spanning Tree and shortest path:
Prim’s algorithms, Kruskal’s algorithm, Dijkstra’s algorithm, analysis of these algorithms.
Recommended Reading Material
Text Books 1. T.H.Cormen, C.E. Leiserson, R.L.Rivest, C.Stein, Introduction to Algorithms, Third Edition, Prentice Hall of India,
Introduction to Algorithms – 3rd Edition
Solution – http://sites.math.rutgers.edu/~ajl213/CLRS/CLRS.html
Operating Systems
Introduction: Operating Systems functions, Types of operating systems, Multiprogramming systems, Batch systems, Time-sharing systems, Operating system operations, Special purpose operating systems, Distributed systems, Different computing environments.
Operating System Organization: Processor and user modes, user operating system interface, Kernels, System calls and its types, System programs, Operating system structures, Virtual machines.
Process Management: Process states, Process Scheduling, Process hierarchy, Threads, Threading issues, Multithreading models, Non-pre-emptive and pre-emptive scheduling algorithms, Concurrent processes, Critical section, Semaphores, methods for inter-process communication, Deadlocks.
Memory Management: Physical and virtual address space, Memory allocation strategies, Paging, Segmentation, Virtual memory and Demand paging, Page replacement algorithms.
File and I/O Management: Directory structure, File operations, Files system mounting, File allocation methods, Device management, Disk scheduling algorithms.
Protection and Security: Policy mechanism, Program, network and system threats, Authentication.
Recommended Reading Material
Text Books . A Silberschatz, P.B. Galvin, G. Gagne, Operating Systems Concepts, 7th edition, John Wiley Publications ,2008.
incarnation 
