School of Engineering & Technology

Department of Computer Science and

Engineering

SYLLBUS
OF
B.Tech .Computer Science and Engineering

(Syllabus, Teaching & Evaluation Schemes)

(W.E.F. Academic Year 2024-25)

 Scheme and Syllabus of B.Tech Computer Science and Engineering

SYLLABUS

2 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

(CSE)
SEMESTER - IV

3 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

Discrete Structure
Teaching and Evaluation Scheme

Maximum Marks Allotted Contact

Subject Code Theory Practi Hours
Tot Total
S.No Subject Name cal per
alMa Credits
. week
rks
MidS Ter
End Quiz/ End
em. mw L T P
Sem. Assignme Sem
Exam. ork
nt/
Lab
Attendanc Work&
e Session
al

1. Discrete Structure 60 20 20 - - 100 3 1 4

COURSE OBJECTIVES:
1. Use mathematically correct terminology and notation.
2. Construct correct direct and indirect proofs.
3. Use division into cases in a proof.
4. Use counter examples.
5. Apply logical reasoning to solve a variety of problems.

COURSE OUTCOMES:
After this completion student will be familiar with relational algebra, Functions
and graph theory.

UNIT-I
Set Theory, Relation, Function, Theorem Proving Techniques : Set Theory: Definition of sets,
countable and uncountable sets, Venn Diagrams, proofs of some general identities on sets
Relation: Definition, types of relation, composition of relations, Pictorial representation of
relation, Equivalence relation, Partial ordering relation, Job-Scheduling problem Function:
Definition, type of functions, one to one, into and onto function, inverse function, composition
of functions, recursively defined functions, pigeonhole principle. Theorem proving
Techniques: Mathematical induction, Proof by contradiction.

UNIT–II
Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian group,
properties of groups, Subgroup, cyclic groups, Cosets, factor group, Permutation groups, Normal
subgroup, Homomorphism and isomorphism of Groups, example and standard results, Rings
and Fields: definition and standard results.

4 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

UNIT–III
Propositional Logic: Proposition, First order logic, Basic logical operation, truth tables,
tautologies, Contradictions, Algebra of Proposition, logical implications, logical equivalence,
predicates, Normal Forms, Universal and existential quantifiers. Introduction to finite state
machine Finite state machines as models of physical system equivalence machines, Finite
state machines as language recognizers

UNIT–IV
Graph Theory: Introduction and basic terminology of graphs, Planer graphs, Multigraphs and
weighted graphs, Isomorphic graphs, Paths, Cycles and connectivity, Shortest path in weighted
graph, Introduction to Eulerian paths and circuits, Hamiltonian paths and circuits, Graph
coloring, chromatic number, Isomorphism and Homomorphism of graphs.

UNIT–V
Combinatorics: Introduction, Permutation and combination, Binomial Theorem, Multimonial
Coefficients Recurrence Relation and Generating Function: Introduction to Recurrence Relation
and Recursive algorithms, Linear recurrence relations with constant coefficients, Homogeneous
solutions, Particular solutions, Total solutions, Generating functions, Solution by method of
generating functions.

TEXTBOOKS/REFERENCES:
1. C.L.Liu, “Elements of Discrete Mathematics” Tata Mc Graw-Hill Edition.
2. Trembley, J.P & Manohar; “Discrete Mathematical Structure with Application CS”, McGraw Hill.
3. Kenneth H. Rosen, “Discrete Mathematics and its applications”, McGraw Hill.
4. Bisht, “Discrete Mathematics”,Oxford University Press
5. Biswal,”Discrete Mathematics & Graph Theory”, PHI

5 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

Digital Circuit Design

Teaching and Evaluation Scheme

Maximum Marks Allotted Contact

Subject Code Theory Practi Hours
Tot Total
S.No Subject Name cal per
alMa Credit
. week
rks s
MidS Ter
EndS Quiz/ End
em. mw L T P
em. Assignme Sem
Exam. ork
nt/
Lab
Attendanc Work&
e Session
al
60 20 20 - - 100 3 2
2. Digital Circuit Design 4

