BIKANER TECHNICAL UNIVERSITY, BIKANER

SYLLABUS
OF
B.TECH.

COMPUTER SCIENCE ENGINEERING

(DATA SCIENCE)
Effective From Session: 2020-21

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

 3CSDS2-01: Advanced Engineering Mathematics

SN CONTENTS Hours
Random Variables:
Discrete and Continuous random variables, Joint distribution,
Probability distribution function, conditional distribution. Mathematical Expectations:
1 7
Moments, Moment Generating Functions, variance and correlation coefficients,
Chebyshev’sInequality, Skewness and Kurtosis.
Binomial distribution, Normal Distribution, Poisson Distribution and their relations,
Uniform Distribution, Exponential Distribution. Correlation: Karl Pearson’s
2 5
coefficient, Rank correlation. Curve fitting. Line of Regression.
Historical development, Engineering Applications of Optimization, Formulation
of Design Problems as a Mathematical Programming
3 8
Problems, Classification of Optimization Problems.

Classical Optimization using Differential Calculus: Single Variable and

4 Multivariable Optimization with & without Constraints, Langrangian theory, Kuhn 6
Tucker conditions.
Linear Programming: Simplex method, Two Phase Method and
5 Duality in Linear Programming. Application of Linear Programming: 14
Transportation and Assignment Problems.
TOTAL 40

3CSDS1-02/4CSDS1-02: Technical Communication

SN CONTENTS Hours
Introduction to Technical Communication- Definition of technical
communication, Aspects of technical communication, forms of technical
1 communication, importance of technical communication, technical communication 4
skills (Listening, speaking, writing, reading writing), linguistic ability, style in
technical communication.
Comprehension of Technical Materials/Texts and Information
Design & development- Reading of technical texts, Readingand
comprehending instructions and technical manuals, Interpreting and summarizing
2 technical texts, Note-making. Introduction of different kinds of technical documents, 6
Information collection, factors affecting information and document design,
Strategies for organization, Information design and writing for print and online
media.

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21 2

 Technical Writing, Grammar and Editing- Technical writing
process, forms of technical discourse, Writing, drafts and revising, Basics of
grammar, common error in writing and speaking, Study of advanced grammar,
3 Editing strategies to achieve appropriate technical style, Introduction to advanced 8
technical communication. Planning, drafting and writing Official Notes, Letters, E-
mail, Resume, Job Application, Minutes of Meetings.

Advanced Technical Writing- Technical Reports, types of technical reports,

Characteristics and formatsand structure of technical reports. Technical Project
Proposals, types of technical proposals, Characteristics and formats and structure of
4 technical proposals. Technical Articles, types of technical articles, Writing strategies, 8
structure and formats of technical articles.

TOTAL 26

3CSDS1-03/ 4CSDS1-03: Managerial Economics and Financial Accounting

SN CONTENTS Hours
Basic economic concepts-
Meaning, nature and scope of economics, deductive vs inductive methods,
1 static and dynamics, Economic problems: scarcity and choice, circular flow 4
of economic activity, national income-concepts and measurement.
Demand and Supply analysis-
Demand-types of demand, determinants of demand, demand function, elasticity of
2 demand, demand forecasting –purpose, determinants and methods, Supply- 5
determinants of supply, supply function, elasticity of supply.
Production and Cost analysis-
Theory of production- production function, law of variable
proportions, laws of returns to scale, production optimization, least cost
3 combination of inputs, isoquants. Cost concepts-explicit and implicit cost, fixed and 5
variable cost, opportunity cost, sunk costs, cost function, cost curves, cost and
output decisions, cost estimation.

Market structure and pricing theory-

4 4
Perfect competition, Monopoly, Monopolistic competition, Oligopoly.
Financial statement analysis-
Balance sheet and related concepts, profit and loss statement and related
concepts, financial ratio analysis, cash-flow analysis, funds- flow analysis,
5 8
comparative financial statement, analysis and interpretation of financial statements,
capital budgeting techniques.

TOTAL 26

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

3
 3CSDS3-04: Digital Electronics

