ist (honours)

1

Course Structure of

B. Sc. In Information Science and Telecommunication

(B. Sc. IST)(Honours) Syllabus

Under

Choice Based Credit System

Effective from 2016

Department of IST Ravenshaw University Cuttack

2

Scheme of UG in IST (Honours) Under Choice Based Credit System (CSBS)

A: Courses for Honours Students

Semester.

Course Course Code

Title Remarks

I Core C101 Basic Circuit Theory and Network Analysis

Compulsory

C102 Programming in C Generic Elective

G101 Elective from other Stream Students to choose course from Mathematic/Physics/Statistics.

Ability Enhancement

AE101 Environmental Science Compulsory

II Core C203 Electronics Circuit Compulsory C204 Data Structure

Generic Elective


Ability Enhancement

AE202 Communicative English Compulsory

Skill Enhancement

SE201 MIL (Odia/Hindi/Alt. English) Compulsory; the students to choose one of the courses

III Core C305 Digital Electronics and VHDL Compulsory C306 Operating Systems C307 Programming in Java

Generic Elective


Skill Enhancement

SE302 Computer Science Compulsory

IV Core C408 Signals and Systems Compulsory C409 Operational and Amplifiers and

Applications C410 Database Management Systems

Generic Elective


Skill Enhancement

SE403 A. R-Programming Students to choose one of the two courses

B. HTML Programming

V Core C511 Microprocessors and Microcontrollers

Compulsory

C512 Computer Networks Skill Enhancement

SE504 A. Android Programming

Students to choose one of the two courses

B. XML Programming

Discipline Specific

D501 A. Internet and Web Technology Students to choose one of the two courses B. Network Programming

D502 A. Discrete Structure Students to choose one of the two courses B. Probability & Statistics

VI Core C613 Communication Electronics Compulsory C614 Software Engineering Compulsory Discipline Specific

D603 A. Numerical Methods Students to choose one of the two courses B. Mathematics Foundation for

Electronics D604 Project Work Compulsory

3

B: Generic Electives

For students opting IST as Generic elective

Semester Code Course Title Remarks I G 101 Programming Fundamentals

(Theory and Practical) For the students who will choose IST as Generic Elective

II G 202 Computer Network and Internet Theory (Theory and Practical)

For the students who will choose IST as Generic Elective

III G 303 Microprocessor and Microcontroller System (Theory and Practical)


IV G 404 Communication System (Theory and Practical)


4

IST(HONOURS) SEMESTER- I

Core Course C101 - Basic Circuit Theory and Network Analysis (6 Credits)

Full Marks 100 (Mid Sem 20 + End Sem 80)

THEORY – 70 (Mid Sem 20 + End Sem50) Unit - I Basic Circuit Concepts: Voltage and Current Sources, Resistors: Fixed and Variable resistors, Construction and Characteristics, Colour coding of resistors, resistors in series and parallel. Inductors: Fixed and Variable inductors, Self and mutual inductance, Faraday’s law and Lenz’s law of electromagnetic induction, Energy stored in an inductor, Inductance in series and parallel, Testing of resistance and inductance using multimeter. Capacitors: Principles of capacitance, Parallel plate capacitor, Permittivity, Definition of Dielectric Constant, Dielectric strength, Energy stored in a capacitor, Air, Paper, Mica, Teflon, Ceramic, Plastic and Electrolytic capacitor, Construction and application, capacitors in series and parallel, factors governing the value of capacitors, testing of capacitors using multimeter. Unit- II Circuit Analysis: Kirchhoff’s Current Law (KCL), Kirchhoff’s Voltage Law (KVL), Node Analysis, Mesh Analysis, Star-Delta Conversion. DC Transient Analysis: RC Circuit- Charging and discharging with initial charge, RL Circuit with Initial Current, Time Constant, RL and RC Circuits with Sources, DC Response of Series RLC Circuits. Unit - III AC Circuit Analysis: Sinusoidal Voltage and Current, Definition of Instantaneous, Peak, Peak to Peak, Root Mean Square and Average Values. Voltage-Current relationship in Resistor, Inductor and Capacitor, Phasor, Complex Impedance, Power in AC Circuits: Instantaneous Power, Average Power, Reactive Power, Power Factor. Sinusoidal Circuit Analysis for RL, RC and RLC Circuits. Resonance in Series and Parallel RLC Circuits, Frequency Response of Series and Parallel RLC Circuits, Quality (Q) Factor and Bandwidth. Passive Filters: Low Pass, High Pass, Band Pass and Band Stop. Unit - IV Network Theorems: Principal of Duality, Superposition Theorem, Thevenin’s Theorem, Norton’s Theorem, Reciprocity Theorem, Millman’s Theorem, Maximum Power Transfer Theorem. AC circuit analysis using Network theorems. Unit - V Two Port Networks: Impedance (Z) Parameters, Admittance (Y) Parameters, Transmission (ABCD) Parameters. Reference Books:

1. Network Theory – P K Satpathy, P Kabisatpathy, S P Ghosh and A K Chakraborty – Tata McGraw Hill, New Delhi.

2. Circuit Theory, A K Chakraborty 3. S. A. Nasar, Electric Circuits, Schaum’s outline series, Tata McGraw Hill (2004) 4. Electrical Circuits, M. Nahvi and J. Edminister, Schaum’s Outline Series, Tata McGraw- Hill.(2005)

5

PRACTICALS -30 (End Semester Evaluation)

1. Familiarization with Resistance in series, parallel and series – Parallel.

2. Familiarization with Capacitors in series & Parallel.

3. Familiarization with Voltage sources in series, parallel and series – Parallel

4. Familiarization with Voltage and Current dividers

5. Multimeter – Checking of components.

6. Measurement of Amplitude, Frequency & Phase difference using CRO.

7. Verification of Kirchoff’s Law.

8. Verification of Norton’s theorem.

9. Verification of Thevenin’s Theorem.

10. Verification of Superposition Theorem.

11. Verification of the Maximum Power Transfer Theorem.

12. RC Circuits: Time Constant of Differentiator.

13. RC Circuits: Time Constant of Integrator.

14. Designing of a Low Pass RC Filter and study of its Frequency Response.

15. Designing of a High Pass RC Filter and study of its Frequency Response.

6


Core Course C102 - Programming in C (6 Credits)


THEORY – 70 (Mid Sem 20 + End Sem 50) Unit - I Introduction to C language: Character Set, C Tokens, Key Words and Identifiers, Constants, Variables, Data Types, Declaration of Variables, Assigning Values to Variables, Defining Symbolic Constants, Defining a variable as Constant, Declaring a variable as volatile.

Operators and Expressions: Introduction, Arithmetic Operators, Relational Operators, Logical Operators, Assignment Operators, Increment and Decrement Operators, Special Operators, Bitwise operator, conditional operator. Arithmetic Expressions, Evaluation of Expressions, Precedence of Arithmetic Operators,

Unit- II Decision making and branching: Decision making with if statement, Simple IF statement, The IF … Else statement, Nesting of IF….Else statements, The Else IF ladder, The switch statement: The ?: Operator. The GOTO statement.

Decision making and looping: Introduction, the While Statement, the DO statement, the FOR statement.

Unit- III Arrays: One-Dimensional Arrays, Declaration of One-dimensional Arrays, Initialization of One-dimensional Arrays, Two-dimensional Arrays, Initializing two-dimensional Arrays.

Character Arrays and Strings: Declaring and Initializing string variables, Reading Strings from Terminal, Writing Strings to screen, putting strings together, Comparison of two strings, String Handling functions.

User defined Functions: Need for user defined Functions, A multi function program, Elements of user defined functions, Definition of Functions, Return values and their types, Function Calls, Function Declaration, Category of Functions- with and without arguments and return Values.

Unit- IV The scope, visibility and lifetime of variables - Automatic variables, Static Variables, Register Variables, External Variables.

Structures: Introduction, Defining a Structure, Declaring Structure Variables, Accessing Structure Members, Structure Initialization, Copying and comparing structure variables, Operations on Individual Members, Arrays of Structures, Union, Structure vs. Union

Pointers: Introduction, Declaring Pointer variables, Pointer expressions and arithmetic, NULL Pointers, Generic Pointers, Passing arguments to function using pointers, Pointers and arrays, Passing arrays to a function, Array of pointers, Function pointers, Array of function pointers, Pointers to pointers, Drawback of pointers.

7

Unit- V Files: Introduction, Types of files, Declaring a file pointer, Opening and closing a file, Read data from file using (fscanf(), fgets(), fgetc() and fread()), Writing data to a file using (fprintf(), fputs(), fputc(), fwrite()), Detecting the end of file, renaming a file, creating a temporary file.

Preprocessor Directive: Introduction, Types, #define, Macros, Nesting Macros, Rules for macros, Operation related to macros, #include, #undef, Programming directives, conditional directives, Predefine macro names.

Reference Books: 1. E. Balagurusamy - Programming in ANSI C, TMH, 6th Edition, 2012.

2. ReemaTharaje - Programming in C, 1st Edition, Oxford University press 2012

PRACTICALS – 30 (End Semester Evaluation) 1. WAP to print the sum and product of digits of an integer. 2. WAP to reverse a number. 3. WAP to compute the sum of the first n terms of the following series S = 1+1/2+1/3+1/4+…… and S =1-2+3-4+5……………. 4. Write a function that checks whether a given string is Palindrome or not. Use this function to find whether the string entered by user is Palindrome or not. 5. Write a function to find whether a given no. is prime or not. Use the same to generate the prime numbers less than 100. 6. WAP to compute the factors of a given number. 7. Write a macro that swaps two numbers. WAP to use it. 8. WAP to print a triangle of stars as follows (take number of lines from user):

* ***

***** *******

********* 9. WAP to perform following actions on an array entered by the user:

i) Print the even-valued elements ii) Print the odd-valued elements iii) Calculate and print the sum and average of the elements of array iv) Print the maximum and minimum element of array v) Remove the duplicates from the array vi) Print the array in reverse order

The program should present a menu to the user and ask for one of the options. The menu should also include options to re-enter array and to quit the program.

8

10. WAP that prints a table indicating the number of occurrences of each alphabet in the text entered as command line arguments. 11. Write a program that swaps two numbers using pointers. 12. Write a program in which a function is passed address of two variables and then alter its contents. 13. Write a program which takes the radius of a circle as input from the user, passes it to another function that computes the area and the circumference of the circle and displays the value of area and circumference from the main() function. 14. Write a program to find sum of n elements entered by the user. To write this program, allocate memory dynamically using malloc() / calloc() functions or new operator. 15. Write a menu driven program to perform following operations on strings:

a) Show address of each character in string b) Concatenate two strings without using strcat() function. c) Concatenate two strings using strcat() function. d) Compare two strings e) Calculate length of the string (use pointers) f) Convert all lowercase characters to uppercase g) Convert all uppercase characters to lowercase h) Calculate number of vowels i) Reverse the string

16. Given two ordered arrays of integers, write a program to merge the two-arrays to get an ordered array. 17. WAP to display Fibonacci series (i) using recursion, (ii) using iteration 18. WAP to calculate Factorial of a number (i) using recursion, (ii) using iteration 19. WAP to calculate GCD of two numbers (i) with recursion (ii) without recursion. 20. Write a menu-driven program to perform following Matrix Operations (2-D array implementation):

a) Sum b) Difference c) Product d) Transpose

21. Write a function that reverses the elements of an array in place. The function must accept only one pointer value and return void. 22. Write a program that will read 10 integers from user and store them in an array. Implement array using pointers. The program will print the array elements in ascending and descending order. 23. W.A.P to find size of various data types on your system. 24. W.A.P to print ‘HELLO WORLD’ using pointers 25. W.A.P to add two floating point numbers into integers. 26. W.A.P to find biggest of three numbers using pointers. 27. W.A.P to add two numbers using function and pointers 28. W.A.P to display and array of given numbers using pointers. 29. W.A.P to read and print an array of n numbers, then find out the smallest numbers. 30. W.A.P to search a value from an array.

