B.

TECH 3rd Year

COMPUTER SCIENCE (HINDI)

CURRICULUM STRUCTURE

SEMESTER- V

End
Sl. Subject Periods Evaluation Scheme
Subject Semester Total Credit
No.
Codes L T P CT TA Total PS TE PE

1 KCS501H Database Management System 3 1 0 30 20 50 100 150 4

2 KCS502H Compiler Design 3 1 0 30 20 50 100 150 4

Design and Analysis of

3 KCS503H 3 1 0 30 20 50 100 150 4
Algorithm

Dept.
4 Departmental Elective-I 3 0 0 30 20 50 100 150 3
Elective-I

Dept.
5 Departmental Elective-II 3 0 0 30 20 50 100 150 3
Elective-II

Database Management System

6 KCS551H 0 0 2 25 25 50 1
Lab

7 KCS552H Compiler Design Lab 0 0 2 25 25 50 1

Design and Analysis of

8 KCS553H 0 0 2 25 25 50 1
Algorithm Lab

Mini Project or Internship

9 KCS554H 0 0 2 50 50 1
Assessment*

Constitution of India. Law and

KNC501H/
10 Engineering / Indian Tradition, 2 0 0 15 10 25 50
KNC502H
Culture and Society

MOOCs (Essential for Hons.

11
Degree)

Total 17 3 8 950 22

*The Mini Project or internship (4 weeks) conducted during summer break after IV semester and will be assessed during
V semester.
KCS503H 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 K 4, K 6
CO 1
and memory demands.
Find an algorithm to solve the problem (create) and prove that the algorithm solves the problem K 5, K 6
CO 2
correctly (validate).
Understand the mathematical criterion for deciding whether an algorithm is efficient, and know K 2, K 5
CO 3
many practically important problems that do not admit any efficient algorithms.
CO 4 Apply classical sorting, searching, optimization and graph algorithms. K 2, K 4

Understand basic techniques for designing algorithms, including the techniques of recursion, K 2, K 3
CO 5
divide-and-conquer, and greedy.
DETAILED SYLLABUS 3-1-0
Unit Topic Proposed
Lecture
Introduction: Algorithms, Analyzing Algorithms, Complexity of Algorithms, Growth of
I 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, Binomial Heaps, Fibonacci Heaps,
II 08
Tries, Skip List
Divide and Conquer with Examples Such as Sorting, Matrix Multiplication, Convex Hull and
Searching.
III 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
and Floyd’s Algorithms, Resource Allocation Problem.
IV 08
Backtracking, Branch and Bound with Examples Such as Travelling Salesman Problem, Graph
Coloring, n-Queen Problem, Hamiltonian Cycles and Sum of Subsets.
Selected Topics: Algebraic Computation, Fast Fourier Transform, String Matching, Theory of NP-
V 08
Completeness, Approximation Algorithms and Randomized Algorithms
Text books:
1. Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, “Introduction to Algorithms”, Printice Hall of
India.
2. E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms",
3. Aho, Hopcraft, Ullman, “The Design and Analysis of Computer Algorithms” Pearson Education, 2008.
4. LEE "Design & Analysis of Algorithms (POD)",McGraw Hill
5. Richard E.Neapolitan "Foundations of Algorithms" Jones & Bartlett Learning
6. Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson, 2005.
7. 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,Algorithmics:Theory and Practice,Prentice Hall,1995.
 B.TECH. 3rd Year