COURSE OBJECTIVES:
1. The course is designed to acquire the basic knowledge of digital logic Levels and
application of digital electronics circuits and different types of memories.
2. To impart how to design Digital Circuits.
3. To understand the basic software tools for the design and implementation of digital
circuits and systems.

COURSE OUTCOMES:
Students earned credits will develop ability to
1. Illustrate basic postulates of Boolean algebra. To design Boolean functions by applying the
methods for simplifying Boolean expressions.
2. Illustrate fundamental concepts and design of digital combinational circuits.
3. Illustrate the basic methods for the design of sequential circuits.
4. Illustrate the operation of Logic families and Analyze and design of programmable logic devices.
5. Design and simulate the Logic circuits using HDL and appropriate EDA tool.

UNIT–I

Review of Number Systems, Codes-BCD, Excess- 3, Gray Reflected ASCII,EBCDIC, review of Logic gates
and binary operations, Implementations of Logic Functions using gates, NAND–NOR implementations.
Boolean postulates and laws – De-Morgan’s Theorem - Principle of Duality, Boolean function, Canonical
and standard forms, Minimization of Boolean functions, Sum of Products (SOP), Product of Sums
(POS),Karnaugh map Minimization, Quine-McCluskey method of minimization.
UNIT–II
Combinational logic circuits: Adder, subtractor, Carry Look Ahead adder, BCD adder, Binary
Multiplier, Multiplexer/De-multiplexer, decoder/encoder, code-converters, designing of
6 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

combinational Circuits, Introduction to Races and hazards.

UNIT–III
Sequential logic: flip flops, D, T, S-R, J-K, race around condition and its remedies, Edge & Level
triggered circuits, Shift registers, Asynchronous and synchronous counters, their types and
state diagrams.

UNIT–IV
Logic Families and its Specifications: RTL, DTL, TTL, ECL, CMOS, Concept of Programmable
logic devices like FPGA, Logic implementation using Programmable Devices, PLDs,
Semiconductor memories and classification of ROM, RAM and storage devices.

UNIT–V
Digital-to-analog conversion (DAC) - R-2R ladder Type, Weighted converter using Op- amp
and transistor. Analog-to-digital Conversion (ADC) -Counter type, Successive
Approximations Register, Flash type, Digital hardware description methodology, HDL,
different modeling in VHDL, VHDL construct and codes for combinational circuit.
TEXTBOOKS/REFERENCES:

1. R. P. Jain, “Modern digital Electronics”, Tata McGraw Hill, 4th edition, 2009.
2. W. H. Gothmann, “Digital Electronics- An introduction to theory and practice”, PHI, 2 nd
edition, 2006.
3. D. V. Hall, “Digital Circuit and System”, Tata McGraw Hill, 1989.
4. S. Salivahanan & S. Arivazhagan, “Digital Circuits and Design”, VikasPublishing.
5. M. Morris Mano, “Digital Logic and Computer Design”, Pearson India Education, 1st edition,
2012
6. Douglas Perry, “VHDL Programming by example”, McGraw Hill, 1st edition, 2002.
7. J. Bhaskar, “VHDL: Primer”, P T R Prentice Hall, 3rd edition, 1999.

List of Experiments:

1. Verification and interpretation of truth table for AND, OR, NOT, NAND, NOR, Ex- OR,
Ex-NOR gates.
2. Design and Implement Half Adder and Half subtractor.
3. Design and Implement Multiplexer, De-multiplexer.
4. Design and Implement BCD to Gray Code Converters.
5. Design and Implement Encoder, Decoder.
6. Verify the truth table of RS, JK, T and D flip-flops using NAND & NOR gates.
7. Design and Implement a modulo-4 asynchronous counter.
8. Analysis of Analog to Digital Converter.
9. Design and simulate half adder and full adder using xilinx tool (VHDL)
10. Design and simulate Multiplexer using xilinx tool (VHDL)
11. Design and simulate D flip flop using xilinx tool (VHDL)
12. Design and simulate ALU using xilinx tool (VHDL)
7 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