9

31. W.A.P to read a file character by character and display it simultaneously in the screen. 32. W.A.P to count the number of characters and numbers of lines in a file. 33. W.A.P to print the text of a file on screen by printing the text line by line and display the line numbers before the text in each line. 34. W.A.P to compare two files to check whether they are identical or not. 35. W.A.P to copy one file into another. 36. W.A.P to merge two files in to third file. 37. W.A.P to read the details of a student and then print it on the screen as well as write into file.

10

IST SEMESTER- I

Generic Elective G101 - Programming Fundamentals(6 Credits)


(Students of IST are to choose this paper from Mathematics/Physics/Statistics and students of other streams opting IST as Generic Elective are to read this paper.)

THEORY – 70 (Mid Sem 20 + End Sem 50)

Unit- I Planning Computer Programs: Introduction, Computer and Computer Languages – Machine Language, Assembly Language and High Level Language, Algorithm, Flow Charts and Pseudocode, Computer Programming – Procedural vs. Object-oriented Programming Introduction to C: History of C, C Program Structure - Using main() function, C Compiler, Compiling and Executing Simple Programs in C

Program Constructs – Keywords, Data Types, Variables, Constants; Declaring, Defining and Initializing Variables.

Unit- II Operators, Basic I/O Operations - Character I/O, Formatted and Console I/O, Using Basic Header Files, Expressions, Conditional Statements (if construct and switch-case construct) and Iterative Statements (while, do while and for construct) , Use of break and continue in Loops, Using Nested Statements (Conditional as well as Iterative). Unit- III Functions and Utility of functions, Call by Value, Functions returning value, Return data type of functions, Functions parameters, Differentiating between Declaration and Definition of Functions Creating and Using One Dimensional Arrays ( Declaring and Defining an Array, Initializing an Array, Accessing individual elements in an Array, Manipulating array elements using loops), Use Various types of arrays (integer, float and character arrays / Strings) Two- dimensional Arrays (Declaring, Defining and Initializing Two Dimensional Array, Working with Rows and Columns)

Unit- IV Pointers: Introduction, Understanding Pointers, Accessing the address of a variable, Declaring Pointer Variables, Initialization of Pointer Variables, Accessing a variable through its pointer, Chain of pointers, Pointer and Array, Pointer and Function, Pointer Expressions and Pointer Arithmatics, Pointers as Function Arguments (Call By Reference) Unit- V Derived Data Types (Structures and Unions) Understanding utility of structures and unions, Declaring, initializing and using simple structures and unions, Manipulating individual members of structures and

11

unions, Array of Structures, Individual data members as structures, Passing and returning structures from functions, Structure with union as members, Union with structures as members. Reference Books: 1. E Balaguruswamy, "Object Oriented Programming with C++", Tata McGraw-Hill Education, 2008. 2. ReemaTharaje - Programming in C, 1st Edition, Oxford University press 2012 3. Computer Fundamentals, P K Sinha PRACTICALS – 30 (End Semester Evaluation) 1. Write a program to calculate Simple Interest. 2. Write a program to calculate addition of two numbers. 3. Write a program to calculate area of a circle. 4. Write programs using all arithmetic operators, relational operators and logical operators. 5. Write a program using increment and decrement operators. 6. Write a program to find greatest of two numbers and of three numbers. 7. Write a program to find gross salary of a person. 8. Write a program to check whether a given no. is even or odd. 9. Write a program to check entered year is leap year or not. 10. Write a program to check whether a person is minor or major. 11. Write a program to check whether a given triangle is valid or not. 12. Write a program to find grade of a student from given set of marks. 13. Write a program to display your name 10 times. 14. Write a program to display 1 to 10 and 20 to 10. 15. Write a program to display even numbers and odd numbers upto 50. 16. Write a program to calculate factorial of a number. 17. Write a program to check whether a given number is Prime or not. 18. Write a program to check whether a given number is Armstrong no or not. 19. Write a program to display reverse of a number. 20. Write a program to check whether a given number is palindrome or not. 21. Write a program to calculate sum of all integers from 1 to 15. 22. Write a program to display Fibonacci series upto 10th term. 23. Write a program to find out largest and smallest element in an array. 24. Write a program to sort an array. 25. Write a program to calculate sum of all elements present in an array. 26. Write a program to multiply two 2-D array. 27. Write a program using function:

(i) Using arguments (ii) Using return type (iii) Using arguments and return type (iv) Call by value and Call by reference

28. Write a program using pointer. 29. Write a program using structure. 30. Write a program using union.

12


Ability Enhancement Compulsory Course AE101-Environmental Science (2 Credits) Full Marks: 50 (End Semester Evaluation)

Unit- I: Ecosystems Ecosystem- Structure and function of ecosystem (Abiotic and Biotic factors); Energy flow in an ecosystem.

Environmental Problems: global warming and Climate change, ozone layer depletion.Deforestation, acid rain; impacts of environmental disturbances. Unit - II: Natural Resources and Biodiversity

Energy resources: Renewable and non-renewable energy sources. Biodiversity patterns and global biodiversity hot spots, India as a mega-biodiversity nation; Endangered and endemic species of India, Threats to biodiversity, Conservation of biodiversity: In-situ and Ex-situ conservation of biodiversity.

Unit -III: Environmental Pollution, Impact and Management

Environmental pollution: Air, water, soil and noise pollution, Nuclear hazards and human health risks, Solid waste management: Control measures of urban and industrial waste.

Environment Protection Act and International agreements: Montreal and Kyoto protocols and Convention on Biological Diversity (CBD).

Reference Books:

1. Carson, R. 2002. Silent Spring.Houghton Mifflin Harcourt. 2. Gadgil, M., &Guha, R. 1993. This Fissured Land: An Ecological History of India. Univ. of California

Press. 3. Gleeson, B. and Low, N. (eds.) 1999. Global Ethics and Environment, London, Routledge. 4. Gleick, P. H. 1993. Water in Crisis.Pacific Institute for Studies in Dev., Environment &

Security.Stockholm Env.Institute, Oxford Univ. Press. 5. Groom, Martha J., Gary K. Meffe, and Carl Ronald Carroll. Principles of Conservation Biology.

Sunderland: Sinauer Associates, 2006. 6. Grumbine, R. Edward, and Pandit, M.K. 2013. Threats from India’s Himalaya dams. Science, 339: 36-37. 7. McCully, P. 1996. Rivers no more: the environmental effects of dams (pp. 29-64). Zed Books. 8. McNeill, John R. 2000. Something New Under the Sun: An Environmental History of the Twentieth

Century. 9. Odum, E.P., Odum, H.T. & Andrews, J. 1971. Fundamentals of Ecology. Philadelphia: Saunders. 10. Pepper, I.L., Gerba, C.P. &Brusseau, M.L. 2011. Environmental and Pollution Science.Academic Press.

13

IST(HONOURS) SEMESTER- II

Core Course C203 - Electronics Circuit(6 Credits)


THEORY – 70 (Mid Sem 20 + End Sem 50) Unit- I Diode Circuits: Ideal diode, piecewise linear equivalent circuit, dc load line analysis, Quiescent (Q) point. Rectifiers: HWR, FWR (center tapped and bridge). Circuit diagrams, working and waveforms, ripple factor & efficiency, comparison. Filters: types, circuit diagram and explanation of shunt capacitor filter with waveforms. Zener diode regulator circuit diagram and explanation for load and line regulation, disadvantages of Zener diode regulator. Unit- II Bipolar Junction Transistor: Review of CE, CB Characteristics and regions of operation. Hybrid parameters. Transistor biasing, DC load line, operating point, thermal runaway, stability and stability factor, Fixed bias without and with RE, collector to base bias, voltage divider bias and emitter bias (+VCC and –VEE bias), circuit diagrams and their working. Transistor as a switch, Darlington pair and its applications. Unit- III Feedback Amplifiers: Concept of feedback, negative and positive feedback, advantages and disadvantages of negative feedback, voltage (series and shunt), current (series and shunt) feedback amplifiers, gain, input and output impedances . Barkhausen criteria for oscillations, Study of phase shift oscillator, Colpitts oscillator and Hartley oscillator. Unit- IV MOSFET Circuits: Review of Depletion and Enhancement MOSFET, Biasing of MOSFETs, Small Signal Parameters, Common Source amplifier circuit analysis, CMOS circuits. Unit- V Power Amplifiers: Difference between voltage and power amplifier, classification of power amplifiers, Class A, Class B, Class C and their comparisons. Operation of a Class A single ended power amplifier. Operation of Transformer coupled Class A power amplifier, overall efficiency. Circuit operation of complementary symmetry Class B push pull power amplifier, crossover distortion. Reference Books:

1. Electronic Devices and Circuit Theory, Robert Boylstead and Louis Nashelsky, 9th Edition, 2013, PHI 2. Electronic Devices, David A Bell, Reston Publishing Company 3. J. Millman and C. C. Halkias, Integrated Electronics, Tata McGraw Hill (2001)

14

PRACTICALS – 30 (End Semester Evaluation)

1. Study of the half wave rectifier with filter circuit.

2. Study of the full wave rectifier with filter circuit.

3.Study the V-I characteristics of P-n junction diode.

4. Study of power supply using C filter and Zener diode.

5. Study of clipping and clamping circuits.

6. Study of CB Transistor Amplifier.

7. Study of CE Transistor Amplifier.

8. Study of Voltage divider configuration for transistors.

9. Study of the frequency response of R-C coupled amplifier.

10. Designing of a Single Stage CE amplifier

11. Study of Class A, B Power Amplifier.

12. Study of the frequency response of Tuned amplifier.

13. Designing of an amplifier of given gain for an inverting and non-inverting configuration using an op-amp.

14. Designing of an integrator using op-amp for a given specification

15. Designing of a differentiator using op-amp for a given specification.

16. Study of Hartley Oscillator.

15


Core Course C204 - Data Structure(6 Credits)



Unit- I Introduction, Types of Data Structure, ADT, Linked Lists(Array and Linked Representation) Single Linked List, static & dynamic memory representation, operation in linked list (create, traverse, insertion, deletion, merging, sorting and ascending order reversed linked list), Doubly linked list creation and traverse, circular linked list creation and traverse. Unit- II Stacks:Implementing single / multiple stack/s in an Array; Operation in stacks, Prefix, Infix and Postfix expressions, Utility and conversion of these expressions from one to another - Conversation from infix to prefix and infix to postfix, Applications of Stack; Limitations of Array Representation of Stack. Recursion: Developing Recursive Definition of Simple Problems and their implementation; Advantages and Limitations of Recursion; Recursion and Internal Stack Implementation

Unit- III Queue:- Introduction, Operation in queue, Array and linked list representation of queue, Limitation of queue, Circular queue, Deque, Priority Queues Tree : Introduction to Tree as a data structure; Basic Terminology, Binary Trees and its representation using Array and Linked List , Expression Trees, traversing of Binary Tree (Preorder, Inorder, Postorder), Binary Trees - Insertion, Deletion Unit- IV Graph – Introduction, terminology, Representation of Graphs (Adjacency Matrix, Adjacency List), Graph Traversal – DFS and BFS, Connected Components, Spanning Tress, Minimum Cost Spanning Trees (Prims and Kruskal Algorithms), Transitive Closure and Shortest Path Algorithm – Dijikstra Algorithm Unit- V Searching:- Introduction, Types of Searching (Sequential and Binary). Sorting:- Introduction, Types (Bubble, Insertion & Selection Sort) Hashing: Introduction, Hash function (Division, Folding, Digit analysis)