COMPUTER SCIENCE (HINDI)
FIFTH SEMESTER (DETAILED SYLLABUS)
KCS501H Database Management System
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to:
CO 1 Apply knowledge of database for real life applications. K3
CO 2 Apply query processing techniques to automate the real time problems of databases. K 3, K 4
CO 3 Identify and solve the redundancy problem in database tables using normalization. K 2, K 3
Understand the concepts of transactions, their processing so they will familiar with broad range K 2, K 4
CO 4
of database management issues including data integrity, security and recovery.
CO 5 Design, develop and implement a small database project using database tools. K 3, K 6
DETAILED SYLLABUS 3-1-0
Unit Topic 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
I 08
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.
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. Introduction on SQL: Characteristics of SQL,
II Advantage of SQL. SQl Data Type and Literals. Types of SQL Commands. SQL Operators and 08
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
Data Base Design & Normalization: Functional dependencies, normal forms, first, second, 8 third
III normal forms, BCNF, inclusion dependence, loss less join decompositions, normalization using 08
FD, MVD, and JDs, alternative approaches to database design
Transaction Processing Concept: Transaction System, Testing of Serializability, Serializability of
Schedules, Conflict & View Serializable Schedule, Recoverability, Recovery from Transaction
IV 08
Failures, Log Based Recovery, Checkpoints, Deadlock Handling. Distributed Database: Distributed
Data Storage, Concurrency Control, Directory System.
Concurrency Control Techniques: Concurrency Control, Locking Techniques for Concurrency
V Control, Time Stamping Protocols for Concurrency Control, Validation Based Protocol, Multiple 08
Granularity, Multi Version Schemes, Recovery with Concurrent Transaction, Case Study of Oracle.
Text books:
1. Korth, Silbertz, Sudarshan,” Database Concepts”, McGraw Hill
2. Date C J, “An Introduction to Database Systems”, Addision Wesley
3. Elmasri, Navathe, “ Fundamentals of Database Systems”, Addision Wesley
4. O’Neil, Databases, Elsevier Pub.
5. RAMAKRISHNAN"Database Management Systems",McGraw Hill
6. Leon & Leon,”Database Management Systems”, Vikas Publishing House
7. Bipin C. Desai, “ An Introduction to Database Systems”, Gagotia Publications
8. 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:
Acquire knowledge of different phases and passes of the compiler and also able to use the K 3, K 6
CO 1 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.
Understand the parser and its types i.e. Top-Down and Bottom-up parsers and construction of K 2, K 6
CO 2
LL, SLR, CLR, and LALR parsing table.
Implement the compiler using syntax-directed translation method and get knowledge about the K 4, K 5
CO 3
synthesized and inherited attributes.
Acquire knowledge about run time data structure like symbol table organization and different K 2, K 3
CO 4
techniques used in that.
Understand the target machine’s run time environment, its instruction set for code generation K 2, K 4
CO 5
and techniques used for code optimization.
DETAILED SYLLABUS 3-0-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 Matchers
I implementation of lexical analyzers, lexical-analyzer generator, LEX compiler, Formal grammars
08
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.
Basic Parsing Techniques: Parsers, Shift reduce parsing, operator precedence parsing, top down
parsing, predictive parsers Automatic Construction of efficient Parsers: LR parsers, the canonical
II 08
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.
Syntax-directed Translation: Syntax-directed Translation schemes, Implementation of Syntax-
directed Translators, Intermediate code, postfix notation, Parse trees & syntax trees, three address
III code, quadruple & triples, translation of assignment statements, Boolean expressions, statements
08
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.
Symbol Tables: Data structure for symbols tables, representing scope information. Run-Time
IV Administration: Implementation of simple stack allocation scheme, storage allocation in block
08
structured language. Error Detection & Recovery: Lexical Phase errors, syntactic phase errors
semantic errors.
Code Generation: Design Issues, the Target Language. Addresses in the Target Code, Basic
V Blocks and Flow Graphs, Optimization of Basic Blocks, Code Generator. Code optimization:
08
Machine-Independent Optimizations, Loop optimization, DAG representation of basic blocks,
value numbers and algebraic laws, Global Data-Flow analysis.
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
KCS056H Application of Soft Computing
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to :

CO 1 Recognize the feasibility of applying a soft computing methodology for a particular problem K 2, K 4

Understand the concepts and techniques of soft computing and foster their abilities in designing K2,K4, K6
CO 2
and implementing soft computing based solutions for real-world and engineering problems.
Apply neural networks to pattern classification and regression problems and compare K 3, K 5
CO 3
solutions by various soft computing approaches for a given problem.
CO 4 Apply fuzzy logic and reasoning to handle uncertainty and solve engineering problems K 3, K 4