SN CONTENTS Hours
Fundamental concepts:
Number systems and codes, Basic logic Gates and Boolean algebra: Sign &
magnitude representation, Fixedpointrepresentation,complement notation, various
1 codes & arithmetic in different codes & their inter conversion. Features of logic 8
algebra, postulates of Boolean algebra. Theorems of Boolean algebra.
Minimization Techniques and Logic Gates:
Principle of Duality - Boolean expression -Minimization of Boolean expressions
2 –– Minterm – Maxterm - Sum of Products (SOP) – Product of Sums (POS) – 8
Karnaugh map Minimization – Don’t care conditions– Quine - McCluskey method
of minimization.
Digital Logic Gate Characteristics:
TTL logic gate characteristics. Theory & operation of TTL NAND gate circuitry.
3 Open collectorTTL. Three stateoutputlogic. TTL subfamilies. MOS& CMOS logic 8
families. Realization of logic gates in RTL, DTL, ECL, C-MOS & MOSFET.

Combinational Circuits:
Combinational logic circuit design, adder, subtract or, BCD adder encoder,
4 8
decoder, BCD to 7-segment decoder, multiplexer demultiplexer.

Sequential Circuits:
Latches, Flip-flops - SR, JK, D, T, and Master-Slave Characteristic table and
equation, counters and their design, Synchronous counters– Synchronous Up/Down
5 8
counters – Programmable counters – State table and statetransition diagram,
sequential circuits design methodology. Registers –shift registers.

TOTAL 40

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

4
 3CSDS4-05: Data Structures and Algorithms

SN CONTENTS Hours
Stacks: Basic Stack Operations, Representation of a Stack using Static Array
and Dynamic Array, Multiple stack implementation using single array, Stack
1 Applications: Reversing list, Factorial Calculation, Infix to postfix Transformation, 8
Evaluating Arithmetic Expressions and Towers of Hanoi.

Queues: Basic Queue Operations, Representation of a Queue using array,

Implementation of Queue Operations using Stack, Applications of Queues-Round
Robin Algorithm. Circular Queues, DeQueue Priority Queues.
Linked Lists: Introduction, single linked list, representation of a linked list in
2 10
memory, Different Operations on a Single linked list, Reversing a single linked list,
Advantages and disadvantages of single linked list, circular linked list, double linked
list and Header linked list.
SearchingTechniques: Sequential and binary search .binarysearch.
Sorting Techniques: Basic concepts, Sorting by: bubble sort, Insertion sort, selection
3 7
sort, quick sort, heap sort, merge sort, radix sort and counting sorting algorithms.

Trees: Definition of tree, Properties of tree, Binary Tree, Representation of Binary

trees using arrays and linked lists, Operations on a Binary Tree, Binary Tree
4 7
Traversals (recursive), Binary search tree, B-tree , B+ tree, AVL tree, Threaded
binary tree.
Graphs: Basic concepts, Different representations of Graphs, Graph Traversals
(BFS & DFS), Minimum Spanning Tree(Prims &Kruskal), Dijkstra’s shortest path
5 algorithms .Hashing: Hash function, Address calculation techniques, Commonhashing 8
functions, Collision resolution: Linear and Quadratic probing, Double hashing.

TOTAL 40

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

5
 3CSDS4-06: Introduction to Data Science

S.N Content Hours

1 Introduction: Objective, scope and outcome of the course 1

Toolboxes: Python, fundamental libraries for data Scientists. Integrated

2 development environment (IDE). Data operations: Reading, selecting, filtering, 7
manipulating, sorting, grouping, rearranging, ranking, and ploting.

Descriptive statistics, data preparation. Exploratory Data Analysis data

3 summarization, data distribution, measuring asymmetry. Sample and estimated mean, 8
variance and standard score. Statistical Inference frequency approach, variability of
estimates, hypothesis testing using confidence intervals, using p-values.

Supervised Learning: First step, learning curves, training-validation and test.

4 Learning models generalities, support vector machines, random forest. 7
Examples

Regression analysis, Regression: linear regression simple linear regression, multiple

5 & Polynomial regression, Sparse model. Unsupervied learning, clustering, 10
similarity and distances, quality measures of clustering, case study.

Network Analysis, Graphs, Social Networks, centrality, drawing centrality of

6 Graphs, PageRank, Ego-Networks, community Detection.
7

Total 40

3CSDS4-07: Object Oriented Programming

SN CONTENTS Hours
Introduction to different programming paradigm, characteristics of OOP, Class,
Object, data member, member function, structures in C++, different access
1 specifiers, defining member function inside and outside class, array of objects. 8

Concept of reference, dynamic memory allocation using new and delete