Reference Books: 1. ReemaTharaje – Data Structure, Oxford University Press 2012

2. Amiya Kumar Rath&Alok Kumar Jagadev-Data Structures Using C, 2nd Edition, SCITECH Publication.

16


Single Linked List: 1. W.A.P to create a single linked list and traverse. 2. W.A.P to add a node at beginning and end. 3. W.A.P to add a node after and before a node. 4. W.A.P to add a node adds at position. 5. W.A.P to delete at beginning and end. 6. W.A.P to delete after and before a node. 7. W.A.P to delete at a position. 8. W.A.P to search a node. 9. W.A.P to merging of two linked list. 10. W.A.P to reversing a linked list. 11. W.A.P to sort a linked list. 12. W.A.P to create an ascending order linked list.

Double linked list: 13. W.A.P to create a double linked list and traverse. 14. W.A.P to add a node at begins. 15. W.A.P to add a node at ends. 16. W.A.P to add a node after a node. 17. W.A.P to add a node before a node. 18. W.A.P to add a node adds at position. 19. W.A.P to delete at begins. 20. W.A.P to delete at ends. 21. W.A.P to delete after a node. 22. W.A.P to delete before a node. 23. W.A.P to delete at a position. Circular linked list:

24. W.A.P to create a circular linked list and traverse. Stack:

25. W.A.P stacks using an array. 26. W.A.P stacks using a linked list. 27. W.A.P to covert infix to postfix expressions. 28. W.A.P to convert infix to prefix expressions. Queue:

29. W.A.P queue using an array. 30. W.A.P queue using a linked list. 31. W.A.P to create a circular queue. 32. W.A.P to create dqueue. 33. W.A.P using sequential search algorithm. 34. W.A.P using binary search algorithm. 35. W.A.P using bubble sort algorithm. 36. W.A.P using insertion sort algorithm. 37. W.A.P using selection sort algorithm.

17

IST SEMESTER- II Generic Elective

G202 - Computer Network and Internet Technology(6 Credits) Full Marks 100 (Mid Sem 20 + End Sem 80)

(Students of IST are to choose this paper from Mathematics/Physics/Statistics and students of other

streams opting IST as Generic Elective are to read this paper.)


Unit- I Computer Networks: Introduction, Data Communication, components of data communication, data transmission mode, data communication measurement, LAN, MAN, WAN, wireless LAN. Internet: Modem, characteristics of a modem, connectivity for communication - Dial-up connection, ISDN connection, DSL connection, client server model & types. Intranet and Extranet.

Unit- II Network Models: Client/ server network and Peer-to-peer network, Protocols and Standards, OSI Model, TCP/IP Protocol Suit Transmission Media: Introduction, Guided Media - Twisted pair, Coaxial cable, and Optical fiber. Unguided media - Microwave, Radio frequency propagation, Satellite. Unit- III LAN Topologies: Ring, bus, star, mesh and tree topologies.

Network Devices: NIC, repeaters, hub, bridge, switch, gateway and router.

Internet Terms: Web page, Home page, website, Domain name, internet browsers, URL, Hypertext, ISP, Web server, download and upload, online and offline.

Internet Applications: www, telnet, ftp, e-mail, social networks, search engines, Video Conferencing, e-Commerce, m-Commerce, VOIP, blogs, Electronic Data Interchange (EDI)

Unit- IV Introduction to Web Design: HTML and HTML tags, documents, header section, body section, headings, formatting characters (text), font tag, image & pictures, listing, link documents using anchor tag, table handling in HTML, creating frames & forms (Frameset definition, frame definition, nested frameset, HTML forms, elements of a form). Unit- V JavaScript Fundamentals: Introduction to JavaScript, client-side JavaScript and server-side JavaScript, advantages of JavaScript, writing JavaScript into HTML, Elements of JavaScript: Data types, variables, operators, conditional statements, array objects, date objects, string objects.

18

Objects & Events: Document object, Image object, forms & elements, event handling & data validation. Functions in JavaScript:(Built in function, declaring functions, passing parameters, recursive functions) Dialog boxes: (Alert, prompt, & confirm dialog boxes). Reference Books:

1. B. A. Forouzan, Data Communication and Networking, TMH, 2003. 2. Andrew S. Tanenbaum, David J. Wetherall Computer Networks (5th Edition),PHI 3. Ivan Bayross, Web Technology-I,BPB Publications 4. C. Xavier, Web Technology & Design, New Age International Publishers


1. Create HTML document with following formatting - Bold, Italics, Underline, Colors, Headings, Title,

Font and Font Width, Background, Paragraph, Line Brakes, Horizontal Line, Blinking text as well as

marquee text.

2. Create HTML document with Ordered and Unordered lists, Inserting Images, Internal and External linking

3. Create HTML document with Table.

4. Create Form with Input Type, Select and Text Area in HTML.

5. Create an HTML containing Roll No., student's name and Grades in a tabular form.

6. Print a table of numbers from 5 to 15 and their squares and cubes using alert. 8. Print the largest of three

numbers.

7. Find the factorial of a number n.

8. Enter a list of positive numbers terminated by Zero. Find the sum and average of these numbers.

9. A person deposits Rs 1000 in a fixed account yielding 5% interest. Compute the amount in the account at

the end of each year for n years.

10. Read n numbers. Count the number of negative numbers, positive numbers and zeros in the list.

19


Ability Enhancement Compulsory Course AE202-Communicative English (2 Credits)

Full Marks: 50 (End Semester Evaluation)

This is a need based course. It aims to develop the communicative ability of the students in speaking, reading and writing skills. The course also aims to equip the students in use of grammar in meaningful contexts and express themselves in day to day life’s practical situations.

Unit - I Basics of Communication: The process of Communication; Language as a Tool of Communication; Levels of Communication, The Flow of Communication; Communication Networks; Barriers to Communication; Technology in Communication Verbal and Non-verbal Communication: Spoken and written; Formal and Informal Style; Use of bias free English

Unit - II Principles and Practices of Writing: Grammar and Punctuation: Subject-Verb Agreement; Common Mistakes; Punctuation. Sentence Construction Unit– III Reading and Writing: Comprehension; Art of Condensation; Note making; Summarizing; Paragraph Writing; Writing a Review; Dialogue Writing

20


Skill Enhancement Compulsory Course SE201 MIL(Odia/Hindi/Alternative English) (2 Credits)


21

HINDI

ALTERNATIVE ENGLISH

Unit I: Poetry: Shakespeare: Sonnet CXXX; William Blake: London; T S Eliot: Preludes; Thomas Hardy: The Darkling Thrush Wordsworth: It’s a Beauteous Evening Unit II: Short Story: Gabriel Garcia Marquez: Balthazar’s Marvellous Afternoon Amitav Ghosh: Ghost’s of Mrs Gandhi; Omprakash Valmiki: Jhootan Unit 3: Essays Virginia Woolf: Shakespeare’s Sister Chitra Banerjee Divakaruni: Indian Movie, New Jersey B. R. Ambedkar: Who are the Shudras? Prescribed Text: The Individual and Society: Essays Stories and Poems. New Delhi: Pearson, 2006

22

IST(HONOURS) SEMESTER- III

Core Course C305 - Digital Electronics and VHDL(6 Credits)


THEORY – 70 (Mid Sem 20 + End Sem 50) Unit - I Number System and Codes: Decimal, Binary, Hexadecimal and Octal number systems, base conversions, Binary, octal and hexadecimal arithmetic (addition, subtraction by complement method, multiplication), representation of signed and unsigned numbers, Binary Coded Decimal code. Logic Gates and Boolean algebra: Introduction to Boolean Algebra and Boolean operators, Truth Tables of OR, AND, NOT, Basic postulates and fundamental theorems of Boolean algebra, Truth tables, construction and symbolic representation of XOR, XNOR, Universal (NOR and NAND) gates. Unit- II Combinational Logic Analysis and Design: Standard representation of logic functions (SOP and POS),Karnaugh map minimization, Encoder and Decoder, Multiplexers and Demultiplexers, Implementing logic functions with multiplexer, binary Adder, binary subtractor, parallel adder/subtractor. Unit- III Sequential logic design: Latches and Flip flops , S-R Flip flop, J-K Flip flop, T and D type Flip flop, Clocked and edge triggered Flip flops, master slave flip flop, Registers, Counters (synchronous and asynchronous and modulo-N), State Table, State Diagrams, counter design using excitation table and equation. Unit- IV Digital Logic families: Fan-in, Fan out, Noise Margin, Power Dissipation, Figure of merit, Speed power product, TTL and CMOS families and their comparison. Programmable Logic Devices: Basic concepts- ROM, PLA, PAL. Unit- V Introduction to VHDL: A Brief History of HDL, Structure of HDL Module, Introduction to Simulation and Synthesis Tools, Test Benches. VHDL Modules, Delays, data flow style, behavioural style, structural style, mixed design style, simulating design. Introduction to Language: Elements, Keywords, Identifiers, White Space Characters, Comments. VHDL terms, describing hardware in VHDL, entity, architectures, concurrent signal assignment, event scheduling, statement concurrency, structural designs, sequential behaviour, process statements, process declarative region, process statement region, process execution. sequential statements, architecture selection, configuration statements, power of configurations. Reference Books: 1. M. Morris Mano Digital System Design, Pearson Education Asia,( Fourth Edition ) 2. Thomas L. Flyod, Digital Fundamentals, Pearson Education Asia (1994) 3. VHDL Programming by Example, Douglas L Perry, TMH

23


1. To verify and design AND, OR, NOT and XOR gates using NAND gates.

2. To convert a Boolean expression into logic gate circuit and assemble it using logic gate IC’s.

3. Design a Half Adder.

4. Design a Full Adder

5. Design a Half Subtractor.

6. Design a Full Subtractor.

7. Design a seven segment display driver.

8. Design a Decoder.

9. Design a Encoder.

10. Design 4 X 1 Multiplexer using gate.

11. Design 4 X 1 De-Multiplexer using gate.

12. To build a Flip- Flop Circuits using elementary gates. (RS, Clocked RS, D-type).

13. Design a shift register and study Serial and parallel shifting of data.

Experiments in VHDL

1. Half adder using basic and derived gates.

2. Full Adder using basic and derived gates.

3. Half subtractor using basic and derived gates.

4. Full Subtractor using basic and derived gates.

5. Clocked D FF, T FF and JK FF (with Reset inputs).

6. Multiplexer (4x1) and De-multiplexer using logic gates.

7. Decoder (2x4), Encoders.

24


Core Course C306 - Operating Systems (6 Credits)


Unit - I Introduction: Basic OS Functions, Resource Abstraction, Types of Operating Systems-multiprogramming systems, batch systems , time sharing systems; Operating Systems for personal computers &workstations, Process Control & Real Time Systems. Operating System Organization: Processor and User Modes, kernels, System Calls and System Programs. Unit- II Process Management: System view of the process and resources, process abstraction, process hierarchy, threads, threading issues, thread libraries; Process Scheduling, non-pre-emptive and pre-emptive scheduling algorithms. Unit- III Process Synchronization and Deadlock:Concurrent processes, critical section, semaphores, classic synchronization problems, methods for inter- process communication; deadlocks-characterization, prevention, avoidance, detection and recovery. Unit- IV Memory Management:Physical and Virtual Address Space; Memory Allocation Strategies –fixed and variable partitions, paging, segmentation, Virtual Memory-demand paging, Page Replacement Policies. Unit- V File and I/O Management: Directory Structure, file operations, Files Allocation methods, Device Management – Disk Structure, Scheduling and Management Protection and Security: Policy Mechanism, Authentication, Internal Access Authorization. Reference Books: 1. A Silberschatz, P.B. Galvin, G. Gagne, Operating Systems Concepts, 8th Edition, John Wiley Publications 2008. 2. A.S. Tanenbaum, Modern Operating Systems, 3rd Edition, Pearson Education 2007. 3. W. Stallings, Operating Systems, Internals & Design Principles , 5th Edition, Prentice Hall of India. 2008. 4. M. Milenkovic, Operating Systems- Concepts and design, Tata McGraw Hill 1992.

