CMS-A-SEC-B-4-2-TH: E-Commerce Skill Enhancement Course: SEC-B: Choice -2: Theory, Credit:02, Contact hours: 40.

 An introduction to Electronic commerce

What is E-Commerce (Introduction And Definition), Main activities E-Commerce, Goals of

E-Commerce, Technical Components of E-Commerce, Functions of E-Commerce,

Advantages and disadvantages of E-Commerce, Scope of E-Commerce, Electronic

Commerce Applications, 9 Electronic Commerce and Electronic Business (C2C) (C2G,G2G,

B2G, B2P, B2A, P2P, B2A, C2A, B2B, B2C).

05hours

The Internet and WWW

Evolution of Internet, Domain Names and Internet Organization (.edu, .com, .mil, .gov, .net

etc.) , Types of Network, Internet Service Provider, World Wide Web, Internet & Extranet,

Role of Internet in B2B Application, building own website, Cost, Time, Reach, Registering a

Domain Name, Web promotion, Target email, Banner, Exchange, Shopping Bots.

10hours

Internet Security

Secure Transaction, Computer Monitoring, Privacy on Internet, Corporate Email privacy,

Computer Crime( Laws , Types of Crimes), Threats, Attack on Computer System, Software

Packages for privacy, Hacking, Computer Virus( How it spreads, Virus problem, virus

protection, Encryption and Decryption, Secret key Cryptography, DES, Public Key

Encryption, RSA, Authorization and Authentication, Firewall, Digital Signature( How it

Works).

10hours

Electronic Data Exchange

Introduction, Concepts of EDI and Limitation, Applications of EDI, Disadvantages of EDI,

EDI model, Electronic Payment System: Introduction, Types of Electronic Payment System,

Payment Types, Value Exchange System, Credit Card System, Electronic Fund Transfer,

Paperless bill, Modern Payment Cash, Electronic Cash.

05hours

Planning for Electronic Commerce

Planning Electronic Commerce initiates, Linking objectives to business strategies, Measuring

cost objectives, Comparing benefits to Costs, Strategies for developing electronic commerce

web sites.

05hours

Internet Marketing:

The PROS and CONS of online shopping, The cons of online shopping, Justify an Internet

business, Internet marketing techniques, The E-cycle of Internet marketing, Personalization

e-commerce.

Skill Enhancement Course: SEC-B: Information Security/ E-Commerce CMS-A-SEC-B-4-1-TH: Information Security

 Overview

Overview of Security Parameters: Confidentiality, Integrity and availability-security

violation, Assumptions and Trust- Security assurance, OSI security architecture.

05 hours

Cryptography

Mathematical Tools for Cryptography, Symmetric Encryption Algorithm, Theory of Block

cipher design, Symmetric cipher model, Risk assessment, quantitative and qualitative

approaches, Network security management, Firewalls, Web and wireless security

management, Computer security log management, IT security infrastructure, Operating

system security, user security, program security.

10 hours

Finite Field and Number Theory

Groups, Rings, Fields-Modular, Prime numbers, Fermat's and Euler's Theorem, Chinese

remainder Theorem, Discrete Logarithm.

03 hours

Hash Functions and Digital Signatures

Authentication requirement – Authentication function -MAC, Hash functions, Security of

hash function, Hashing Algorithms: MD5.

05 hours

Internet Firewalls for Trusted System

Roles of Firewalls, Firewall related terminology, Types of Firewalls, Firewall designs.

02 hours

E-Mail, IP & Web Security (Qualitative study)

E-mail Security: Security Services for E-mail-attacks possible through E-mail, Pretty

Good S/MIME.

IP Security: Overview of IPSec, IP Security Architecture, Authentication Header,

Encapsulation Security Payload.

Web Security: Secure Socket Layer/Transport Layer Security, Basic Protocol, SSL

05 hours

Attacks, Secure Electronic Transaction (SET).

Cyber

Cyber laws to be covered as per IT 2008

Definitions, Digital Signature And Electronic Signature.

1) [Section 43] Penalty and Compensation for damage to computer, computer system,

etc.

2) [Section 65] Tampering with Computer Source Documents.

3) [Section 66 A] Punishment for sending offensive messages through communication

service, etc.

4) [Section 66 B] Punishments for dishonestly receiving stolen computer resource or

