ACE

Engineering College
Ankushapur, Ghatkesar, Medchal, Hyderabad–501 301,T.S.
(An Autonomous Institution)

Department of CSE (Data Science)

Applicable from 2022-23 Admitted Batch

II YEAR I SEMESTER(R22)

Course
S. No. Course L T P Credits
Code
1 EC301ES Electronic Devices and Circuits 2 0 0 2
2 CS302PC Data Structures 3 0 0 3
3 MA303BS Computer Oriented Statistical Methods 3 1 0 4
Computer Organization
4 CS304PC 3 0 0 3
andArchitecture
Object Oriented Programming
5 CS305PC 3 0 0 3
through Java
Elements of Computer Science&
6 CS306PC 1 0 0 1
Engineering

7 CS307PC Data Structures Lab 0 0 3 1.5

Object Oriented Programming

8 CS308PC 0 0 3 1.5
through Java Lab

Data visualization - R
9 CS310PC 0 0 2 1
Programming/ Power BI

10 *MC310 Gender Sensitization Lab 0 0 2 0

11 *MC312 Advanced Python Programming 3 0 0 0

Total 18 1 10 20

1
Course Code:- EC301ES ELECTRONIC DEVICES AND CIRCUITS

B. Tech. II Year I Sem. L T P C

2 0 0 2
Course Objectives:

1. To introduce components such as diodes, BJTs and FETs.

2. To know the applications of devices.
3. To know the switching characteristics of devices.

Course Outcomes: Upon completion of the Course, the students will be able to:

1. Acquire the knowledge of various electronic devices and their use on real life.
2. Know the applications of various devices.
3. Acquire the knowledge about the role of special purpose devices and their applications.

Course PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 1 2 - - 1 1 - - - - 1
CO2 3 2 3 - - 2 1 - - - - 1
CO3 3 3 3 - - 2 1 - - - - 1

UNIT - I
Diodes: Diode - Static and Dynamic resistances, Equivalent circuit, Diffusion and Transition
Capacitances, V-I Characteristics, Diode as a switch- switching times.

UNIT - II
Diode Applications: Rectifier - Half Wave Rectifier, Full Wave Rectifier, Bridge Rectifier,
Rectifiers with Capacitive and Inductive Filters, Clippers-Clipping at two independent levels,
Clamper-Clamping Circuit Theorem, Clamping Operation, Types of Clampers.

UNIT - III
Bipolar Junction Transistor (BJT): Principle of Operation, Common Emitter, Common Base
and Common Collector Configurations, Transistor as a switch, switching times,

UNIT - IV
Junction Field Effect Transistor (FET): Construction, Principle of Operation, Pinch-Off
Voltage, Volt- Ampere Characteristic, Comparison of BJT and FET, FET as Voltage Variable
Resistor, MOSFET, MOSTET as a capacitor.

UNIT – V
Special Purpose Devices: Zener Diode - Characteristics, Zener diode as Voltage Regulator,
Principle of Operation - SCR, Tunnel diode, UJT, Varactor Diode, Photo diode, Solar cell,
LED,Schottky diode.

2
TEXT BOOKS:
1. Jacob Millman - Electronic Devices and Circuits, McGraw Hill Education
2. Robert L. Boylestead, Louis Nashelsky- Electronic Devices and Circuits theory, 11th
Edition, 2009,Pearson.

REFERENCE BOOKS:
1. Horowitz -Electronic Devices and Circuits, David A. Bell – 5thEdition, Oxford.
2. Chinmoy Saha, Arindam Halder, Debaati Ganguly - Basic Electronics-Principles and
Applications,Cambridge, 2018.

3
 CS302PC: DATA STRUCTURES
B.Tech. II Year I Semester

Maximum
Hours/Week Credits
Course Code Category Marks

L T P C CIA SEE Total

CS302PC PCC
3 0 0 3 30 70 100

Contact Classes: 45 Tutorial

Practical Classes: Nil Total Classes: 60
Classes:15
Prerequisite: A course on “Programming for Problem Solving”.

Course Objectives:

 Exploring basic data structures such as stacks and queues.

 Introduces a variety of data structures such as hash tables, search trees, tries,
heaps, graphs.
 Introduces sorting and pattern matching algorithms
Course Outcomes:

 Ability to select the data structures that efficiently model the information in a
problem.
 Ability to assess efficiency trade-offs among different data structure
implementations or combinations.
 Implement and know the application of algorithms for sorting and pattern