Computer Network
Teaching and Evaluation Scheme
Maximum Marks Allotted Contact
Hours
Practic
Theory per
al
week
Ter
mw Tot Total
Subject Code Quiz/
S.No. Subject Name Mid ork alMa Credits
End Assignment End
Sem. Lab rks
Sem. / Sem L T P
Exam. Work&
Attendance Sessiona
l

3. Computer Network 60 20 20 30 20 150 3 2 4

COURSE OBJECTIVE:
1. This course provides a foundation to understand computer networks using layered
architectures.
2. It will help them to pursue specialized programs leading to technical and professional
careers and certifications in the Networking and Communication Industry.
3. It will help students in understanding of various types of computer networks, technologies
behind networks and protocols.
COURSE OUTCOMES:
1. Describe basics of computer network, network architecture, TCP/IP protocol suite, OSI
reference models & fundamentals of physical layer.
2. Classify data link protocol like flow control, error control, bit oriented protocol.
3. Paraphrase multi-channel access protocol, IEEE 802 standards & use Ethernet standards.
4. Explain routing & congestion algorithm. State IP protocol, addressing & subnet.
5. Distinguish various transport & application layer protocols.
UNIT-I

Introduction to computer networks: Network – Component and Categories – Topologies

Reference Models: ISO/OSI Model and TCP/IP Protocol suite. Principals of physical layer:
Transmission Media, Bandwidth, Multiplexing, Switching.

UNIT-II

Data Link Layer: Need, Services Provided, Framing, Flow Control, Error control. Data Link Layer
Protocol: Elementary &Sliding Window protocol: 1-bit, Go-Back-N, Selective Repeat, Hybrid ARQ.
Protocol verification: Finite State Machine Models & Petri net models.ARP/RARP.

UNIT-III

8 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

MAC Sub layer: MAC Addressing, Binary Exponential Back-off (BEB) Algorithm, Distributed
Random Access Schemes/Contention Schemes: for Data Services (ALOHA and Slotted- ALOHA),
for Local-Area Networks (CSMA, CSMA/CD, CSMA/CA), Collision Free Protocols: Basic Bit Map,
Binary Count Down, Adaptive Tree Walk, Performance Measuring Metrics. IEEE Standards 802
series & their variant.
UNIT-IV
Network Layer : Need, Services Provided , Design issues, Routing algorithms: Least Cost
Routing algorithm, Dijkstra's algorithm, Bellman-ford algorithm, Hierarchical Routing,
Broadcast Routing, Multicast Routing. IP Addresses, Header format, Packet forwarding,
Fragmentation andreassembly,ICMP,Comparative study of IPv4 & IPv6.

UNIT-V
Transport Layer: Design issues, UDP: Header Format, Per-Segment Checksum, Carrying Uncast/Multicast
Real-Time Traffic, TCP: Connection Management, Reliability of Data Transfers, TCP Flow Control, TCP
Congestion Control, TCP Header Format, TCP Timer Management. Application Layer: WWW and HTTP,
FTP, SSH, Email (SMTP, MIME, IMAP), DNS, Network Management (SNMP).

TEXTBOOKS/REFERENCES:

1. Andrew S.Tanenbaum, David .Wetherall,“ComputerNetworks”PearsonNew International

Edition ,5thEdition,2013.
2. Douglas E Comer, “Internetworking with Tcp/Ip Principles, Protocols, And Architecture-
Volume I” 6thEdition, Prentice Hall ofIndia.
3. Dimitri Bertsekas, Robert Gallager, “Data Networks”, PHI Publication, Second Edition.
4. Kaveh Pahlavan, Prashant Krishnamurthy, “NetworkingFundamentals”, Wiley Publication.
FirstEdition,2009
5. Uyless Black, “Computer Networks”, PHI Publication, SecondEdition.
6. Ying-DarLin, Ren-Hung Hwang, FredBaker,“Computer Networks: An Open Source
Approach”, McGrawHill.2011.
7. Behrouz A. Forouzan, “Data Communication and Networking”, McGrawHill, 5th Edition, 2013.
8. WilliamStallings,“DataandComputerCommunication”8thEdition,2007.
9. W. Richard Stevens. “TCP/IP Illustrated, Volume 1”, Addison-Wesley, United States of
America.
List of Experiments:
1. Study of Different Type of LAN & Network Equipment.
2. Study and Verification of standard Network topologies i.e. .Star, Bus, Ring etc.
3. LAN installations and Configurations.
4. Write a program to implement various types of error correcting techniques.
5. Write a program to implement various types of framing methods.
6. Study of Tool Command Language (TCL).
7. Study and Installation of Standard Network Simulator:N.S-2,N.S3.OpNet, Qual Net etc.
8. Study & Installation of ONE (Opportunistic Network Environment) Simulator for High
Mobility Networks.
9 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