communication device.

5) [Section 66C] Punishment for identity theft.

6) [Section 66D] Punishment for cheating by personation by using computer resource.

7) [Section 66E] Punishment for violation of privacy.

8) [Section 66F] Punishment for cyber terrorism.

9) [Section 67] Punishment for publishing or transmitting obscene material in

electronic form.

10) [Section 67A] Punishment for publishing or transmitting of material containing

sexually explicit act, etc. in electronic form.

11) [Section 67B] Punishment for publishing or transmitting of material depicting

children in sexually explicit act, etc. in electronic form.

12) [Section 72] Breach of confidentiality and privacy.

CMS-A-CC-4-10-P:Programming with Microprocessor 8085 Core Course- 10: Practical, Credits:02, Contact hours: 40.

 1. Assembly Language Programming for Arithmetic Operations like Addition, Subtraction,

Multiplication and Division on 8, 16 bit data.

2. Assembly Language Programming for different logical operations.

3. Assembly Language Programming for code conversions.

4. Assembly Language Programming for different sorting techniques.

5. Assembly Language Programming for memory block transfer.

6. Assembly Language Programming for AP series and Fibonacci series.

7. Assembly Language Programming for HCF, LCM etc.

8. Assembly Language Programming for Searching.

9. Assembly Language Programming for frequency distribution.

10. Block Replacement and transfer

Many more programs can be included related to the programming techniques of Microprocessor 8085

CMS-A-CC-4-10-TH: Microprocessor and its Applications Core Course- 7: Theory, Credits:04, Contact hours: 60.

 Introduction to Microcomputer based system:

Evolution of Microprocessor and Microcontrollers and their advantages and disadvantages.

03 hours

Microprocessor Architecture and Memory Interfacing

Basic Architecture of Microprocessor 8085 and explanation of each block, Microprocessor

8085 pin out and signals, Addressing modes, Instruction Formats, Instruction Cycle, Clock

Cycle, Multiplexed Address Data Bus, Control and Status signals, Microprocessor and Bus

Timing, De-multiplexing of Address Data Bus, Generation of Control Signals for I/O and

Memory, Basic concepts in Memory Interfacing, Address Decoding and memory

Addresses.

14 hours

Interfacing I/O Devices

Basic Interfacing concepts, Peripheral I/O instructions (I/O mapped I/O), Device Selection

and data Transfer, Absolute and Partial Decoding, Input Interfacing, Interfacing I/O using

decoders, Memory mapped I/O techniques, Data transfer schemes, Interfacing 8155

memory segment.

10 hours

Programming 8085

Instruction Set of 8085, Different Programming Techniques, Stack and Subroutines,

Counter and Time Delays, Code Conversion, BCD Arithmetic and 16 bit Data Operation.

10 hours

Interfacing Peripheral Devices and Applications

Interrupts: 8085 Interrupt, RST instructions, Software and Hardware interrupt, multiple

Interrupts and Priorities, 8085 Vectored Interrupts, Restart as Software Instructions.

Interfacing Digital to Analog Converters, Analog to Digital Interfacing, keyboard

interfacing, interfacing 8255 (Mode - 0, BSR), Support IC chips- 8237/8257,8259

13 hours

Microprocessor 8086

The 8086 microprocessor- Architecture, Instruction set, Addressing modes, Interrupts,

Memory interfacing with 8086.

CMS-A-CC-4-9-P: Algorithms Lab. Core Course- 9: Practical, Credit:02, Contact hour: 40.

 Lab. based on Graph Theory using C

Graph Algorithms:

Implementation of Graph algorithms: Single Spanning Tree Generation using - BFS, DFS, Minimal

Spanning Tree Generation using - Prim's Algorithm, Kruskal’s Algorithm, Shortest Path finding using -

Floyd's Algorithm, Floyd-Warshall Algorithm, Dijkstra's Algorithm, Graph Partitioning Algorithm.

CMS-A-CC-4-9-TH: Introduction to Algorithms & its Applications Core Course- 9: Theory, Credit: 04, Contact hours: 60.

 Introduction to Algorithms:

Definition, Characteristics, Recursive and Non-recursive algorithms.

05 hours

Asymptotic Complexity Analysis of Algorithms:

Space and Time Complexity, Efficiency of an algorithm, Growth of Functions, Polynomial

and Exponential Complexity, Asymptotic Notations: Big O Notation and Small o notation,

Big Ω and Small ω, Big Θ and Small ϕ Notations, Properties: Best case/worst case/average

case analysis of well-known algorithms.

10 hours

Algorithm Design Techniques:

Concepts and simple case studies of Greedy algorithms. Divide and conquer: Basic

concepts, Case study of selected searching and sorting problems using divide and

conquer techniques: Dynamic programming: General issues in Dynamic Programming.

15 hours

Graph Representation and Algorithm:

Graph traversal algorithms: BFS, DFS, Minimal spanning trees: Prim's Algorithm,

Kruskal's Algorithm, Shortest path algorithms: Floyd's Algorithm, Floyd-Warshall

Algorithm, Dijkstra's Algorithm, Graph Coloring Algorithms.

25 hours

Classification of Problems:

Concept of P, NP.

CMS-A-CC-4-8-P: Computer Networking and Web Design Lab Core Course- 8: Practical, Credit: 02, Contact hour: 40.

 Computer Networks: Practical

Familiarization with Networking cables (CAT5, CAT6, UTP), Connectors (RJ-45, Tconnector),

Hubs, Switches, LAN installation & configuration (peer-to-peer) process.

05 hours

Web Design: Practical

Web page design by HTML

Handling HTML form

HTML

Capturing Form Data, GET and POST form methods, Dealing with multi value fields

Redirecting a form after submission.

20 hours

Array

Anatomy of an Array ,Creating index based and Associative array, Accessing array

Looping with Index based array, with associative array using each() and for each()

Some useful Library function.

CMS-A-CC-4-8-TH: Data Communication, Networking and Internet Technology. Core Course- 8: Theory, Credit: 04, Contact hours: 60.

 Overview of Data Communication and Networking

Introduction:

Data communications Components, data representation, direction of data flow (simplex, half

duplex, full duplex).

Network Hardware: Physical structure (type of connection, topology), categories of

network (LAN, MAN, WAN).

Internet: Brief history, Protocols and standards, Reference models: OSI reference model,

properties of all the layers, TCP/IP reference model, their comparative study.

04hours

Physical Layer

Data & Signals: Analog & Digital Data and Signals, periodic and non-periodic signals,

composite signals, bandwidth, bit rate, transmission of digital signals.

Transmission Impairments: Attenuation, Distortion and Noise.

Data Rate Limits: Noiseless Channel: Nyquist Data rate, Noisy Channel: Shannon’s

Capacity, calculation of data rate using both limits.

Digital Transmission

Digital to Digital Conversion: Line coding, schemes (RZ, NRZ, Manchester, Differential

Manchester), block coding.

Analog to Digital Conversion: Sampling, Nyquist rate of sampling, Pulse code modulation

(PCM), Delta Modulation (DM), Adaptive Delta Modulation (ADM), parallel and serial

transmission.

Analog Transmission

Digital to Analog: Amplitude shift keying (ASK), Frequency Shift Keying (FSK), Phase

Shift Keying (PSK), Quadrature Amplitude Modulation (QAM).

Analog to Analog Conversion:

Amplitude Modulation (AM), Frequency Modulation (FM), Phase Modulation.

12hours

Bandwidth Utilization Techniques

Multiplexing: FDM, Synchronous & Statistical TDM, WDM.

04hours

Transmission Medium

Guided media: Twisted pair, Coaxial, Fiber optics.

Unguided: Radio waves, microwaves, Infrared, Antenna, Communication satellites

(qualitative study only).

06hours

Switching and Telephone network

Circuit switched networks, Packet Switched networks, Virtual Circuit switch.

Major components of telephone network, Dial up modem, DSL and ADSL modems, Cable

TV for data transfer (qualitative study only)

04hours

Data link Layer:

Types of errors, framing (character and bit stuffing), error detection & correction methods,

Linear and cyclic codes, checksum.

Protocols: Stop & wait ARQ, Go-Back- N ARQ, Selective repeat ARQ, HDLC (qualitative

study only).

Physical addressing: MAC address and its format.

04hours

Medium Access sub layer

Point to Point Protocol, Token Ring: Reservation, Polling. Multiple access protocols: Pure