matching.
 Design programs using a variety of data structures, including hash tables,
binary and general tree structures, search trees, tries, heaps, graphs, and
AVL-trees.
Unit -1 No. of Classes: 12
Introduction to Data Structures
Abstract data types, Linear list – singly linked list implementation, insertion,
deletion and searching operations on linear list, Stacks-Operations, linked list
representations of stacks, stack applications, Queues-operations, linked list
representations of Queue.
Unit -2 No. of Classes: 12
Dictionaries & Hash Table Representation
Linear list representation, skip list representation, operations - insertion,
deletion and searching.
Hash functions, collision resolution-separate chaining, open addressing-linear
probing, quadratic probing, double hashing, rehashing, extendible hashing.
Unit -3 No. of Classes: 12
Search Trees:
Binary Search Trees, Definition, I mplementation, Operations- Searching,
Insertion and Deletion, AVL Trees, Definition, Height of an AVL Tree,
Operations – Insertion, Deletion and Searching, Red –Black, Splay Trees.

4
 Unit -4 No. of Classes: 12
Graphs & Sorting
Implementation Methods. Graph Traversal Methods.

Heap Sort, External Sorting- Model for external sorting, Merge Sort.

Unit -5 No. of Classes: 12

Pattern Matching and Tries
Pattern matching algorithms -Brute force, the Boyer –Moore algorithm,
the Knuth-Morris-Pratt algorithm, Standard Tries, Compressed Tries,
Suffix
tries.
Text Books:
1. Fundamentals of Data Structures in C, 2ndEdition, E. Horowitz, S. Sahni
and Susan Anderson Freed, Universities Press.

2. Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M.J.

Augenstein, PHI/Pearson Education.

Reference Books:
1. Data Structures: A Pseudo code Approach with C, 2ndEdition, R. F.
Gilberg and B.A. Forouzan, CengageLearning.
Web References:

E-Text Books:

5
 Course Code: - MA303BS COMPUTER ORIENTED STATISTICAL METHODS
B.Tech. II Year I Sem. L T P C

3 1 0 4
Pre-requisites: Mathematics courses of first year of study.

Course Objectives: To learn

1. The theory of Probability, and probability distributions of single and multiple

random variables
2. Identify the types of data (qualitative, quantitative, discrete, and continuous)
3. Identify the types of sampling (random, stratified, systematic, cluster).
4. The sampling theory and testing of hypothesis and making inferences
5. Stochastic process and Markov chains.

Course outcomes: After learning the contents of this paper the student must be able to
1. Apply the concepts of probability and distributions to case studies.
2. Formulate and solve problems involving random variables and apply statistical
methods for analyzing experimental data.
3. Calculate mean, proportions and variances of sampling distributions and to make
important decisions s for few samples which are taken from a large data
4. Apply concept of estimation and testing of hypothesis to case studies.
5. Correlate the concepts of one unit to the concepts in other units.
UNIT - I: Probability 10 L
Probability: Sample Space, Events, Counting Sample Points, Probability of an Event,
Additive Rule, Conditional Probability, Independence, and the Product Rule, Bayes’
Rule. Random Variables and Probability Distributions: Concept of a Random
Variable, Discrete Probability Distributions, Continuous Probability Distributions,

UNIT - II: Expectation and discrete distributions 10 L

Mean of a Random Variable, Variance and Covariance of Random Variables, Means and
Variances of Linear Combinations of Random Variables, Chebyshev’s Theorem.
Discrete Probability Distributions: Binomial Distribution, Poisson distribution.

UNIT - III: Continuous and Sampling Distributions 10 L

Uniform Distribution, Normal Distribution, Areas under the Normal Curve, Applications
of the Normal Distribution, Normal Approximation to the Binomial Distributions.

Fundamental Sampling Distributions: Random Sampling, Some Important Statistics,

Sampling Distributions, Sampling Distribution of Means and the Central Limit Theorem, t -
Distribution, F – Distribution.

6
UNIT - IV: Sample Estimation & Tests of Hypotheses 10 L
Introduction, Statistical Inference, Classical Methods of Estimation, Single Sample:
Estimating the mean, standard error of a point estimate, prediction interval. Two sample:
Estimating the difference between two means, Single sample: Estimating a proportion,
Two samples: Estimating the difference between two proportions, Two samples:
Estimating theratio of two variances.
Statistical Hypotheses: General Concepts, Testing a Statistical Hypothesis, Single sample:
Tests concerning a single mean, Two samples: tests on two means, One sample: test on a
single proportion. Two samples: tests on two proportions, Two- sample tests concerning
variances.

