BIKANER TECHNICAL UNIVERSITY, BIKANER

बीकानेर तकनीकी विश्वविद्यालय, बीकानेर

OFFICE OF THE DEAN ACADEMICS

IV Semester
B. Tech. (Computer Science & Engineering)
4CS1-01: Discrete Mathematics
Credit:3 Max. Marks: 100 (IA:30, ETE:70)
3L+0T+ 0P End Term Exams: 3 Hours
Course Objectives
1. To understand the concepts of mathematical logic, sets, relations and functions.
2. To understand generating functions and recurrence relations.
3. To understand combinatorial mathematics.
4. To identify the basic properties of graphs and trees.
Course Outcomes: Upon successful completion of the course the students will be able to
CO-1: Understand the language of logic.
CO-2: Understand the concept of sets, relations, functions and counting principles.
CO-3: Understand different terminologies and theorems of Graph Theory.
CO-4: Understand Algebraic Structures.
S. No. Contents Hours
1 Propositional Logic: Propositions and compound Propositions, Basic logical operations, truth 6
tables, tautologies, Contradictions, Algebra of Proposition, logical implications, logical
equivalence, Normal forms, predicates and quantifiers, Rules of Inference.
Theorem proving Techniques: Mathematical induction, Introduction to Proofs, Methods of
proof.
2 Set Theory: Definition of sets, countable and uncountable sets, Set operations, Partition of set, 8
Cardinality (Inclusion-Exclusion & Addition Principles) Venn Diagrams, proofs of some
general identities on sets.
Relation: Definition, types of relation, composition of relations, Equivalence relation, Partial
ordering relation.
Function: Definition, type of functions, one to one, into and onto function, inverse function,
composition of functions, recursively defined functions.
Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagrams of partially
ordered set, isomorphic ordered set, well ordered set, properties of lattices, bounded and
complemented lattices.
3 Combinatorics: The Basics of Counting, The Pigeonhole Principle, Permutations and 8
Combinations, Binomial Coefficients and Identities.
Recurrence Relation and Generating Function: Introduction to Recurrence Relation and
Recursive algorithms, linear recurrence relations with constant coefficients, Homogeneous
solution, Particular solution, Total solution, Generating functions, Solution by method of
generating functions.
4 Graph Theory: Graphs and Multi-graphs, Degree of a vertex, Paths connectivity, Walks, 10
Paths, Cycles, Bipartite, Regular, Planar and connected graphs, Components, Euler graphs,
Euler's theorem, Hamiltonian path and circuits, Graph coloring, chromatic number,
isomorphism and homomorphism of graphs. Trees, properties of trees, pendant vertices in
trees, Degree sequences in trees, Rooted and Binary Trees, Minimal Spanning Trees.
5 Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian 8
group, Properties of groups, Subgroup, cyclic group, Permutation group, Cosets, Normal
subgroup, Quotient Group, Homomorphism and isomorphism of Groups, example and
standard results.
Total 40
Suggested Books:
• Kenneth H. Rosen, Discrete Mathematics and its applications, 7th Ed. Tata McGraw Hill (2012).
• C. L. Liu, Elements of Discrete Mathematics, 2nd Ed., Tata Mc-Graw Hill (2005) .
• Kolman, Busby and Ross, Discrete Mathematical Structures, 6th Ed. PHI (2009).

Approved by …….. academic council meeting held on ……….

Office: Bikaner Technical University, Bikaner
Karni Industrial Area, Pugal Road, Bikaner-334004; Website: https://btu.ac.in Page 18
 BIKANER TECHNICAL UNIVERSITY, BIKANER
बीकानेर तकनीकी विश्वविद्यालय, बीकानेर
OFFICE OF THE DEAN ACADEMICS

• Narsingh Deo, Graph Theory with Applications to Engineering and Computer Sciences, PHI (2020).
• Murry R. Spiegel, Discrete Mathematics (Schaums Outline series), Tata McGraw Hill (2009).
• I.N. Herstein, Topics in Algebra, Wiley (2022).

Approved by …….. academic council meeting held on ……….

Office: Bikaner Technical University, Bikaner
Karni Industrial Area, Pugal Road, Bikaner-334004; Website: https://btu.ac.in Page 19
 BIKANER TECHNICAL UNIVERSITY, BIKANER