CO 5 Apply genetic algorithms to combinatorial optimization problems K3, K5

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed
Lecture
Neural Networks-I (Introduction & Architecture) : Neuron, Nerve structure and synapse,
I Artificial Neuron and its model, activation functions, Neural network architecture: single layer and 08
multilayer feed forward networks, recurrent networks. Various learning techniques; perception and
convergence rule, Auto-associative and hetro-associative memory.
Neural Networks-II (Back propagation networks): Architecture: perceptron model, solution,
II single layer artificial neural network, multilayer perception model; back propagation learning 08
methods, effect of learning rule co-efficient ;back propagation algorithm, factors affecting
backpropagation training, applications.
Fuzzy Logic-I (Introduction): Basic concepts of fuzzy logic, Fuzzy sets and Crisp sets, Fuzzy set
III 08
theory and operations, Properties of fuzzy sets, Fuzzy and Crisp relations, Fuzzy to Crisp
conversion.
Fuzzy Logic –II (Fuzzy Membership, Rules) : Membership functions, interference in fuzzy logic,
IV 08
fuzzy if-then rules, Fuzzy implications and Fuzzy algorithms, Fuzzyfications & Defuzzificataions,
Fuzzy Controller, Industrial applications
Genetic Algorithm(GA): Basic concepts, working principle, procedures of GA, flow chart of GA,
V 08
Genetic representations, (encoding) Initialization and selection, Genetic operators, Mutation,
Generational Cycle, applications.
Text books:

1. S. Rajsekaran & G.A. Vijayalakshmi Pai, “Neural Networks,Fuzzy Logic and Genetic Algorithm:Synthesis and

Applications” Prentice Hall of India.

2. N.P.Padhy,”Artificial Intelligence and Intelligent Systems” Oxford University Press. Reference Books:

3. Siman Haykin,”Neural Networks”Prentice Hall of India

4. Saroj Kaushik, Sunita Tiwari, “Soft Computing: Fundamentals, Techniques and Applications”, McGraw Hill
Education

5. Timothy J. Ross, “Fuzzy Logic with Engineering Applications” Wiley India.

6. Kumar Satish, “Neural Networks” Tata Mc Graw Hill

KCS054H Object Oriented System Design
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to:
CO 1 Understand the application development and analyze the insights of object oriented K 2, K 4
programming to implement application
CO 2 Understand, analyze and apply the role of overall modeling concepts (i.e. System, structural) K 2, K 3
CO 3 Understand, analyze and apply oops concepts (i.e. abstraction, inheritance) K 2, K3, K4
CO 4 Understand the basic concepts of C++ to implement the object oriented concepts K 2, K 3

CO 5 To understand the object oriented approach to implement real world problem. K 2, K 3

DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
Introduction: The meaning of Object Orientation, object identity, Encapsulation, information
I hiding, polymorphism, generosity, importance of modelling, principles of modelling, object oriented 08
modelling, Introduction to UML, conceptual model of the UML, Architecture.
Basic Structural Modeling: Classes, Relationships, common Mechanisms, and diagrams. Class
&Object Diagrams: Terms, concepts, modelling techniques for Class & Object Diagrams.
Collaboration Diagrams: Terms, Concepts, depicting a message, polymorphism in collaboration
Diagrams, iterated messages, use of self in messages. Sequence Diagrams: Terms, concepts,
II depicting asynchronous messages with/without priority, call-back mechanism, broadcast messages. 08
Basic Behavioural Modeling: Use cases, Use case Diagrams, Activity Diagrams, State Machine ,
Process and thread, Event and signals, Time diagram, interaction diagram, Package diagram.
Architectural Modeling: Component, Deployment, Component diagrams and Deployment
diagrams.
Object Oriented Analysis: Object oriented design, Object design, Combining three models, Designing
algorithms, design optimization, Implementation of control, Adjustment of inheritance, Object
representation, Physical packaging, Documenting design considerations.
Structured analysis and structured design (SA/SD), Jackson Structured Development
III (JSD).Mapping object oriented concepts using non-object oriented language, Translating classes into 08
data structures, Passing arguments to methods, Implementing inheritance, associations encapsulation.
Object oriented programming style: reusability, extensibility, robustness, programming in the
large. Procedural v/s OOP, Object oriented language features. Abstraction and Encapsulation.
C++ Basics : Overview, Program structure, namespace, identifiers, variables, constants, enum,
operators, typecasting, control structures
IV C++ Functions : Simple functions, Call and Return by reference, Inline functions, Macro Vs. Inline 08
functions, Overloading of functions, default arguments, friend functions, virtual functions
Objects and Classes : Basics of object and class in C++, Private and public members, static data
and function members, constructors and their types, destructors, operator overloading, type
conversion. Inheritance : Concept of Inheritance, types of inheritance: single, multiple, multilevel,
V 08
hierarchical, hybrid, protected members, overriding, virtual base class
Polymorphism : Pointers in C++, Pointes and Objects, this pointer, virtual and pure virtual
functions, Implementing polymorphism
Text Books
1. James Rumbaugh et. al, “Object Oriented Modeling and Design”, PHI
2. Grady Booch, James Rumbaugh, Ivar Jacobson, “The Unified Modeling Language User Guide”, Pearson
Education
3. Object Oriented Programming With C++, E Balagurusamy, TMH
4. C++ Programming, Black Book, Steven Holzner, dreamtech
5. Object Oriented Programming in Turbo C++, Robert Lafore, Galgotia
6. Object Oriented Programming with ANSI and Turbo C++, Ashok Kamthane, Pearson
7. The Compete Reference C++, Herbert Schlitz, TMH
 INDIAN TRADITIONS, CULTURAL AND SOCIETY