UNIT-V: Stochastic Processes and Markov Chains 8L

Introduction to Stochastic processes- Markov process. Transition Probability, Transition
Probability Matrix, First order and Higher order Markov process, n-step transition
probabilities, Markov chain, Steady state condition, Markov analysis.

TEXT BOOKS:
1. Ronald E. Walpole, Raymond H. Myers, Sharon L. Myers, Keying Ye, Probability &
Statistics For Engineers & Scientists, 9th Ed. Pearson Publishers.
2. S C Gupta and V K Kapoor, Fundamentals of Mathematical statistics, Khanna
publications.
3. S.D.Sharma, Operations Research, Kedarnath and Ramnath Publishers, Meerut, Delhi.

REFERENCE BOOKS:
1. T.T. Soong, Fundamentals of Probability and Statistics For Engineers, John Wiley &
Sons,Ltd, 2004.
2. Sheldon M Ross, Probability and statistics for Engineers and scientists, academic press.
3. Miller and Freund’s, Probability and Statistics for Engineers, 8th Edition,
Pearson Educations

7
Course Code: - CS304PC COMPUTER ORGANIZATION AND ARCHITECTURE

B.Tech. II Year I Sem. L T P C

3 0 0 3
Co-requisite: A Course on “Digital Electronics”.

Course Objectives
• The purpose of the course is to introduce principles of computer
organization and the basic architectural concepts.
• It begins with basic organization, design, and programming of a simple
digital computer and introduces simple register transfer language to specify
various computer operations.
• Topics include computer arithmetic, instruction set design,
microprogrammed control unit, pipelining and vector processing,
memoryorganization and I/O systems, and multiprocessors

Course Outcomes
 Understand the basics of instruction sets and their impact on processor design.
 Demonstrate an understanding of the design of the functional units of a digital
computer system.
 Evaluate cost performance and design trade-offs in designing and
constructing a computer processor including memory.
 Design a pipeline for consistent execution of instructions with minimum
hazards.
 Recognize and manipulate representations of numbers stored in digital
computers

UNIT - I
Digital Computers: Introduction, Block diagram of Digital Computer, Definition of
Computer Organization, Computer Design and Computer Architecture.
Register Transfer Language and Micro operations: Register Transfer language, Register
Transfer, Bus and memory transfers, Arithmetic Micro operations, logic micro
operations,shift micro operations, Arithmetic logic shift unit.
Basic Computer Organization and Design: Instruction codes, Computer Registers
Computer instructions, Timing and Control, Instruction cycle, Memory Reference
Instructions, input – Output and Interrupt.

UNIT - II
Micro programmed Control: Control memory, Address sequencing, micro program
example, design of control unit.
Central Processing Unit: General Register Organization, Instruction Formats,
Addressing modes, Data Transfer and Manipulation, Program Control.

8
UNIT - III
Data Representation: Data types, Complements, Fixed Point Representation, Floating
Point Representation.
Computer Arithmetic: Addition and subtraction, multiplication Algorithms, Division
Algorithms, Floating point Arithmetic operations. Decimal Arithmetic unit, Decimal
Arithmetic operations.

UNIT - IV
Input-Output Organization: Input-Output Interface, Asynchronous data transfer,
Modes of Transfer, Priority Interrupt Direct memory Access.
Memory Organization: Memory Hierarchy, Main Memory, Auxiliary memory, Associate
Memory, Cache Memory.

UNIT - V
Reduced Instruction Set Computer: CISC Characteristics, RISC Characteristics. Pipeline
and Vector Processing: Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction
Pipeline, RISC Pipeline, Vector Processing, Array Processor. Multi Processors:
Characteristics of Multiprocessors, Interconnection Structures, inter processor bit
ration, Inter processor communication and synchronization, Cache Coherence.

TEXT BOOK:
1. Computer System Architecture – M. Morris Mano, Third Edition, Pearson/PHI.

REFERENCE BOOKS:
1. Computer Organization – Carl Hamacher, Zvonks Vranesic, SafeaZaky, V th
Edition,McGrawHill.
2. Computer Organization and Architecture – William Stallings Sixth Edition,
Pearson/PHI.
3. Structured Computer Organization – Andrew S. Tanenbaum, 4 th Edition,
PHI/Pearson.