& Slotted ALOHA, CSMA, CSMA/CD, CSMA/CA.

Channelization: FDMA, TDMA, CDMA (Qualitative study only).

Wired and Wireless LAN: Standards, fast Ethernet, Protocol 802.11, Bluetooth.

08hours

Network layer

Internetworking & devices: Repeaters, Hubs, Bridges, Switches, Router, Gateway,

Addressing: IP addressing, Subnetting, Routing techniques: static vs. dynamic routing ,

Protocols: RARP, ARP, IP, ICMP

11 hours

Transport layer

Process to Process delivery: UDP, TCP

03 hours

Application Layer

Introduction to DNS, Remote logging, FTP, Electronic mail, WWW & HTTP

CMS-A-SEC-A-3-2-TH: Internet of Things (IoT) Skill Enhancement Course: SEC-A: Choice -2, Theory, Credit:02, Contact hours: 40.

 Introduction to Internet of Things (IoT)

Defining IoT, Characteristics of IoT, Physical design of IoT, Functional blocks of IoT,

Communication models & APIs.

04 hours

IoT and M2M

Difference between IoT and M2M, Software defined Network, network function

virtualization (NFV), difference between SDN and NFV.

04 hours

Network & Communication aspects

Wireless medium access issues, MAC protocol survey, Survey routing protocols,

Sensor deployment & Node discovery, Edge connectivity and protocols, Fog/Gateway

Devices for Data aggregation and dissemination, Security challenges.

08 hours

IoT Physical Servers and Cloud Offerings

Introduction to Cloud Storage models and communication APIs Web Server – Web Server

for IoT, Cloud for IoT, Python web application framework.

05 hours

Developing IoTs

Introduction to Python, Introduction to different IoT tools, Developing applications

through IoT tools, Developing sensor based application through embedded system platform,

Implementing IoT concepts with python.

08 hours

IoT Physical Devices and Endpoints Introduction to Raspberry PI-Interfaces (serial, SPI,

I2C) Programming – Python program with Raspberry PI with focus of interfacing external

gadgets.

04 hours

IoT Analytics

Signal processing, real-time and local analytics, Databases, cloud analytics and applications.

04 hours

Domain specific applications of IoT

Home automation, Industry applications, Surveillance applications.

CMS-A-SEC-A-3-1-TH: Computer Graphics Skill Enhancement Course: SEC-A: Choice -1: Theory, Credit:02, Contact hours: 40.

 Introduction

Basic concepts of Graphics Devices– CRT monitor, Monochrome and Color Monitor

displaying technique only, Physical and logical units of graphics devices – Pixel and its

different properties, Basic idea for image or picture formation using pixels – Raster Scan and

Vector Scan.

05 hours

Basic geometrical shapes formation algorithms

Concepts Co-ordinate System, Line Segment, Digital Differential Analyzer, Circle and arc

segment, elliptic segment, Bresenham’s and Midpoint scan conversion algorithms.

05 hours

Two and Three Dimensional Transformations

Transformations operations - Translation, Rotation, Scaling. Reflection, Shearing and Inverse

of these operations, Homogeneous coordinate system representation, matrix representation.

Composite Transformations Operations – Basic ideas and matrix representations by matrix

concatenation for a particular operation.

14 hours

Two Dimensional Clipping

View port, window port, display device, Point Clipping, Line Clipping, Cohen-Sutherland

line clipping algorithm, Sutherland Hudgeman polygon clipping algorithm

08 hours

Projection

Basic Concept of Projection operation and its application, Classification – Perspective,

Parallel and its subclasses, Principles of these projections (Geometric representation only, no

Mathematical Foundation and algorithms)

06 hours

Applications

Basic Concepts Computer Art, Animation – Animating and modeling of real world,

Morphing – Classification of morphing and Application to the Advertisements and

publicities.

CMS-A-CC-3-7-P: Operating Systems Lab. Core Course- 7: Practical, Credit: 02, Contact hours: 40. Shell programming in LINUX

 1. Write a shell script to convert the content of a file from lower case to upper case.

2. Write a shell script to count the words, lines and characters of a given file. File name should be

provided at run time.

3. Write a shell script that take a word from user and find out the frequency of the word in a given

file.