9. Configure 802.11WLAN.
10. Implement & simulate various types of routing algorithm.
11. Study & Simulation of MAC Protocols like Aloha, CSMA,CSMA/CD and CSMA/CA
using Standard NetworkSimulators.
12. Study of Application layer protocols-DNS, HTTP, HTTPS, FTPS and Telnet

10 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

Software Engineering
Teaching and Evaluation Scheme

Maximum Marks Allotted Contact

Subject Code Theory Practi Hours
Tot Total
S.No Subject Name cal per
alMa Credit
. week
rks s
MidS Ter
EndS Quiz/ End
em. mw L T P
em. Assignme Sem
Exam. ork
nt/
Lab
Attendanc Work&
e Session
al
Software Engineering 60 20 20 30 20 150 3 2
4. 4

COURSE OBJECTIVE:
1. The purpose of this subject is to cover the underlying concepts and techniques used in Software
Engineering & Project Management.
2. Some of these techniques can be used in software design & its implementation.
3. Demonstrate an understanding of and apply current theories, models, and techniques that provide a basis
for the software lifecycle.
4. Demonstrate an ability to use the techniques and tools necessary for engineering practice.

COURSE OUTCOME:
1. Students will be able to decompose the given project in various phases of a lifecycle.
2. Students will be able to choose appropriate process model depending on the user requirements.
3. Students will be able perform various life cycle activities like Analysis, Design, Implementation,
Testing and Maintenance.
4. Students will be able to know various processes used in all the phases of the product.
5. Students can apply the knowledge, techniques, and skills in the development of a software product.

UNIT-I
The Software Product and Software Process
Software Product and Process Characteristics, Software Process Models: Linear Sequential
Model, Prototyping Model, Evolutionary Process Models like Incremental Model, Spiral Model,
Component Assembly Model, Agile processes. Software Process customization and
improvement, CMM, Product and Process Metrics

UNIT-II
Requirement Elicitation, Analysis, and Specification

11 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

Functional and Non-functional requirements, Requirement Sources and Elicitation Techniques,

Analysis Modeling for Function-oriented and Object-oriented software development, System and
Software Requirement Specifications, Requirement Validation, Traceability

UNIT-III
Software Design
The Software Design Process, Design Concepts and Principles, Software Modeling and UML,
Architectural Design, User Interface Design, Function- oriented Design, SA/SD Component Based
Design, and Design Metrics

UNIT-IV
Software Analysis and Testing
Software Static and Dynamic analysis, Code inspections, Software Testing, Fundamentals, Software
Test Process, Testing Levels, Test Criteria, Test Case Design, Test Oracles, Test Techniques, Black-
Box Testing, White-Box Unit Testing and Unit, Testing Frameworks, Integration Testing, System
Testing and other Specialized, Testing, Test Plan, Test Metrics, Testing Tools. , Introduction to
Object-oriented analysis, design and comparison with structured Software Engg.

UNIT-V
Software Maintenance & Software Project Measurement
Need and Types of Maintenance, Software Configuration Management (SCM),Re-engineering,
Reverse Engineering, Tool Support. Project Management Concepts, Feasilibility Analysis, Project
and Process Planning, Resources Allocations, Software efforts, Schedule, and Cost estimations,
Project Scheduling and Tracking, Risk Assessment and Mitigation, Software Quality Assurance
(SQA). Project Plan, Project Metrics.