9
 Course Code:- CS305PC OBJECT ORIENTED PROGRAMMING THROUGH JAVA

B.Tech. II Year I Sem. L T P C

3 0 0 3
Course Objectives

o To Understand the basic object-oriented programming concepts and apply

them in problem-solving.
o To Illustrate inheritance concepts for reusing the program.
o To Demonstrate multitasking by using multiple threads and event handling
o To Develop data-centric applications using JDBC.
o To Understand the basics of java console and GUI based programming
Course Outcomes
o Demonstrate the behavior of programs involving the basic programming
constructs like control structures, constructors, string handling and
garbagecollection.
o Demonstrate the implementation of inheritance (multilevel, hierarchical and
multiple) by using extend and implement keywords
o Use multithreading concepts to develop inter process communication.
o Understand the process of graphical user interface design and implementation
using AWT or swings.
o Develop applets that interact abundantly with the client environment and
deploy on the server.

UNIT - I
Object oriented thinking and Java Basics- Need for oop paradigm, summary of oop
concepts, coping with complexity, abstraction mechanisms. A way of viewing world – Agents,
responsibility, messages, methods, History of Java, Java buzzwords, data types, variables,
scope and lifetime of variables, arrays, operators, expressions, control statements, type
conversion and casting, simple java program, concepts of classes, objects, constructors,
methods, access control, this keyword, garbage collection, overloading methods and
constructors, method binding, inheritance, overriding and exceptions, parameter passing,
recursion, nested and inner classes, exploring string class.
UNIT - II
Inheritance, Packages and Interfaces – Hierarchical abstractions, Base class object,
subclass, subtype, substitutability, forms of inheritance specialization, specification,
construction, extension, limitation, combination, benefits of inheritance, costs of inheritance.
Member access rules, super uses, using final with inheritance, polymorphism- method
overriding, abstract classes, the Object class. Defining, Creating and Accessing a Package,

10
Understanding CLASSPATH, importing packages, differences between classes and interfaces,
defining an interface, implementing interface, applying interfaces, variables in interface and
extending interfaces. Exploring java.io.

UNIT - III
Exception handling and Multithreading-- Concepts of exception handling, benefits of
exception handling, Termination or resumptive models, exception hierarchy, usage of try,
catch, throw, throws and finally, built in exceptions, creating own exception subclasses. String
handling, Exploring java. util. Differences between multithreading and multitasking, thread
life cycle, creating threads, thread priorities, synchronizing threads, inter thread
communication, thread groups, daemon threads. Enumerations, auto boxing, annotations,
generics.

UNIT - IV
Event Handling: Events, Event sources, Event classes, Event Listeners, Delegation event
model, handling mouse and keyboard events, Adapter classes. The AWT class hierarchy, user
interface components- labels, button, canvas, scrollbars, text components, check box, checkbox
groups, choices, lists panels – scroll pane, dialogs, menu bar, graphics, layout manager –
layoutmanager types – border, grid, flow, card and grid bag.
UNIT - V
Applets – Concepts of Applets, differences between applets and applications, life cycle of an
applet, types of applets, creating applets, passing parameters to applets. Swing – Introduction,
limitations of AWT, MVC architecture, components, containers, exploring swing- J Applet, J
Frame and J Component, Icons and Labels, text fields, buttons – The J Button class, Check
boxes, Radio buttons, Combo boxes, Tabbed Panes, Scroll Panes, Trees, and Tables.

TEXT BOOKS:
1. Java the complete reference, 7th edition, Herbert schildt, TMH.
2. Understanding OOP with Java, updated edition, T. Budd, Pearson education.

REFERENCE BOOKS:
1. An Introduction to programming and OO design using Java, J.Nino and F.A. Hosch,
John wiley& sons.
2. An Introduction to OOP, third edition, T. Budd, Pearson education.
3. Introduction to Java programming, Y. Daniel Liang, Pearson education.
4. An introduction to Java programming and object-oriented application development,
R.A.Johnson- Thomson.

11
5. Core Java 2, Vol 1, Fundamentals, Cay.S. Horstmann and Gary Cornell, eighth
Edition, Pearson Education.
6. Core Java 2, Vol 2, Advanced Features, Cay.S. Horstmann and Gary Cornell, eighth
Edition, Pearson Education
7. Object Oriented Programming with Java, R.Buyya, S.T.Selvi, X.Chu, TMH.
8. Java and Object Orientation, an introduction, John Hunt, second edition, Springer. 9.
Maurach’s Beginning Java2 JDK 5, SPD.