25


Core Course C307 - Programming in Java(6 Credits)

Full Marks 100 (Mid Sem 20 + End Sem 80) THEORY – 70 (Mid Sem 20 + End Sem 50) Unit - I Introduction to Object Oriented Programming, Principles of Object Oriented Languages, Procedural Language Vs. OOP, Applications of OOP Introduction to Java: Java Essentials, JVM, Java Features, Program Structures, IDE Java Programming Constructs- Variables, Constants, Keywords, Data Types, Operators and Expressions Flow of Control - Conditional Statements, and Loops Java Methods (Defining, Scope, Passing and Returning Arguments, Type Conversion and Type Checking) Arrays: Creating & Using Arrays (One Dimension and Multi-dimensional), Referencing Arrays Dynamically, Command-Line Arguments Unit- II Classes and Objects – Class and Class Declaration, Objects and Object Creation, Methods and Method Overloading, Constructors and Constructor Overloading, Cleaning Up, Class Variables and Methods, Objects as parameters, final classes, Object class Java Strings: The String class, Creating & Using String Objects, Manipulating Strings, String Immutability & Equality, and Passing Strings to & from Methods, StringBuffer Classes. Java I/O: Simple I/O using System.out and the Scanner class, InputStream and OutputStream, Byte and Character streams, File Class, Reading/Writing from files. Unit- III Inheritance: Single and Multilevel, Polymorphism: Method Overloading and Overriding, Dynamic Method Dispatch, Abstract Classes. Interfaces and Extending interfaces, Creating and Using Packages, Access Protection, Wrapper Classes, Autoboxing/Unboxing, Enumerations and Metadata Exception Handling – Introduction, Exception Types, Exception Handling Techniques (try-catch, multiple catch, throw and throws, finally), User-Defined Exceptions

26

Unit- IV Multithreading in Java – Introduction, Main Thread, Creating Threads – Extending Thread Class and Implementing Runnable Interface, Thread Life Cycle, Thread Priority, synchronization and communication, suspending/resuming threads. Networking: Using java.net package, Overview of Socket Programming – TCP Socket and Datagram Socket. Library classes: Math, Runtime, Date class Unit- V AWT – Introduction, Components and Containers, Button, Label, CheckBox, Radio Buttons, List Boxes, Choice Boxes, Textfield and Textarea, , Layout managers, menus Event Handling – Introduction, Event Delegation Model, Event Sources and Event Listeners Applets - Introduction, Applet Class and Applet Structure, Running an Applet, Applet Life Cycle Graphics Class – Drawing Line and Rectangle, Circle and Ellipse, Arc and Polygon Reference Books:

1. Programming in Java by Sachin Malhotra and Saurabh Choudhary, Oxford University Press 2. E. Balaguruswamy, "Programming with Java", 4th Edition, McGraw Hill.2009. 3. Cay S. Horstmann, GaryCornell, "Core Java 2 Volume 1 ,9th Edition,Printice Hall.2012 4. Herbert Schildt, ”Java Complete Reference”,9th edition, McGraw Hill Education

PRACTICALS – 30(End Semester Evaluation) 1. To find the sum of any number of integers entered as command line arguments

2. To find the factorial of a given number

3. To learn use of single dimensional array by defining the array dynamically.

4. To learn use of .lenth in case of a two dimensional array

5. To convert a decimal to binary number

6. To check if a number is prime or not, by taking the number as input from the keyboard

7. To find the sum of any number of integers interactively, i.e., entering every number from the keyboard,

whereas the total number of integers is given as a command line argument

8. Write a program that show working of different functions of String and StringBuffer classes like

setCharAt(), setLength(), append(), insert(), concat() and equals().

9. Write a program to create a ―Distance class with methods where distance is computed in terms of feet and

inches, how to create objects of a class and to see the use of this pointer

10. Modify the ―Distance class by creating constructor for assigning values (feet and inches) to the distance

object. Create another object and assign second object as reference variable to another object reference

variable. Further create a third object which is a clone of the first object.

11. Write a program to show that during function overloading, if no matching argument is found, then java

will apply automatic type conversions (from lower to higher data type)

27

12. Write a program to show the difference between public and private access specifiers. The program should

also show that primitive data types are passed by value and objects are passed by reference and to learn use of

final keyword

13. Write a program to show the use of static functions and to pass variable length arguments in a function.

14. Write a program to demonstrate the concept of boxing and unboxing.

15. Create a multi-file program where in one file a string message is taken as input from the user and the

function to display the message on the screen is given in another file (make use of Scanner package in this

program).

16. Write a program to create a multilevel package and also creates a reusable class to generate Fibonacci

series, where the function to generate fibonacii series is given in a different file belonging to the same

package.

17. Write a program that illustrates different levels of protection in classes/subclasses belonging to same

package or different packages

18. Write a program ―DivideByZero that takes two numbers a and b as input, computes a/b, and invokes

ArithmeticException to generate a message when the denominator is zero.

19. Write a program to show the use of nested try statements that emphasizes the sequence of checking for

catch handler statements.

20. Write a program to create your own exception types to handle situation specific to your application (Hint:

Define a subclass of Exception which itself is a subclass of Throwable).

21. Write a program to demonstrate priorities among multiple threads.

22. Write a program to demonstrate multithread communication by implementing synchronization among

threads (Hint: you can implement a simple producer and consumer problem).

23. Write a program to create URL object, create a URLConnection using the openConnection() method and

then use it examine the different components of the URLand content.

24. Write a program to implement a simple datagram client and server in which a message that is typed into

the server window is sent to the client side where it is displayed.

25. Write a program that creates a Banner and then creates a thread to scrolls the message in the banner from

left to right across the applet‘s window.

26. Write a program to get the URL/location of code (i.e. java code) and document (i.e. html file).

27. Write a program to demonstrate different mouse handling events like mouseClicked(), mouseEntered(),

mouseExited(), mousePressed, mouseReleased() and mouseDragged().

28. Write a program to demonstrate different keyboard handling events.

29. Write a program to generate a window without an applet window using main() function.

30. Write a program to demonstrate the use of push buttons.

28

IST SEMESTER- III Generic Elective

G303 - Microprocessor and Microcontroller System(6 Credits) Full Marks 100 (Mid Sem 20 + End Sem 80)




Unit- I Introduction to Microprocessor: Introduction, applications, basic block diagram, speed, word size, memory capacity, classification of microprocessors (mention different microprocessors being used) Microprocessor 8085: Features, architecture -block diagram, internal registers, registerpairs, flags, stack pointer, program counter, types of buses. Multiplexed address and data bus, generation of control signals, pin description of microprocessor 8085. Unit- II 8085 Instructions: Operation code, Operand & Mnemonics. Instruction set of 8085, instruction classification, addressing modes, instruction format. Data transfer instructions, arithmetic instructions, increment & decrement instructions, logical instructions, branch instructions and machine control instructions. Stack operations, subroutine calls and return operations. Delay loops, use of counters, timing diagrams-instruction cycle, machine cycle, T- states, time delay Interrupt structure of 8085A microprocessor, processing of vectored and non-vectored interrupts Unit- III Introduction to Microcontrollers: Basic block diagram, comparison of microcontroller with microprocessors, comparison of 8 bit, 16 bit and 32 bit microcontrollers. MICROCONTROLLER 8051- architecture -internal block diagram, key features of 8051, pin diagram, memory organization, Internal RAM memory, Internal ROM. General purpose data memory, special purpose/function registers, external memory. Unit- IV 8051 Interrupts, Addressing modes and Instruction set: Interrupts – IE, IP, time flag interrupts, serial port interrupt, external interrupts, reset, interrupt control, interrupt priority, interrupt destinations & software generated interrupts. Unit- V Addressing modes, immediate addressing, register addressing, direct and indirect addressing, Data transfer instructions, internal data move, external data move, code memory read-only data move, Push and Pop and data exchange instructions. Logical Instructions, byte level logical operations, bit level logical operations, rotate and swap operations. Arithmetic Instructions, flags, incrementing and decrementing, addition, subtraction, multiplication and division, decimal arithmetic, simple programs in assembly language.

29

Reference Books: 1. Microprocessor Architecture, Programming and Applications with 8085, Ramesh S.Gaonkar - Wiley Eastern Limited- IV Edition. 2. Fundamentals of Microprocessor & Microcomputer: B. Ram—Danpat Rai Publications. 3. Muhammad Ali Mazidi, Janice GillispieMazidi, Rolin D. MCKinlay “The 8051 Microcontroller and Embedded Systems”, 2nd Edition, Pearson Education 2008.

PRACTICALS – 30(End Semester Evaluation) 8085 Assembly Language Programs: 1. Program to add two 8-bit numbers

2. Program to decimal addition of two 8-bit numbers.

3. Program to subtract two 8-bit numbers.

4. Program to divide a 16 bit number by 8 bit number

5. Program to find 1’s and 2’s Complement of 8-bit number..

6. Program to find smaller and larger among N numbers

7. Program to sort numbers in ascending order.

8. Program to verify the truth table of logic gates.

8051 Microcontroller Programming

1. Program to add two 8-bit numbers

2. Program to subtract two 8-bit numbers.

3. Program to divide a 16 bit number by 8 bit number.

4. Program to find 1’s and 2’s Complement of 8-bit number.

30


Skill Enhancement Compulsory Course SE302- PHP Programming (2 Credits) Full Marks: 50 (End Semester Evaluation)

Unit-I Introduction to PHP: PHP introduction, inventions and versions, important tools and software requirements (like- Web Server, Database, Editors etc.). PHP with other technologies, scope of PHP, Basic Syntax, PHP variables and constants Types of data in PHP, Expressions, scopes of a variable (local, global). PHP Operators: Arithmetic, Assignment, Relational, Logical operators, Bitwise, ternary and MOD operator. PHP operator Precedence and associativity Handling HTML form with PHP: Capturing Form Data. GET and POST form methods, Dealing with multi value fields, Redirecting a form after submission, Unit-II PHP conditional events and Loops: PHP IF Else conditional statements ( Nested IF and Else), Switch case, while, For and Do While Loop, Goto, Break, Continue and exit. PHP Functions: Function, Need of Function, declaration and calling of a function PHP Function with arguments, Default Arguments in Function, Function argument with call by value, call by reference, Scope of Function Global and Local. Unit-III String Manipulation and Regular Expression: Creating and accessing String, Searching & Replacing String Formatting, joining and splitting String, String Related Library functions. Use and advantage of regular expression over inbuilt function. Use of preg_match(), preg_replace(), preg_split() functions in regular expression. Array: Anatomy of an Array, Creating index based and Associative array ,Accessing array, Looping with Index based array, with associative array using each() and foreach(), Some useful Library functions. Reference Books:

1. Steven Holzner, "PHP: The Complete Reference Paperback", McGraw Hill Education (India), 2007. 2. Timothy Boronczyk, Martin E. Psinas, "PHP and MYSQL (Create-Modify-Reuse)", Wiley India

Private Limited, 2008. 3. Robin Nixon, "Learning PHP, MySQL, JavaScript, CSS & HTML5", 3rd Edition Paperback, O'reilly,

2014. 4. Luke Welling, Laura Thompson, PHP and MySQL Web Development", 4th Edition, Addition

Paperback, Addison-Wesley Professsional,2008. 5. David Sklar, Adam Trachtenberg, "PHP Cookbook: Solutions & Examples for PHP Programmers",

2014.

31

IST(HONOURS) SEMESTER- IV