REFERENCE BOOKS:

1. Pankaj Jalote ,”An Integrated Approach to Software Engineering”, Narosa Pub, 2005
2. Rajib Mall, “Fundamentals of Software Engineering” Second Edition, PHI Learning
3. R S. Pressman ,”Software Engineering: A Practitioner's Approach”, Sixth edition2006, McGraw-Hill.
4. Sommerville,”Software Enginerring”,Pearson Education.
5. Richard H.Thayer,”Software Enginerring & Project Managements”, WileyIndia
6. Waman S.Jawadekar,”Software Enginerring”, TMH
7. Bob Hughes, M.Cotterell, Rajib Mall “ Software Project Management”, McGrawHill

LIST OF EXPERIMENTS:
1. Development of problem statement.
2. Preparation of Software Requirement Specification Document, Design Documents and Testing
Phase related documents.
3. Preparation of Software Configuration Management and Risk Management related documents.
4. Study and usage of any Design phase CASE tool

12 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

5. Performing the Design by using any Design phase CASE tools.

6. Develop test cases for unit testing and integration testing
7. Develop test cases for various white box and black box testing techniques.
8. Design Use Case diagram
9. Design and develop COCOMO cost estimation model of Project.
10. Identity functional and Nonfunctional requirement of problem statem

13 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

Introduction to Python
Teaching and Evaluation Scheme

Maximum Marks Allotted Contact

Hours
Practi
Theory per
cal
week
Ter
Quiz/ mw Tot Total
S.No Subject Code alMa Credit
Subject Name MidS Assignme ork
. EndS End rks s
em. nt/ Lab
em. Sem L T P
Exam. Work&
Attendanc
Session
e
al

5. Introduction to Python 60 20 20 30 20 150 3 2 4

COURSE OBJECTIVE:
1. The course is designed to provide Basic knowledge of Python.
2. Python programming is intended for software engineers, system analysts, program managers
and user support personnel who wish to learn thePython programming language.
3. Problem solving and programming capability.

COURSE OUTCOME:
1. Install Python and have knowledge of syntax of Python.
2. Describe the Numbers, Math functions, Strings, List, Tuples and Dictionaries inPython.
3. Express different Decision Making statements and Functions.
4. Develop code in Python using functions, loops, etc.
5. Design GUI Applications in Python and evaluate different database operations.

UNIT-I
Introduction, History, Features, Python –Environment Setup Local Environment Setup, Getting Unit
Python, Installation of Python, Use of IDE

UNIT-II
Python –Basic Syntax Python Identifiers, Reserved Words, Lines & Indentation, Multiline Statements,
Quotation in Python, Comments & other useful constructs, Python –Variables Assigning Values to
Variables, Multiple Assignment, Standard Data Types.

UNIT-III

Python –Variables, Assigning Values to Variables, Multiple Assignment, Standard Data Types;
Python Numbers, Python Strings, Python Lists, Python Tuples, Dictionary, Data Type

14 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

Conversion.

UNIT-IV
Python –Basic Operators, Types of Operators, Arithmetic Operators, Comparison Operators,
Assignment Operators, Bitwise Operators, Logical Operators, Operator Precedence, Python– Decision
Making & Loops, Flowchart, If statement Syntax

UNIT-V
Python-Functions, Syntax for defining a function, Calling a Function, Function Arguments,
Anonymous Functions Python-Applications & Further Extensions, Data analysis packages.

REFERENCE BOOKS:
1. Eric Matthes, “Python Crash Course: A Hands-On, Project-Based Introduction to Programming”, No
Starch Press.
2. ZedA. Shaw, “Learn Python the Hard Way” (3rd Edition), Addison Wesley.
3. Paul Barry, “Head-First Python”, O’Reilly.
4. John Zelle, Franklin,”Python Programming”, Beedle & Associates Inc.

