Jntuk 2-1 Syllabus r20
Jntuk 2-1 Syllabus r20
2020 – 21
II Year – I SEMESTER
Course
S. No Courses L T P Credits
Code
1 BS Mathematics III 3 0 0 3
2 CS Object Oriented Programming through C++ 3 0 0 3
3 CS Operating Systems 3 0 0 3
4 CS Software Engineering 3 0 0 3
5 CS Mathematical Foundations of Computer Science 3 0 0 3
6 CS Object Oriented Programming through C++ Lab 0 0 3 1.5
7 CS Operating Systems Lab 0 0 3 1.5
8 CS Software Engineering Lab 0 0 3 1.5
Skill oriented Course - I
Applications of Python-NumPy OR
9 SO 0 0 4 2
2) Web Application Development Using
Full Stack -Frontend Development – Module-I
10 MC Constitution of India 2 0 0 0
Total Credits 21.5
II Year – II SEMESTER
Course
S. No Courses L T P Credits
Code
1 BS Probability and Statistics 3 0 0 3
2 CS Database Management Systems 3 0 0 3
3 CS Formal Languages and Automata Theory 3 0 0 3
4 ES Java Programming 3 0 0 3
5 HS Managerial Economics and Financial Accountancy 3 0 0 3
6 CS Database Management Systems Lab 0 0 2 1
7 CS R Programming Lab 0 1 2 2
8 ES Java Programming Lab 0 0 3 1.5
Skill Oriented Course - II
Applications of Python-Pandas OR
9 SO 2) Web Application Development Using 0 0 4 2
Full Stack -Frontend Development –Module-II
Total Credits 21.5
10 Minor Operating Systems$ 3 0 2 3+1
11 Honors Any course from the Pool, as per the opted track 4 0 0 4
$- Integrated Course
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
IV B. Tech –I Semester
S.No Course Code Course Title Hoursperweek Credits
L T P C
Professional Elective-III
1.Cloud Computing
1 PE 2.Neural Networks and Soft Computing 3 0 0 3
3.Ad-hoc and Sensor Networks
4.Cyber Security & Forensics
Professional Elective-IV
1. Deep Learning Techniques
2 PE 2. Social Networks & Semantic Web 3 0 0 3
3. Computer Vision
4.MOOCS-NPTEL/SWAYAM%
Professional Elective-V
1.Block-Chain Technologies
3 PE 2.Wireless Network Security 3 0 0 3
3.Ethical Hacking
4.MOOCS-NPTEL/SWAYAM%
Open Elective-III
Open Elective
4 Open Electives offered by other departments/ 3 0 0 3
/Job Oriented
API and Microservices (Job Oriented Course)
Open Elective-IV
Open Elective Open Electives offered by other departments/
5 3 0 0 3
/Job Oriented Secure Coding Techniques (Job Oriented
Course)
Universal Human Values 2: Understanding
6 HS 3 0 0 3
Harmony
1.PYTHON: Deep Learning OR
2.MEAN Stack Technologies-Module II-
7 SO 0 0 4 2
Angular JS and MongoDB OR
3.APSSDC offered Courses
Industrial/Research Internship 2 months
8 PR (Mandatory) after third year (to be 0 0 0 3
evaluated during VII semester
Total credits 23
Software Engineering$ / any other from PART-
11 Minor 3 0 2 3+1
B (For Minor)
Any course from the Pool, as per the opted
12 Honors 4 0 0 4
track
Minor course through SWAYAM - - - 2
$- Integrated Course
% - MOOC Course
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
Note:
1. For integrated courses: Theory and laboratory exams will be conducted separately, and the
student concern will get credits if successfully completes both theory and laboratory. Only external
exam will be conducted for Laboratory component. Credit based weightage shall be considered
while awarding the grade.
2. For MOOC courses: Based on the students interest, student can register and complete a 12 week
course one year in advance, by prior information to the concern.
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
PART A
Course available
S.No Subject L-T-P Credits NPTEL Link
in NPTEL
https://onlinecourses.sw
1 Operating Systems 3-0-2 4 Operating Systems ayam2.ac.in/cec21_cs20
/preview
https://onlinecourses.sw
Data Structures
ayam2.ac.in/cec22_cs10
Programming, Data
Data Structures and /preview
2 3-0-2 4 Structures and
Algorithms https://onlinecourses.npt
Algorithms using
el.ac.in/noc22_cs26/pre
Python
view
https://onlinecourses.sw
Software
3 Software Engineering 3-0-2 4 ayam2.ac.in/cec21_cs21
Engineering
/preview
https://onlinecourses.sw
4 Computer Networks 3-0-2 4 Computer Networks ayam2.ac.in/cec22_cs05
/preview
Data Base
https://onlinecourses.npt
Database Management Management
5 3-0-2 4 el.ac.in/noc22_cs51/pre
Systems System (noc22-
view
cs51)
PART B
Course
S.No Subject L-T-P Credits available in NPTEL Link
NPTEL
Physics through https://onlinecourses.
1 Computational Thinking 4-0-0 4 Computational nptel.ac.in/noc22_ph
Thinking 12/preview
Object Oriented Programming
2 3-0-2 4
through JAVA
https://onlinecourses.
Data Analytics
3 Data Analytics using Python 3-0-2 4 nptel.ac.in/noc22_cs
with Python
8/ preview
Artificial 1. https://onlinecour
Intelligence: ses.nptel.ac.in/no
4 Artificial Intelligence 4-0-0 4 Knowledge c22_cs56/previe
Representation w
And Reasoning 2. https://onlinecour
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
L T P C
II Year I Semester
3 0 0 3
MATHEMATICS - III
Course Objectives:
x To familiarize the techniques in partial differential equations
x To furnish the learners with basic concepts and techniques at plus two level to lead them into
advanced level by handling various real world applications.
Course Outcomes:
At the end of the course, the student will be able to
x Interpret the physical meaning of different operators such as gradient, curl and divergence
(L5)
x Estimate the work done against a field, circulation and flux using vector calculus (L5)
x Apply the Laplace transform for solving differential equations (L3)
x Find or compute the Fourier series of periodic signals (L3)
x Know and be able to apply integral expressions for the forwards and inverse Fourier
transform to a range of non-periodic waveforms (L3)
x Identify solution methods for partial differential equations that model physical processes (L3)
Text Books:
1) B. S. Grewal, Higher Engineering Mathematics, 43rd Edition, Khanna Publishers.
2) B. V. Ramana, Higher Engineering Mathematics, 2007 Edition, Tata Mc. Graw Hill
Education.
Reference Books:
1) Erwin Kreyszig, Advanced Engineering Mathematics, 10th Edition, Wiley-India.
2) Dean. G. Duffy, Advanced Engineering Mathematics with MATLAB, 3rd Edition,
CRC Press.
3) Peter O’ Neil, Advanced Engineering Mathematics, Cengage.
4) Srimantha Pal, S C Bhunia, Engineering Mathematics, Oxford University Press.
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
L T P C
II Year – I Semester
3 0 0 3
OBJECT ORIENTED PROGRAMMING THROUGH C++
Course Objectives:
x Describe the procedural and object oriented paradigm with concepts of streams,
classes, functions, data and objects
x Understand dynamic memory management techniques using pointers, constructors,
destructors
x Describe the concept of function overloading, operator overloading, virtual functions
and polymorphism
x Classify inheritance with the understanding of early and late binding, usage of
exception handling, generic programming
x Demonstrate the use of various OOPs concepts with the help of programs
Course Outcomes:
By the end of the course, the student
x Classify object oriented programming and procedural programming
x Apply C++ features such as composition of objects, operator overloads, dynamic
memory allocation, inheritance and polymorphism, file I/O, exception handling
x Build C++ classes using appropriate encapsulation and design principles
x Apply object oriented or non-object oriented techniques to solve bigger computing
problems
UNIT I
Introduction to C++: Difference between C and C++, Evolution of C++, The Object Oriented
Technology, Disadvantage of Conventional Programming, Key Concepts of Object Oriented
Programming, Advantage of OOP, Object Oriented Language.
UNIT II
Classes and Objects &Constructors and Destructor: Classes in C++, Declaring Objects,
Access Specifiers and their Scope, Defining Member Function, Overloading Member
Function, Nested class, Constructors and Destructors, Introduction, Constructors and
Destructor, Characteristics of Constructor and Destructor, Application with Constructor,
Constructor with Arguments parameterized Constructor, Destructors, Anonymous Objects.
UNIT III
Operator Overloading and Type Conversion & Inheritance: The Keyword Operator,
Overloading Unary Operator, Operator Return Type, Overloading Assignment Operator (=),
Rules for Overloading Operators, Inheritance, Reusability, Types of Inheritance, Virtual Base
Classes- Object as a Class Member, Abstract Classes, Advantages of Inheritance,
Disadvantages of Inheritance.
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
UNIT IV
Pointers & Binding Polymorphisms and Virtual Functions: Pointer, Features of Pointers,
Pointer Declaration, Pointer to Class, Pointer Object, The this Pointer, Pointer to Derived
Classes and Base Class, Binding Polymorphisms and Virtual Functions, Introduction,
Binding in C++, Virtual Functions, Rules for Virtual Function, Virtual Destructor.
UNIT V
Generic Programming with Templates & Exception Handling: Definition of class Templates,
Normal Function Templates, Over Loading of Template Function, Bubble Sort Using
Function Templates, Difference between Templates and Macros, Linked Lists with
Templates, Exception Handling, Principles of Exception Handling, The Keywords try throw
and catch, Multiple Catch Statements, Specifying Exceptions.
Overview of Standard Template Library, STL Programming Model, Containers, Sequence
Containers, Associative Containers, Algorithms, Iterators, Vectors, Lists, Maps.
Text Books:
1) A First Book of C++, Gary Bronson, Cengage Learning.
2) The Complete Reference C++, Herbert Schildt, TMH.
Reference Books:
1) Object Oriented Programming C++, Joyce Farrell, Cengage.
2) C++ Programming: from problem analysis to program design, DS Malik, Cengage
Learning
3) Programming in C++, Ashok N Kamthane, Pearson 2nd Edition
e- Resources:
1) https://nptel.ac.in/courses/106/105/106105151/
2) https://github.com/topics/object-oriented-programming
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
L T P C
II Year – I Semester
3 0 0 3
OPERATING SYSTEMS
Course Objectives:
The objectives of this course is to
Course Outcomes:
After learning, the course the students should be able to:
x Describe various generations of Operating System and functions of Operating System
x Describe the concept of program, process and thread and analyze various CPU
Scheduling Algorithms and compare their performance
x Solve Inter Process Communication problems using Mathematical Equations by
various methods
x Compare various Memory Management Schemes especially paging and Segmentation
in Operating System and apply various Page Replacement Techniques
x Outline File Systems in Operating System like UNIX/Linux and Windows
UNIT I
Operating Systems Overview: Operating system functions, Operating system structure,
Operating systems operations, Computing environments, Open-Source Operating Systems.
System Structures: Operating System Services, User and Operating-System Interface,
systems calls, Types of System Calls, system programs, operating system structure, operating
system debugging, System Boot.
UNIT II
Process Concept: Process scheduling, Operations on processes, Inter-process communication,
Communication in client server systems.
Multithreaded Programming: Multithreading models, Thread libraries, Threading issues.
Process Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms, Multiple
processor scheduling, Thread scheduling.
Inter-process Communication: Race conditions, Critical Regions, Mutual exclusion with busy
waiting, Sleep and wakeup, Semaphores, Mutexes, Monitors, Message passing, Barriers,
Classical IPC Problems - Dining philosophers problem, Readers and writers problem.
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
UNIT III
Memory-Management Strategies: Introduction, Swapping, Contiguous memory allocation,
Paging, Segmentation.
Virtual Memory Management: Introduction, Demand paging, Copy on-write, Page
replacement, Frame allocation, Thrashing, Memory-mapped files, Kernel memory allocation.
UNIT IV
Deadlocks: Resources, Conditions for resource deadlocks, Ostrich algorithm, Deadlock
detection and recovery, Deadlock avoidance, Deadlock prevention.
File Systems: Files, Directories, File system implementation, management and optimization.
Secondary-Storage Structure: Overview of disk structure, and attachment, Disk scheduling,
RAID structure, Stable storage implementation.
UNIT V
System Protection: Goals of protection, Principles and domain of protection, Access matrix,
Access control, Revocation of access rights.
System Security: Introduction, Program threats, System and network threats, Cryptography
for security, User authentication, Implementing security defenses, Firewalling to protect
systems and networks, Computer security classification.
Case Studies: Linux, Microsoft Windows.
Text Books:
1) Silberschatz A, Galvin P B, and Gagne G, Operating System Concepts, 9th edition,
Wiley, 2013.
2) Tanenbaum A S, Modern Operating Systems, 3rd edition, Pearson Education, 2008.
(for Interprocess Communication and File systems.)
Reference Books:
1) Dhamdhere D M, Operating Systems A Concept Based Approach, 3rd edition, Tata
McGraw-Hill, 2012.
2) Stallings W, Operating Systems -Internals and Design Principles, 6th edition, Pearson
Education, 2009
3) Nutt G, Operating Systems, 3rd edition, Pearson Education, 2004.
e-Resources:
1) https://nptel.ac.in/courses/106/105/106105214/
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
L T P C
II Year – I Semester
3 0 0 3
SOFTWARE ENGINEERING
Course Objectives:
This course is designed to:
x Give exposure to phases of Software Development, common process models
including Waterfall, and the Unified Process, and hands-on experience with elements
of the agile process
x Give exposure to a variety of Software Engineering practices such as requirements
analysis and specification, code analysis, code debugging, testing, traceability, and
version control
x Give exposure to Software Design techniques
Course Outcomes:
Students taking this subject will gain software engineering skills in the following areas:
x Ability to transform an Object-Oriented Design into high quality, executable code
x Skills to design, implement, and execute test cases at the Unit and Integration level
x Compare conventional and agile software methods
UNIT I
The Nature of Software, The Unique Nature of WebApps, Software Engineering, The
Software Process, Software Engineering Practice, Software Myths. A Generic Process Model,
Process Assessment and Improvement, Prescriptive Process Models, Specialized Process
Models, The Unified Process, Personal and Team Process Models, Process Technology.
UNIT II
Agility, Agility and the Cost of Change, Agile Process, Extreme Programming (XP), Other
Agile Process Models, A Tool Set for the Agile Process, Software Engineering Knowledge,
Core Principles, Principles That Guide Each Framework Activity, Requirements Engineering,
Establishing the Groundwork, Eliciting Requirements, Developing Use Cases, Building the
Requirements Model, Negotiating Requirements, Validating Requirements.
UNIT III
Requirements Analysis, Scenario-Based Modeling, UML Models That Supplement the Use
Case, Data Modeling Concepts, Class-Based Modeling, Requirements Modeling Strategies,
Flow-Oriented Modeling, Creating a Behavioral Model, Patterns for Requirements
Modelling, Requirements Modeling for WebApps.
UNIT IV
Design within the Context of Software Engineering, The Design Process, Design Concepts,
The Design Model, Software Architecture, Architectural Genres, Architectural Styles,
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
UNIT V
The Golden Rules, User Interface Analysis and Design, Interface Analysis, Interface Design
Steps, WebApp Interface Design, Design Evaluation, Elements of Software Qualtiy
Assurance, SQA Tasks, Goals & Metrics, Statistical SQA, Software Reliability, A Strategic
Approach to Software Testing, Strategic Issues, Test Strategies for Conventional Software,
Test Strategies for Object-Oriented Software, Test Strategies for WebApps, Validation
Testing, System Testing, The Art of Debugging, Software Testing Fundamentals, Internal
and External Views of Testing, White-Box Testing, Basis Path Testing.
Text Books:
1) Software Engineering a practitioner’s approach, Roger S. Pressman, Seventh Edition,
McGraw Hill Higher Education.
2) Software Engineering, Ian Sommerville, Ninth Edition, Pearson.
Reference Books:
1) Software Engineering, A Precise Approach, PankajJalote, Wiley India, 2010.
2) Software Engineering, Ugrasen Suman, Cengage.
e-Resources:
1) https://nptel.ac.in/courses/106/105/106105182/
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
L T P C
II Year – I Semester
3 0 0 3
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
Course Objectives:
This course is designed to:
x To introduce the students to the topics and techniques of discrete methods and
combinatorial reasoning
x To introduce a wide variety of applications. The algorithmic approach to the solution
of problems is fundamental in discrete mathematics, and this approach reinforces the
close ties between this discipline and the area of computer science
Course Outcomes:
At the end of the course student will be able to
x Demonstrate skills in solving mathematical problems
x Comprehend mathematical principles and logic
x Demonstrate knowledge of mathematical modeling and proficiency in using
mathematical software
x Manipulate and analyze data numerically and/or graphically using appropriate
Software
x Communicate effectively mathematical ideas/results verbally or in writing
UNIT I
Mathematical Logic: Propositional Calculus: Statements and Notations, Connectives, Well
Formed Formulas, Truth Tables, Tautologies, Equivalence of Formulas, Duality Law,
Tautological Implications, Normal Forms, Theory of Inference for Statement Calculus,
Consistency of Premises, Indirect Method of Proof, Predicate Calculus: Predicates,
Predicative Logic, Statement Functions, Variables and Quantifiers, Free and Bound
Variables, Inference Theory for Predicate Calculus.
UNIT II
Set Theory: Sets: Operations on Sets, Principle of Inclusion-Exclusion, Relations: Properties,
Operations, Partition and Covering, Transitive Closure, Equivalence, Compatibility and
Partial Ordering, Hasse Diagrams, Functions: Bijective, Composition, Inverse, Permutation,
and Recursive Functions, Lattice and its Properties, Algebraic Structures: Algebraic Systems,
Properties, Semi Groups and Monoids, Group, Subgroup and Abelian Group,
Homomorphism, Isomorphism.
UNIT III
Combinatorics: Basis of Counting, Permutations, Permutations with Repetitions, Circular and
Restricted Permutations, Combinations, Restricted Combinations, Binomial and Multinomial
Coefficients and Theorems, Number Theory: Properties of Integers, Division Theorem,
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
Greatest Common Divisor, Euclidean Algorithm, Least Common Multiple, Testing for Prime
Numbers, The Fundamental Theorem of Arithmetic, Modular Arithmetic, Fermat’s and
Euler’s Theorems
UNIT IV
Recurrence Relations: Generating Functions, Function of Sequences, Partial Fractions,
Calculating Coefficient of Generating Functions, Recurrence Relations, Formulation as
Recurrence Relations, Solving Recurrence Relations by Substitution and Generating
Functions, Method of Characteristic Roots, Solving Inhomogeneous Recurrence Relations
UNIT V
Graph Theory: Basic Concepts, Graph Theory and its Applications, Sub graphs, Graph
Representations: Adjacency and Incidence Matrices, Isomorphic Graphs, Paths and Circuits,
Eulerian and Hamiltonian Graphs, Multigraphs, Bipartite and Planar Graphs, Euler’s
Theorem, Graph Colouring and Covering, Chromatic Number, Spanning Trees, Prim’s and
Kruskal’s Algorithms, BFS and DFS Spanning Trees.
Text Books:
1) Discrete Mathematical Structures with Applications to Computer Science, J. P.
Tremblay and P. Manohar, Tata McGraw Hill.
2) Elements of Discrete Mathematics-A Computer Oriented Approach, C. L. Liu and D.
P. Mohapatra, 3rd Edition, Tata McGraw Hill.
Reference Books:
1) Discrete Mathematics for Computer Scientists and Mathematicians, J. L. Mott, A.
Kandel and T. P. Baker, 2nd Edition, Prentice Hall of India.
2) Discrete Mathematical Structures, Bernand Kolman, Robert C. Busby and Sharon
Cutler Ross, PHI.
3) Discrete Mathematics and its Applications with Combinatorics and Graph Theory, K.
H. Rosen, 7th Edition, Tata McGraw Hill.
e-Resources:
1) https://nptel.ac.in/courses/106/106/106106094/
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
L T P C
II Year – I Semester
0 0 3 1.5
OBJECT ORIENTED PROGRAMMING THROUGH C++ LAB
Course Objectives:
The objective of this lab is to
Course Outcomes:
By the end of this lab the student is able to
1. Write a main function to create objects of DISTANCE class. Input two distances and
output the sum.
2. Write a C++ Program to illustrate the use of Constructors and Destructors (use the
above program.)
3. Write a program for illustrating function overloading in adding the distance between
objects (use the above problem)
Exercise – 2 (Access)
Write a program for illustrating Access Specifiers public, private, protected
Exercise -4 (Inheritance)
Exercise -6
1. Write a C++ program illustrating user defined string processing functions using
pointers (string length, string copy, string concatenation)
2. Write a C++ program illustrating Virtual classes & virtual functions.
3. Write C++ program that implement Bubble sort, to sort a given list of integers in
ascending order
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
L T P C
II Year – I Semester
0 0 3 1.5
OPERATING SYSTEM LAB
Course Objectives:
x To understand the design aspects of operating system
x To study the process management concepts & Techniques
x To study the storage management concepts
x To familiarize students with the Linux environment
x To learn the fundamentals of shell scripting/programming
Course Outcomes:
x To use Unix utilities and perform basic shell control of the utilities
x To use the Unix file system and file access control
x To use of an operating system to develop software
x Students will be able to use Linux environment efficiently
x Solve problems using bash for shell scripting
1) a) Study of Unix/Linux general purpose utility command list: man,who,cat, cd, cp, ps,
ls, mv, rm, mkdir, rmdir, echo, more, date, time, kill, history, chmod, chown, finger,
pwd, cal, logout, shutdown.
b) Study of vi editor
c) Study of Bash shell, Bourne shell and C shell in Unix/Linux operating system
d) Study of Unix/Linux file system (tree structure)
e) Study of .bashrc, /etc/bashrc and Environment variables.
2) Write a C program that makes a copy of a file using standard I/O, and system calls
3) Write a C program to emulate the UNIX ls –l command.
4) Write a C program that illustrates how to execute two commands concurrently with a
command pipe. Ex: - ls –l | sort
5) Simulate the following CPU scheduling algorithms:
(a) Round Robin (b) SJF (c) FCFS (d) Priority
6) Multiprogramming-Memory management-Implementation of fork (), wait (), exec()
and exit (), System calls
7) Simulate the following:
a) Multiprogramming with a fixed number of tasks (MFT)
b) Multiprogramming with a variable number of tasks (MVT)
8) Simulate Bankers Algorithm for Dead Lock Avoidance
9) Simulate Bankers Algorithm for Dead Lock Prevention.
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
12) Write a C program that illustrates two processes communicating using shared
memory
14) Write C program to create a thread using pthreads library and let it run its function.
15) Write a C program to illustrate concurrent execution of threads using pthreads library.
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
L T P C
II Year – I Semester
0 0 3 1.5
SOFTWARE ENGINEERING LAB
Course Objectives:
The objective of this lab is to acquire the generic software development skill through various
stages of software life cycle and also to ensure the quality of software through software
development with various protocol based environment
Course Outcomes:
x By the end of this lab the student is able to elicit, analyze and specify software
requirements through a productive working relationship with various stakeholders of
the project
x prepare SRS document, design document, test cases and software configuration
management and risk management related document.
x develop function oriented and object oriented software design using tools like rational
rose.
x use modern engineering tools necessary for software project management,
estimations, time management and software reuse
x generate test cases for software testing
4) Stock Maintenance
9) Design the test cases for a Mobile Application (Consider any example from Appstore)
L T P C
II Year - I Semester Skill Oriented Course- I
0 0 4 2
APPLICATIONS OF PYTHON-NumPy
Course Objectives:
The objective of this lab is to acquire programming skills in Python package NumPy and
perform mathematical and statistical operations.
Course Outcomes:
L T P C
II Year - I Semester Skill Oriented Course- I
0 0 4 2
WEB APPLICATION DEVELOPMENT USING FULL STACK
Frontend Development – Module -I
Course Objectives:
The objective of this lab is to provide understanding about the core concepts of frontend
programming for web application
Course Outcomes:
By the end of this lab the student is able to
x Analyze a web page and identify its elements and attributes.
x Demonstrate the important HTML tags for designing static pages and separate design
from content using Cascading Style sheet
x Implement MVC and responsive design to scale well across PC, tablet and Mobile
Phone
x Create web pages using HTML and Cascading Style Sheets.
A) HTML
1) Introduction to HTML
2) Browsers and HTML
3) Editor’s Offline and Online
4) Tags, Attribute and Elements
5) Doctype Element
6) Comments
7) Headings, Paragraphs, and Formatting Text
8) Lists and Links
9) Images and Tables
B) CSS
1) Introduction CSS
2) Applying CSS to HTML
3) Selectors, Properties and Values
4) CSS Colors and Backgrounds
5) CSS Box Model
6) CSS Margins, Padding, and Borders
7) CSS Text and Font Properties
8) CSS General Topics
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
L T P C
II Year - I Semester
2 0 0 0
CONSTITUTION OF INDIA
Course Objectives:
x To Enable the student to understand the importance of constitution
x To understand the structure of executive, legislature and judiciary
x To understand philosophy of fundamental rights and duties
x To understand the autonomous nature of constitutional bodies like Supreme Court and
high court controller and auditor general of India and election commission of India.
x To understand the central and state relation financial and administrative
Course Outcomes:
At the end of the course, the student will be able to have a clear knowledge on the following:
x Understand historical background of the constitution making and its importance for
building a democratic India.
x Understand the functioning of three wings of the government ie., executive,
legislative and judiciary.
x Understand the value of the fundamental rights and duties for becoming good citizen
of India.
x Analyze the decentralization of power between central, state and local self-
government.
x Apply the knowledge in strengthening of the constitutional institutions like CAG,
Election Commission and UPSC for sustaining democracy.
1. Know the sources, features and principles of Indian Constitution.
2. Learn about Union Government, State government and its administration.
3. Get acquainted with Local administration and Pachayati Raj.
4. Be aware of basic concepts and developments of Human Rights.
5. Gain knowledge on roles and functioning of Election Commission
UNIT I
Introduction to Indian Constitution: Constitution meaning of the term, Indian Constitution -
Sources and constitutional history, Features - Citizenship, Preamble, Fundamental Rights and
Duties, Directive Principles of State Policy.
UNIT II
Union Government and its Administration Structure of the Indian Union: Federalism, Centre-
State relationship, President: Role, power and position, PM and Council of ministers, Cabinet
and Central Secretariat, LokSabha, RajyaSabha, The Supreme Court and High Court: Powers
and Functions;
UNIT III
State Government and its Administration Governor - Role and Position - CM and Council of
ministers, State Secretariat: Organisation, Structure and Functions
UNIT IV
A.Local Administration - District’s Administration Head - Role and Importance,
Municipalities - Mayor and role of Elected Representative - CEO of Municipal Corporation
PachayatiRaj: Functions PRI: ZilaPanchayat, Elected officials and their roles, CEO
ZilaPanchayat: Block level Organizational Hierarchy - (Different departments), Village level
- Role of Elected and Appointed officials - Importance of grass root democracy
UNIT V
Election Commission: Election Commission- Role of Chief Election Commissioner and
Election Commissionerate State Election Commission:, Functions of Commissions for the
welfare of SC/ST/OBC and women
Learning outcomes: After completion of this unit student will
• Know the role of Election Commission apply knowledge
• Contrast and compare the role of Chief Election commissioner and
Commissiononerate
• Analyze role of state election commission
• Evaluate various commissions of viz SC/ST/OBC and women
R-20 Syllabus for CSE, JNTUK w. e. f. 2020 – 21
References:
1) Durga Das Basu, Introduction to the Constitution of India, Prentice Hall of India Pvt.
Ltd.
2) SubashKashyap, Indian Constitution, National Book Trust
3) J.A. Siwach, Dynamics of Indian Government & Politics
4) D.C. Gupta, Indian Government and Politics
5) H.M.Sreevai, Constitutional Law of India, 4th edition in 3 volumes (Universal Law
Publication)
6) J.C. Johari, Indian Government andPolitics Hans
7) J. Raj IndianGovernment and Politics
8) M.V. Pylee, Indian Constitution Durga Das Basu, Human Rights in Constitutional Law,
Prentice – Hall of India Pvt. Ltd.. New Delhi
9) Noorani, A.G., (South Asia Human Rights Documentation Centre), Challenges to Civil
Right), Challenges to Civil Rights Guarantees in India, Oxford University Press 2012
e-Resources:
1) nptel.ac.in/courses/109104074/8
2) nptel.ac.in/courses/109104045/
3) nptel.ac.in/courses/101104065/
4) www.hss.iitb.ac.in/en/lecture-details
5) www.iitb.ac.in/en/event/2nd-lecture-institute-lecture-series-indian-constitution