4. Write a shell script that gets executed at the moment of user login and it displays Good Morning,

Good afternoon, Good Evening, Good Night, depending upon the time at which the user logs on.

5. Write a shell script to print Pascal diamond.

6. Write a shell script to find a number using sequential search method.

7. Write a shell script to find a number using binary search technique.

8. Write a shell script to sort a set of integer numbers using bubble sort.

9. Write a shell script to find out the factorial of a given number.

10. Write a shell script to reverse a string and check whether it is a palindrome.

11. Write a shell script to find the roots of a quadratic equation ax2 + bx +c = 0, considering all

possible cases.

12. Write a shell script for menu based system to insert records for employees with employee ID,

name, designation, salary in a data file, also display records when necessary. Display salary for

the employee asked.

CMS-A-CC-3-7-TH: Operating Systems Core Course- 7: Theory, Credit: 04, Contact hours: 60.

 Introduction

Basic OS functions, types of operating systems- batch processing, multiprogramming, time

sharing, multiprocessing, distributed and real time systems.

6 hours

Operating System Organization

Processor and user modes, kernels, system calls and system programs.

6 hours

Process

System view of the process and resources, process control block, I/O and CPU bound

process, process hierarchy, concept of threads

Process Scheduling: Preemptive and non-preemptive scheduling, Long term scheduling,

short term/CPU scheduling (FCFS, SJF, SRJF, RR and priority) and medium term

scheduling

Process Synchronization: Concurrent processes, critical section, semaphores and

application, methods for inter-process communication;

18 hours

Deadlock:

Definition, Prevention, Avoidance, Detection, Recovery.

9 hours

Memory Management

Physical and logical address space; memory allocation strategies – fixed and variable

partitions, paging, segmentation, virtual memory

14 hours

File and I/O Management

Directory structure, file operations, file allocation methods, disk management.

5 hours

Protection and Security

Policy mechanism, Authentication

CMS-A-CC-3-6-P: Computational Mathematics Lab. Core Course- 6: Practical, Credits:02, Contact hours: 40.

 Lab. based on Numerical Methods using C.

CMS-A-CC-3-6-TH: Computational Mathematics Core Course- 6: Theory, Credits: 04, Contact hours: 60.

 Introduction

Set Theory: Finite and Infinite Sets, Uncountable Infinite Sets, Relations: Properties of

Binary Relations, Closure, Partial Ordering Relations, Equivalence, Functions: definition,

one-to-one, onto and invertible, Mathematical Functions: Exponential and Logarithmic,

Counting: Mathematical Induction, Pigeonhole Principle, Permutation and Combination,

Binomial Theorem, Principle of Inclusion and Exclusion.

10 hours

Introduction to Probability

Elementary events, Sample space, Classical and Axiomatic definition of Probability,

Theorems on Total Probability, Conditional Probability, Bernoulli Trials and Binomial

Distribution, Bayes’ Theorem, Random Variables, Expectation, Variance, Standard

Deviation.

10 hours

Growth of Functions

Asymptotic Notations, Standard notations and common functions with simple examples.

04 hours

Recurrences

Relations, Generating Functions, Linear Recurrence Relations with Constant Coefficients

and their solution, Substitution Method, Recurrence Trees.

06 hours

Numerical Methods (Algorithmic Approach)

Errors: Approximate and Rounding of Numbers, Significant digits, Errors and their types,

Propagation of errors.

Interpolation: Newton Forward and Backward interpolation, Lagrange interpolation.

Solving a Set of Linear Equations: Gaussian Elimination, Gauss–Jordan, Iteration methods

a n d t h ei r convergence conditions, Gauss-Seidel, Gauss-Jacobi Iterative Methods.

Solving Non-linear equations: Bisection, Regula-falsi, Secant and Newton-Raphson, their

order of convergence.

Solving Differential Equations: Euler, Runge-Kutta second and fourth order methods.

Numerical Integration:

Trapezoidal and Simpson’s 1/3rd rules.

Curve fitting :

Least square approximation, Linear regression, Polynomial regression, Fitting Exponential

and Trigonometric functions.

Graph Theory

Basic Terminology, Models and Types, Multi graphs and Weighted graphs, Graph

Representation, Graph Isomorphism, Connectivity, Euler and Hamiltonian Paths and