operators, inline functions, function overloading, function with default arguments,
2 8
constructors and destructors, friend function and classes, using this pointer.

Inheritance, types of inheritance, multiple inheritance, virtual base class, function

3 overriding, abstract class and pure virtual function 9

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

6
 Constant data member and member function, static data member and member
4 function, polymorphism, operator overloading, dynamic binding and virtual function 9

5 Exception handling, Template, Stream class, File handling. 6

TOTAL 40

3CSDS4-21: Data Structures and Algorithms Lab

SN CONTENTS
Write a simple C program on a 32 bit compiler to understand the concept of array
storage, size of a word. The program shall be written illustrating the concept of row major and
1 column major storage. Find the address of element and verify it with the theoretical value.
Program may be written for arrays up to
4-dimensions.

Simulate a stack, queue, circular queue and dequeue using a one dimensional array as storage
2 element. The program should implement the basic addition, deletion and traversal operations.

Represent a 2-variable polynomial using array. Use this representation to implement

3 addition of polynomials
Represent a sparse matrix using array. Implement addition and transposition operations using
4 the representation.
Implement singly, doubly and circularly connected linked lists illustrating operations like
5 addition at different locations, deletion from specified locations and traversal.

6 Repeat exercises 2, 3 & 4 with linked structure.

7 Implementation of binary tree with operations like addition, deletion, traversal.
Depth first and breadth first traversal of graphs represented using adjacency matrix and list.
8

9 Implementation of binary search in arrays and on linked Binary Search Tree.

Implementation of different sorting algorithm like insertion, quick, heap, bubble and many more
10 sorting algorithms.
3CSDS4-22: Object Oriented Programming Lab

SN CONTENTS
1 Understand the basics of C++ library, variables, data input-output.
2 C++ program using with the concept of structures.
3 Implement class and object concepts and function overloading.
4 Write programs to understand dynamic memory allocation and array of objects.
5 Program to understand different types of constructors and destructor.
Implement friend function to access private data of a class and usage of this pointer.
6

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

7
 Write programs to understand the usage of constant data member and member function, static
7 data member and member function in a class.
Implement different types of inheritance, function overriding and virtual
8
Function
9 Implement Operator overloading concepts.
10 Write programs to understand function template and class template.
11 Write programs to understand exception handling techniques.
12 Write programs to understand file handling techniques.

CSDS4-23: Data Science Lab

Sr. No. Content

Interactive commands in Python, data operations, simple programs for writing into files and
1
reading from files. Data file manipulations programs.

2 Familiarization with IDE in Python.

3 Writing programs for standard algorithms of sorting and searching in Python.

4 Plotting the data using X-Y graph, Bar- chart, and using other plotting techniques.

Write programs to perform exploratory data analysis: variance, standard derivation,

5
summarization, distribution, and statistical inference.

6 Plotting the various distributions for given data sets.

7 Classifying and presentation of data using support vector machine.

8 Write programs for k-means clustering and presentation for given data sets.

9 Write programs on graphs of social networks for community detection

10 Write programs for analysis of graphs to find centrality and page-rank.

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

8
 3CSDS4-24: Digital Electronics Lab

SN CONTENTS
To verify the truth tables of basic logic gates: AND, OR, NOR, NAND, NOR. Also to verify
1 truth table of Ex-OR, Ex-NOR (For 2, 3, & 4 inputs using gates with 2, 3, & 4 inputs).

To verify the truth table of OR, AND, NOR, Ex-OR, Ex-NOR realized using NAND & NOR
2 gates.
3 To realize an SOP and POS expression.
To realize Half adder/ Subtractor & Full Adder/ Subtractor using NAND & NOR Gates and to
4 verify their truth tables.
To realize a 4-bit ripple adder/ Subtractor using basic Half adder/ Subtractor & basic Full Adder/
5 Subtractor.
To verify the truth table of 4-to-1 multiplexer and 1-to-4 demultiplexer. Realize the multiplexer
using basic gates only. Also to construct and 8-to-1 multiplexer and 1-to-8demultiplexer using
6 blocks of 4-to-1 multiplexer and 1-to-4 demultiplexer.

