DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY LUCKNOW Evaluation Scheme & Syllabus For B.Tech. 3" Year Computer Science (Hindi) (Effective from the Session: 2023-24)B.TECH 3" Year COMPUTER SCIENCE (HINDI) (CURRICULUM STRUCTURE SEMESTER- V End Subject Periods x Subject Semester | rotat | Credit Codes L |T] PCT] TA | Total | PS | TE | PE T | KCSS01H | Database Management Sysiem | 3 ]1] 0] 30] 20 | 50 100 130 | 4 2 | KCSSOIT | Compiler Design 3 TT] 0 [30] 20] 30 T00 130 | 4 3 | Kessoan | Design and Analysis of 3 ]}1/ 0] 30] 20] so 100 150 | 4 Algorithm 4 Dept. | Departmental Elective-t 3 |o| 0} 30] 20] so 100 150 | 3 Blective-1 5 | Det | Departmental Elective-II 3 |0| 0] 30] 20] so 100 150 | 3 Elective-I 6 | Kcsssin | Database Management System | 9 | g | 25 2s| so] 1 Lab 7_[ KCSSSOH | Compiler Design Lab 0 [0] 2 5 2] 30] 7 Design and Analysis of 8 | KcS5s3H | Aisorithm Lab 0 jo|2 25 2} so} 1 9 | csssan | Mini Project or Internship alas i Pale Assessment Constitution of India, Law and 501H/ 10 | KNCSO1H/ | engineering /Indian Tradition, | 2 |0| 0 | 15 | 10 | 25 50 KNC502H Culture and Society ‘ MOOCS (Essential for Hons Degree) Total 773] 8 950 | 22 *The Mini Project or internship (4 weeks) conducted during summer break after IV semester and will be assessed during 'V semesterB.TECH. 3" Year COMPUTER SCIENCE (HINDI) FIFTH SEMESTER (DETAILED SYLLABUS) KCSS01H Database Management System ‘Course Outcome (CO) Bloom’s Knowledge Level (KL) At the end of course , the student will be able to: CO1__ | Apply knowledge of database for real life applications, KR CO2___| Apply query processing techniques to automate the real time problems of databases Ki, Ke CO3__| Ientify and solve the redundaney problem in database tables using normalization, ‘Understand the concepts of transactions, their processing so they will familiar with broad range CO4 | of database management issues including data integrity, security and recovery. COS _| Design, develop and implement a small database project using database tools Ka. Ke DETAILED SYLLABUS 310 Unit pie Proposed Lecture Introduction: Overview, Database System vs File System, Database System Concept and Architecture, Data Model Schema and Instances, Data Independence and Database Language and Interfaces, Data Definitions Language, DML, Overall Database Structure. Data Modeling Using the Entity Relationship Model: ER Model Concepts, Notation for ER Diagram, Mapping Constraints, Keys, Concepts of Super Key, Candidate Key, Primary Key, Generalization, Aggregation, Reduction of an ER Diagrams to Tables, Extended ER Model, Relationship of Higher Degree 08 Relational data Model and Language: Relational Data Model Concepts, Integrity Constraints, Entity Integrity, Referential Integrity, Keys Constraints, Domain Constraints, Relational Algebra, Relational Calculus, Tuple and Domain Calculus. Introduetion on SQL: Characteristics of SQL, I | Advantage of SQL. SQI Data Type and Literals. Types of SQL Commands. SQL Operators and Their Procedure. Tables, Views and Indexes. Queries and Sub Queries. Aggregate Functions, Insert, Update and Delete Operations, Joins, Unions, Intersection, Minus, Cursors, Triggers Procedures in SQL/PL SQL 08 Data Base Design & Normalization: Functional dependencies, normal forms, first, second, 8 third 111 | normal forms, BCNF, inelusion dependence, loss less join decompositions, normalization using FD, MVD, and JDs, alternative approaches to database design 08, ‘Transaction Processing Concept: Transaction System, Testing of Serializabilty, Serializability of Schedules, Conflict & View Serializable Schedule, Recoverability, Recovery from Transaction Failures, Log Based Recovery, Checkpoints, Deadlock Handling. Distributed Database: Distributed Data Storage, Concurrency Control, Directory System, IV 08 ‘Concurrency Control Techniques: Concurrency Control, Locking Techniques for Concurrency V__ | Control, Time Stamping Protocols for Concurrency Control, Validation Based Protocol, Multiple Granularity, Multi Version Schemes, Recovery with Concurrent Transaction, Case Study of Oracle. 08 Text books: 1. Korth, Silbertz, Sudarshan,” Database Concepts”, McGraw Hill Date C J, “An Introduction to Database Systems”, Addision Wesley Elmasri, Navathe, “ Fundamentals of Database Systems”, Addision Wi O'Neil, Databases, Elsevier Pub. RAMAKRISHNAN"Database Management Systems" McGraw Hill Leon & Leon,"Database Management Systems”, Vikas Publishing House Bipin C. Desai, “ An Introduction to Database Systems”, Gagotia Publications Majumdar & Bhattacharya, “Database Management System”, TMHKCS502H Compiler Design ‘Course Outcome (CO) Bloom's Knowledge Level (KL) At the end of course , the student will be able to: col ‘Acquire knowledge of different phases and passes of the compiler and also able to use the compiler tools like LEX, YACC, etc. Students will also be able to design different types of compiler tools to meet the requirements of the realistic constraints of compilers coz Understand the parser and its types ie. Top-Down and Bottom-up parsers and construction of LL, SLR, CLR, and LALR parsing table co3 Implement the compiler using syntax-directed translation method and get Knowledge about the synthesized and inherited attributes. co4 ‘Acquire knowledge about run time data structure like symbol table organization and different techniques used in that cos Understand the target machine's run time environment, its instruction set for code generation and techniques used for code optimization. DETAILED SYLLABUS 30-0 Unit Topic Proposed Lecture Introduction to Compiler: Phases and passes, Bootstrapping, Finite state machines and regular expressions and their applications to lexical analysis, Optimization of DFA-Based Pattern Matcher implementation of lexical analyzers, lexical-analyzer generator, LEX compiler, Formal grammars and their application to syntax analysis, BNF notation, ambiguity, YACC. The syntactic specification of programming languages: Context free grammars, derivation and parse trees, capabilities of CFG. 08 u Basic Parsing Techniques: Parsers, Shift reduce parsing, operator precedence parsing, top down parsing, predictive parsers Automatic Construction of efficient Parsers: LR parsers, the canonical Collection of LR(0) items, constructing SLR parsing tables, constructing Canonical LR parsing tables, Constructing LALR parsing tables, using ambiguous grammars, an automatic parser generator. implementation of LR parsing tables, 08. ‘Syntax-directed Translation: Syntax-directed Translation schemes, Implementation of Syntax- directed Translators, Intermediate code, postfix notation, Parse trees & syntax trees, three address code, quadruple & triples, translation of assignment statements, Boolean expressions, statements that alter the flow of control, postfix translation, translation with a top down parser. More about translation: Array references in arithmetic expressions, procedures call, declarations and case statements. 08 IV ‘Symbol Tables: Data structure for symbols tables, representing scope information. Run-Time Administration: Implementation of simple stack allocation scheme, storage allocation in block structured language. Error Detection & Recovery: Lexical Phase errors, syntactic phase errors semantic errors 08 Code Generation: Design Issues, the Target Language Addresses in the Target Code, Basic Blocks and Flow Graphs, Optimization of Basic Blocks, Code Generator. Code optimization: Machine-Independent Optimizations, Loop optimization, DAG representation of basie blocks, value numbers and algebraic laws, Global Data-Flow analysis 08 Text books: 1. K, Muneeswaran, Compiler Design, First Edition, Oxford University Press 2. J.P. Bennet, “Introduction to Compiler Techniques”, Second Edition, Tata McGraw-Hill, 2003. 3. Henk Alblas and Albert Nymeyer, “Practice and Principles of Compiler Building with C”, PHI, 2001 4, Aho, Sethi & Ullman, "Compilers: Principles, Techniques and Tools”, Pearson Education 5. V Raghvan, “ Principles of Compiler Design”, TMH 6. Kenneth Louden,” Compiler Construction”, Cengage Learning, 7. Charles Fischer and Ricard LeBlanc,” Crafting a Compiler with C”, Pearson EducationKCSS03H Design and Analysis of Algorithm ‘Course Outcome (CO) Bloom’s Knowledge Level (KL) At the end of course, the student will be able to: Design new algorithms, prove them correct, and analyze their asymptotic and absolute runtime | Ks, Ke CO! | and memory demands. Find an algorithm fo solve the problem (create) and prove that the algorithm solves the problem | Ks, Ke CO? | correctly (validate. Co3 _ | Understand the mathematical criterion for deciding whether an algorithm is efficient, and know | Ka, Ks ‘many practically important problems that do not admit any efficient algorithms. Co4 | Apply classical sorting, searching, optimization and graph algorithms. KK COs _ | Understand basic techniques Tor designing algorithms, including the techniques of recursion, | Ks divide-and-conquer, and greed) DETAILED SYLLABUS $10 Unit Topie Proposed Lecture Tniroduction: Algorithms, Analyzing Algorithms, Complexity of Algorithms, Growth of 1 | Functions, Performance Measurements, Sorting and Order Statistics - Shell Sort, Quick Sort, Merge | 08 Sort, Heap Sort, Comparison of Sorting Algorithms, Sorting in Linear Time. ‘Advanced Data Structures: Red-Black Trees, B — Trees, Binomvl Heaps, Fibonacci Heaps, | 9g M1 | tries, Skip List 7 Divide and Conquer with Examples Such as Sorting, Matrix Multiplication, Convex Hull and Searching tt | Greedy Methods with Examples Such as Optimal Reliability Allocation, Knapsack, Minimum | 08 Spanning Trees — Prim’s and Kruskal’s Algorithms, Single Source Shortest Paths - Dijkstra's and Bellman Ford Algorithms Dynamic Programming with Examples Such as Knapsack All Pair Shortest Paths ~ Warshal’s w {ad Floyd's Algorithms, Resource Allocation Problem. | 4g Backtracking, Branch and Bound with Examples Such as Travelling Salesman Problem, Graph Coloring, n-Queen Problem, Hamiltonian Cycles and Sum of Subsets. y _ | Selested Topies: Alzebraie Computation, Fast Fourier Transform, String Matching, Theowy OfNP- | gg Completeness, Approximation Algorithms and Randomized Algorith Text books: 1. Thomas H. Coreman, Charles E, Leiserson and Ronald L. Rivest, “Introduction to Algorithms”, Printice Hall of India. E, Horowitz & S Sahni, "Fundamentals of Computer Algorithms", Aho, Hoperatt, Ullman, “The Design and Analysis of Computer Algorithms” Pearson Education, 2008 LEE "Design & Analysis of Algorithms (POD)". McGraw Hill Richard E Neapolitan "Foundations of Algorithms" Jones & Bartlett Learning Jon Kleinberg and Eva Tardos, Algorithm Design, Pearson, 2005. Michael T Goodrich and Roberto Tamassia, Algorithm Design: Foundations, Analysis, and Internet Examples, Second Edition, Wiley, 2006. 8. Harry R. Lewis and Larry Denenberg, Data Structures and Their Algorithms, Harper Collins, 1997 9, Robert Sedgewick and Kevin Wayne, Algorithms, fourth edition, Addison Wesley, 2011 10. Harsh Bhasin,” Algorithm Design and Analysis” First Edition Oxford University Press, 11. Gilles Brassard and Paul Bratley.Algorithmies:Theory and Practice,Prentice Hall,1995KCS0S2H1 Web Designing ‘Course Outcome (CO) Bloom’s Knowledge Level (KL) ‘At the end of course , the student will be able to: Go 1 | Understand principle of Web page design and about types of websites Kk Coz | Wisualize and Recognize the basic concept of HTML and application in web designing KK Gos | Recognize and apply the elements of Creating Style Sheet (CSS). Kiki Goa | Understand the Basie concept of Tava Seript and is appheation Kak os | Introduce basics concept of Web Hosting and apply the concept of SEO Kak DETAILED SYLLABUS 3.0.0 Topie Proposed Lecture Tntroduetion : Basic principles involved in developing a web site, Planning process , Domains and Hosting, Responsive Web Designing , Types of Websites (Static and Dynamic Websites), Web 1 | Standards and W3C recommendations, 08 Introduction to HTML: What is HTML , HTML Documents, Basie structure of an HTML document, Creating an HTML document , Mark up Tags , Heading- Paragraphs , Line Breaks Elements of HTML? MIMD Tags, Working with Text , Working with Lists, Tables and Frames, 11 | Working with Hyprlins, mages and Milind, Working with eBand contol ua ing with Hyperlinks, Images a orking wit and controls ‘Concept of CSS: Creating Siyle Sheet, CSS Properties , CSS Siyling(Background, Text Format, Controlling Fonts) , Working with block elements and objects , Working with Lists and Tables . iy {ESS Id and Class, Box Model(ntroduction, Border properties, Padding Properties, Margin | gg properties) CSS Advanced(Grouping, Dimension, Display, Positioning, Floating. Align, Pseudo class, Navigation Bar, Image Sprites, Attribute sector) , CSS Color , Creating page Layout and Site Designs. Introduction to Client Side Scripting , Introduction to Java Script, Javascript Types , Variables In ty__| 48. Operators in JS , Conditions Statements, Java Seript Loops 18 Popup Boxes JS Events JS | gg Arrays, Working with Arrays, JS Objects JS Functions , Using Java Script in Real time , Validation of Forms, Related Examples Web Hosting: Web Hosting Basics , Types of Hosting Packages, Registering domains , Defining |_| Name Servers , Using Control Panel, Creating Emails in Cpanel , Using FTP Client, Maintaining a v 0s Website Concepts of SEO : Basis of SEO, Importance of SEO, Onpage Optimization Basies Text Books: 1. Steven M. Schafer, “HTML, XHTML, and CSS Bible, Sed”, Wiley India 2. Ian Pouncey, Richard York, “Beginning CSS: Cascading Style Sheets for Web Design’, Wiley IndiaKCS0S3H Computer Graphies ‘Course Outcome (CO) Bloom's Knowledge Level (KL) ‘At the end of course , the student will be able to: CO 1 _ | Understand the graphics hardware used in Tield of computer graphics. Coz _ | Understand the concept of graphies primitives such as Tines and circle Based on different |~K:.Ky algorithms. CO3 | Apply the 2D graphics transformations, composite transformation and Clipping concepts. Ki Co4 | APPIY the concepts of and techniques used in 3D computer graphies, including viewing transformations. CO 5 _ | Perform the concept of projections, curve and hidden surfaces in real life DETAILED SYLLABUS 3.0.0 Unit opie Proposed Lecture Introduction and Line Generation: Types of computer graphics, Graphic Displays- Random sean 1 | displays, Raster scan displays, Frame buffer and video controller, Points and lines, Line drawing | gg algorithms, Circle generating algorithms, Mid-point circle generating algorithm, and parallel version of these algorithms, ‘Transformations: Basic transformation, Matrix representations and homogenous coordinates, Composite transformations, Reflections and shearing, n {Wi dowing and Clipping: Viewing pipeline, Viewing transformations, 2-D Clipping algorithms- | 08 e clipping algorithms such as Cohen Sutherland line clipping algorithm, Liang Barsky algorithm, Line clipping against non rectangular clip windows, Polygon clipping - Sutherland Hodgeman polygon clipping, Weiler and Atherton polygon clipping, Curve clipping, Text clipping. ir _| Three Dimensional: 3-D Geometric Primitives, 3-D Object representation, 3-D Transformation, >- | 9g D viewing, projections, 3-D Clipping TV _| Curves and Surfaces: Quadric surfaces, Spheres, Ellipsoid, Blobby objects, Introductory concepts | 9g of Spline, Bspline and Bezier curves and surfaces, Hidden Lines and Surfaces: Back Face Detection algorithm, Depth buffer method, A- buffer y__| method, Scan line method, basic illumination models~ Ambient light, Diffuse reflection, Specular | 9g reflection and Phong model, Combined approach, War model, Intensity Attenuation, Color consideration, Transparency and Shadows. Text books: 1. Donald Hearn and M Pauline Baker, “Computer Graphies C Version”, Pearson Education 2. Foley, Vandam, Feiner, Hughes ~ “Computer Graphics principle”, Pearson Education 3. Rogers, “ Procedural Elements of Computer Graphics”, MeGraw Hill 4, W. M, Newman, R. F. Sproul! ~ “Principles of Interactive computer Graphics” ~ Tata MCGraw Hill 5. Amrendra N Sinha and Arun D Udai,” Computer Graphies”, Tata MCGraw Hill 6. RK. Maurya, “Computer Graphics ” Wiley Dreamtech Publication. 7. Mukherjee, Fundamentals of Computer graphics & Multimedia, PHI Learning Private Limited, 8. Donald Hearn and M Pauline Baker, “Computer Graphies with OpenGL”, Pearson education