बीकानेर तकनीकी विश्वविद्यालय, बीकानेर
OFFICE OF THE DEAN ACADEMICS

IV Semester
B. Tech. (Computer Science & Engineering)
4CS4-02: Microprocessor and Interfaces
Credit:3 Max. Marks: 100 (IA:30, ETE:70)
3L+0T+ 0P End Term Exams: 3 Hours
Course Objectives:
1. Demonstrate the various features of microprocessor, memory and I/O devices including concepts of system bus.
2. Identify the hardware elements of 8085 microprocessor including architecture and pin functions and
programming model including registers, instruction set and addressing modes.
3. Select appropriate 8085 instructions based on size and functions to write a given assembly language program.
4. Design a given interfacing system using concepts of memory and I/O interfacing.
5. Demonstrate the features of advance microprocessors.
Course Outcomes: Upon successful completion of the course the students will be able to
CO1: Basic understanding of 8085 microprocessor, timing diagram and memory mapping.
CO2: Understand ISA for 8085 and also How to design ISA for some other microprocessors.
CO3: Write basic program in assembly language and concept of other Programmable peripheral devices.
CO4: Interface I/O devices, interrupt controller and DMA.
CO5: Basic understanding of design ISA and further design their own processor.
S. No. Contents Hours
1 Introduction: Objective, Scope and Outcome of the course 1
2 Introduction and architecture of 8085: Microprocessor Architecture &Operations, Memory, 7
I/O Device, Memory and I/O Operations, , Address, Data And Control Buses, Pin Functions,
concept of multiplexing and de-multiplexing of buses, Generation Of Control Signals,
Instruction Cycle, Machine Cycles, T-States, Memory Interfacing.
3 Instruction set and assembly language programming: Introduction to 8085 8
assembly language programming, Instruction Set, Addressing modes, Data transfer,
arithmetic, logical, branch, stack and machine control groups of instruction set, macro
RTL and micro RTL flow chart of instructions, Code Conversion, BCD Arithmetic
and 16-Bit Data operations
4 Interfacing with I/O Devices: Interfacing Concepts, Ports, Interfacing of I/O Devices, 8
Interrupts in 8085, Programmable Interrupt Controller 8259A, Programmable
Peripheral Interface 8255A, 8257 (DMA Controller), 8253/8254 (Programmable
Interval Timer).
5 Introduction and architecture of 8051 Microcontroller: Internal Block Diagram, CPU, 8
ALU, address, data and control bus, Working registers, SFRs, Clock and RESET circuits,
Stack and Stack Pointer, Program Counter, I/O ports, Memory Structures, Data and
Program Memory, Timing diagrams and Execution Cycles.
6 Programming and application of 8051 Microcontroller: Programming Timer interrupts, 8
programming external hardware interrupts, Programming the serial communication interrupts,
Programming 8051 timers and counters.
Total 40
Suggested Books:
• Hall D.V.,“Microprocessor and Interfacing-Programming and Hardware”, 2nd Ed., Tata McGraw-Hill Publishing
Company Limited, 2008.
• GaonkarR.S.,“Microprocessor Architecture ,Programming and Applications”, 5th Ed., Penram International,
2007.
• Stewart J,“Microprocessor Systems- Hardware,Software and Programming”, Prentice Hall International
Edition,1990

Approved by …….. academic council meeting held on ……….

Office: Bikaner Technical University, Bikaner
Karni Industrial Area, Pugal Road, Bikaner-334004; Website: https://btu.ac.in Page 20
 BIKANER TECHNICAL UNIVERSITY, BIKANER
बीकानेर तकनीकी विश्वविद्यालय, बीकानेर
OFFICE OF THE DEAN ACADEMICS