Design & Realize a combinational circuit that will accept a 2421 BCD code and drive a TIL -
7 312 seven-segment display.
Using basic logic gates, realize the R-S, J-K and D-flip flops with and without clock signal
8 and verify their truth table.
Construct a divide by 2, 4 & 8 asynchronous counter. Construct a 4-bit binary counter and ring
9 counter for a particular output pattern using D flip flop.
Perform input/output operations on parallel in/Parallel out and Serial in/Serial out registers using
clock. Also exercise loading only one of multiple values into the register using multiplexer.
10 Note: As far as possible, the experiments shall be performed on bread board. However, experiments
Nos. 1-4 are to be performed on bread board only.

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

9
 4CSDS2-01: Discrete Mathematics Structure

SN Contents Hours
1 Introduction: Objective, scope and outcome of the course. 1
2 Set Theory: Definition of sets, countable and uncountable sets, Set operations,
Partition of set, Cardinality (Inclusion-Exclusion & Addition Principles) 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, 7
composition of functions, recursively defined functions, pigeonhole principle. Theorem
proving Techniques: Mathematical induction, Proof by contradiction. Composition of
Functions. The Pigeonhole and Generalized Pigeonhole Principles.
3 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. 2 way
predicate logic. 8
Introduction to finite state machine Finite state machines as models of physical system
equivalence machines, Finite state machines as language recognizers.

4 Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of
partially, ordered set, isomorphic ordered set, well ordered set, properties of Lattices,
bounded and complemented lattices.
Combinatorics: Introduction, Permutation and combination, Binomial Theorem, Multimodal
Coefficients Recurrence Relation and Generating Function: Introduction to Recurrence 8
Relation and Recursive algorithms, linear recurrence relations with constant coefficients,
Homogeneous solutions, Particularsolutions, Total solutions, Generating functions,
Solution by method of generating functions.
5 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 8
standard results, Rings and Fields: definition and standard results.

6 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
8
circuits, Graph coloring, chromatic number, Isomorphism and Homomorphism of graphs,
matching, vertex/edge covering.

Total 40

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21 10

 4CSDS1-03/3CSDS1-03: Managerial Economics and
Financial Accounting

SN CONTENTS Hours
1 Introduction: Objective, scope and outcome of the course. 1
2 Basic economic concept- Meaning, nature and scope of economics, deductive vs
inductive methods, static and dynamics, Economic problems: scarcity and choice,
circular flow of economic activity, national income-concepts and measurement. 3

3 Demand and Supply analysis-

Demand-types of demand, determinants of demand, demand function, elasticity of
demand, demand forecasting –purpose, determinants and methods, Supply- 5
determinants of supply, supply function, elasticity of supply.
4 Production and Cost analysis-
Theory of production- production function, law of variable
proportions, laws of returns to scale, production optimization, least cost combination
5
of inputs, isoquants. Cost concepts-explicit and implicit cost, fixed and variable
cost, opportunity cost, sunk costs, cost function, cost curves, cost and output
decisions, cost estimation.
5 Market structure and pricing theory- Perfect competition, Monopoly, Monopolistic
4
competition, Oligopoly.
6 Financial statement analysis-
Balance sheet and related concepts, profit and loss statement and related
concepts, financial ratio analysis, cash-flow analysis, funds-flow analysis,
8
comparative financial statement, analysis and interpretation of financial statements,
capital budgeting techniques.

TOTAL 26

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

11
 4CSDS1-02/3CSDS1-02: Technical Communication

SN CONTENTS Hours
1 Introduction: Objective, scope and outcome of the course. 1
2 Introduction to Technical Communication- Definition of technical communication,
Aspects of technical communication, forms of technical communication, importance
of technical communication, technical communication skills (Listening, speaking, 3
writing, reading writing), linguistic ability, style in technical communication.

3 Comprehension of Technical Materials/Texts and Information Design &

development- Reading of technical texts, Reading and comprehending
instructions and technical manuals, Interpreting and summarizing technical texts,
Note-making. Introduction of different kinds of technical documents, Information 6
collection, factors affecting information and document design, Strategies
for organization, Information design and writing for print and online media.

4 Technical Writing, Grammar and Editing- Technical writing process, forms of

technical discourse, Writing, drafts and revising, Basics of grammar, common
error in writing and speaking, Study of advanced grammar, Editing strategies to
achieve appropriate technical style, Introduction to advanced technical 8
communication. Planning, drafting and writing Official Notes, Letters, E-mail,
Resume, Job Application, Minutes of Meetings.