12
Course Code: - CS306PC ELEMENTS OF COMPUTER SCIENCE AND ENGINEERING

B.Tech. II Year I Sem. L T P C

1 0 0 1
Course Objective: To provide an overview of the subjects of computer science and engineering.

Course Outcomes:
1. Know the working principles of functional units of a basic Computer
2. Understand program development, the use of data structures and algorithms in
problem solving.
3. Know the need and types of operating system, database systems.
4. Understand the significance of networks, internet, WWW and cyber security.
5. Understand Autonomous systems, the application of artificial intelligence.

UNIT – I
Basics of a Computer – Hardware, Software, Generations of computers. Hardware -
functional units, Components of CPU, Memory – hierarchy, types of memory, Input and
output devices. Software – systems software, application software, packages, frameworks,
IDEs.

UNIT – II
Software development – waterfall model, Agile, Types of computer languages –
Programming, mark up, scripting Program Development – steps in program development,
flowcharts, algorithms, data structures – definition, types of data structures

UNIT – III
Operating systems: Functions of operating systems, types of operating systems, Device &
Resource management
Database Management Systems: Data models, RDBMS, SQL, Database Transactions, data
centers, cloud services

UNIT – IV
Computer Networks: Advantages of computer networks, LAN, WAN, MAN, internet, WiFi,
sensor networks, vehicular networks, 5G communication.
World Wide Web – Basics, role of HTML, CSS, XML, Tools for web designing, Social media,
Online social networks.
Security – information security, cyber security, cyber laws

UNIT – V
Autonomous Systems: IoT, Robotics, Drones, Artificial Intelligence – Learning, Game
Development, natural language processing, image and video processing.
Cloud Basics

13
TEXT BOOK:
1. Invitation to Computer Science, G. Michael Schneider, Macalester College, Judith L.
Gers ting University of Hawaii, Hilo, Contributing author: Keith Miller University of
Illinois, Springfield.

REFERENCE BOOKS:
1. Fundamentals of Computers, Reema Thareja, Oxford Higher Education, Oxford University Press.
2. Introduction to computers, Peter Norton, 8th Edition, Tata McGraw Hill.
3. Computer Fundamentals, Anita Goel, Pearson Education India, 2010.
4. Elements of computer science, Cengage.

14
Course Code: -CS307PC DATA STRUCTURES LAB

B.Tech. II Year I Sem. L T P C

0 0 3 1.5
Prerequisites: A Course on “Programming for problem solving”.

Course Objectives:
● It covers various concepts of C programming language
● It introduces searching and sorting algorithms
● It provides an understanding of data structures such as stacks and queues.

List of Experiments:
1. Write a program that uses functions to perform the following operations on
singly linked list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
2. Write a program that uses functions to perform the following operations on
doubly linked list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
3. Write a program that uses functions to perform the following operations on
circular linked list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
4. Write a program that implement stack (its operations) using
i) Arrays ii) Pointers
5. Write a program that implement Queue (its operations) using
i) Arrays ii) Pointers
6. Write a program that implements the following sorting methods to sort a given list
of integersin ascending order
i) Bubble sort ii) Selection sort iii) Insertion sort
7. Write a program that use both recursive and nonrecursive functions to perform the
following searching operations for a Key value in a given list of integers:
i) Linear search ii) Binary search
8. Write a program to implement the tree traversal methods.
9. Write a program to implement the graph traversal methods.

List of Equipment/Software (with Specifications or Range) Required:

A Computer System with Ubuntu operating system and GCC Compiler

15
Course Code: - CS308 PC OBJECT ORIENTED PROGRAMMING THROUGH JAVA
LAB
B.Tech. II Year I Sem. L T P C

0 0 3 1.5
Course Objectives:

 To write programs using abstract classes.

 To write programs for solving real world problems using the java collection
framework.
 To write multithreaded programs.
 To write GUI programs using swing controls in Java.
 To introduce java compiler and eclipse platform.
 To impart hands-on experience with java programming.
Course Outcomes:
 Able to write programs for solving real world problems using the java collection
framework.
 Able to write programs using abstract classes.
 Able to write multithreaded programs.
 Able to write GUI programs using swing controls in Java.

Note:
1. Use LINUX and MySQL for the Lab Experiments. Though not mandatory, encourage the
useof the Eclipse platform.