IV Semester
B. Tech. (Computer Science & Engineering)
4CS4-03: Theory of Computation
Credit: 3 Max. Marks: 100 (IA:30, ETE:70)
3L+0T+ 0P End Term Exams: 3 Hours
Course Objectives:
1. Understand the relationship between languages, grammars and automaton models.
2. Design automation for different strings or machine
3. To study the capabilities of the abstract machines.
4. Understanding the theoretical limits of computation and identify the NP complete and NP Hard problems
5. Classify machines by their power to recognize languages.
Course Outcomes:
Upon successful completion of the course the students will be able to
CO-1: Able to classify Language and Grammar in Type0, Type1, Type2 and Type3. Design the Grammar for
given string or languages.
CO-2: Able to design the FA, PDA and TM for given string and languages.
CO-3: Able to convert PDA to CFG. Able to apply the pumping lemma for regular languages
CO-4: Able to demonstrate that a grammar is ambiguous. Simplification of the CFG, representations of grammars
in CNF and GNF.
CO-5: Understanding the concepts of LBA, NP Complete and NP Hard.
S. No. Contents Hours
1 Finite Automata & Regular Expression: Basic machine, Finite state machine, Transition 8
graph, Transition matrix, Deterministic and nondeterministic 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
properties of regular sets, Pumping lemma and regular sets, Myhill- Nerode theorem,
Application of pumping lemma, Power of the languages.
2 Context Free Grammars: CFG, Derivations and Languages, Relationship between derivation 8
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 membership problem.
3 PushDown Automaton: Nondeterministic PDA, Definitions, PDA and CFL, CFG for PDA, 8
Deterministic PDA, and Deterministic PDA and Deterministic CFL , The pumping lemma for
CFL’s, Closure Properties and Decision properties for CFL, Deciding properties of CFL.
4 Turing Machines: Introduction, Definition of Turing Machine, TM as language Acceptors 8
and Transducers, Computable Languages and functions, Universal TM & Other modification,
multiple tracks Turing Machine. Hierarchy of Formal languages: Recursive & recursively
enumerable languages, Properties of RL and REL, Introduction of Context sensitive grammars
and languages, The Chomsky Hierarchy.
5 Tractable and Un-tractable Problems: P, NP, NP complete and NP hard problems, Un- 8
decidability, examples of these problems like vertex cover problem, Hamiltonian path
problem, traveling sales man problem.
Total 40
Suggested Books:
• K L P Mishra and N Chandrasekaran, Theory of Computer Science: Automata, Languages and Computation,
Prentice Hall India Learning Private Limited
• John C. Martin, Introduction to Languages and The Theory of Computation, McGraw-Hill
• Aho, Hopcroft and Ullman, Introduction to Automata Theory, Formal Languages and Computation, Narosa
• Cohen, Introduction to Computer Theory, Addison Wesley.

Approved by …….. academic council meeting held on ……….

Office: Bikaner Technical University, Bikaner
Karni Industrial Area, Pugal Road, Bikaner-334004; Website: https://btu.ac.in Page 21
 BIKANER TECHNICAL UNIVERSITY, BIKANER
बीकानेर तकनीकी विश्वविद्यालय, बीकानेर
OFFICE OF THE DEAN ACADEMICS

IV Semester
B. Tech. (Computer Science & Engineering)
4CS4-04: Database Management Systems
Credit: 3 Max. Marks: 100 (IA:30, ETE:70)
3L+0T+ 0P End Term Exams: 3 Hours
Course Objectives:
1. To understand purpose of database management systems.
2. Apply concepts of database design and database languages (SQL based) in managing data.
3. Understand concepts and importance of relational algebra and relational calculus.
4. Importance and application of normalization in DBMS.
5. Knowledge of transaction, concurrency control, recovery strategies.
Course Outcomes:
Upon successful completion of the course the students will be able to
CO-1: Describe DBMS architecture, physical and logical database designs, database models, entity-relationship
model.
CO-2: Understand relational algebra, relational calculus importance and query writing
CO-3: Apply Structured query language (SQL) for database definition, database manipulation, data control.
CO-4: Understanding of normalization theory and apply it to normalize databases.
CO-5: Understand various transaction processing, concurrency control mechanisms and database protection
mechanisms.
S. No. Contents Hours
1 Introduction to database systems: Overview and History of DBMS. File System v/s DBMS. 8
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 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.
2 Relationship Algebra and Calculus: Relationship Algebra Selection and Projection, Set 8
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
Operations, Aggregate Operators, Null Values and Embedded SQL, Dynamic SQL, ODBC and
JDBC, Triggers and Active Databases.
3 Schema refinement and Normal forms: Introductions to Schema Refinement, Functional 8
Dependencies, Boyce-Codd Normal Forms, Third Normal Form, Normalization-
Decomposition into BCNF Decomposition into 3-NF.
4 Transaction Processing: Introduction-Transaction State, Transaction properties, Concurrent 8
Executions. Need of Serializability, Conflict vs. View Serializability, Testing for Serializability,
Recoverable Schedules, Cascadeless Schedules.
5 Concurrency Control: Implementation of Concurrency: Lock-based protocols, Timestamp- 8
based protocols, Validation-based protocols, Deadlock handling,
Database Failure and Recovery: Database Failures, Recovery Schemes: Shadow Paging and
Log-based Recovery, Recovery with Concurrent transactions.
Total 40
Suggested Books:
• H. F. Korth and Silberschatz: Database Systems Concepts, McGraw Hill
• Almasri and S. B. Navathe: Fundamentals of DataBase Systems
• Ramakrishnan: Database Management Systems
• C. J. Date: Data Base Design, Addison Wesley
• Hansen and Henson: DBM and Design, PHI