Core Course C408 - Signals and Systems(6 Credits)


THEORY – 70 (Mid Sem 20 + End Sem 50) Unit - I Signals and Systems: Continuous and discrete time signals, Transformation of the independent variable, Exponential and sinusoidal signals, Impulse and unit step functions, Continuous-Time and Discrete-Time Systems, Basic System Properties. Unit- II Linear Time -Invariant Systems (LTI): Discrete time LTI systems, the Convolution Sum, Continuous time LTI systems, the Convolution integral. Properties of LTI systems, Commutative, Distributive, Associative. LTI systems with and without memory, Invariability, Causality, Stability, Unit Step response.Differential and Difference equation formulation, Block diagram representation of first order systems. Unit- III Fourier Series Representation of Periodic Signals: Continuous-Time periodic signals, Convergence of the Fourier series, Properties of continuous-Time Fourier series, Discrete-Time periodic signals, Properties of Discrete-Time Fourier series. Frequency-Selective filters, Simple RC highpass and lowpass filters. Unit- IV Fourier Transform: Aperiodic signals, Periodic signals, Properties of Continuous-time Fourier transform, Convolution and Multiplication Properties, Properties of Fourier transform and basic Fourier transform Pairs. Unit- V Laplace Transform: Laplace Transform, Inverse Laplace Transform, Properties of the Laplace Transform, Laplace Transform Pairs, Laplace Transform for signals, Laplace Transform Methods in Circuit Analysis, Impulse and Step response of RL, RC and RLC circuits. Reference Books: 1. V. Oppenheim, A. S. Wilsky and S. H. Nawab, Signals and Systems, Pearson Education (2007) 2. Digital Signal Processing, P Ramesh Babu, Scitech 3. S. Haykin and B. V. Veen, Signals and Systems, John Wiley & Sons (2004) 4. Digital Signal Processing, John G. Proakis, Dimitris G. Manolakis - Pearson Prentice Hall, 2007

https://books.google.co.in/books?id=H_5SAAAAMAAJ&q=signals+and+system+proakis&dq=signals+and+system+proakis&hl=en&sa=X&ved=0CB4Q6AEwAGoVChMIsYHexqKZyQIVx-0UCh3xkAFn

https://www.google.co.in/search?biw=1366&bih=624&tbm=bks&tbm=bks&q=inauthor:%22John+G.+Proakis%22&sa=X&ved=0CCAQ9AgwAGoVChMIsYHexqKZyQIVx-0UCh3xkAFn

https://www.google.co.in/search?biw=1366&bih=624&tbm=bks&tbm=bks&q=inauthor:%22Dimitris+G.+Manolakis%22&sa=X&ved=0CCEQ9AgwAGoVChMIsYHexqKZyQIVx-0UCh3xkAFn

32

PRACTICALS – 30(End Semester Evaluation)

1. Generation of Signals: continuous time

2. Generation of Signals: discrete time

3. Time shifting and time scaling of signals.

4. Folding a given sequence

5. Addition of two discrete time signal

6. Linear Convolution of Signals

7. Circular Convolution of Signals

8. Solution of Difference equations.

9. Auto correlation of a sequence.

10. Cross correlation of a sequence.

11. Fourier series representation of continuous time signals.

12. Fourier transform of continuous time signals.

13. Laplace transform of continuous time signals.

14. Compute the DFT of the sequence and plot magnitude and phase response

15. Introduction to Xcos/similar function and calculation of output of systems represented by block Diagrams.

33


Core Course C409 - Operational Amplifiers and Applications(6 Credits)


Unit - I Basic Operational Amplifier: Concept of differential amplifiers (Dual input balanced and unbalanced output), constant current bias, current mirror, cascaded differential amplifier stages with concept of level translator, block diagram of an operational amplifier (IC 741) Op-Amp parameters: input offset voltage, input offset current, input bias current, differential input resistance, input capacitance, offset voltage adjustment range, input voltage range, common mode rejection ratio, slew rate, supply voltage rejection ratio. Unit- II Op-Amp Circuits: Open and closed loop configuration, Frequency response of an op-amp in open loop and closed loop configurations, Inverting, Non-inverting, Summing and difference amplifier, Integrator, Differentiator, Voltage to current converter, Current to voltage converter. Unit- III Comparators: Basic comparator, Level detector, Voltage limiters, Schmitt Trigger. Signal generators: Phase shift oscillator, Wein bridge oscillator, Square wave generator, triangle wave generator, saw tooth wave generator, and Voltage controlled oscillator(IC 566). Unit- IV Multivibrators: Block diagram, Astable and monostablemultivibrator circuit, Applications of Monostable and Astablemultivibrators. Phase locked loops (PLL): Block diagram, phase detectors, IC565. Unit- V Signal Conditioning circuits: Sample and hold systems, Active filters: First order low pass and high pass butter worth filter, Second order filters, Band pass filter, Band reject filter, All pass filter. Reference Books: 1. R. A. Gayakwad, Op-Amps and Linear IC’s, Pearson Education (2003) 2. R. F. Coughlin and F. F. Driscoll, Operational amplifiers and Linear Integrated circuits, Pearson Education (2001) 3. Pulse and Digital Circuits, A. Anand Kumar–PHI, 2008

https://books.google.co.in/books?id=Md3QAkwXwXcC&printsec=frontcover&dq=advanced+electronics+circuits+anand+kumar&hl=en&sa=X&ved=0CCIQ6AEwAWoVChMI_Iqr_qSZyQIVhLwUCh3EoAi9

https://www.google.co.in/search?hl=en&tbm=bks&tbm=bks&q=inauthor:%22A.+ANAND+KUMAR%22&sa=X&ved=0CCQQ9AgwAWoVChMI_Iqr_qSZyQIVhLwUCh3EoAi9

34


Core Course C410 - Database Management Systems(6 Credits)

Full Marks 100 (Mid Sem 20 + End Sem 80) THEORY – 70 (Mid Sem 20 + End Sem 50) Unit - I Introduction: Characteristics of Database Approach, Advantages of using DBMS, Data Models Schemas and Instances, Three-Schema Architecture and Data Independence, Database Languages and Interfaces. Entity Relationship(ER) Modeling: Entity Types, Relationships, Constraints, ER Diagram Unit- II Relational Model: Relational Model Concepts, Relational Constraints, Relational Algebra – Unary Operations and Operations from Set Theory, SQL and Basic SQL Queries, Examples of Queries in Relational Algebra, Relational Calculus Unit- III Database Design: Relational Database Design using ER-To-Relational Mapping, Design Guidelines, Functional Dependencies, Lossless Decomposition, Normal Forms (1NF, 2NF, 3NF and BCNF). Unit - IV Transaction Processing: ACID Properties, Recoverability and Serializability, Concurrency Control – Two Phase Locking, Timestamp, Multiversion and Validation, Recovery – Deferred Update and Immediate Update, Shadow Paging Unit- V File Structure and Indexing: Secondary Storage and Files, Operations on Files, Files of Unordered and Ordered Records, Overview of File Organizations, Indexing Structures for Files (Primary Index, Secondary Index, and Clustering Index), Multilevel Indexing using B Trees and B+ Trees.

Reference Books: 1. R. Elmasri, S.B. Navathe, Fundamentals of Database Systems 6th Edition, Pearson Education, 2010. 2. R. Ramakrishanan, J. Gehrke, Database Management Systems 3rd Edition, McGraw-Hill, 2002. 3. A. Silberschatz, H.F. Korth, S. Sudarshan, Database System Concepts 6th Edition, McGraw Hill, 2010.


Create and use the following database schema to answer the given queries.

EMPLOYEE Schema

Field Type NULL KEY DEFAULT

Eno Char(3) NO PRI NIL

Ename Varchar(50) NO NIL Job_type

Varchar(50) NO NIL Manager

Char(3) Yes FK NIL

35

Hire_date Date NO NIL Dno

Integer YES FK NIL

Commission Decimal(10,2) YES NIL Salary

Decimal(7,2) NO NIL

DEPARTMENT Schema

Field Type NULL KEY DEFAULT

Dno Integer No PRI NULL

Dname Varchar(50) Yes NULL

Location Varchar(50) Yes New Delhi

Query List :

1. Query to display Employee Name, Job, Hire Date, Employee Number; for each employee with the

Employee Number appearing first.

2. Query to display unique Jobs from the Employee Table.

3. Query to display the Employee Name concatenated by a Job separated by a comma.

4. Query to display all the data from the Employee Table. Separate each Column by a comma and name the

said column as THE_OUTPUT.

5. Query to display the Employee Name and Salary of all the employees earning more than $2850.

6. Query to display Employee Name and Department Number for the Employee No= 7900.

7. Query to display Employee Name and Salary for all employees whose salary is not in the range of $1500 and

$2850.

8. Query to display Employee Name and Department No. of all the employees in Dept 10 and Dept 30 in

the alphabetical order by name.

9. Query to display Name and Hire Date of every Employee who was hired in 1981.

10. Query to display Name and Job of all employees who don't have a current Manager.

11. Query to display the Name, Salary and Commission for all the employees who earn commission.

12. Sort the data in descending order of Salary and Commission.

13. Query to display Name of all the employees where the third letter of their name is ‗A'.

14. Query to display Name of all employees either have two ‗R's or have two ‗A's in their name and are

either in Dept No = 30 or their Manger's Employee No = 7788.

15. Query to display Name, Salary and Commission for all employees whose Commission Amount is 14

greater than their Salary increased by 5%.

16. Query to display the Current Date.

36

17. Query to display Name, Hire Date and Salary Review Date which is the 1st Monday after six months of

employment.

18. Query to display Name and calculate the number of months between today and the date each employee

was hired.

19. Query to display the following for each employee <E-Name> earns < Salary> monthly but wants < 3 *

Current Salary >. Label the Column as Dream Salary.

20. Query to display Name with the 1st letter capitalized and all other letter lower case and length of their

name of all the employees whose name starts with ‗J', 'A' and ‗M'.

21. Query to display Name, Hire Date and Day of the week on which the employee started.

22. Query to display Name, Department Name and Department No for all the employees.

23. Query to display Unique Listing of all Jobs that are in Department # 30.

24. Query to display Name, Dept Name of all employees who have an ‗A' in their name.

25. Query to display Name, Job, Department No. and Department Name for all the employees working at the

Dallas location.

26. Query to display Name and Employee no. Along with their Manger's Name and the Manager's

employee no; along with the Employees' Name who do not have a Manager.

27. Query to display Name, Dept No. And Salary of any employee whose department No. and salary matches

both the department no.And the salary of any employee who earns a commission.

28. Query to display Name and Salaries represented by asterisks, where each asterisk (*) signifies $100.

29. Query to display the Highest, Lowest, Sum and Average Salaries of all the employees

30. Query to display the number of employees performing the same Job type functions.

31. Query to display the no. of managers without listing their names.

32. Query to display the Department Name, Location Name, No. of Employees and the average salary for

all employees in that department.

33. Query to display Name and Hire Date for all employees in the same dept. as Blake.

34. Query to display the Employee No. And Name for all employees who earn more than the average salary.

35. Query to display Employee Number and Name for all employees who work in a department with any

employee whose name contains a ‗T'.

36. Query to display the names and salaries of all employees who report to king.

37. Query to display the department no, name and job for all employees in the Sales department.

[SQL COMMANDS]

1. SQL* formatting commands

2. To create a table, alter and drop table.

37

3. To perform update, insert and delete operation in a table.

4. To perform different type of query using select in a table.

5. To make use of different clauses viz where, group by, having, order by.

6. To make use of special operator - in, any, all, between, exists, like etc.

7. To study different constraints.

[SQL FUNCTION]

8. To use oracle function -aggregate, numeric, conversion.

9. To use oracle function -string function, date/time functions

10. To understand use and working with joins.