2.The list suggests the minimum program set. Hence, the concerned staff is requested to
addmore problems to the list as needed.
List of Experiments:
1. Use Eclipse or Net bean platform and acquaint yourself with the various menus. Create
a test project, add a test class, and run it. See how you can use auto suggestions, auto
fill. Try code formatter and code refactoring like renaming variables, methods, and
classes. Try debug step by step with a small program of about 10 to 15 lines which
contains at least one if else condition and a for loop.
2. Write a Java program to create an abstract class named Shape that contains two
integers and an empty method named print Area (). Provide three classes named
Rectangle, Triangle, and Circle such that each one of the classes extends the class
Shape. Each one of the classes contains only the method print Area () that prints the
area of the given shape.
3. A) Write a Java program to list all the files in a directory including the files present in
all its subdirectories.
B) Write a Java program on Random Access File class to perform different read and
write operations.
4. Write a Java program that implements a multi-thread application that has three
threads. First thread generates a random integer every 1 second and if the value is
even, the second thread computes the square of the number and prints. If the value is
odd, the third thread will print the value of the cube of the number.
16
 5. A) Write a Java program that correctly implements the producer – consumer problem
using the concept of inter thread communication.
B) Write a Java program to synchronize the threads acting on the same object.
[Consider the example of any reservations like railway, bus, movie ticket booking,
etc.]
6. A) Develop an applet in Java that displays a simple message.
B) Develop an applet in Java that receives an integer in one text field, and
computes its
Factorial Value and returns it in another text field, when the button named “Compute” is
clicked.
7. Write a Java program that works as a simple calculator. Use a grid layout to arrange
buttons for
The digits and for the +, -,*, % operations. Add a text field to display the result. Handle
any possible exceptions like divided by zero.
8. Write a Java program that simulates a traffic light. The program lets the user select one
of three lights: red, yellow, or green with radio buttons. On selecting a button, an
appropriate message with “Stop” or “Ready” or “Go” should appear above the buttons
in the selected color. Initially, there is no message shown.
9. Write a Java program that creates a user interface to perform integer divisions. The
user enters two numbers in the text fields, Num1 and Num2. The division of Num1 and
Num 2 is displayed in the Result field when the Divide button is clicked. If Num1 or
Num2 were not an integer, the program would throw a Number Format Exception. If
Num2 were Zero, the program would throw an Arithmetic Exception. Display the
exception in a message dialog box.
10. Write a Java program that handles all mouse events and shows the event name at the
center of the window when a mouse event is fired (Use Adapter classes).
11. Suppose that a table named Table.txt is stored in a text file. The first line in the file is
the header, and the remaining lines correspond to rows in the table. The elements
are separated by commas. Write a java program to display the table using Labels in
Grid Layout.
12. Write a Java program that loads names and phone numbers from a text file where the
data is organized as one line per record and each field in a record are separated by a
tab (\t). It takes a name or phone number as input and prints the corresponding other
value from the hash table (hint: use hash tables).
13. Write a Java program for the following:
Create a doubly linked list of elements. Delete a given element from the above list.
Display the contents of the list after deletion.
14. Write a program to perform CRUD operations on the student table in a database
using JDBC.
REFERENCE BOOKS:
1. Java for Programmers, P. J. Deitel and H. M. Deitel, 10th Edition Pearson education.
2. Thinking in Java, Bruce Eckel, Pearson Education.
3. Java Programming, D. S. Malik and P. S. Nair, Cengage Learning.
4. Core Java, Volume 1, 9th edition, Cay S. Horstmann and G Cornell, Pearson.

17
Course Code: - CS310PC DATA VISUALIZATION - R PROGRAMMING/ POWER BI

B.Tech. II Year I Sem. L T P C

0 0 2 1
Course Objectives:

● Effective use of Business Intelligence (BI) technology (Tableau) to apply data visualization
● To discern patterns and relationships in the data.
● To build Dashboard applications.
● To communicate the results clearly and concisely.
● To be able to work with different formats of data sets.

Course Outcomes: At the end of the course a student should be able to

● Understand How to import data into Tableau.

● Understand Tableau concepts of Dimensions and Measures.
● Develop Programs and understand how to map Visual Layouts and Graphical Properties.
● Create a Dashboard that links multiple visualizations.
● Use graphical user interfaces to create Frames for providing solutions to
real world problems.