Approved by …….. academic council meeting held on ……….

Office: Bikaner Technical University, Bikaner
Karni Industrial Area, Pugal Road, Bikaner-334004; Website: https://btu.ac.in Page 22
 BIKANER TECHNICAL UNIVERSITY, BIKANER
बीकानेर तकनीकी विश्वविद्यालय, बीकानेर
OFFICE OF THE DEAN ACADEMICS

IV Semester
B. Tech. (Computer Science & Engineering)
4CS4-05: Introduction to Python Programming
Credit: 3 Max. Marks: 100 (IA:30, ETE:70)
3L + 0T + 0P End Term Exams: 3 Hours
Course Objectives:
1. Develop understanding of the fundamental concepts essential for programming.
2. To enable students to design algorithms, apply code and data visualized the data.
3. To enable students to apply python programming in problem solving.
Course Outcomes:
Upon successful completion of the course the students will be able to
CO-1: Know the Essential concepts of Python Programming and its real time use.
CO-2: Design algorithms and source code.
CO-3: Use of suitable data structure and logic for problem solving.
S. No. Contents Hours
1 Introduction to Python: Why Python? - Essential Python libraries - Python Introduction- 8
Features, Data types, variables, expressions, operators, Identifiers, Reserved words,
Indentation, Comments.
2 Decision Making: Selective statements – if, if-else, nested if, if –elif ladder statements. 8
Iterative statements - while, for, Nested loops, else in loops, break, continue and pass
statements.
Looping: Loop Control statement- Math and Random number functions. User-defined
functions - function arguments & its types.
Strings: Formatting, Comparison, Slicing, Splitting, Stripping, Negative indices, String
functions.
Regular expression: Matching the patterns, Search and replace.
3 List: Create, Access, Slicing, Negative Indices, List Methods, and comprehensions. 8
Tuples: Create, Indexing and Slicing, Operations on tuples.
Dictionary: Create, add, and replace values, operations on dictionaries.
Sets: Create and operations on set.
4 Functions: Types, parameters, arguments: positional arguments, keyword arguments, 8
parameters with default values, functions with arbitrary arguments, Scope of variables: Local
and global scope, Recursion and Lambda functions.
Files: Open, Read, Write, Append and Close. Tell and seek methods
5 NumPy Basics: Arrays and Vectorized Computation- The NumPy ND array- Creating ND 8
arrays- Data Types for ND arrays- Arithmetic with NumPy Arrays- Basic Indexing and
Slicing- Boolean Indexing-Transposing Arrays and Swapping Axes. Universal Functions: Fast
Element-Wise Array Functions- Mathematical and Statistical Methods-Sorting Unique and
Other Set Logic. , Data Visualization
Total 40
Suggested Books:
• Programming Python by Mark Lutz, O'Reilly.
• Learning Python, 3rd Edition by Mark Lutz, O'Reilly
• Python in a Nutshell by Alex Martelli, O'Reilly.
• Wesley J. Chun, “Core Python Programming”, Prentice Hall,2006.
• Mark Lutz, “Learning Python”, O’Reilly, 4th Edition, 2009.
• Introduction to Programming using Python by Y. Daniel Liang , Pearson,2012.

Approved by …….. academic council meeting held on ……….

Office: Bikaner Technical University, Bikaner
Karni Industrial Area, Pugal Road, Bikaner-334004; Website: https://btu.ac.in Page 23
 BIKANER TECHNICAL UNIVERSITY, BIKANER
बीकानेर तकनीकी विश्वविद्यालय, बीकानेर
OFFICE OF THE DEAN ACADEMICS