11. To make use of transaction control statement viz rollback, commit and save point.

12. To make views of a table.

13. To make indexes of a table.

14. To make use synonyms on database object.

[PL/SQL]

15. To understand working with PL/SQL

16. To make use basic and composite data types.

17. To make use variable and constants in PL/SQL.

18. To implement PL/SQL conditional statements.

19. To implement PL/SQL Iterative statements.

20. To implement Cursor on a table.

38

IST SEMESTER- IV Generic Elective

G404 - Communication System(6 Credits) Full Marks 100 (Mid Sem 20 + End Sem 80)




Unit- I Amplitude Modulation/demodulation techniques: Block diagram of electronic communication system. Modulation-need and types of modulation-AM, FM & PM. Amplitude modulation – representation, modulation index, expression for instantaneous voltage, power relations, frequency spectrum, DSBFC, DSBSC and SSBSC (mention only), Limitations of AM. Demodulation- AM detection: principles of detection, linear diode, principle of working and waveforms. Block diagram of AM transmitter and Receiver. Unit- II Frequency Modulation/demodulation techniques: Frequency Modulation: definition, modulation index, FM frequency spectrum diagram, bandwidth requirements, frequency deviation and carrier swing, FM generator-varactor diode modulator. FM detector – principle, slope detector-circuit, principle of working and waveforms. Block diagram of FM transmitter and Receiver. Comparison of AM and FM. Unit - III Digital communication: Introduction to pulse and digital communications, digital radio, sampling theorem, types- PAM, PWM, PPM, PCM – quantization, advantages and applications, digital modulations (FSK, PSK, and ASK). Advantage and disadvantages of digital transmission, characteristics of data transmission circuits – Shannon limit for information capacity, bandwidth requirements, data transmission speed, noise, cross talk. Unit- IV TDMA, FDMA, CDMA concepts, comparison of TDMA and FDMA Noise and Transmission lines: Noise-Introduction, internal and external noises, signal to noise ratio and noise figure. Unit- V Cellular Communication: Concept of cellular mobile communication – cell and cell splitting, frequency bands used in cellular communication, absolute RF channel numbers (ARFCN), frequency reuse, roaming and hand off, authentication of the SIM card of the subscribers, IMEI number, concept of data encryption, architecture (block diagram) of cellular mobile communication network, CDMA technology, CDMA overview, simplified block diagram of cellular phone handset, Comparative study of GSM and CDMA, 2G, 3G and 4G concepts. .

39

Reference Books: 1. Electronic Communication, George Kennedy, 3rd edition, TMH. 2. Wireless Communication, 2nd Edition, Theodore S Rappaport 3. Advanced Electronic Communication systems, Wayne Tomasi- 6th edition, Low priced edition- Pearson education PRACTICALS – 30(End Semester Evaluation)

1. Study of Amplitude Modulation

2. Study of Amplitude Demodulation

3. Study of Frequency Modulation

4. Study of Frequency Demodulation

5. AM Transmitter

6. AM Receiver

7. FM Transmitter

8. FM Receiver

9. Study of TDM.

10. Study of FDM

11. Study of Pulse Code Modulation

12. Study of Amplitude Shift Keying

13. Study of Phase Shift Keying,

14. Study of Frequency Shift Keying.

40


Skill Enhancement Compulsory Course SE403A-R Programming(2 Credits)

Full Marks: 50 (End Semester Evaluation) Unit - I Introduction: Overview and History of R, Getting Help, Data Types, Subsetting, Vectorized , Operations.

Unit- II Reading and Writing Data. Control Structures, Functions, lapply, tapply, split, mapply, apply. Coding Standards

Unit - III Scoping Rules. Debugging Tools, Simulation, R Profiler

Reference Books:

1. William N. Venables and David M. Smith, An Introduction to R. 2nd Edition. Network Theory Limited.2009 2. Norman Matloff, The Art of R Programming - A Tour of Statistical Software Design, No Starch Press.2011

PRACTICALS

1. Write a program that prints ‗Hello World' to the screen.

2. Write a program that asks the user for a number n and prints the sum of the numbers 1 to n

3. Write a program that prints a multiplication table for numbers up to 12. 4. Write a function that returns the

largest element in a list.

5. Write a function that computes the running total of a list.

6. Write a function that tests whether a string is a palindrome.

7. Implement the following sorting algorithms: Selection sort, Insertion sort, Bubble Sort 8. Implement linear

search. 9. Implement binary search.

10. Implement matrices addition, subtraction and Multiplication.

41


Skill Enhancement Compulsory Course SE403B - HTML Programming (2 Credits)

Full Marks: 50 (End Semester Evaluation) Unit - I Introduction, Document Structure, the Head, the Body, Basic tags, Colors, Headings, Paragraph, Formatting tags, Lists-ordered and unordered. Unit- II Hyperlink-Internal and External Link, inserting image, image as background, images as link, Frames, Nested Frameset, iframe. HTML Layout-div and span Unit- III Creating table, table header, caption, spanning multiple columns, styling table, nested table. HTML Form, different types of input controls, Styling page with CSS-Type of CSS, CSS properties.

Reference Books: 1. Web Technology and Design by C Xavier 2. Web Technology I by Ivan Bayrose 3. Virginia DeBolt , Integrated HTML and CSS A Smarter, Faster Way to Learn Wiley / Sybex , 2006 4. Cassidy Williams, Camryn Williams Introduction to HTML and CSS, O'Reilly, 2015.

PRACTICALS

1. Create an HTML document with the following formatting options (a) Bold (b) Italic (c) Underline (d) Font (e) Line break (f) Horizontal rule (g) Pre tag

2. Create an HTML document having blue color background and text in first level heading and white color. 3. Create an HTML document having image as background having two paragraphs with different alignment. 4. Create an HTML document having two scrolling texts in left and right direction and a scrolling image

having alternate scrolling effect. 5. Create an HTML document which consists of

(a) Ordered list (b) Unordered list (c) Nested list

6. Create an HTML document which implements external hyperlink. 7. Create an HTML document that implements internal linking. 8. Create a table using HTML which consists of columns for Roll No., Student‘s name and grade. 9. Create an HTML document having a table to display time table. 10. Create a table using HTML for mark sheet as follows

42

Marksheet

Subjects

Subject1 Mark1

Subject2 Mark2

Subject3 Mark3

Division First/Second/Third/Fail

11. Create a Table with the following view

Place an image here

12. Create a 3x3 table using HTML that contains nine hyperlinked images. 13. Create an HTML documents having multiple frames in the following format

Frame1

Frame2

14. Create an HTML documents having multiple frames in the following format

Frame1 Frame2

Frame3

Frame4 Frame5 Frame6

15. Create web page having two frame in horizontal .The first frame contains menu as hyperlink. The link

should be opened in second frame.

Link1Link2Link3Link4 (Frame1)

(Frame2)

16. Create a web page to demonstrate iframe. 17. Create a web page having login form with required GUI control using table. 18. Create a form using HTML which has the following types of controls

(a) Text box (b) Password Field (c) Text Area (d) Checkbox (e) Radio button (f) Select (g) Reset and Submit buttons

19. Create a web page having internal style sheet using CSS text properties. 20. Create a web page having inline style sheet using CSS font properties.

43

IST (HONOURS) SEMESTER- V

Core Course C511 - Microprocessors and Microcontrollers(6 Credits)


THEORY – 70 (Mid Sem 20 + End Sem 50) Unit - I Introduction to Microprocessor: Introduction, Applications, Basic block diagram, Speed, Word size, Memory capacity, Classification of microprocessors (mention of different microprocessors being used) Microprocessor 8085: Features, Architecture -block diagram, General purpose registers, register pairs, flags, stack pointer, program counter, types of buses. Multiplexed address and data bus, generation of control signals, pin description of microprocessor 8085. Basic interfacing concepts, Memory mapped I/O and I/O mapped I/O. Unit- II 8085 Instructions: Operation code, Operand & Mnemonics. Instruction set of 8085, instruction classification, addressing modes, instruction format. Data transfer instructions, arithmetic instructions, increment & decrement instructions, logical instructions, branch instructions and machine control instructions. Assembly language programming examples. Unit- III Stack operations, subroutine, call and return instructions. Delay loops, use of counters, timing diagrams-instruction cycle, machine cycle, T- states, time delay. Interrupt structure of 8085A microprocessor, processing of vectored and non-vectored interrupts Microcontrollers: Introduction, different types of microcontrollers, embedded microcontrollers, processor architectures. Harvard vs. Princeton, CISC vs. RISC architectures, microcontroller memory types, microcontroller features, clocking, I/O pins, interrupts, timers, peripherals. Unit- IV Introduction to Microcontrollers: Basic block diagram, comparison of microcontroller withmicroprocessors, comparison of 8 bit, 16 bit and 32 bit microcontrollers. MICROCONTROLLER 8051- architecture -internal block diagram, key features of 8051, pindiagram, memory organization, Internal RAM memory, Internal ROM. General purpose datamemory, special purpose/function registers, external memory. Unit- V 8051 Interrupts, Addressing modes and Instruction set: Interrupts – IE, IP, time flaginterrupts, serial port interrupt, external interrupts, reset, interrupt control, interrupt priority,interrupt destinations & software generated interrupts. Addressing modes: immediate addressing, register addressing, direct and indirect addressing,8051 instruction set: Data transfer instructions, internal data move, external data move, code memory read-only data move, Push and Pop and data exchange instructions, Logical Instructions, byte level logical operations, bit level logical operations, rotate and swap operations .Arithmetic Instructions, flags, incrementing and decrementing, addition, subtraction, multiplication and division, decimal arithmetic, simple programs in assembly language.

44

Reference Books: 1. Microprocessor Architecture, Programming and Applications with 8085, Ramesh S. Gaonkar – Wiley Eastern Limited- IV Edition. 2. Fundamentals of Microprocessor & Microcomputer: B. Ram—Danpat Rai Publications. 3. Muhammad Ali Mazidi, Janice GillispieMazidi, Rolin D. MCKinlay “The 8051 Microcontroller and Embedded Systems”, 2nd Edition, Pearson Education 2008.

PRACTICALS – 30(End Semester Evaluation) 8085 Assembly Language Programs: 1. Program to transfer a block of data.

2. Program to add two 8-bit numbers.

3. Program to substract two 8-bit numbers.

4. Program to multiply two 8-bit numbers.

5. Program to divide a 16 bit number by 8 bit number


7. Program to generate terms of Fibonacci series.


9. Program to find the square root of an integer.

10. Program to find GCD of two numbers.

11. Program to sort numbers in ascending order.

12. Program to sort numbers in descending order.

13. Program to verify the truth table of logic gates.

8051 Microcontroller Programming

1. Program to add two 8-bit numbers

2. Program to substract two 8-bit numbers.

3. Program to multiply two 8-bit numbers.

4. Program to divide a 16 bit number by 8 bit number.



45


Core Course C512 - Computer Networks(6 Credits)


Unit - I Data Communications – Introduction, Networks (Distributed Processing, Network Criteria, Physical Structure, Network Models, Network Categories, Inter-Network), Protocols and Standards Layered Network Architecture – The OSI Model and Layers in OSI Model, TCP/IP Protocol Suite, Addressing (Physical Addresses, Logical Addresses, Port Addresses, Specific Addresses) Data and Signals – Analog and Digital, Periodic and Non-Periodic Signals, Transmission Impairment, Data Rate Limits and Performance Unit- II Physical Layer – Digital Transmission (Digital to Digital and Analog to Digital Conversion, Transmission Modes), Analog Transmission (Digital to Analog and Analog to Analog Conversion) Bandwidth Utilization – Multiplexing (FDM, WDM, TDM) and Spreading (FHSS and DSSS) Transmission Media – Guided (Twisted Pair, Coaxial and Fibre-Optic) and Unguided (Radio Waves, Microwaves, and Infra-Red) Switching – Circuit Switched, Datagram and Virtual Circuit Networks