5 Advanced Technical Writing- Technical Reports, types of technical reports,

Characteristics and formats and structure of technical reports. Technical Project
Proposals, types of technical proposals, Characteristics and formats and structure of
technical proposals. Technical Articles, types of technical articles, Writing strategies, 8
structure and formats of technical articles.

TOTAL 26

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

12
 4CSDS3-04: Microprocessor & Interfaces

SN Contents Hours
1 Introduction: Objective, scope and outcome of the course. 1
2 Introduction to Microprocessors, microcontroller; 8085 Microprocessor Architecture,
pin description, Bus concept and organization; concept of multiplexing and de-
7
multiplexing of buses; concept of static and dynamic RAM, type of ROM, memory
map.
3 Software architecture registers and signals, Classification of instruction, Instruction
set, addressing modes, Assembly Language Programming and Debugging,
Programming Technique, instruction Format and timing. 8

4 Advance Assembly Language Programming, Counter and time delay; types of

Interrupt and their uses, RST instructions and their uses, 8259 programmable
8
interrupt controller; Macros, subroutine; Stack- implementation and uses with
examples; Memory interfacing.
5 8085 Microprocessor interfacing:, 8255 Programmable Peripheral
Interface, 8254 programmable interval timer, interfacing of 8
Input/output device, 8279 Key board/Display interface.
6 Microprocessor Application: Interfacing scanned multiplexed display and liquid
crystal display, Interfacing and Matrix Keyboard, MPU Design; USART 8251,
8
RS232C and RS422A, Parallel interface- Centronics and IEEE 488.

Total 40

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

13
 4CSDS4-05: Database Management System

SN Contents Hours
1 Introduction: Objective, scope and outcome of the course. 1
2 Introduction to database systems: Overview and History of DBMS. File System
v/s DBMS. Advantage of DBMS Describing and Storing Data in a DBMS. Queries
in DBMS. Structure of a DBMS.
Entity Relationship model: Overview of Data Design Entities, Attributes and Entity Sets,
Relationship and Relationship Sets. Features of the ER Model- Key Constraints,
Participation Constraints, Weak Entities, Class Hierarchies, Aggregation, Conceptual 7
Data Base, and Design with ER Model- Entity v/s Attribute, Entity vs Relationship
Binary vs Ternary Relationship and Aggregation v/s ternary Relationship
Conceptual Design for a Large Enterprise.
3 Relationship Algebra and Calculus: Relationship Algebra Selection and
Projection, Set Operations, Renaming, Joints, Division, Relation Calculus,
Expressive Power of Algebra and Calculus.
SQL queries programming and Triggers: The Forms of a Basic SQL Query, Union, and
Intersection and Except, Nested Queries, Correlated Nested Queries, Set-Comparison 8
Operations, Aggregate Operators, Null Values and Embedded SQL, Dynamic SQL,
ODBC and JDBC, Triggers and Active Databases.
4 Schema refinement and Normal forms: Introductions to Schema Refinement,
Functional Dependencies, Boyce-Codd Normal Forms, Third Normal Form,
8
Normalization-Decomposition into BCNF Decomposition into 3-NF.

5 Transaction Processing: Introduction-Transaction State, Transaction properties,

Concurrent Executions. Need of Serializability, Conflict vs. View Serializability,
8
Testing for Serializability, Recoverable Schedules, Cascadeless Schedules.

6 Concurrency Control: Implementation of Concurrency: Lock-based protocols,

Timestamp-based protocols, Validation-based protocols, Deadlock handling,
Database Failure and Recovery: Database Failures, Recovery
Schemes: Shadow Paging and Log-based Recovery, Recovery with Concurrent 8
transactions.

Total 40

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

14
 4CSDS4-06: Theory of Computation

SN Contents Hours
1 Introduction: Objective, scope and outcome of the course. 1
2 Finite Automata & Regular Expression: Basic machine, Finite state machine, Transition
graph, Transition matrix, Deterministic and non- deterministic finite automation,
Equivalence of DFA and NDFA, Decision properties, minimization of finite automata,
Mealy & Moore machines.
Alphabet, words, Operations, Regular sets, relationship and conversion between Finite
automata and regular expression and vice versa, designing regular expressions, closure 7
properties of regular sets, Pumping lemma and regular sets, Myhill- Nerode theorem ,
Application of pumping lemma, Power of the languages.
3 Context Free Grammars (CFG), Derivations and Languages, Relationship
between derivation and derivation trees, leftmost and rightmost derivation,
sentential forms, parsing and ambiguity, simplification of CFG, normal forms,
Greibach and Chomsky Normal form , Problems related to CNF and GNF including 8
membership problem.
4 Nondeterministic PDA, Definitions, PDA and CFL, CFG for PDA, Deterministic PDA,
and Deterministic PDA and Deterministic CFL , The pumping lemma for CFL’s,
8
Closure Properties and Decision properties for CFL, Deciding properties of CFL.