L: T:P: 2: 0:0

Module 1- Society State and Polity in India

State in Ancient India: Evolutionary Theory, Force Theory, Mystical Theory Contract Theory,
Stages of State Formation in Ancient India, Kingship , Council of Ministers Administration
Political Ideals in Ancient India Conditions’ of the Welfare of Societies, The Seven Limbs of the
State, Society in Ancient India, Purusārtha, Varnāshrama System, Āshrama or the Stages of Life,
Marriage, Understanding Gender as a social category, The representation of Women in Historical
traditions, Challenges faced by Women. Four-class Classification, Slavery.

Module 2- Indian Literature, Culture, Tradition, and Practices

Evolution of script and languages in India: Harappan Script and Brahmi Script. The Vedas, the
Upanishads, the Ramayana and the Mahabharata, Puranas, Buddhist And Jain Literature in
Pali,Prakrit And Sanskrit, Kautilya’s Arthashastra, Famous Sanskrit Authors, Telugu Literature,
Kannada Literature,Malayalam Literature ,Sangama Literature Northern Indian Languages &
Literature, Persian And Urdu ,Hindi Literature

Module 3- Indian Religion, Philosophy, and Practices

Pre-Vedic and Vedic Religion, Buddhism, Jainism, Six System Indian Philosophy,
Shankaracharya, Various Philosophical Doctrines , Other Heterodox Sects, Bhakti Movement,
Sufi movement, Socio religious reform movement of 19th century, Modern religious practices.

Module 4-Science, Management and Indian Knowledge System

Astronomy in India, Chemistry in India, Mathematics in India, Physics in India, Agriculture in

India, Medicine in India ,Metallurgy in India, Geography, Biology, Harappan Technologies,
Water Management in India, Textile Technology in India ,Writing Technology in India
Pyrotechnics in India Trade in Ancient India/,India’s Dominance up to Pre-colonial Times

Module 5- Cultural Heritage and Performing Arts

Indian Architect, Engineering and Architecture in Ancient India, Sculptures, Seals, coins,
Pottery, Puppetry, Dance, Music, Theatre, drama, Painting, Martial Arts Traditions, Fairs and
Festivals, Current developments in Arts and Cultural, Indian’s Cultural Contribution to the
World. Indian Cinema

COURSE OBJECTIVES:

• The course aims at imparting basic principles of thought process, reasoning and inference
to identify the roots and details of some of the contemporary issues faced by our nation
and try to locate possible solutions to these challenges by digging deep into our past.
• To enable the students to understand the importance of our surroundings and encourage
the students to contribute towards sustainable development.
• To sensitize students towards issues related to ‘Indian’ culture, tradition and its
composite character.

Non Credit Course 2020-21 AICTE Model Curriculum K series (V & VI Semester) Page 7