LIST OF EXPERIMENTS:
Write a Python program:
1. To find GCD of two numbers.
2. To find the square root of a number by Newton’s Method.
3. To find the exponentiation of a number.
4. To find the maximum from a list of numbers.
5. To perform Linear Search
6. To perform binary search.
7. To perform selection sort.
8. To find first n prime numbers.
9. To multiply matrices.
10. For command line arguments.
11. To find the most frequent words in a text read from a file.
12. To demonstrate data analysis packages using python like Pandas, Filtering, etc.

15 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

Soft Skills – I
Teaching and Evaluation Scheme

Maximum Marks Allotted Contact

Subject Code Theory Practi Hours
Tot Total
S.No Subject Name cal per
alMa Credit
. week
rks s
MidS Ter
EndS Quiz/ End
em. mw L T P
em. Assignme Sem
Exam. ork
nt/
Lab
Attendanc Work&
e Session
al

6. *Soft Skills – I 50 50 2 1

COURSE OBJECTIVE:
The course will help students to learn effective communication skills, group and team building skills.It
will help them to learn the goal setting process and thus become more effective in achieving it.

COURSE OUTCOME:
The outcome of this course will be to make students aware about the different facets of self. It will
also help them learn skills to strengthen their inner capacities so that they are able to understand
themselves, think and act effectively to lead.

UNIT-I

Introduction to Soft Skills: Importance of Soft Skills, Effective Communication Skills, Verbal: Oral and
Written, Merits and Demerits. Non Verbal: Kinesics, Proxemics, Haptics, Chronemics, Paralanguage,
Sign/Symbol, Meta Communication, and Cultural differences in Non-Verbal Communication
UNIT-II
Aspects of Communication: Process of Listening, Types of Listening, Barriers to Listening,
Strategies to Develop Listening Skills, Listening Comprehension, Culture as Communication,
Communicating across Cultures, Communication Breakdown and ways to overcome.

UNIT-III
Interpersonal Skills: Introduction and Importance to Interpersonal Skills, Personal Attributes,
Interpersonal Attributes, Decision making, Creative Problem Solving, Dealing with Glossophobia,
Logical Reasoning, Tony Buzan’s Mind Mapping Techniques: Argumentation, Inductive, Deductive
reasoning, Persuasion.

UNIT-IV

16 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

Group Behavior: Leadership skills, Team Management, Group Dynamics, Negotiation,

Assertiveness,Emotional Intelligence.
UNIT-V
Practical Approach to Soft Skills and Interpersonal Skills, Case Studies, SWOC Analysis and Goal
Setting,Mindfulness Training, Brain Storming, Group Discussion, Team Building Activities.
REFERENCE BOOKS:
1. Soft Skills by G.S. Chouhan and Sangeeta Sharma, Wiley, New Delhi, 2016 CommunicationSkills
by Sanjay Kumar and Pushplata, OUP, New Delhi, 2011
2. Communication Skill for Engineers and Scientist by Sangeeta Sharma and Vinod Mishra, PHI
Learning, New Delhi, 2015
3. Developing Communication Skill by Krishna Mohan, Meera Banerji, McMillan India
Limited,2018
4. Effective Listening Skills by Kratz, Abby Robinson. Toronto: ON: Irwin ProfessionalPublishing,
1995.
5. Soft Skill for Everyone by Jeff Butterfield, Cengage Leaning, New Delhi, 2010.
6. Theories of Personality by Hall, Calvin S. et al. . New Delhi: Wiley. rpt. 2011.
7. Corporate Conversations by Holtz, Shel. New Delhi: PHI. 2007.
8. The Art of Public Speaking by Lucas, Stephen E. McGraw-Hill Book Co. International
Edition, 11th Ed. 2014.
9. Winning at Interviews by Thorpe, Edgar and Showick Thorpe. Pearson Education. 2004.
10. Business Communication for Managers by Penrose, John M., et al. New Delhi: ThomsonSouth
Western. 2007.

17 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

Essence of Indian Knowledge Tradition

Teaching and Evaluation Scheme

Maximum Marks Allotted Contact

Hours
Practi
Theory per
cal
week
Ter
Quiz/ mw Tot Total
S.No Subject Code alMa Credit
Subject Name MidS Assignme ork
. EndS End rks s
em. nt/ Lab
em. Sem L T P
Exam. Work&
Attendanc
Session
e
al