IV Semester
B. Tech. (Computer Science & Engineering)
4CS4-06: Introduction to Java Programming
Credit: 3 Max. Marks: 100 (IA:30, ETE:70)
3L + 0T + 0P End Term Exams: 3 Hours
Course Objectives:
1. To understand the basic concepts and fundamentals of platform independent object-oriented language
2. To demonstrate skills in writing programs using exception handling techniques and multithreading.
3. To understand streams and efficient user interface design techniques.
Course Outcomes:
Upon successful completion of the course the students will be able to
CO-1: Understand the features of Java such as operators, classes, objects, inheritance, packages and exception
handling
CO-2: Learn latest features of Java like garbage collection, Console class, Network interface, APIs
CO-3: Acquire competence in Java through the use of multithreading, applets
CO-4: Get exposure to advance concepts like socket and database connectivity.
S. No. Contents Hours
1 Introduction: Object oriented programming principles, Java essentials, java virtual machine, 8
program structure in java, Java class libraries, Data types, Variables and Arrays, Data types
and casting, automatic type promotion in expressions, arrays. Operators and Control
Statements: Arithmetic operators, bit wise operators, relational operators, Boolean logical
operators, the ? Operator, operator precedence, Java's selection statements, iteration
statements, jump statements.
2 Introduction to Classes: Class fundamentals, declaring class, creating objects, introducing 6
methods: method declaration, overloading, using objects as parameters, recursion,
Constructors, this keyword, garbage collection, the finalization.
3 Inheritance: Inheritance basics, using super and final, method overriding, dynamic method 10
dispatch, Abstract Class, Interface: variables and extending Interfaces, Package: Creating and
importing packages, Package access protection, Exception Handling: Exception handling
fundamentals, Exception types, Uncaught Exceptions Using try and catch, multiple catch
clauses, nested try statements, throw, Java’s built-in exceptions.
4 Multithreaded Programming: The Java thread model, the main thread, creating thread, 10
creating multiple threads, using isAlive () and join (), Thread priorities, synchronization, inter
thread communications, suspending resuming and stopping threads.
5 I/O Operations: I/O Basics, Reading Console Input, Writing Console Output, Reading and 6
Writing Files , Applets: Applet Fundamentals, Applet Architecture, The HTML Applet tag,
Passing parameters to Applets., Networking: Networking basics, Java and the Net, TCP/IP
Client Sockets URL, URL Connection, TCP/IP Server Sockets, Database connectivity.
Total 40
Suggested Books:
• Herbert Schildt, The Complete Reference Java 2, McGraw-Hill.
• Joyce Farrell, Java for Beginners, Cengage Learning.
• Deitel and Deitel, Java: How to Program, 6th Edition, Pearson Education.
• James Edward Keogh, Jim Keogh, J2EE: The complete Reference, McGrawHill
• Khalid A. Mughal, Torill Hamre, Rolf W. Rasmussen, Java Actually, Cengage Learning.
• Shirish Chavan, Java for Beginners, 2nd Edition, Shroff Publishers.

Approved by …….. academic council meeting held on ……….

Office: Bikaner Technical University, Bikaner
Karni Industrial Area, Pugal Road, Bikaner-334004; Website: https://btu.ac.in Page 24
 BIKANER TECHNICAL UNIVERSITY, BIKANER
बीकानेर तकनीकी विश्वविद्यालय, बीकानेर
OFFICE OF THE DEAN ACADEMICS

IV Semester
B. Tech. (Computer Science & Engineering)
4CS4-21: Database Management Systems Lab
Credit: 1.5 Max. Marks: 100 (IA:60, ETE:40)
0L+ 0T+ 3P End Term Exams: 3 Hours
Course Objectives:
1. Installing and configuring databases such as MySQL on windows and Linux platforms along with front
end tools.
2. Designing database for different applications and applying various DDL queries along with various
Integrity constraints.
3. Write various DML queries using select clause with join, subqueries, group operations etc.
4. Creating triggers and views. Writing DCL queries for creating users, rights.
5. Design and Implement database including E-R model and Relational model for one application like
college management, Hospital management along with front end.
Course Outcomes: Upon successful completion of the course/Lab the students will be able to
CO1: Installation of Backend and front end.
CO2: Writing DDL queries effectively.
CO3: Writing advance DML queries in MySQL.
CO4: Writing DCL queries, triggers and views.
CO5: Developing a web-based or client server-based application.
Suggestive 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.
12. Data Base Designing Project: For better understanding students (group of 3-4 students) should design
web based project containing data base, understand the requirements and design the front end and
backend of project by its own. Some example of data base design project like: College management
system, Inventory management system and Hospital management system.
Suggested Books:
• Hall D. V., “Microprocessor and Interfacing-Programming and Hardware”, 2nd Ed., Tata McGraw-Hill
Publishing Company Limited, 2008.
• Gaonkar R. S., “Microprocessor Architecture, Programming and Applications”, 5th Ed., Penram
International Publishing, 2007.
• Stewart J, “Microprocessor Systems- Hardware, Software and Programming”, Prentice Hall International
Edition,1990