Unit- III Data Link Layer - Error Detection and correction, Detection Vs. Correction, Coding – Block Coding, Linear Block Codes and Cyclic Codes, Checksum Data Link Control – Framing, Flow and Error Control, Protocols – Simplest, Stop-and-Wait, ARQ, Go- Back-N ARQ, Selective Repeat ARQ, HDLC and Point –to- Point Protocol Multiple Access - Random Access (ALOHA – CSMA, CSMA/CD, CSMA/CA), Controlled Access (Reservation, Polling and Token Passing) and Channelization (FDMA, TDMA, CDMA).

Unit- IV Wired LANs – IEEE Standards and Ethernet (Standard, Fast and Gigabit Ethernets) Wireless LANs – IEEE 802.11(Architecture and Layers) and Bluetooth (Architecture and Layers) Connecting Devices – Hubs, Repeaters, Bridges, Switches, Routers and Gateway Network Layer – Logical Addressing (Classfull and Classless Addressing), Internet (Datagram and Connectionless) Network, IPv4 and IPv6, Delivery (Direct Vs. Indirect) and Forwarding (Techniques, Process and Routing Table), Routing – Unicast and Multicast Routing Unit- V Transport Layer – Process to Process Delivery (Client-Server Paradigm and Connectionless Vs. Connection-oriented Service), UDP (UDP Operation, Checksum and Use of UDP), TCP (Services, Features, Flow Control, Error Control and Congestion Control – Open Loop and Closed Loop)Application Layer – DNS (Domain Name Space and its Distribution, DNS in Internet), Resolution and DNS Messages, e-Mail (Architecture and Protocol), WWW (Architecture and Web Documents), http, Network Security – Introduction to Cryptography, Security Services (CIA), Digital Signature

Reference Books: 1. B. A. Forouzan: Data Communications and Networking, Fourth edition, THM ,2007. 2. A. S. Tanenbaum: Computer Networks, Fourth edition,PHI , 2002

46

IST(HONOURS) SEMESTER- V

Skill Enhancement Compulsory Course SE504A - Android Programming(2 Credits)


Unit - I Introduction: History of Android, Introduction to Android Operating Systems, Android Development Tools, Android Architecture. Overview of object oriented programming using Java: OOPs Concepts: Inheritance, Polymorphism, Interfaces, Abstract class, Threads, Overloading and Overriding, Java Virtual Machine. Unit - II Development Tools: Installing and using Eclipse with ADT plug-in, Installing Virtual machine for Android sandwich/Jelly bean (Emulator), configuring the installed tools, creating a android project - Hello Word, run on emulator, Deploy it on USB-connected Android device. User Interface Architecture: Application context, intents, Activity life cycle, multiple screen size s. Unit - III User Interface Design: Form widgets, Text Fields, Layouts, Button control, toggle buttons, Spinners(Combo boxes),Images, Menu, Dialog. (2L) Database: Understanding of SQLite database, connecting with the database and database operations Reference Book:

1. Android application development for java programmers. By James C. Sheusi. Publisher: Cengage Learning, 2013.

PRACTICALS 1. Create ―Hello Worldǁ application. That will display ―Hello Worldǁ in the middle of the screen in the emulator. Also display ―Hello Worldǁ in the middle of the screen in the Android Phone. 2. Create an application with login module. (Check username and password). 3. Create spinner with strings taken from resource folder (res >> value folder) and on changing the spinner value, Image will change. 4. Create a menu with 5 options and and selected option should appear in text box. 5. Create a list of all courses in your college and on selecting a particular course teacher- in-charge of that course should appear at the bottom of the screen. 6. Create an application with three option buttons, on selecting a button colour of the screen will change. 7. Create and Login application as above. On successful login, pop up the message. 8. Create an application to Create, Insert, update, Delete and retrieve operation on the database.

47

IST(HONOURS) SEMESTER- V

Skill Enhancement Compulsory Course SE504B-XML Programming(2 Credits) Full Marks: 50 (End Semester Evaluation)

Unit - I Introduction: Understanding Mark-up Languages, XML and its Goals.

Unit- II XML Basics: XML Structure and Syntax, Document Classes and Rules.

Unit- III Other XML Concepts: Scripting XML, XML as Data, Linking with XML.

XML with Style: XSL -Style Sheet Basics, XSL basics, XSL Style Sheets.

Reference Books: 1. XML in action web technology by William J. Pardi 2. Step by Step XML by Michael J. Young

PRACTICALS

Practical Exercises based on concepts listed in Theory.

48


Discipline Specific Elective D501A - Internet and Web Technology(6 Credits)


THEORY – 70 (Mid Sem 20 + End Sem 50) Unit - I JavaScript: Programming Fundamentals-Data types, Expressions, Operators, functions, Popup Boxes, control structures. Objects of JavaScript: Date object, Array object, Boolean object, Math object, and String object. HTML DOM, Events and Event handling. Unit- II JDBC: Fundamentals, JDBC Drivers, Establishing Connectivity and working with Connection interface, working with Statements, Creating and Executing SQL Statements, Working with ResultSet Objects, ResultSetMetadata. Unit- III Java EE Platform: Overview, Distributed Multi-tiered Applications-Java EE Clients, Web Components, Business Components, Java EE Containers, Web Services support. Java EE Application Assembly and Deployment- Packaging Applications, Development Roles. Java EE APIs, Web Applications-Web Application life cycle, Web modules. Unit- IV Java Servlet Technology -Servlet Basics, Lifecycle of a Servlet, Servlet API, Servlet Packages, Types of Servlets, Handling HTTP Request and Response, Servlet Exception handling, Database Access, Session Tracking. Unit- V JSP: Introduction to Java Server Page, The Problem with Servlet, The Anatomy of a JSP Page, JSP life cycle, JSP Architecture, Scripting Elements, Implicit JSP Objects, Dynamic webpage creation, JSP Directives, JSP Actions, Using javabean in JSP, Database Access. Reference Books: 1.Ivan Bayross, Web Enabled Commercial Application Development Using Html, Dhtml,javascript, Perl CgiBPB Publications, 2009. 2. Eric Jendrock, D. Carson, I. Evans, D. Gollapudi, K. Haase, C. Srivastha,“The Java EE6 Tutorial”, Jim

Volume-1, Fourth Edition, 2010, Pearson India, New Delhi. 3. Keogh ,TheComplete Reference J2EE, TMH, ,2002. 4. O'Reilly , Java Server Pages, Hans Bergsten, Third Edition, 2003.

PRACTICALS – 30(End Semester Evaluation) 1. Write a JavaScript program to find the largest of three numbers and the factorial of a number.

2. WAP in JavaScript to read n numbers. Count the number of negative numbers, positive numbers and zeros

in the list.

3. WAP in JavaScript to read a number. If the number is even print the message in green color, in case of odd

number print the message in red color.

49

4. WAP in JavaScript to read two numbers. Find the HCF using user defined function.

5. WAP in JavaScript to read a number. Display the multiplication table in HTML table format.

6. WAP in JavaScript to accept five names using Array object. Perform the following operations on them

a. Print the names in sorted order. b. Print the names in reverse order.

7. WAP in JavaScript to print current year, month, date, hour and minute.

8. WAP in JavaScript to demonstrate Math Object.

9. Write an event driven program in JavaScript to change the background color of web page on moving

mouse to corresponding button.

10. Write an event driven program in JavaScript for GUI calculator to perform simple arithmetic operation.

11. WAP in java using JDBC to create a table named student (roll, name, mark) in any database management

system.

12. WAP in java using JDBC to insert record in to student table and print all records from student table.

13. WAP in java using JDBC to update record in student table and delete record from student table.

14. Installation and running a web server (e.g. Apache Tomcat/ GlassFish).

15. Creating, Compiling and Running a sample servlet program having current date and time information.

16. Write a servlet program that accepts student details from client HTML page and display them in formatted

manner.

17. Write a servlet program that accepts basic pay from client HTML page and calculates DA, HRA,

Deduction, Gross Pay and Net Pay and display them in table format.

18. Write a servlet program for hit counter that prints number of request is made using session.

19. Write a servlet program to insert record in to table EMP (empid, ename, salary).

20. Write a servlet program to print all records from table EMP in table format.

21. Creating and Running a sample JSP Program that displays your name address and email id in formatted

manner.

22. Write a JSP program that accepts three numbers from client HTML page and then prints the biggest and

smallest number.

23. Write a JSP program that accepts a positive number n and then prints factorial of numbers from 1 to n in

table format.

24. Write a program to Write a program to demonstrate use of implicit objects.

25. Write a JSP program to insert record in to table USER (uname, password).

26. Write a JSP program to verify valid username and password stored in table USER. If username and

password is valid, control will be transferred to success page. In case of invalid username or password

control will be transferred to error page.

27. Write a program to demonstrate use of Java Bean in JSP Page.

50


Discipline Specific Elective D501B - Network Programming(6 Credits) Full Marks 100 (Mid Sem 20 + End Sem 80)

THEORY – 70 (Mid Sem 20 + End Sem 50) Unit – I Transport Layer Protocols: TCP, UDP, SCTP protocol. Unit – II Socket Programming: Socket Introduction; TCP Sockets; TCP Client/Server Example ; Signal Handling; I/O multiplexing using sockets; Socket Options; UDP Sockets; UDP client server example; Address lookup using sockets. Unit – III Network Applications: Remote logging; Email; WWW and HTTP. Unit – IV LAN Administration: Linux and TCP/IP Unit – V Network Management and Debugging. Reference Books: 1. W. Richard Stevens, Bill Fenner, Andrew M. Rudoff, Unix Network Programming, The sockets Networking API, Vol. 1, 3rd Edition, PHI.2003 2. B. A. Forouzan: Data Communications and Networking, Fourth edition, THM Publishing Company Ltd.,2003 3. Nemeth Synder& Hein, Linux Administration Handbook, Pearson Education, 2nd Edition,2010 4. R. Stevens, Unix Network Programming, PHI 2nd Edition,1990

PRACTICALS – 30(End Semester Evaluation) Practical Exercises based on concepts listed in Theory.

51


Discipline Specific Elective D502A - Discrete Structure(6 Credits)


Unit - I Introduction: Sets - finite and Infinite sets, uncountable Infinite Sets; functions, relations, Properties of Binary Relations, Closure, Partial Ordering Relations; counting - Pigeonhole Principle, Permutation and Combination; Mathematical Induction, Principle of Inclusion and Exclusion. Unit- II Growth of Functions: Asymptotic Notations, Summation formulas and properties, Bounding Summations, approximation by Integrals. Unit- III Recurrences: Recurrence Relations, generating functions, Linear Recurrence Relations with constant coefficients and their solution, Substitution Method, Recurrence trees. Unit- IV Graph Theory :Basic Terminology, Models and Types, multigraphs and weighted graphs, Graph Representaion, Graph Isomorphism, Connectivity, Euler and Hamiltonian Paths and Circuits, Planar Graphs, Graph Coloring, Trees, Basic Terminology and properties of Trees, Introduction to Spanning Trees. Unit- V Prepositional Logic: Logical Connectives, Well-formed Formulas, Tautologies, Equivalences, Inference Theory. Reference Books:

1. Discrete Mathematics and its Application, Kenneth H Rosen, TMH Publications 2. C.L. Liu , D.P. Mahopatra, Elements of Discrete mathematics, 2nd Edition , Tata McGraw Hill, 1985, 3. T.H. Coremen, C.E. Leiserson, R. L. Rivest, Introduction to algorithms, 3rd edition Prentice Hall on

India, 2009

52


Discipline Specific Elective D502B - Probability and Statistics(6 Credits)