5 Turing Machines: Introduction, Definition of Turing Machine, TM as

language Acceptors and Transducers, Computable Languages and functions, Universal
TM & Other modification, multiple tracks Turing Machine.
Hierarchy of Formal languages: Recursive & recursively enumerable languages, 8
Properties of RL and REL, Introduction of Context sensitive
grammars and languages, The Chomsky Hierarchy.
6 Tractable and Untractable Problems: P, NP, NP complete and NP hard problems, Un-
decidability, examples of these problems like vertex cover problem, Hamiltonian path 8
problem, traveling sales man problem.
Total 40

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

15
 4CSDS4-07: Statistics for Data Science

S.N Content Hours

1 Introduction: Objective, scope and outcome of the course 1
2 Probability models, their properties, combinatorial principle, 4
conditional probability, independence of events.
3 Random variable and distributions discrete and continuous 6
distributions, cumulative distribution functions. One dimensional
change of variable, joint distributions, joint probability functions,
desity functions. Conditional independence
4 Expectation: Discrete case & continuous case. Variance, covariance 9
and correlation. Generating functions, Conditional expectation.
Sampling distribution and limits. Convergence in probability and
distribution. Monte Carlo approximations, Normal distribution.
5 Statistical inference. Models for inference. Data collection: finite 12
population, simple random sampling, histograms, survey sampling.
Some basic inferences. Likely hood inference. Maximum likely
hood estimation, inference based on MLE. Bayesian Inference, prior
and poster distributions, inference estimation, Baysian
computations, optimal inference.
6 Model checking, sample model, residual probality plots, Chi- 8
square test. Stochastic processes, distribution, Markov chains.
Poisson processes.
Total 40

4CSDS4-21: Microprocessor &

Interfaces Lab

List of Experiments:

1. Add the contents of memory locations XX00 &XX01 & place the result
in memory location XX02.
2. Add the 16 bit numbers stored in memory location & store the result in
another memory location.
3. Transfer a block of data from memory location XX00 to another memory
location XX00 in forward & reverse order.
4. Write a program to swap two blocks of data stored in memory.
5. Write a program to find the square of a number.
6. Write a main program and a conversion subroutine to convert Binary to its
equivalent BCD.
7. Write a program to find largest & smallest number from a given array.
8. Write a program to Sort an array in ascending & descending order.

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

16
 9. Write a program to multiply two 8 bit numbers whose result is 16 bit.
10. Write a program of division of two 8 bit numbers.
11. Generate square wave from SOD pin of 8085 & observe on CRO.
12. Write a program to perform traffic light control operation.
13. Write a program to control the speed of a motor.

4CSDS4-22: Database Management System Lab

List of Experiments:

1. Design a Database and create required tables. For e.g. Bank, College Database
2. Apply the constraints like Primary Key, Foreign key, NOT NULL to the tables.
3. Write a SQL statement for implementing ALTER,UPDATE and DELETE.
4. Write the queries to implement the joins.
5. Write the query for implementing the following functions: MAX (), MIN (), AVG
()
and COUNT ().
6. Write the query to implement the concept of Integrity constrains.
7. Write the query to create the views.
8. Perform the queries for triggers.
9. Perform the following operation for demonstrating the insertion , updation and
deletion
10.Using the referential integrity constraints.
11.Write the query for creating the users and their role.

Data Base Designing Project:

For better understanding students (group of 3-4 students) should design data base for
any data base project, understand the requirement and design methodology of project
by its own.

Some example of data base design project like:

College m an a ge m ent s ys t e m , Inv en t o r y managem ent s ys t em a n d

Hos p i t al management system.

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

17
 4CSDS4-23: Python Programming Lab

Sr. No. Contents

Installation of Python, and learning interactively at command prompt and writing simple
1 programs.