Approved by …….. academic council meeting held on ……….

Office: Bikaner Technical University, Bikaner
Karni Industrial Area, Pugal Road, Bikaner-334004; Website: https://btu.ac.in Page 25
 BIKANER TECHNICAL UNIVERSITY, BIKANER
बीकानेर तकनीकी विश्वविद्यालय, बीकानेर
OFFICE OF THE DEAN ACADEMICS

IV Semester
B. Tech. (Computer Science & Engineering)
4CS4-22: Microprocessor and Interfaces Lab
Credit: 1.5 Max. Marks: 100 (IA:60, ETE:40)
0L+ 0T+ 3P End Term Exams: 3 Hours
Course Objectives:
1. Demonstrate the various features of microprocessor, memory and I/O devices including concepts of
system bus.
2. Identify the hardware elements of 8085 microprocessor including architecture and pin functions and
programming model including registers, instruction set and addressing modes.
3. Select appropriate 8085 instructions based on size and functions to write a given assembly language
program.
4. Design a given interfacing system using concepts of memory and I/O interfacing.
5. Demonstrate the features of advance microprocessors.
Course Outcomes: Upon successful completion of the course/Lab the students will be able to
CO1: Ability to write assembly language program for data transfer and control instructions.
CO2: Ability to write assembly language program for Arithmetic calculation using register pair.
CO3: Ability to Write assembly language program for interfacing with Programmable peripheral devices.
CO4: Assembly language programming for general purpose problems like traffic light controller, control the
speed of step motor etc.
CO5: To make live projects using assembly language and interfacing with PPI and see outputs on CRO and
other electronic devices.
Suggestive List of Experiments
1. Study the hardware, functions, memory structure, Instruction set and operation of 8085 microprocessor
kit.
2. Write an assembly language program to Add/Subtract two 8-bit/16-bit number.
3. Write an assembly language program to Data transfer/Exchange from one memory block to another in
forward and reverse order.
4. Write an assembly language program to generate a square wave of 1khz frequency on the SOD pin of
8085. Operating frequency of 8085 is 3 khz.
5. Write an assembly language program to perform following conversion:
(i) BCD to ASCII
(ii) BCD to Hexadecimal.
6. Write an assembly language program for Sorting of array(Ascending/Descending), Searching a number
in array, find largest/smallest number in array and to generate Fibonacci series.
7. Design your own minimal set of ISA similar to 8085 which will compute all arithmetic and logic,
memory and control instruction(you have to introduce addressing mode in ISA )
Design microprocessor using above minimal set of ISA(experiment number 7) which will perform all
computation and implement using FPGA
Suggested Books:
• Hall D. V., “Microprocessor and Interfacing-Programming and Hardware”, 2nd Ed., Tata McGraw-Hill
Publishing Company Limited, 2008.
• Gaonkar R. S., “Microprocessor Architecture, Programming and Applications”, 5th Ed., Penram
International Publishing, 2007.
• Stewart J, “Microprocessor Systems- Hardware, Software and Programming”, Prentice Hall International
Edition,1990

Approved by …….. academic council meeting held on ……….

Office: Bikaner Technical University, Bikaner
Karni Industrial Area, Pugal Road, Bikaner-334004; Website: https://btu.ac.in Page 26
 BIKANER TECHNICAL UNIVERSITY, BIKANER
बीकानेर तकनीकी विश्वविद्यालय, बीकानेर
OFFICE OF THE DEAN ACADEMICS