Lab Problems:
1. Understanding Data, What is data, where to find data, Foundations for building Data
Visualizations, Creating Your First visualization?

2.Getting started with Tableau Software using Data file formats, connecting your Data to
Tableau, creating basic charts (line, bar charts, Tree maps), Using the Show me panel.

3.Tableau Calculations, Overview of SUM, AVR, and Aggregate features, Creating custom
calculations and fields.

4.Applying new data calculations to your visualizations, Formatting Visualizations,

Formatting Tools and Menus, Formatting specific parts of the view.

5. Editing and Formatting Axes, Manipulating Data in Tableau data, Pivoting Tableau data.

6. Structuring your data, Sorting and filtering Tableau data, Pivoting Tableau data.

7. Advanced Visualization Tools: Using Filters, Using the Detail panel, using the Size panels,
customizing filters, Using and Customizing tooltips, Formatting your data with colors.

8.Creating Dashboards & Storytelling, creating your first dashboard and Story, Design
for different displays, adding interactivity to your Dashboard, Distributing &
Publishingyour Visualization.

18
9. Tableau file types, publishing to Tableau Online, Sharing your visualizations, printing, and
Exporting.

10. Creating custom charts, cyclical data and circular area charts, Dual Axis charts.

REFERENCE BOOKS:
1. Microsoft Power BI cookbook, Brett Powell, 2nd edition.
2. R Programming for Data Science by Roger D. Peng (References)
3. The Art of R Programming by Norman Matloff Cengage Learning India.

19
Course Code: -*MC310 GENDER SENSITIZATION LAB

B.Tech. II Year I Sem. L T P C

0 0 2 0
COURSE OBJECTIVE:
 To develop students’ sensibility with regard to issues of gender in contemporary
India.
 To provide a critical perspective on the socialization of men and women.
 To introduce students to information about some key biological aspects of genders.
 To expose the students to debates on the politics and economics of work.
 To help students reflect critically on gender violence and to expose students to
more egalitarian interactions between men and women

COURSE OUTCOME: Upon completion of the course, students will be able to:
 Students will have developed a better understanding of important issues related
to gender in contemporary India.
 Students will be sensitized to basic dimensions of the biological, sociological,
psychological and legal aspects of gender. This will be achieved through
discussion of materials derived from research, facts, everyday life, literature and
film.
 Students will attain a finer grasp of how gender discrimination works in our
society and how to counter it.
 Students will acquire insight into the gendered division of labor and its relation
to politics and economics.
 Men and women students and professionals will be better equipped to work and
live together as equals. Students will develop a sense of appreciation of women
in all walks of life.

Unit-I: UNDERSTANDING GENDER

Introduction: Definition of Gender-Basic Gender Concepts and Terminology-Exploring
Attitudes towards Gender-Construction of Gender-Socialization: Making Women, Making
Men - Preparing for Womanhood. Growing up Male. First lessons in Caste

Unit – II: GENDER ROLES AND RELATIONS

Two or Many? -Struggles with Discrimination-Gender Roles and Relations-Types of Gender
Roles Gender Roles and Relationships Matrix-Missing Women-Sex Selection and Its
Consequences Declining Sex Ratio. Demographic Consequences-Gender Spectrum: Beyond
the Binary

Unit – III: GENDER AND LABOUR

Division and Valuation of Labour -Housework: The Invisible Labor- “My Mother Doesn’t
Work.” “Share the Load.”-Work: Its Politics and Economics -Fact and Fiction.
Unrecognized and Unaccounted work. -Gender Development Issues-Gender, Governance
and SustainableDevelopment-Gender and Human Rights-Gender and Mainstreaming

20
 Unit – IV: GENDER - BASED VIOLENCE
The Concept of Violence- Types of Gender-based Violence-Gender-based Violence from a
Human Rights Perspective-Sexual Harassment: Say No! -Sexual Harassment, not Eve-
teasing- Coping with Everyday Harassment- Further Reading: “Chupulu”. Domestic
Violence: Speaking OutIs Home a Safe Place? –When Women Unite [Film]. Rebuilding
Lives.Thinking about Sexual Violence Blaming the Victim-“I Fought for my Life….”

Unit – V: GENDER AND CULTURE

Gender and Film-Gender and Electronic Media-Gender and Advertisement-Gender and
Popular Literature- Gender Development Issues-Gender Issues -Gender Sensitive
Language-Gender and Popular Literature - Just Relationships: Being Together as Equals
Mary Kom and Onler. Love and Acid just do not Mix. Love Letters. Mothers and Fathers.
Rosa Parks The Brave Heart