Essence of Indian
7. 50 50 2 1
Knowledge Tradition

COURSE OBJECTIVES:
To facilitate the students with the concepts of Indian traditional knowledge and to make them understand the
Importance of roots of knowledge system.

COURSE OUTCOME:
Demonstrate knowledge of key philosophical concepts in Indian thought, including dharma, karma, and moksha.
Analyze the significance of major philosophical schools (e.g., Vedanta, Samkhya, Buddhism) in shaping Indian
knowledge.

UNIT-I
Introduction to Traditional Knowledge: Define traditional knowledge, nature and characteristics, scope
and importance, kinds of traditional knowledge, the physical and social contexts in which traditional
knowledge develop, the historical impact of social change on traditional knowledge systems. Indigenous
Knowledge (IK), characteristics, traditional knowledge vis-à-vis indigenous knowledge, traditional

UNIT-II
knowledge Vs western knowledge traditional knowledge vis-à-vis formal knowledge

Protection of Traditional Knowledge: The need for protecting traditional knowledge Significance
of traditional knowledge protection, the value of traditional knowledge in the global economy, Role
of Government to harness traditional knowledge

UNIT-III

Legal framework and Traditional Knowledge:

A: The Scheduled Tribes and Other Traditional Forest Dwellers (Recognition of Forest Rights) Act, 2006,
Plant Varieties Protection and Farmers Rights Act, 2001 (PPVFR Act).

18 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

B: The Biological Diversity Act 2002 and Rules 2004, the protection of traditional knowledge bill,
2016. Geographical indications act 2003.

UNIT-IV
Traditional knowledge and Intellectual Property: Systems of traditional knowledge protection, Legal
concepts for the protection of traditional knowledge, Certain non IPR mechanisms of traditional knowledge
protection, Patents and traditional knowledge, Strategies to increase protection of traditional knowledge,
global legal FORA for increasing protection of Indian Traditional Knowledge.

UNIT-V
Traditional knowledge in different sectors: Traditional knowledge and engineering, Traditional
medicine system, Traditional knowledge and biotechnology, Traditional knowledge in agriculture,
Traditional societies depend on it for their food and healthcare needs, Importance of conservation
and sustainable development of environment, Management of biodiversity, Food security of the
country and protection of Traditional knowledge.

TEXTBOOKS/REFERENCES:
1. Traditional Knowledge System in India, by Amit Jha, 2009.
2. Traditional Knowledge System and Technology in India by Basanta Kumar Mohanta and Vipin Kumar Singh,
Pratibha Prakashan 2012. .

19 |Page
Scheme and Syllabus of B.Tech Computer Science and Engineering

20 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

French Language-II
Teaching and Evaluation Scheme

Maximum Marks Allotted Contact

Subject Code Theory Practi Hours
Tot Total
S.No Subject Name cal per
alMa Credit
. week
rks s
MidS Ter
EndS Quiz/ End
em. mw L T P
em. Assignme Sem
Exam. ork
nt/
Lab
Attendanc Work&
e Session
al
French Language-II/Hindi-
9. 50 50 2 1
II

COURSE OBJECTIVE:
The aim of the course is to help the students acquire basic and intermediate levels of communication skills of general
French Language in professional usage.
• To facilitate students to develop proficiency in communication in French Language and to be globally competent
• To develop creative and innovative abilities using French Language, to meet the challenges of the constantly
evolving industry and to identify entrepreneurial opportunities
• To enable students to be leaders and develop inter personal skills to perform effectively in diverse teams of MNC
using French Language.
• To appraise the students of the different customs, traditions, sociohistorical aspects and trends in French society and
literature.
• To assess and interpret authentic documents in French Language
• Introduction to the Hindi language and Indian culture.
• Familiarity with Devanagari script and sound system.
• A balance of all four language skills: speaking, listeJring comprehension, reading, and writing.