Circuits, Planar Graphs, Trees and their basic terminologies and properties.

CMS-A-CC-3-5-P: Computer Organization Lab. Core Course-5, Practical, Credits: 02, Contact hours:40.

 (1). Construct an Arithmetic Unit capable of performing 4-bit subtraction and Addition using 2's

complement method. Use Parallel Adders and other necessary logic gates.

(2). Construct a logical unit using logic gates capable of performing 4-bit, Bitwise ORing, ANDing,

XORing and inversion.

(3). Construct a 4-bit ALU unit which can perform the following operation;

Selection Function

S1 S0

0 0 Addition

0 1 Subtraction

1 0 XOR-ing

1 1 Complement

(4). Construct a 2-bit Carry Look Ahead Adder using logic gates.

(5). Study and Construct a 1-digit BCD/Decimal adder using parallel adders and other necessary logic

gates.

(6). Construct a Binary Multiplier using basic logic gates.

(7). Construct a Binary Divider using basic logic gates.

(8). Subtraction with 1's complement method using parallel adders and other necessary logic gates.

(9). Construction of BCD Subtractor with 9'S complement method using parallel adders and logic gates.

(10). Construction of BCD Subtractor with 10'S complement method using parallel adders and logic

gates.

(11). Binary magnitude comparators (up to 4 bits) using parallel adder and logic gates.

(12). Construct a Binary 4-bit and 8-bit adder using logic gates.

(13). Construct a Serial in Serial out 4-bit register.

(14). Construct a 4-bit Universal Shift register.

(15). Construct a 4 bit ring counter.

(16). Construct a 4 - bit Johnson Counter.

(17) Construct RAM (4-bit) and extend it

(18). Horizontal and Vertical Cascading of Memory modules.

(19). Code converters using memory modules.

CMS-A-CC-3-5-TH: Computer Organization and Architecture Core Course- 5: Theory, Credits:04, Contact hours: 60.

 Basic Structure of Computers (Qualitative Discussion)

Computer Types, Basic Functional Units, Basic Operational Concept, Bus Structure,

Software, Performance, Multiprocessor and Multicomputer, IAS Computer, Historical

perspectives.

05 hours

Register Transfer and Micro-operation

Register Transfer Language, Register Transfer, Bus and Memory Transfers, Three State Bus

Buffers, memory Transfer, Arithmetic and Logical micro-operations, Shift and Arithmetic

shifts.

05 hours

Basic Computer Organization and Design

Instruction Codes, Stored Program Organization, Indirect Address, Computer Registers,

Common Bus System, Computer Instruction, Timing and Control, Instruction Cycle, fetch

Decode, Register Reference Instructions, Memory Reference Instruction, Input-Output and

Interrupt, Design of Basic Computer, Design of Accumulator Logic.

05 hours

CPU Organization

Arithmetic and Logic Unit (ALU)- Combinational ALU, 2'S Complement Addition,

Subtraction Unit, Booths Algorithm for Multiplication, Division Hardware using Restoration

Division Algorithm.

General register organization, Control Word, Accumulator Based, Register Based, Stack

Type CPU organization.

06 hours

Control Unit

Hardwired Control Unit, Micro-programmed Control Unit: Control memory, Address

Sequencing, conditional branching, mapping of instructions, subroutine, Design of Control

Unit.

07 hours

CPU Registers

Program Counter, Stack Pointer Register, Memory Address Register, Instruction Register,

Memory Buffer Register, Flag registers, Temporary Registers.

06 hours

Instructions.

Operational Code, Operands, Zero, One, Two and Three Address Instruction, Instruction

Types, Addressing modes, Data Transfer and Manipulation instructions, Program control

instructions.

CISC and RISC processors

Introduction, relative merits and De-merits.

03 hours

Computer Peripherals

VDU, Keyboard, Mouse, Printer, Scanner (Qualitative approach).

08 hours

Input / Output Organization

Polling, Interrupts, subroutines, Memory mapped IO, IO mapped IO, DMA, I/O Bus and

Protocol, SCSI, PCI, USB, Bus Arbitration.

02 hours

Memory

Primary memory: ROM, PROM, EPROM, EEPROM, Flash memory, RAM: SRAM,

DRAM, Asynchronous DRAMs, Synchronous DRAMs, Structure of Larger Memories,