TEXT BOOK:
1. “Towards a World of Equals: A Bilingual Textbook on Gender” written by A.Suneetha,
Uma Bhrugubanda, DuggiralaVasanta, Rama Melkote, Vasudha Nagaraj, Asma Rasheed,
Gogu Shyamala, Deepa Sreenivas and Susie Tharu published by Telugu Akademi,
Telangana Government in 2015.

ASSESSMENT AND GRADING:

1. Discussion & Classroom Participation: 20%

2. Project/Assignment: 30%
3. End Term Exam: 50%
Note: Classes will consist of a combination of activities: dialogue-based lectures, discussions,
collaborative learning activities, group work and in-class assignments. Apart from the above
prescribed book, Teachers can make use of any authentic materials related to the topics given
in the syllabus on “Gender”

21
 Course Code: *MC312 ADVANCED PYTHON PROGRAMMING
B.Tech. II Year I Sem L T P C

3 0 0 0
Course Objectives
1. To learn how to write relatively advanced, well structured, computer programs in Python.
2. To learn how to develop the ability to write database applications in Python.
3. To learn how to apply understanding of how to manipulate and analyze datasets.
4. To learn how to apply basic statistical analysis.
5. To learn how to effectively visualize statistics.

Course Outcomes
1. To understand how data is stored in different formats.
2. To understand how data is stored across multiple tables and manipulate tables in database
using python.
3. To use Numpy and SciPy for performing complex numerical analysis tasks.
4. To understand data preprocessing techniques on data set using pandas.
5. To produce high quality 2D data visualizations using Matplotlib and seaborn.

UNIT - I
Different Formats of Datasets: Introduction to CSV and Excel, reading and writing data,object
serialization, picked module.

XML: Introduction to XML DOM and SAX, Introducing Element Tree and lxml, Parsing XML,
Navigating the document,
JSON: Introduction to JSON, JSON Vs XML, JSON in python, Serializing and Deserializing JSON
Data Extraction Techniques: Web Scraping with Python.

UNIT - II
Regular Expressions: Concept of regular expression, re-module, using special characters,
Regular Expression Functions, Password, email, url validation using regular expression, Pattern
finding programs using regular expression.
Database Programming: Introduction, Python Database Application Programmer Interface
(DB-API), SQLite, MYSQL, Database Connection using python, Creating, Storing and Reading
information on database, Object Relational Managers (ORMs).

UNIT - III
NumPy: Introduction to NumPy array, Creating and manipulating NumPy arrays, NumPydtype,
Computation on NumPy arrays, Arithmetic with NumPy arrays, Indexing, Slicing, and Sorting
NumPy arrays, Mathematical and Statistical Methods, Reshaping Arrays. SciPy: Installation and
Environment setup, NumPy Vs SciPy, Linear Algebra in SciPy, Working with Polynomials in
SciPy,Integration with SciPy, SciPy special Functions.
UNIT – IV
Pandas: Introduction to Pandas, Series and Data Frames in Pandas, Data Indexing, Selection and
Filtering in Pandas, Selection with loc and iloc Function Application and Mapping, Missing Data,

22
 Filtering and Filling in Missing Data Vectorized String Functions in pandas, Data Transformation
in pandas, Combining and Merging datasets, Merging Joining and Concatenating, Group by,
Grouping with Functions.
UNIT - V
Visualization with Matplotlib and Seaborn – Visualization with Matplotlib, Line Plots, Pie
Chart, Setting the title, axis labels, ticks, and ticklabels, Adding legends, Bar Graph, Histogram,
Box(Whisker) Plot, Scatter Plot, Customizing Plots, Multiple subplots, Plotting with pandas,
seaborn.

TEXT BOOKS:
1. Core Python Programming, Wesley J. Chun, Second Edition, Pearson.
2. Python for Data Analysis, Wes McKinney, O’Reilly Media Edition.

REFERENCE BOOKS:
1. Python Crash Course – A Hands-on, Project-Based Introduction to Programming, Eric
Mathews,2nd Edition, no starch Press.
2. Python in a Nutshell – A Desktop Quick Reference, Alex Martelli, 3rd Edition, Oreilly.
3. Head First Python – A Brain-Friendly Guide, Paul Harry, 2nd Edition, Oreilly.

23