IV Semester
B. Tech. (Computer Science & Engineering)
4CS4-23: Python Programming Lab
Credit: 1.5 Max. Marks: 100 (IA:60, ETE:40)
0L+ 0T+ 3P End Term Exams: 3 Hours
Course Objectives:
1. To provide skills for designing algorithm and writing code.
2. To introduce students to the real word programming applications using Python.
3. To enable students to apply data structure & python programming code in problem solving.
Course Outcomes:
Upon successful completion of the course the students will be able to
CO-1: Demonstrate and understanding of programming language concepts.
CO-2: Identify and abstract the programming task involved for a given problem.
CO-3: Design and develop modular programming skills.
CO-4: Trace and debug a program.
S. No. Contents
1 Installation of Python, and learning interactively at command prompt and writing simple programs.
2 Perform Creation, indexing, slicing, concatenation, and repetition operations on Python built-in data
types: Strings, List, Tuples , Dictionary, Set
3 Solve problems using decision and looping statements
4 Handle numerical operations using math and random number functions
5 Create user-defined functions with different types of function arguments.
6 Perform File manipulations- open, close, read, write, append and copy from one file to another.
7 Matrix addition, multiplications, and unity matrix.
8 Text processing using python , Import a CSV file and perform various Statistical and Comparison
operations on rows/columns.
9 Intrinsic NumPy objects and Random Functions. Manipulation of NumPy arrays- Indexing,
Slicing, Reshaping, Joining, and Splitting.
10 Programs related to python libraries like Numpy, Pandas, Scipy etc.
Suggested Books:
• Beginning Python Wrox Publication Peter Norton, Alex Samuel
• Starting Out with Python (2009) Pearson, Tonny Gaddis
• Y. Daniel Liang, “Introduction to Programming using Python,” Pearson,2012.
• Wes McKinney, “Python for Data Analysis: Data Wrangling with Pandas, NumPy, and
IPython,” O’Reilly, 2nd Edition,2018.
• Jake VanderPlas, “Python Data Science Handbook: Essential Tools for Working with
Data,” O’Reilly, 2017.

Approved by …….. academic council meeting held on ……….

Office: Bikaner Technical University, Bikaner
Karni Industrial Area, Pugal Road, Bikaner-334004; Website: https://btu.ac.in Page 27
 BIKANER TECHNICAL UNIVERSITY, BIKANER
बीकानेर तकनीकी विश्वविद्यालय, बीकानेर
OFFICE OF THE DEAN ACADEMICS

IV Semester
B. Tech. (Computer Science & Engineering)
4CS4-24: Java Programming Lab
Credit: 1.5 Max. Marks: 100 (IA:60, ETE:40)
0L+ 0T+ 3P End Term Exams: 3 Hours
Course Objectives:
1. To write programs using abstract classes
2. To write multithreaded programs.
3. To write GUI programs in Java.
4. To impart hands on experience with java programming.
Course Outcomes:
Upon successful completion of the course the students will be able to
CO-1: Implement the features of Java such as operators, classes, objects, inheritance, packages and exception
handling
CO-2: Design problems using latest features of Java like garbage collection, Console class, Network interface,
APIs
CO-3: Develop competence in Java through the use of multithreading, Applets etc
CO-4: Apply advance concepts like socket and database connectivity, and develop project based on industry
orientation
S. No. Contents
1 WAP in Java to show implementation of classes.
2 WAP in Java to show implementation of inheritance.
3 WAP in Java to show Implementation of packages and interfaces. To accomplish
4 WAP in Java to show Implementation of threads.
5 WAP in Java Using exception handling mechanisms.
6 WAP in Java to show Implementation of Applets.
7 WAP in Java to show Implementation of mouse events, and keyboard events.
8 WAP in Java to show Implementing basic file reading and writing methods.
9 Using basic networking features, WAP in Java To accomplish
10 WAP in Java to show Connecting to Database using JDBC.
11 Project work: A desktop based application project should be designed and implemented in java.

Suggested Books:
• Herbert Schildt, The Complete Reference Java2, McGraw-Hill. 2.
• Deitel and Deitel, Java: How to Program, 6th Edition, Pearson Education.
• James Edward Keogh, Jim Keogh, J2EE: The complete Reference, McGrawHill

Approved by …….. academic council meeting held on ……….

Office: Bikaner Technical University, Bikaner
Karni Industrial Area, Pugal Road, Bikaner-334004; Website: https://btu.ac.in Page 28