RAMBUS Memory, Cache Memory: Mapping Functions, Replacement Algorithms,

interleaving, Hit and Rate penalty, Virtual memories, Address Translation, Memory

Management requirements, Secondary Storage: Magnetic Hard Disks, Optical Disks,

Magnetic Tape Systems.

CMS-A-CC-2-4-P: Basic Electronic Devices and Circuits Lab. Core Course-4: Practical, Credits - 02, Contact hours - 40.

 1. Study the forward characteristic of a p-n junction diode and calculate the static and dynamic

resistance.

2. Construct a Half wave rectifier using power diodes and study its load regulation characteristics

with and without capacitor filter.

3. Construct a full wave rectifier using power diodes and study its load regulation characteristics

with and without capacitor filter.

4. Construct a Bridge rectifier using power diodes and study its load regulation characteristics

with and without capacitor filter.

5. Study the reverse characteristic of a Zener diode and calculate the Zener voltage from the

characteristic curve and also calculate the value of current limiting resistance.

6. Construct a voltage regulator using Zener diode and study its load regulation characteristics.

7. Construct a positive and negative voltage regulator using three terminal linear voltage

regulators 78XX and 79XX. Study its load regulation characteristics.

8. Construct a variable positive voltage regulator using three terminal linear voltage regulator

LM317 and study its load regulation characteristics for different sets of output voltage.

9. Study the output characteristics of a transistor in CE mode and calculate the dc current gain (β)

from the graph.

10. Realize a NOT operation using a Transistor. Draw its transfer characteristics and measure the

threshold voltage.

11. Construct and study an Inverting amplifier using OPAMP with different sets of voltage gain

and calculate the gain from the graph.

12. Construct and study a non-inverting amplifier using OPAMP with different sets of voltage gain

and calculate the gain from the graph.

13. Construct and study an inverting adder using OPAMP capable of adding two inputs.

14. Construct and study a non-inverting adder using OPAMP capable of adding two inputs.

15. Construct and study a subtractor using OPAMP.

16. Construct and study the OPAMP as a subtractor.

17. Construct and study the OPAMP as a differentiator. Apply sine and square wave and study and

record the output waveforms.

18. Construct and study the OPAMP as an integrator. Apply sine and square wave and study and

record the output waveforms.

19. Construct an astable multivibrator using Timer 555.

20. Construct and study a R-2R ladder digital to analog converter.

21. Convert an analog signal into digital using ADC 0804/0808/0809.

CMS-A-CC-2-4-TH: Basic Electronic Devices and Circuits Core Course-4: Theory, Credits - 04, Contact hours - 60.

 Basics of Circuit Theory

KVL, KCL, Thevenin's, Norton's, superposition, maximum power transfer theorem,

application to simple problems.

04 hours

Theory of Semiconductor devices

Semiconductor materials and their properties, classification based on energy band

diagram, Intrinsic and extrinsic semiconductors, P & N type.

03 hours

Diode and its applications

PN junction diode: Construction, characteristics and working principle, unbiased and

biased band diagram, Single Phase Half and Full wave rectifier circuits, working principle,

derivation and calculation of average dc current, average dc voltage, RMS, ripple factor,

efficiency, Peak Inverse Voltage (PIV), Circuit and working of bridge rectifiers.

Zener diode: Characteristics and its application as a voltage regulator, simple problems.

09 hours

Bipolar Junction Transistor

Working Principle of Junction bipolar Transistor (including current components, current

gains), Modes: Common Emitter (CE), Common Base (CB), Common Collector (CC), DC

biasing in CE mode: Fixed bias, Emitter Stabilized bias, Voltage divider bias and

Collector feedback bias, simple related numerical problems, Q-Point, dc load line analysis,

single stage CE mode based transistor amplifying action (qualitative study).

Inverter using transistors: Transistor as a switch, transfer characteristics and threshold

voltages.

08 hours

Unipolar Junction Transistor

Principle of JFET and MOSFET, Depletion and Enhancement mode operations, Concept of

NMOS, PMOS and CMOS. CMOS circuits for basic logic gates (AND, OR, NOT, NAND

and NOR).

08 hours

PNPN Devices

Construction, characteristics, working and simple applications: SCR, DIAC, TRIAC.