COURSE OUTCOMES:
• Explain linguistic requirements of French Language grammar and vocabulary
• Demonstrate basic written communicative skills with emphasis on creative writing in French Language.
• Comprehend and construct syntactically correct answers in basic 2 French Language comprehensions
• Develop and demonstrate basic oral skills in French Language for possible situations.
• Understand the socio-cultural and historical features of France
• At the end of the quarter students should be able to listen to simple conversations or stories, watch movies
and understand them, read and understand short texts, engage in brief conversations on everyday topics,
and write short essays on familiar topics using the structures and vocabulary introduced in class.

COURSE CONTENTS:
French language
Verbs: Reflexive verbs; Few 3rd group verbs: prendre, descendre, faire, aller, pouvoir, vouloir, dire, etc.; Tense:
21 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

Imperative tense, Present continuous, Compound Past, Simple Future; Pronouns: Reflexive pronouns, The pronoun y
and en; Relative pronouns (qui and que); Objects: Direct object (COD), Indirect object (COI); Adjective: Possessive
adjective; Interrogation: Open-ended questions (Pourquoi…parce), Closed questions (Est-ce-que…?) Vocabulary:
Telling Time, climate, weather, season, month; Temporal expression (1); Expressions of quantity (litre, pot, motte,
etc.), (ne…plus, ne…que); Structures of advice (1); Structures for placing and taking orders; Structures of comparison
(1);

TEXTBOOKS/REFERENCES:
1. Alter Ego, A1 (ISBN: 9782011554208); Publisher: Hachette; Author: Annie Berthet, Catherine
2. Hugot et al.; Published: 2006; (Lesson 1 to Lesson 4) or Alter Ego, A1 – Cahier d'activités - A1 (ISBN:
9782011558114); Publisher: Hachette; Author:
3. Annie Berthet, Catherine Hugot et al.; Published: 2006; (Lesson 1 to Lesson 4)
4. Écho (2e edition), A1 (ISBN: 9782090385885); Publisher: CLE International; Authors: Jacky Girardet, Jacques
Pecheur; Published: 2013

22 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

Hindi-II
Teaching and Evaluation Scheme
Maximum Marks Allotted Contact
Subject Code Theory Practi Hours
Tot Total
S.No Subject Name cal per
alMa Credit
. week
rks s
MidS Ter
EndS Quiz/ End
em. mw L T P
em. Assignme Sem
Exam. ork
nt/
Lab
Attendanc Work&
e Session
al
10. Hindi-II 50 50 2 1

23 |Page
Scheme and Syllabus of B.Tech Computer Science and Engineering

24 |Page
 Scheme and Syllabus of B.Tech Computer Science and Engineering

OOP’S programming with (c++)

Teaching and Evaluation Scheme

Maximum Marks Allotted Contact

Subject Code Theory Practi Hours
Tot Total
S.No Subject Name cal per
alMa Credit
. week
rks s
MidS Ter
EndS Quiz/ End
em. mw L T P
em. Assignme Sem
Exam. ork
nt/
Lab
Attendanc Work&
e Session
al
OOP’S programming with
50 50 2 1
11. (c++)

List of Experiment:
1. Write a C++ program to display Names, Roll No., and grade of 3 students who have appeared in the
examination. Declare the class of name, roll no., and grade. Create an array of class objects. Read and
display the contents of the array.
2 Write a C++ program to declare struct. Initialize and display contents of member
3 Write a C++ program to declare a class . Declare pointer to class. Initialize and display the contents of the
class members
4 Given that EMPLOYEE class contains following members: data members: Employee number, Employee
name, Basic, DA, IT, Net Salary, and print data members.
5 Write a C++ program to read the data of N employee and compute the net salary of each employee
(DA=52% of basic and IT=30% of gross salary).
6 Write a C++ to illustrate the concepts of console I/O operations
7 Write a C++ program to use scope resolution operator. Display the various values of the same variables
declared at different scope levels.
8 Write a C++ program to allocate memory using new operator.
9 Write a C++ program to create multilevel inheritance
10 Write a C++ program to create an array of pointers. Invoke functions using array objects
11 Write a C++ program to use pointer for both base and derived classes and call the member function. Use
virtual keyword

25 |Page