Learning the conditions and iterations in Python by writing and running simple
2 programs.

3 Random number generations, and problems based on random numbers.

4 Handling tuples and exercises based on tuples.

5 Functions and files

6 Linear and binary search

7 Handeling tokens

8 Finding unique, and duplicate items of a list.

9 Matrix addition, multiplications, and unity matrix.

10 Text processing using python

11. Programs related to python libraries like Numpy, Pandas, Scipy etc.

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

18
 4CSDS4-24: Linux Shell Programming Lab

List of Experiments:
1. Use of Basic Unix Shell Commands: ls, mkdir, rmdir, cd, cat, banner, touch,
file, wc, sort, cut, grep, dd, dfspace, du, ulimit.
2. Commands related to inode, I/O redirection and piping, process control
Commands, mails.
3. Shell Programming: Shell script based on control structure- If-then-fi, if-then-
else-if, nested if-else, to find:
3.1 Greatest among three numbers.
3.2 To find a year is leap year or not.
3.3 To input angles of a triangle and find out whether it is valid triangle or not.
3.4 To check whether a character is alphabet, digit or special character.
3.5 To calculate profit or loss.

4. Shell Programming - Looping- while, until, for loops

4.1 Write a shell script to print all even and odd number from 1 to 10.
4.2 Write a shell script to print table of a given number
4.3 Write a shell script to calculate factorial of a given number.
4.4 Write a shell script to print sum of all even numbers from 1 to 10.
4.5 Write a shell script to print sum of digit of any number.
5. Shell Programming - case structure, use of break
5.1 Write a shell script to make a basic calculator which performs addition,
subtraction,
Multiplication, division
5.2 Write a shell script to print days of a week.
5.3 Write a shell script to print starting 4 months having 31 days.
6. Shell Programming - Functions
6.1 Write a shell script to find a number is Armstrong or not.
6.2 Write a shell script to find a number is palindrome or not.
6.3 Write a shell script to print Fibonacci series.
6.4 Write a shell script to find prime number.
6.5 Write a shell script to convert binary to decimal and decimal to binary
7. Write a shell script to print different shapes- Diamond, triangle, square,
rectangle, hollow square etc.
8. Shell Programming – Arrays
8.1 Write a C program to read and print elements of array.
8.2 Write a C program to find sum of all array elements.
8.3 Write a C program to find reverse of an array.
8.4 Write a C program to search an element in an array.
8.5 Write a C program to sort array elements in ascending or descending order.

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

19
 4CSDS4-25: Java Lab
List of Experiment:
1. Develop an in depth understanding of programming in Java: data types,
variables,
operators, operator precedence, Decision and control statements, arrays, switch
statement,
Iteration Statements, Jump Statements, Using break, Using continue, return.

2. Write Object Oriented programs in Java: Objects, Classes constructors, returning

and passing objects as parameter, Inheritance, Access Control, Using super, final
with inheritance Overloading and overriding methods, Abstract classes, Extended
classes.

3. Develop understanding to developing packages & Interfaces in Java:

Package, concept of CLASSPATH, access modifiers, importing package,
Defining and implementing interfaces.

4. Develop understanding to developing Strings and exception handling:

String constructors, special string operations, character extraction, searching and
comparing strings, string Buffer class. Exception handling fundamentals,
Exception types, uncaught exceptions, try, catch and multiple catch statements.
Usage of throw, throws and finally.

5. Develop applications involving file handling: I/O streams, File I/O.

6. Develop applications involving concurrency: Processes and Threads,
Thread Objects, Defining and Starting a Thread, Pausing Execution with Sleep,
Interrupts, Joins, and Synchronization.
Indicative List of exercises:
7. Programs to demonstrate basic concepts e.g. operators, classes, constructors,
control & iteration statements, recursion etc. such as complex arithmetic, matrix
arithmetic, tower of Hanoi problem etc.

8. Development of programs/projects to demonstrate concepts like inheritance,

exception handling, packages, interfaces etc. such as application for electricity
department, library management, ticket reservation system, payroll system etc.

9. Development of a project to demonstrate various file handling concepts.

10. Develop applications involving Applet: Applet Fundamentals, using paint

method and drawing polygons. It is expected that each laboratory assignments to
given to the students with an aim to In order to achieve the above objectives.

Syllabus of B.Tech. CSE (Data Science) Effective From Session 2020-21

20