Power supply (qualitative study only): SCR regulated power supply, Switch Mode Power

Supply (SMPS).

06 hours

Optoelectronic materials (Qualitative study)

Construction and working: LED, LCD, Photo Sensors and basics of Optical fiber and

Opto-couplers).

02 hours

Operational Amplifiers (OPAMP)

Ideal Characteristics, Open loop operation, Single and double ended operation, Common

mode operation, Common mode rejection ratio (CMRR), Offset parameters, Concept of

Virtual ground.

Application: Inverting, Non-inverting Amplifier, Inverting and Non-inverting Adder,

Differentiator, Integrator, Scale changer and Schmitt Trigger.

Signal Generation using OPAMP: Monostable, Astable (Square wave generator).

12 hours

Timer

Construction and Functional description of 555, Mono-stable, Bi-stable and Astable

Operation, VCO.

Data Acquisition

Digital to Analog Converter (DAC): R-2R ladder, Weighted resistor type.

Analog to Digital Converters (ADC): Flash, Counter, Successive Approximation Register

(SAR), Dual Slope type.

CMS-A-CC-2-3-P: Data Structure Lab using C. Core Course- 3: Practical, Credits - 02, Contact hours - 40.

 1. Write a program to search an element from a list. Give user the option to perform Linear or

Binary search.

2. Write a program to sort a list of elements. Give user the option to perform sorting using Insertion

sort, Bubble sort or Selection sort.

3. Implement Linked List. Include functions for insertion, deletion and search of a number, reverse

the list and concatenate two linked lists.

4. Implement Doubly Linked List. Include functions for insertion, deletion and search of a number,

reverse the list.

5. Implement Circular Linked List. Include functions for insertion, deletion and search of a

number, reverse the list.

6. Perform Stack operations using Linked List implementation.

7. Perform Stack operations using Array implementation.

8. Perform Queue operations using Array and linked list implementation.

9. Create and perform different operations on Double-ended Queues using Linked List

implementation.

10. Write a program to scan a polynomial using linked list and add two polynomials.

11. Write a program to create a Binary Search Tree and include following operations in tree:

(a) Insertion (Recursive and Iterative Implementation).

(b) Deletion.

(c) Search a node in BST.

(d) Display its preorder, postorder and inorder traversals recursively.

(e) Display its preorder, postorder and inorder traversals Iteratively.

(f) Display its level-by-level traversals.

(g) Count the non-leaf nodes and leaf nodes.

(h) Display height of tree.

(i) Create a mirror image of tree.

12. Write a program to reverse the order of the elements in the stack using additional stack.

13. Write a program to reverse the order of the elements in the stack using additional Queue.

CMS-A-CC-2-3-TH: Data Structure Core Course-3: Theory, Credits - 04, Contact hours - 60.

 Introduction to Data Structure

Abstract Data Type.

Arrays

1D, 2D and Multi-dimensional Arrays, Sparse Matrices. Polynomial representation

Linked Lists

Singly, Circular and Doubly Lists, Polynomial representation.

Stacks

Array and linked representation of stack, Prefix, Infix and Postfix expressions, utility and

conversion of these expressions from one to another, evaluation of postfix and prefix

expression using stack, applications of stack, limitations of Array representation of stack.

Queues

Array and Linked representation of Queue, Circular Queue, De-queue, Priority Queues.

Recursion

Developing Recursive Definition of Simple Problems and their implementation; Advantages

and Limitations of Recursion; Understanding what goes behind Recursion (Internal Stack

Implementation), Tail recursion.

Trees

Introduction to Tree as a data structure: Binary Trees (Recursive and Iterative Traversals),

Binary Search Tree (Traversal, Insertion, Deletion and Searching), Threaded Binary Trees

(Traversal and advantages).

Searching and Sorting

Linear Search, Binary Search, Comparison of Linear and Binary Search with respect to time

complexity, Selection Sort, Bubble sort, Insertion Sort, Merge Sort, Quick sort, Heap sort,

Shell Sort, Radix sort, Comparison of Sorting Techniques with respect to time complexity.

Hashing

Introduction to Hashing, Different hashing Techniques, Collision and resolving collision by

Open Addressing, Closed Hashing, Separate Chaining, Choosing a Hash Function.