Full Marks 100 (Mid Sem 20 + End Sem 80) Unit - I Sample space, probability axioms, real random variables (discrete and continuous), cumulative distribution function. probability mass/density functions, mathematical expectation, moments,moment generating function, characteristic function. Unit- II Discrete distributions: uniform, binomial,Poisson, geometric, negative binomial, continuous distributions: uniform, normal, exponential.Joint cumulative distribution function and its properties. Unit- III Joint probability density functions,marginal and conditional distributions, expectation of function of two random variables,conditional expectations, independent random variables, bivariate normal distribution. Unit- IV Correlation coefficient, joint moment generating function (jmgf) and calculation of covariance(from jmgf), linear regression for two variables.Chebyshev’s inequality, statement and interpretation of (weak) law of large numbers and strong, law of large numbers. Unit- V Central Limit theorem for independent and identically distributed randomvariables with finite variance, Markov Chains, Chapman-Kolmogorov equations, classificationof states.

Reference Books: 1. Robert V. Hogg, Joseph W. McKean and Allen T. Craig, Introduction to Mathematical Statistics, Pearson Education, Asia, 2007. 2. Irwin Miller and Marylees Miller, John E. Freund, Mathematical Statistics with Applications, 7th Ed., Pearson Education, Asia, 2006.

53

IST (HONOURS) SEMESTER- VI

Core Course C613 - Communication Electronics(6 Credits)


THEORY – 70 (Mid Sem 20 + End Sem 50) Unit - I Electronic communication: Block diagram of an electronic communication system,electromagnetic spectrum-band designations and applications, need for modulation, conceptof channels and base-band signals. Concept of Noise, Types of Noise, Signal to noise ratio,Noise Figure, Noise Temperature, Friss formula. Unit- II Amplitude Modulation: Amplitude Modulation, modulation index and frequency spectrum.Generation of AM, Amplitude Demodulation (diode detector), Concept of Double side band suppressed carrier, Single side band suppressed carrier, other forms of AM (Pilot CarrierModulation, Vestigial Side Band modulation, Independent Side Band Modulation). Blockdiagram of AM Transmitter and Receiver Unit- III Angle modulation: Frequency and Phase modulation, modulation index and frequencyspectrum, equivalence between FM and PM, Generation of FM (direct and indirect methods),FM detector (PLL). Block diagram of FM Transmitter and Receiver, Comparison between AM, FM and PM. Unit- IV Pulse Analog Modulation: Channel capacity, Sampling theorem, PAM, PDM, PPMmodulation and detection techniques, Multiplexing, TDM and FDM.Pulse Code Modulation: Need for digital transmission, Quantizing, Uniform and Non-uniformQuantization, Quantization Noise, Companding, Coding, Decoding, Regeneration. Unit- V Digital Carrier Modulation Techniques: Block diagram of digital transmission andreception, Information capacity, Bit Rate, Baud Rate and M-ary coding. Amplitude ShiftKeying (ASK), Frequency Shift Keying (FSK), Phase Shift Keying (PSK), Binary PhaseShift Keying (BPSK) and Quadrature Phase Shift Keying (QPSK) Reference Books: 1. Electronic Communication Systems- Kennedy, 3rd edition, McGraw international Publications 2. Modern Digital and Analog Communication Systems, BhagwandasPannalalLathi, Zhi DingOxford University Press, 2010 3. Communication Systems, S. Haykin, Wiley India (2006)

https://www.google.co.in/search?tbo=p&tbm=bks&q=inauthor:%22Bhagwandas+Pannalal+Lathi%22

https://www.google.co.in/search?tbo=p&tbm=bks&q=inauthor:%22Zhi+Ding%22

54


1. Study of Amplitude Modulation

2. Study of Amplitude Demodulation

3. Study of Frequency Modulation

4. Study of Frequency Demodulation

5. AM Transmitter

6. AM Receiver

7. FM Transmitter

8. FM Receiver

9. Study of TDM.

10. Study of FDM

11. Study of Pulse Code Modulation

12. Study of Amplitude Shift Keying

13. Study of Phase Shift Keying.

14. Study of Frequency Shift Keying.

15. Study of Quadrature Phase Shift Keying

55


Core Course C614 - Software Engineering(6 Credits)

Full Marks 100 (Mid Sem 20 + End Sem 80) Unit- I Introduction: The Evolving Role of Software, Evolution and impact of Software Engineering, Software Characteristics, Software Engineering as a Layered Technology, Software Life Cycle Models - Classical Waterfall Model and Iterative Model Requirement Analysis: Software Requirement Analysis and Specification, Initiating Requirement Engineering Process, Requirement Analysis and Modeling Techniques, Flow Oriented Modeling, Need for SRS, Characteristics and Components of SRS. Unit- II Software Project Management: Project Planning, Estimation in Project Planning Process - Metrics for Project Size Estimation, Project Estimation Techniques with focus on COCOMO Project Scheduling - Backbone Structures, Activity Network & Critical Path Method, Gantt Chart , Pert Chart, Project Monitoring & Control, Staffing Risk Management: Software Risks, Risk Identification and Assessment, Risk Projection and Risk Refinement Unit- III Design Engineering: Software Design Concepts, Cohesion & Coupling, Architectural Design Elements, Software Architecture, Software Design Approaches (Function Oriented & Object Oriented) Function Oriented Software Design: Overview, Structured Analysis, Data flow Diagram, Structured Design. Mapping of Data Flow into Software Architecture Objected Oriented Design: Overview, Basic Mechanism, Advantages of Object Oriented Design. Introduction to UML & UML Diagrams, Design Patterns

Unit –IV Coding & Testing: Introduction to Coding, Code Review (Code Walk-Through, Code Inspection, Clean Room Testing, Software Documentation), Testing, Software Testing Fundamentals ,Unit Testing, Black Box Testing, White Box Testing, Debugging, Integration Testing, System Testing. Software Maintenance: Introduction, Characteristics of Software Maintenance (Types of S/W Maintenance, Special Problems Associated with S/W Maintenance).

Unit - V Software Reliability - Hardware vs. Software Reliability, Software Quality & Quality Management System, ISO 9000 – 2000, SEI Capability Maturity Model, Personal Software Process, Six SigmaModern Trends and Emerging Technologies: Humphrey’s Capability Maturity Model, CMMI (Capability Maturity Model Integration), Agile Software Development, Extreme Programming (XP), Security Engineering, Service-Oriented Software Engineering, Aspect-Oriented Software Development. Reference Books:

1. R. Mall, Fundamentals of Software Engineering (2nd Edition), Prentice-Hall of India, 2004.

2. R.S. Pressman, Software Engineering: A Practitioner's Approach (7th Edition), McGraw- Hill, 2009.

3. P. Jalote, An Integrated Approach to Software Engineering (2nd Edition), NarosaPublishing House, 2003.

56


Discipline Specific Elective D603A - Numerical Methods (6 Credits)

Full Marks 100 (Mid Sem 20 + End Sem 80) THEORY – 70 (Mid Sem 20 + End Sem 50) Unit - I Algorithms, Convergence, Errors: Relative, Absolute, Round off, Truncation. Transcendental and Polynomial equations: Bisection method, Newton’s method, Secant method.Rate of convergence of these methods. Unit- II System of linear algebraic equations: Gaussian Elimination and Gauss Jordan methods. GaussJacobi method, Gauss Seidel method and their convergence analysis. Unit- III Interpolation: Lagrange and Newton’s methods. Error bounds.Finite difference operators. Gregory forward and backward difference interpolation. Unit- IV Numerical Integration: Trapezoidal rule, Simpson’s rule, Simpsons 3/8th rule, Boole’s Rule. Midpoint rule, Composite Trapezoidal rule, Composite Simpson’s rule. Unit –V Ordinary Differential Equations: Tayler’s series Method, Euler’s method. Runge-Kutta methods of orders two and four. Reference Books:

1. Introductory Methods of Numerical Analysis, S SShastri, PHI Publications 2. Computer Based Numerical and Statistical Techniques, Dr. Santosh Kumar, S Chand 3. Higher Engineering Mathematics, B S Grewal,

PRACTICALS – 30(End Semester Evaluation) (1) Calculate the sum 1/1 + 1/2 + 1/3 + 1/4 + ----------+ 1/ N. (2) To find the absolute value of an integer. (3) Enter 100 integers into an array and sort them in an ascending order. (4) Bisection Method. (5) Newton Raphson Method. (6) Secant Method. (7) RegulaiFalsi Method. (8) LU decomposition Method. (9) Gauss-Jacobi Method. (10) Gauss-Siedel Method. (11) Lagrange Interpolation (12) Newton Interpolation. (13) Trapezoidal Rule (14) Simpson’s 1/3rd Rule. (15) Simpson’s 3/8th Rule (16) Boole’s Rule

57


Discipline Specific Elective D603B - Mathematics Foundation for Electronics (6 Credits)


THEORY – 70 (Mid Sem 20 + End Sem 50) Unit - I Ordinary Differential Equations:First Order Ordinary Differential Equations, Basic Concepts, Separable Ordinary Differential Equations, Exact Ordinary Differential Equations, Linear Ordinary Differential Equations. Second Order homogeneous and non-homogeneous Differential Equations. Unit - II Series solution of differential equations and special functions:Power series method, Legendre,Polynomials, Frobenius Method, Bessel’s equations and Bessel’s functions of first and second kind. Error, functions and gamma function. Unit - III Matrices:Introduction to Matrices, System of Linear Algebraic Equations, Gaussian Elimination Method,Gauss-Seidel Method, LU decomposition, Solution of Linear System by LU decomposition. Eigen Values and Eigen Vectors, Linear Transformation, Properties of Eigen Values and Eigen Vectors, Cayley-Hamilton Theorem, Diagonalization, Powers of a Matrix. Real and Complex Matrices, Symmetric, Skew Symmetric,Orthogonal Quadratic Form, Hermitian, Skew Hermitian, Unitary Matrices. Unit - IV Sequences and series: Sequences, Limit of a sequence, Convergence, Divergence and Oscillation of a sequence, Infinite series, Necessary condition for Convergence, Cauchy’s Integral Test, D’Alembert’s Ratio Test, Cauchy’s nth Root Test, Alternating Series, Leibnitz’s Theorem, Absolute Convergence and Conditional Convergence, Power Series. Unit - V Complex Variables and Functions:Complex Variable, Complex Function, Continuity, Differentiability, Analyticity. Cauchy-Riemann (C- R) Equations, Harmonic and Conjugate Harmonic Functions, Exponential Function, Trigonometric Functions, Hyperbolic Functions. Line Integral in Complex Plane, Cauchy’s Integral Theorem, Cauchy’s Integral Formula, Derivative of Analytic Functions. Sequences, Series and Power Series. Reference Books: 1. E. Kreyszig, advanced engineering mathematics, Wiley India (2008) 2. Murray Spiegel, Seymour Lipschutz, John Schiller, Outline of Complex Variables, SchaumOutlineSeries, Tata McGraw Hill (2007) 3. R. K. Jain, and S.R.K. Iyengar, Advanced Engineering Mathematics, Narosa Publishing House(2007) PRACTICALS – 30(End Semester Evaluation) 1. Solution of First Order Differential Equations and Second Order homogeneous Differential Equations 2. Solution of Second Order non-homogeneous Differential Equations 3. Convergence of a given series and Divergence of a given series. 4. Solution of linear system of equation Using Gauss-Elimination Method and Gauss-Seidal Method. (Students are required to practice more such programs as per the guidance of the teacher.)

58


Discipline Specific Elective D604 - Project Work (6 Credits)

Full Marks 100 (End Semester Evaluation) Every student will have to do Project Work in any area of Information Science and Telecommunication detailed in curriculum under the guidance of Department Teachers/Experts.

*****