course structure of b. sc. in information science and

Course Structure of

B. Sc. In Information Science and Telecommunication

(B. Sc. IST) (Honours) Syllabus

Under

Choice Based Credit System

Effective From 2019

Department of IST

Ravenshaw University Cuttack

Scheme of UG in IST (Honours) Under Choice Based Credit System (CBCS) Courses for Honours Students

Sem. Course Course Code

Title Credits Full Marks

Remarks

I Core C-1 Basic Circuit Theory and Network Analysis

6 100

Compulsory

C-2 Programming in C 6 100

Generic Elective

GE-1 Mathematics I 6 100 Mathematics Foundation for Electronics

Ability Enhancement

AECC-1 Environmental Science 4 100 Compulsory

II Core C-3 Electronics Circuit 6 100

Compulsory

C-4 Data Structure using C 6 100

Generic Elective

GE-2 Mathematics II 6 100

Numerical Methods

Ability Enhancement

AECC-2 MIL (Odia/Hindi/Alt. English) 4 100 Compulsory

III Core C-5 Digital Electronics 6 100

Compulsory

C-6 Computer Networks 6 100 C-7 Programming in Java 6 100

Generic Elective

GE-3 Mathematics III 6 100

Probability & Statistics

Skill Enhancement

SEC-1 Communicative English 4 100 Compulsory

IV Core C-8 Microprocessors and Microcontrollers

6 100

Compulsory

C-9 Operational Amplifier and Application

6 100

C-10 Operating Systems 6 100

Generic Elective

GE-4 Mathematics IV 6 100

Discrete Structure

Skill Enhancement

SEC-2 Quantitative Aptitude & Logical Reasoning

4 100

Compulsory

V Core C-11 Communication Electronics 6 100

Compulsory

C-12 Data Base Management Systems 6 100

Skill Enhancement

SEC-3 Web Technology 4 100

Compulsory

Discipline Specific

DSE-1 Data Science 6 100 Compulsory DSE-2 Software Engineering 6 100 Compulsory

VI Core C-13 Signals and Systems

6 100

Compulsory

C-14 Programming in Python 6 100

Compulsory

Skill Enhancement

SEC-4 Programming in VB.Net 4 100 Compulsory

Discipline Specific

DSE-3 Communication Systems 6 100 Compulsory DSE-4 Project Work 6 100 Compulsory

IST (HONOURS) SEMESTER- I

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

Full Marks: 100 [Mid Term: 15 Marks + End Term (Theory: 60 Marks + Practical: 25 Marks)]

THEORY

Unit – I

Basic Circuit Concepts: Voltage and Current Sources, Resistors: Fixed and Variable resistors, 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, Inductance in series and parallel. Capacitors: Principles of capacitance, Permittivity, Definition of Dielectric Constant, Dielectric strength, capacitors in series and parallel, factors governing the value of capacitors. Circuit Analysis: Kirchhoff’s Current Law (KCL), Kirchhoff’s Voltage Law (KVL), Node Analysis, Mesh Analysis, Star-Delta Conversion.

Unit- II

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 – 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, Quality (Q) Factor and Bandwidth.

Unit – IV

DC Transient Analysis: RC Circuit- Charging and discharging with initial charge, RL Circuit with Initial Current, Time Constant, DC Response of Series RLC Circuits. Passive Filters: Low Pass High Pass, Band Pass and Band Stop, Two Port Networks: Impedance (Z) Parameters, Admittance (Y) Parameters, and Transmission (ABCD) Parameters.

Text 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)

PRACTICALS

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. RC Circuits: Time Constant of Differentiator.

12. RC Circuits: Time Constant of Integrator.

IST (HONOURS) SEMESTER- I

Core Course C-2 - Programming in C (6 Credits)


THEORY

Unit-1

Introduction: Introduction to Programming Language, Introduction to C Programming, Keywords & Identifiers, Constants, Variables, Input and Output Operations, Compilation and Pre-processing. Data types: Different data types, Data types qualifier, modifiers, Memory Representation, size and range, Operators: Operators (Arithmetic, Relational, Logical, Bitwise, Assignment & compound assignment, Increment & Decrement, Conditional), Operator types (unary, binary, ternary). Expressions, Order of expression (Precedence and associativity) Control structures: Decision Making and Branching (Simple IF Statement, IF…ELSE Statement, Nesting IF… ELSE Statement, ELSE IF Ladder), Selection control structure (Switch Statement). Unit-2

Loops: The WHILE Statement, The DO…WHILE Statement, The FOR Statement, Jumps in Loops Array: Concept of Array, Array Declaration, types of array (one and multiple dimension), Character Arrays and Strings, Subscript and pointer representation of array, Array of Pointers, Limitation of array, Pointers: Concept of Pointer (null pointer, wild pointer, dangling pointer, generic pointer), Pointer Expressions, Accessing the Address of a Variable, Declaring Pointer Variables, Initializations of Pointer Variable, Accessing a Variable through its Pointer, Pointer arithmetic. Unit-3

Storage class: Types (auto, register, static, extern), scope rules, declaration and definition. Function: Function & types (User defined function, library function) Function Definition, Declaration, Function Calls, Header file and library, Function Arguments, string handling function (strlen, strcmp, strcpy, strncpy, strcat, strstr), Function recursion, Functions Returning Pointers, Pointers to Functions, Command line arguments, Application of pointer (dynamic memory allocation). Unit-4

Structure and Union: Defining, Declaring, Accessing, Initialization Structure, nested structure, self referential structure, bit-field, Arrays of Structures, Structures and Functions, Unions, difference between structure and union, active data member, structure within union, Self-referential Structure. File: File Management in C, Defining and Opening a File, File opening modes (read, write, append), Closing a File, File operations, file and stream, Error Handling During I/O Operations, sequential and random access file, low level and high level file. Text Book: 1. E. Balagurusamy, “Programming in ANSI C”, 4/e, (TMH) Reference Books: 1. B. Kernighan & Dennis Ritchie, “The C Programming Language”, 2/e PHI 2. Paul Deitel, Harvey Deitel, “C: How to Program”, 8/e, Prentice Hall. 3. P.C. Sethi, P.K. Behera, “Programming using C”, Kalyani Publisher, Ludhiana

PRACTICAL/TUTORIAL

1. Write a Program to find greatest among three numbers. 2. Write a Program to all arithmetic operation using switch case. 3. Write a Program to print the sum and product of digits of an integer. 4. Write a Program to reverse a number. 5. Write a Program to compute the sum of the first n terms of the following series S = 1+1/2+1/3+1/4+…… 6. Write a Program to compute the sum of the first n terms of the following series S =1-2+3 4+5……………. 7. 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. 8. Write a function to find whether a given no. is prime or not. Use the same to generate the prime numbers less than 100. 9. Write a Program to compute the factors of a given number. 10. Write a program to swap two numbers using macro. 11. Write a Program to print a triangle of stars as follows (take number of lines from user):

* ***

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

12. Write a Program to perform following actions on an array entered by the user: a) Print the even-valued elements b) Print the odd-valued elements c) Calculate and print the sum and average of the elements of array d) Print the maximum and minimum element of array e) Remove the duplicates from the array f) 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. 13. Write a Program that prints a table indicating the number of occurrences of each alphabet in the text entered as command line arguments. 14. Write a program that swaps two numbers using pointers. 15. Write a program in which a function is passed address of two variables and then alter its contents. 16. 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. 17. Write a program to find sum and average of n elements entered by the user. To write this program, allocate memory dynamically using malloc( ) / calloc( ) functions. 18. 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

19. Given two ordered arrays of integers, write a program to merge the two-arrays to get an ordered array. 20. Write a program to copy the content of one file to other.

IST(HONOURS) SEMESTER- I

Generic Elective GE-1 - Mathematics I (6 Credits)


UNIT-I Integers: Integers and Divisions, Modular Arithmetic, Integers and algorithms, Euclidean algorithm. Application of number theory: Modular Exponentiation, Extended Euclidean Algorithm, Inverse of a Modulo, Linear Congruence. Unit-II Differential Equations: Definition, order and degree, general and particular solutions of a differential equation. Formation of differential equation whose general solution is given. Solution of differential equations by method of separation of variables solutions of homogeneous differential equations of first order and first degree. Solutions of linear differential equation of the type: dy/dx + py = q, where p and q are functions of x or constants.dx/dy + px =q, where p and q are functions of y or constants. 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, Properties of Eigen Values and Eigen Vectors, Powers of a Matrix. . Unit –IV Linear Programming Introduction, related terminology such as constraints, objective function, optimization, different types of linear programming (L.P.) problems, mathematical formulation of L.P. problems, graphical method of solution for problems in two variables, feasible and infeasible regions, feasible and infeasible solutions. Text Books: 1. E. Kreyszig, advanced engineering mathematics, Wiley India (2008) 2. K.H. Rosen-Elementary Number Theory & its Applications, Pearson Addition Wesley. 3. Kanti Swarup, P.K. Gupta-Operation Research, Sultan Chand &sons. PRACTICALS

1. Write a program to find the gcd of two numbers using Euclidean Algorithm. 2. Write a program to find the value of a given modular Exponential. 3. Write a program to find the gcd of two numbers using Euclidean Algorithm Using recursion 4. Write a program to convert a decimal number to its binary equivalent. 5. Write a program to convert a decimal number to its octal equivalent. 6. Write a program to add two binary numbers. 7. Write a program to multiply two binary numbers. 8. Write a program for multiplication of two Matrices. 9. Write a program to construct a unit matrix of any given Order. 10. Write a program to find the solution of system of linear equations using Gauss elimination Method. 11. Write a program to find the solution of system of linear equations using Gauss-Seidel Method. 12. Write a program to find the solution of system of linear equations using LU decomposition Method. 13. Write a recursive program for Modular Exponential. 14. Write a recursive program to construct a Fibonacci Series up to a given number ‘n’ . 15. Write a recursive program to calculate an.

IST(HONOURS) SEMESTER- I

Ability Enhancement Compulsory Course AECC-1-Environmental Science (4 Credits)

Full Marks: 100 [Mid Term: 20 Marks + End Term: 80 Marks]

Unit – I The Environment: The Atmosphere, Hydrosphere, Lithosphere, Biosphere, Ecology, Ecosystem, Biogeochemical Cycle (Carbon Cycle, Nitrogen Cycle), Environment Pollution: Air Pollution, Water Pollution, Soil Pollution, Radiation Pollution. Unit – II Population Ecology: Individuals, Species, Pollution, Community, Control Methods of Population, Urbanization and its effects on Society, Communicable Diseases and its Transmission, Non-Communicable Diseases. Unit- III Environmental Movements in India: Grassroot Environmental movements in India, Role of women, Environmental Movements in Odisha, State Pollution Control Board, Central Pollution Control Board. Unit –IV Natural Resources: Conservation of Natural Resources, Management and Conservation of Wildlife, Soil Erosion and Conservation, Environmental Laws: Water Act, 1974, Air Act, 1981, The Wildlife (Protection) Act, 1972, Environment Protection, 1986, Natural Disasters and their Management. Recommended Readings:

1. Gadgil, M., &Guha, R. 1993. This Fissured Land: An Ecological History of India. Univ. of California Press.

2. McNeill, John R. 2000. Something New Under the Sun: An Environmental History of the Twentieth Century.

3. Odum, E.P., Odum, H.T. & Andrews, J. 1971. Fundamentals of Ecology. Philadelphia: Saunders. Pepper, I.L., Gerba, C.P. &Brusseau, M.L. 2011

IST(HONOURS) SEMESTER- II Core Course

C-3 - Electronics Circuit (6 Credits) Full Marks: 100

[Mid Term: 15 Marks + End Term (Theory: 60 Marks + Practical: 25 Marks)]

THEORY

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. Zener diode regulator circuit diagram, disadvantages of Zener diode regulator. Bipolar Junction Transistor: Operation and types of BJT, Review of CE, CB Characteristics and regions of operation. DC load line, operating point, thermal runaway,

Unit- II

Transistor biasing: 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 and as an Amplifier. Power Amplifiers: Difference between voltage and power amplifier, classification of power amplifiers, Class A, Class B, 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.

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 Operational Amplifier: Introduction, Operational Overview, op-amp Supply Voltage, IC Identification, op-amp Packages, op-amp Parameters, op-amp as Voltage Amplifier, Inverting Amplifier, Non-inverting Amplifier, Voltage Follower, Summing Amplifier, Differential Amplifier, op-amp Applications: Comparators, Integrator, Differentiator. Text 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)

PRACTICALS

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 and Tuned amplifier.

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

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

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

IST(HONOURS) SEMESTER- II

Core Course C-4 - Data Structure using C (6 Credits)


THEORY Unit-1

Introduction: Basic Terminology, Data structure, Time and Space complexity, Review of Array, Structures, Pointers. Linked Lists: Dynamic memory allocation, representation, Linked list insertion and deletion, Searching, Traversing in a list, double linked list, Sparse matrices. Unit-2

Stack: Definition, Representation, Stack operations, Applications (Infix–Prefix–Postfix Conversion & Evaluation, Recursion). Queues: Definition, Representation, Types of queue, Queue operations, Applications. Unit-3

Trees: Tree Terminologies, General Tree, Binary Tree, Representations, Traversing, BST, Operations on BST, Heap tree, AVL Search Trees, M-way search tree, Applications of all trees. Unit-4

Sorting: Exchange sorts, Selection Sort, Bubble sort, Insertion Sorts, Merge Sort, Quick Sort, Radix Sort, Heap sort. Searching: Linear search, Binary search. Text Books: 1. Classic Data Structure , D. Samanta , PHI , 2/ed. Reference Books: 1. Ellis Horowitz, Sartaj Sahni, “Fundamentals of Data Structures”, Galgotia Publications, 2000. 2. Sastry C.V., Nayak R, Ch. Rajaramesh, Data Structure & Algorithms, I. K. International Publishing House Pvt. Ltd, New Delhi.

CORE – 4 PRACTICAL/TUTORIAL: Data Structure Lab Write a C Program for the followings 1. To insert and delete elements from appropriate position in an array. 2. To search an element and print the total time of occurrence in the array. 3. To delete all occurrence of an element in an array. 4. Array implementation of Stack. 5. Array implementation of Linear Queue. 6. Array implementation of Circular Queue. 7. To implement linear linked list and perform different operation such as node insert and delete, search of an item, reverse the list. 8. To implement circular linked list and perform different operation such as node insert and delete. 9. To implement double linked list and perform different operation such as node insert and delete. 10. Linked list implementation of Stack. 11. Linked list implementation of Queue. 12. Polynomial representation using linked list. 13. To implement a Binary Search Tree. 14. To represent a Sparse Matrix. 15. To perform binary search operation. 16. To perform Bubble sort. 17. To perform Selection sort. 18. To perform Insertion sort. 19. To perform Quick sort. 20. To perform Merge sort.

SEMESTER- II Generic Elective

GE-2 – Mathematics II (6 Credits) Full Marks: 100


THEORY

Unit-1 Floating point representation and computer arithmetic, Significant digits, Errors: Round-off error, Local truncation error, Global truncation error, Order of a method, Convergence and terminal conditions, Efficient computations. Unit-2 Bisection method, Secant method, Regula−Falsi method Newton−Raphson method, Newton’s method for solving nonlinear systems. Unit-3 Interpolation: Lagrange’s form and Newton’s form Finite difference operators, Gregory Newton forward and backward differences Interpolation Piecewise polynomial interpolation: Linear interpolation. Unit-4 Numerical integration: Trapezoid rule, Simpson’s rule (only method), Newton−Cotes formulas, Gaussian quadrature, Ordinary differential equation: Euler’s method Modified, Euler’s methods, Runge-Kutta second methods Text books 1. S.S. Sastry, “Introductory Methods of Numerical Analysis”, EEE , 5/ed. 2. M.K. Jain, S.R.K. Iyengar and R.K. Jain, Numerical Methods for Scientific and Engineering Computation, New Age International Publisher, 6/e (2012) Reference books 1. Numerical Analysis: J. K. Mantri & S. Prahan, Laxmi Publication. 2. Introduction to Numerical Analysis, Josef Stoer and Roland Bulirsch, Springer. PRACTICALS

(1) Bisection Method. (2) Newton Raphson Method. (3) Secant Method. (4) Regula-Falsi Method. (5) LU Decomposition Method. (6) Gauss-Jacobi Method. (7) Gauss-Siedel Method. (8) Lagrange Interpolation (9) Newton Interpolation. (10) Trapezoidal Rule (11) Simpson’s 1/3rd Rule and (12) Simpson’s 3/8th Rule

IST (HONOURS) SEMESTER- II

Ability Enhancement Compulsory Course AECC-2 M.I.L (ODIA/ALT. ENGLISH/HINDI) (4 Credits)


IST(HONOURS) SEMESTER- III

Core Course C-5 - Digital Electronics (6 Credits)


THEORY 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, Gray Code and Excess-3 Code. Unit- II 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. Standard representation of logic functions (SOP and POS),Karnaugh map minimization. Unit- III Combinational Logic Analysis and Design: Basic Adders, Parallel Binary Adder, Subtractor. Comparator, Encoder and Decoder, Multiplexers and Demultiplexers, Implementing logic functions with multiplexer, Parity Generator. 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- IV 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. Text Books: 1. M. Morris Mano Digital System Design, Pearson Education Asia,( Fourth Edition ) 2. Thomas L. Flyod, Digital Fundamentals, Pearson Education Asia (1994)

PRACTICALS

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).

IST(HONOURS) SEMESTER- III

Core Course C-6 - Computer Networks (6 Credits)


Unit-1 Introduction to Data Communications and Network Models: Protocols and Standards, Layers in OSI Models, Analog and Digital Signals, Transmission Modes, Transmission Impairment, Data Rate Limits,Performance, Digital Transmission, Network Devices & Drivers: Router, Modem, Repeater, Hub, Switch, Bridge (fundamental concepts only). Unit-2 Signal Conversion: Digital-to-Digital Conversion, Analog-to-Digital Conversion, Digital-to-Analog Conversion, Analog-to-analog Conversion. Transmission Media: Guided Media, Unguided Media. Switching Techniques: Packet Switching, Circuit Switching, Datagram Networks, Virtual-Circuit Networks, and Structureof a Switch. Unit-3 Error Detection and Correction: Checksum, CRC, Data Link Control: Framing, Flow and Error Control, Noiseless Channels, Noisy channels, (Stop and Wait ARQ, Slidding Window, Protocol , Go Back N, Selective Repeat) HDLC, Point-to-Point Protocol. Access Control: TDM, CSMA/CD, and Channelization (FDMA, TDMA, and CDMA). Unit-4 Network Layer: Logical Addressing, IPv4 Addresses, IPv6 Addresses, Virtual-Circuit Networks: Frame Relay and ATM, Transport Layer: Process-Process Delivery: UDP, TCP. Application layers: DNS, SMTP, POP, FTP, HTTP, Basics of WiFi (Fundamental concepts only) Network Security: Authentication, Basics of Public Key and Private Key, Digital Signatures and Certificates (Fundamental concepts only). Text Books: 1. Data Communications and Networking, Fourth Edition by Behrouza A. Forouzan,TMH. Reference Books:

1. Computer Networks, A. S. Tanenbaum, 4th edition, Pearson Education.

PRACTICAL: 1. Simulate Even Parity generator and checker. 2. Simulate two dimensional Parity generator and checker. 3. Simulate checksum generator and checker. 4. Simulate Hamming code method. 5. Simulate Cyclic Redundancy Check (CRC) error detection algorithm for noisy channel. 6. Simulate and implement stop and wait protocol for noisy channel. 7. Simulate and implement go back n sliding window protocol. 8. Simulate and implement selective repeat sliding window protocol. 9. Simulate and implement distance vector routing algorithm.

IST(HONOURS)

SEMESTER- III Core Course

C-7 - Programming in Java (6 Credits) Full Marks: 100


THEORY Unit-1 Introduction to Java: Java History, Architecture and Features, Compiling and Executing a Java Program, Variables, Constants, Keywords (super, this, final, abstract, static, extends, implements, interface) , Data Types, Wrapper class, Operators (Arithmetic, Logical and Bitwise) and Expressions, Comments, Doing Basic Program Output, Decision Making Constructs (conditional statements and loops) and Nesting, Java Methods (Defining, Scope, Passing and Returning Arguments, Type Conversion and Type and Checking, Built-in Java Class Methods). Input through keyboard using Command line Argument, the Scanner class, Buffered Reader class. Unit-2 Object-Oriented Programming Overview: Principles of Object-Oriented Programming, Defining & Using Classes, Class Variables & Methods, Objects, Object reference, Objects as parameters, final classes, Garbage Collection. Constructor- types of constructor, this keyword, super keyword. Method overloading and Constructor overloading. Aggregation vs Inheritance Inheritance: extends vs implements, types of Inheritance, Interface, Up-Casting, Down-Casting, Auto-Boxing, Enumerations, Polymorphism, Method Overriding and restrictions. Package: Pre-defined packages and Custom packages. Unit-3 Arrays: Creating & Using Arrays (1D, 2D, 3D and Jagged Array), Array of Object, Referencing Arrays Dynamically. Strings and I/O: Java Strings: The Java String class, Creating & Using String Objects, Manipulating Strings, String Immutability& Equality, Passing Strings to & from Methods, String Buffer Classes and StringBuilder Classes. IO package: Understanding Streams File class and its methods, Creating, Reading, Writing using classes: Byte and Character streams, File Output Stream, File Input Stream, File Writer, File Reader, Input Stream Reader, Print Stream, Print Writer, Compressing and Uncompressing File. Unit-4 Exception Handling, Threading, Networking and Database Connectivity: Exception types, uncaught exceptions, throw, built-in exceptions, Creating your own exceptions; Multithreading: The Thread class and Runnable interface, creating single and multiple threads, Thread prioritization, synchronization and communication, suspending/resuming threads. Text Books: 1. E. Balagurusamy, “Programming with Java”, TMH, 4/Ed, Reference books: 1. Herbert Schildt, “The Complete Reference to Java”, TMH, 10/Ed. Practical/Tutorial: Java Programming Lab 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 convert a decimal to binary number. 4. To check if a number is prime or not, by taking the number as input from the keyboard. 5. 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 6. Write a program that show working of different functions of String and StringBuffer classs like setChar At( ), setLength( ), append( ), insert( ), concat ( ) and equals( ). 7. 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 8. 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. 9. 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) 10. 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. 11. 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 Fibonacci series is given in a different file belonging to the same package. 17. Write a program that creates illustrates different levels of protection in classes/subclasses belonging to same package or different packages 18. Write a program – “Divide By Zero” that takes two numbers a and b as input, computes a/b, and invokes Arithmetic Exception 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 different mouse handling events like mouse Clicked( ), mouse Entered( ), mouse Exited( ), mouse Pressed( ), mouse Released( ) & mouse Dragged( ). 23. Write a program to demonstrate different keyboard handling events.

IST(HONOURS) SEMESTER- III Generic Elective

GE-3 – Mathematics III (6 Credits) Full Marks: 100


THEORY UNIT-I Probability and Probability Distribution: Events and the Sample Space, Calculating Probabilities using Simple events, Useful counting rules, Probability rules: Addition rule, Conditional probability and multiplication rule, Bayes’ rule. UNIT-II Probability Distributions: Random Variable, Discrete random variable, Mean and Standard deviation of discrete random variable, Discrete Probability Distributions: Binomial, Poisson and Hypergeometric probability distribution, Continuous Probability distribution: Normal distribution. UNIT-III Sampling Distribution: sampling plans and experimental designs, Sampling distribution of a statistic, Central Limit theorem, Sampling distribution of the Sample mean and Proportion. Large Sample Estimation: Point estimation, Interval estimation, Confidence interval of population mean, Population proportion, difference between two population means, difference between two population proportions. Large Sample Tests of Hypothesis: Test of a Population mean, Test of difference of two population means, Test of hypothesis for a binomial proportion, Test of hypothesis for the difference between two binomial proportions. Inference from Small Samples: Student’s t Distribution, Small Sample inferences concerning a population mean and difference between two population means. UNIT-IV Analysis of Variance: One-way classification, Two-way classification. Linear regression and Correlation: Method of least squares, Analysis of variance for linear regression, Testing the usefulness of the linear regression model, Estimation and Prediction using the fitted line. Carl Pearson’s coefficient of Correlation. Text Books:

1. William Mendenhall, Robert J. Beaver, Barbara M. Beaver, “Probability and Statistics” 14/e,CENGAGE Learning.

2. W. W. Hines, D.C. Montgomery, D.M. Goldsman, & C.M. Borror, “Probability & Statistics in Engineering

PRACTICALS

1. Construct an ANOVA table for single factor( one way classification) 2. Construct an ANOVA Table for Single factor (Two way classification) 3. Construct an ANOVA table for Two- factor with replication. 4. Construct an ANOVA table for Two- factor without replication. 5. Find the correlation coefficient for given data. 6. Find the covariance between the different set of data. 7. Perform the t-test for paired two sample mean 8. Perform the t-test for Two-sample assuming equal variances. 9. Perform the t-test for Two-ample assuming unequal variances. 10. Perform the z-test for Two-sample mean. 11. Find the regression from two set of data. 12. Determine whether a mean of sample differs significantly from a special value when the population

standard deviation is known. 13. Determine whether mean of a sample differs significantly from a value 14. Determine whether mean of a sample differs significantly from two groups. 15. Determine whether the proportion of an event observed in a sample differs significantly from a specified

value. 16. Determine whether the proportion of an event observed for two sample group differs significantly.

IST(HONOURS)

SEMESTER- III Skill Enhancement Compulsory Course SEC-1 – Communicative English (4 Credits)


UNIT-I- BUSINESS COMMUNICATION AND GRAMMAR Why English Communication is Essential and How to Improve the Skill?, Introduction to Voice and Accent, Consonant Sounds, Vowels, Diphthongs, A Few Phonic Rules, Word Stress: Syllables, Intonation, Pacing and Chunking, Fluency, Indianisms. UNIT-II: GRAMMAR English: Spoken Versus Written Communication, Nouns, Pronouns, Adjectives, Adverbs, Prepositions, Conjunctions, Verbs, Subject and verb agreement, Determiners and Modifiers, Tenses, Punctuation, UNIT-III: READING COMPREHENSION Reading – A 7 Step Process, Techniques to enhance students’ reading skills, Types of reading skills, Three levels of Reading, Improving your reading speed, Reading Comprehension Practice Exercises. Text Book: Enriching Linguistic Knowledge & Communication Proficiency

ODISHA STATE HIGHER EDUCATION COUNCIL

BHUBANESWAR

IST(HONOURS) SEMESTER- IV

Core Course C-8 - Microprocessors and Microcontrollers (6 Credits)


THEORY

Unit-I Microprocessor and Microcomputer Architecture: Introduction to 8085 Microprocessor, Pin and Signals of 8085 Microprocessor, Register Organization, Timing and Control Module, 8085 Instruction, Timing and execution, Addressing Modes, Instruction set of 8085, Memory and I/O addressing, Stack and Subroutines, Assembly Language of 8085, 8085 interrupts. Unit-II 8086 Microprocessor: Architectures, Pin Diagram, Architecture, Physical Memory Organisation, Minimun and Maximum Mode System and timing, 8086 Instruction Set, Addressing Modes, 8086 Interrupts. Unit-III Basic Peripherals and their Interfacing with 8085, Intel 8255 Programmable Peripheral Interface, Programmable Interrupt Controller (Intel 8259), Programmable DMA Controller (Intel 8257). Memory Interfacing: Address Space Partitioning, Memory and I/O Interfacing, Intel 2764, Intel 6264, Data transfer Schemes, Interfacing 8085 with 2764 and 6264, Interfacing 8086 with 2764 and 6264. Unit-IV 8051 Microcontroller: Overview of 8085 family, Pin description of 8051, Inside the 8051, Register Banks, Stack, Registers in 8051, Rom Space in 8051, 8051 flag bits and PSW registers, Instruction sets of 8051, Data Transfer, Jump, Loop, Call, Arithmetic, Logic, Single bit Instruction, 8051 Addressing Modes, 8051 Interrupt. Text 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.

4. Advanced Microprocessor and Peripherals, 2nd Edition, by Ray Bhurchandi, TMH Publications

PRACTICALS

8085 Assembly Language Programs: 1. Program to transfer a block of data.

2. Program to add two 8-bit numbers.

3. Program to subtract two 8-bit numbers.

4. Program to multiply two 8-bit numbers.

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

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

7. Program to generate terms of Fibonacci series.

8. Program to find smaller and larger among N numbers

9. Program to sort numbers in ascending order.

10. Program to sort numbers in descending order.

8051 Microcontroller Programming:

1. Program to add two 8-bit numbers

2. Program to subtract two 8-bit numbers.

3. Program to multiply 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


Core Course C-9 – Operational Amplifier 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. Comparators: Basic comparator, Level detector, Voltage limiters, Schmitt Trigger. Unit- III Signal generators: Phase shift oscillator, Wein bridge oscillator, Square wave generator, triangle wave generator, saw tooth wave generator, and Voltage controlled oscillator(IC 566). 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

PRACTICAL

1. Study of op-amp characteristics: CMRR and Slew rate. 2. Designing of an amplifier of given gain for an inverting and non-inverting configuration using an opamp. 3. Designing of analog adder and subtractor circuit. 4. Designing of an integrator using op-amp for a given specification and study its frequency response. 5. Designing of a differentiator using op-amp for a given specification and study its frequency response. 6. Designing of a First Order Low-pass filter using op-amp. 7. Designing of a First Order High-pass filter using op-amp. 8. Designing of a RC Phase Shift Oscillator using op-amp. 9. Study of IC 555 as an astable multivibrator. 10. Study of IC 555 as monostable multivibrator. 11. Designing of Fixed voltage power supply using IC regulators using 78 series and 79 series


Core Course C-10 – Operating Systems (6 Credits)


THEORY Unit–1 Introduction to Operating System, System Structures: Operating system services, system calls, system programs, Operating system design and implementation, Operating system structure. Unit–2 Process Management: Process Concept, Operations on processes, Process scheduling and algorithms, Inter-process Communication, Concepts on Thread and Process, Deadlocks: Deadlock detection, deadlock prevention, and deadlock avoidance fundamentals. Unit-3 Memory Management Strategies: Swapping, Contiguous Memory Allocation, Paging, Segmentation, Virtual Memory Management: Concepts, implementation (Demand Paging), Page Replacement, Thrashing. Unit–4 Storage Management: File System concept, Access Methods, File System Mounting, File Sharing and File Protection, Implementing File Systems, Kernel I/O Systems. Text book: 1. Operating System Concepts, Abraham Silberschatz, Peter B. Galvin, and Greg Gagne, Eighth Edition, Wiley Student Edition 2009. Reference book: 1. Modern Operating System, Tanenbaum, Pearson, 4/Ed. 2014 2. Richard F Ashley, Linux with Operating System Concepts, Chapman and Hall/CRC Published August 26, 2014 3. Richard Blum, Linux Command Line and Shell Scripting Bible, O’ Reilly PRACTICALS

1. (a) Show the calendar for the specified month and year. (b) Print the current path to working directories. (c) Display the current system time and date. (d) Show the user who is currently logged in. (e) Prints user and groups of the current user. 2. (a) Show all the files and directories.

(b) To create a empty text file. (c) To delete and directories file. (d) To remove any empty directory. (e) Display the first few lines of a file. (f) Show the last 10 lines of a file. (g) To counts lines, words, and letters of the file.

(h) Searches for pattern in a file - to search a mobile number from a text file. (i) Create a links one file to another file. (j) To check which users are logged in to the systems.

3. Design the following directories and file structure using Linux:

(a) To create empty subdirectory names as JACK under M. (b) To change the directory JACK. (c) To find the current location or current working directory. (d) To back the JACK to parent directory. (e) To remove or delete File9 and JACK directory. (f) To rename file name File2 to demofile22. (g) To move the S directory to P directory. (h) To create a text file name as “munnar” under R directory. (i) Display the contents of the” munnar” file on the screen. (j) To add new text at end of documents for “munnar” file - (k) To make duplicate munnar file to B directory.

4. Shell Programming (a) Write a shell scripting program to calculate the sum of two integer number. (b) Write a shell scripting program to take input from user five integer numbers and calculate total with average of given numbers. (c)To take input from user and calculate the area of circle and rectangle. (d) Write a shell script program to find the simple interest. (e) Write a shell script to take input from user as basic salary 2580, DA 58%. TA 79% and HRA 36% of basic salary to calculate the gross salary for employee. (f) Write a shell script program to check out the given number is positive or negative. (g) To take input from user and check out given integer is an even or odd integer number.

IST (HONOURS) SEMESTER- IV Generic Elective

GE-4– Mathematics IV (6 Credits) Full Marks: 100


THEORY UNIT-I Logic and Proofs: Propositions, Logical Connectives, Well-formed Formulas, Propositional Equivalences, Proof Methods and Strategy, Mathematical Induction, Strong Induction UNIT-II Basic Structures: Sets, Set Operations, Functions, Relations and their Properties, Closure of Relations: Symmetric closure, Transitive Closure, Warshall Algorithm. Equivalence Relations, Partial Order Relation UNIT-III Recurrences: Recurrence Relations, Modeling With Recurrence Relations, Solving Linear Homogeneous Recurrence Relations with Constant Coefficients, Divide-and-Conquer Recurrence Relations UNIT-IV Graphs: Introduction to Graphs, Graphs terminologies and Special Types of Graphs, Representation of Graphs, Graph Isomorphism, Subgraphs, Planar Graphs, Graph Coloring, Trees and their Properties, Spanning Tree, Minimal Spanning Tree: Prim’s Algorithm, Kruskal Algorithm. UNIT-V Boolean Algebra: Introduction to Boolean Algebra, Boolean Functions, Representing Boolean Functions, Logic Gates, Minimization of Circuits Text Books:

1. Discrete Mathematics and its Application, Kenneth H Rosen, TMH Publications 2. C.L. Liu , D.P. Mohapatra, Elements of Discrete mathematics, 2nd Edition , Tata McGraw Hill, 1985,

PRACTICALS

1. Find out union and intersection of two sets. 2. Find out difference of two sets. 3. Find out power set of a given set. 4. Construct truth table of AND, OR and XOR. 5. Construct truth table for NAND and NOR. 6. Prove De Morgan’s laws. 7. Construct truth table of any given formula. 8. Construct transitive closure using Warshall’s algorithm. 9. Represent graph using adjacency Matrix. 10. Represent graph using adjacency List. 11. Implement Prim’s algorithm. 12. Implement Kruskal’s algorithm.


Skill Enhancement Compulsory Course SEC-2 Quantitative Aptitude & Logical

Reasoning (4 Credits) Full Marks: 100

[Mid Term: 20 Marks + End Term: 80 Marks] QUANTITATIVE APTITUDE & DATA INTERPRETATION:

Unit – 1: Whole numbers, Integers, Rational and irrational numbers, Fractions, Square roots and Cube roots, Surds and Indices, Problems on Numbers, Divisibility, Steps of Long Division Method for Finding Square Roots Unit -2: Basic concepts, Different formulae of Percentage, Profit and Loss, Discount, Simple interest, Ratio and Proportion, Mixture Unit- 3: Time and Work, Pipes and Cisterns, Basic concepts of Time, Distance and Speed ; relationship among them Unit – 4: Concept of Angles, Different Polygons like triangles, rectangle, square, right angled triangle, Pythagorean Theorem, Perimeter and Area of Triangles, Rectangles, Circles Unit – 5: Raw and Grouped Data, Bar Graphs, Pie charts, Mean, Median and Mode, Events and Sample Space, Probability

LOGICAL REASONING Unit - 1 : Analogy basing on kinds of relationships, Simple Analogy; Pattern and Series of Numbers, Letters, Figures. Coding-Decoding of Numbers, Letters, Symbols (Figures), Blood relations UNIT – 2 : Logical Statements – Two premise argument, More than two premise argument using connectives UNIT -3: Venn Diagrams, Mirror Images, Problems on Cubes and Dices

Text Book: Quantitative Aptitude and Logical Thinking ODISHA STATE HIGHER EDUCATION COUNCIL

BHUBANESWAR

IST (HONOURS) SEMESTER- V

Core Course C-11 – Communication Electronics (6 Credits)


THEORY

Unit - I Electronic communication: Block diagram of an electronic communication system, electromagnetic spectrum- band designations and applications, need for modulation, concept of channels and base-band signals. Concept of Noise, Types of Noise, Signal to noise ratio, Noise Figure, Noise Temperature, Friss formula. 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 Carrier Modulation, Vestigial Side Band modulation, Independent Side Band Modulation). Block diagram of AM Transmitter and Receiver

Unit- II Angle modulation: Frequency and Phase modulation, modulation index and frequency spectrum, 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- III Pulse Analog Modulation: Channel capacity, Sampling theorem, PAM, PDM, PPM modulation and detection techniques, Multiplexing, TDM and FDM. Pulse Code Modulation: Need for digital transmission, Quantizing, Uniform and Non-uniform Quantization, Quantization Noise, Companding, Coding, Decoding, Regeneration. Unit-IV Digital Carrier Modulation Techniques: Block diagram of digital transmission and reception, capacity, Bit Rate, Baud Rate and M-ary coding. Amplitude Shift Keying (ASK), Frequency Shift Keying (FSK), Phase Shift Keying (PSK), Binary Phase Shift Keying (BPSK) and Quadrature Phase Shift Keying (QPSK)

Text Books: 1. Electronic Communication Systems- Kennedy, 3rd edition, McGraw international Publications 2. Modern Digital and Analog Communication Systems, Bhagwandas PannalalLathi, Zhi Ding Oxford University Press, 2010 3. Communication Systems, S. Haykin, Wiley India (2006)

PRACTICALS

1. Study of DSB-AM Modulation

2. Study of DSB-AM Demodulation

3. Study of Frequency Modulation

4. Study of Frequency Demodulation

5. Study of SSB-AM Modulation

6. Study of SSB-AM Modulation

7. Study of TDM.

8. Study of FDM

9. Study of Pulse Code Modulation

10. Study of Amplitude Shift Keying

11. Study of Phase Shift Keying.

12. Study of Frequency Shift Keying.

IST (HONOURS) SEMESTER- V Core Course

C-12 - Database Management Systems (6 Credits) Full Marks: 100


THEORY Unit-1

Introduction to Database and Database Users, Database System Concepts and Architecture: data Models, schema, and instances, Conceptual Modeling and Database Design: Entity Relationship (ER) Model: Entity Types, Entity Sets, Attributes, Keys, Relationship Types, Relationship Sets, Roles and Structural Constraints, Weak Entity Types, ER Naming Conventions. Enhanced Entity-Relationship (EER) Model. Unit-2

Database Design Theory and Normalization: Functional Dependencies, Normal Forms based on Primary Keys, Second and third Normal Forms, Boyce-Codd Normal Form, Multivalued Dependency and Fourth Normal Form, Join Dependencies and Fifth Normal Form. Unit-3

Relational data Model and SQL: Relational Model Concepts, Basic SQLs, SQL Data Definition and Data types, Constraints in SQL, Retrieval Queries in SQL, INSERT, DELETE, UPDATE Statements in SQL, Relational Algebra and Relational Calculus: Unary Relational Operations: SELECT and PROJECT, Binary Relation: JOIN and DIVISION. Unit-4

Introduction to Transaction Processing Concepts and Theory: Introduction to Transaction Processing, Transaction and System Concepts, Properties of Transactions, Recoverability, Serializability, Concurrency Control Techniques, Locking techniques for Concurrency Control, Concurrency Control based on Time-Stamp Ordering. Text Book: 1. Fundamentals of Database Systems, 6th edition, Ramez Elmasri, Shamkant B. Navathe, Pearson Education Reference Book: 1. An Introduction to Database System, Date C. J. - Pearson Education, New Delhi - 2005

PRACTICALS Q1. The HR department wants you to create SQL statements to DDL, DML, DQL and DCL employee data. As a prototype, you can use the EMPLOYEE table, before giving the statements to the HR department, to create the structure of EMPLOYEES table. Include only the EMPNO, ENAME, JOB, MGR, HIREDATE, SALARY, COMM and DEPTNO columns.

Q2. Create an INSERT statement to add the first row of data to the EMPLOYEE table from the following sample data. EMPNO ENAME JOB MGR HIREDATE SALARY COMM DEPTNO 7369 SMITH CLERK 7902 17-DEC-80 800 20 7499 ALLEN SALESMAN 7698 20-FEB-81 1600 300 40 7521 WARD SALESMAN 7698 22-FEB-81 1250 500 30 7566 JONES MANAGER 7839 02-APR-81 2975 20 7654 MARTIN SALESMAN 7698 28-SEP-81 1250 1400 30 7698 BLAKE MANAGER 7839 01-MAY-81 2850 40 7782 CLARK MANAGER 7839 09-JUN-81 2450 10 7788 SCOTT ANALYST 7566 19-APR-87 3000 20 7839 KING PRESIDENT 17-NOV-81 5000 10 7844 TURNER SALESMAN 7698 08-SEP-81 1500 0 30 7876 ADAMS CLERK 7788 23-MAY-87 1100 20 7897 TOMY OFFICER 7791 9-JAN-85 3780 0 30 7900 JONY HR 7980 03-DEC-81 9000 1350 40 7902 FORD ANALYST 7566 03-DEC-81 4000 20 7934 MILLER CLERK 7782 23-JAN-82 1300 10 Q3. To list out the all employee details from the EMPLOYEE table.

Q4. Write a SQL statement to display employee name, job, hiredate, salary from the EMPLOYEE table.

Q5. Write a SQL statement to display employee number, name, job, commission whose employee name is “FORD”.

Q6. To display details of employees who are not getting commission from the EMPLOYEE table .

Q7. Change the salary to $22000 for all employees with a salary less than $1100.

Q8. Verify your new data changes to the EMPLOYEE table.

Q9. Delete one record whose name is “TOMY” from the EMPLOYEE table.

Q10. Confirm your deletion in the EMPLOYEE table.

Q11. Empty the entire data in the EMPLOYEE table.

Q12. Confirm that the EMPLOYEE table is empty.

Q13. Make the data addition permanent.

Q14. The HR department wants a query to display the name, job, hire date, salary and employee number for each employee, with the employee number appearing first. Provide an alias STARTDATE for the HIRE_DATE column. Q15. The HR department has requested a report of all employees and their job titles.

Display the name concatenated with the job (separated by a comma and space) and name the column Employee and Title.

Q16. To familiarize yourself with the data in the EMPLOYEES table, create a query to display all the data from the EMPLOYEES table. Separate each column output with a comma. Name the column THE_OUTPUT.

Q17. The HR department needs a report that displays the name, mgr, hiredate, deptno and salary of employees earning more than $22,000.

Q18. The HR departments need to find high-salary and low-salary employees, and wants to display the name and salary for all employees whose salary is not in the $5,000–$12,000 range.

Q19. The HR department needs a query to display all unique job codes from the EMPLOYEES table.

Q20. Display the empno, salary, job, hiredate and department number of all employees in departments 20 or 40 in ascending alphabetical order by name.

Q21. Display the names of all employees who have both an “S” and an “R” in their names.

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

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

Q24. To display Name of all employees’ either having two _ _R's or having two _ _A's in their name and are either in Dept No = 30 or their Manger's Employee No = 7788.

Q25. To display Name, Hire Date and Day of the week on which the employee started working.

Q26. To display the Employee No. and Name for all employees who earn more than the average salary.

Q27. Create a query to display the name and salary for all employees. Format the salary to be 15 characters long, left-padded with the “$” symbol. Label the column SALARY.

Q28. Display each employee’s name, hire date, and salary review date, which is the first Monday after six months of service. Label the column REVIEW. Format the dates to appear in the format similar to “Monday, the Thirty-First of July, 2000.”

Q29. Find the highest, lowest, sum, and average salary of all employees. Label the columns Maximum, Minimum, Sum, and Average, respectively. Round your results to the nearest whole number.

Q30. Create a report to display the manager number and the salary of the lowest-paid employee for that manager. Exclude anyone whose manager is not known. Exclude any groups where the minimum salary is $6,000 or less. Sort the output in descending order of salary.

Q31. The HR department needs a report of employees in Toronto. Display the name, job, department number, and department name for all employees who work in Toronto.

Q32. Display all the employees who are getting some commission with their designation is neither MANANGER nor ANALYST.

Q33. Display department-wise total salaries for all the Managers and Analysts, only if the average salaries for the same are greater than or equal to 3000.

Q34. Display all the employees who are earning more than all the managers.

Q35. Create a report that displays the employee number, name, and salary of all employees who earn more than the average salary. Sort the results in ascending order by salary

Q36. To display the employee number, name, job and salary of all employees who earn more than the average salary and who work in a department with any employee whose name contains a “T”. Q37. Write a query that displays the name (with the first letter uppercase and all other letters lowercase) and the length of the name for all employees whose name starts with the letters J, A, or M. Give each column an appropriate label. Sort the results by the employees’ names.

Q38. Write a query that displays the department name and location of the employees names “ALLEN”,”SCOTT”

Q39. Write queries that display the second highest salaries.

Q40. Display all the managers and clerk who work in Accounting and Sales departments.

Q41. Display all the salesmen who are not located at New York and get all the employees who work in the same departments as of SCOTT.

Q42. Select the row if an employee is a PRESIDENT or a SALESMAN and if the employee earns more than $1500."

Q43. Write a query to display the name, department number, and salary of any employee whose department number and salary match the department number and salary of any employee who earns a commission.

Q44. Finds the employees whose salary is more than the maximum salary of the employees in any department.

Q45. Query to display the Name, Salary and Commission for all the employees who earn commission. Sort the data in descending order of Salary and Commission.

Q46. Query to display employee serial no, Name, date of join, Job and Salary of all employees whose Job is Clerical or Analyst & their salaries are not equal to 1000, 3000, or 5000.

Q47. Query to display the Employee No, Name and Salary for all employees who earn than the average salary and who work in a Department with any employee with a ‘M’ in his/her name.

Q48. Query to display the Manager’s No. and the Salary of the lowest paid employee for that respective manager. Exclude anyone where the Manager ID is not known. Exclude any groups where the minimum salary is less than $1000.

IST(HONOURS)

SEMESTER- V Skill Enhancement Compulsory Course

SEC-3 Web Technology (4 Credits) Full Marks: 100

[Mid Term: 15 Marks + End Term (Theory: 60 Marks + Practical: 25 Marks)] Unit-1 Web Essentials: Clients, Servers and Communication: The Internet – Basic Internet protocols – The WWW, HTTP request message – response message, web clients web servers – case study. Introduction to HTML: HTML, HTML domains, basic structure of an HTML document – creating an HTML document, mark up tags, heading, paragraphs, line breaks, HTML tags. Elements of HTML, working with text, lists, tables and frames, working with hyperlink, images and multimedia, forms and controls

Unit-2 Introduction to cascading style sheets: Concepts of CSS, creating style sheet, CSS properties, CSS styling (background, text format, controlling fonts), working with the block elements and objects. Working who lists and tables, CSS ID and class. Box model (introduction, border properties, padding properties, margin properties), CSS colour, groping, Dimensions, display, positioning, floating, align, pseudo class, Navigation bar, image sprites. Unit-3 Java scripts: Client side scripting, what is java script, simple java script, variables, functions, conditions, loops and repetitions. Java scripts and objects, java script own objects, the DOM and web browser environment, forms and validations. DHTML: Combining HTML, CSS, java scripts, events and buttons, controlling your browser. Unit-4 PHP: Starting to script on server side, PHP basics, variables, data types, operators, expressions,

constants, decisions and loop making decisions. Strings – creating, accessing strings, searching, replacing and formatting strings. Arrays: Creation, accessing array, multidimensional arrays, PHP with Database. Text Book:

1. Web Technologies – Black Book – DreamTech Press 2. Matt Doyle, Beginning PHP 5.3 (wrox-Willey publishing) 3. John Duckett, Beginning HTML, XHTML, CSS and Java script.

Reference Book: 1. HTML, XHTML and CSS Bible, 5ed, Willey India-Steven M. Schafer.

Practical: Web Technology Lab

1. Acquaintance with elements, tags and basic structure of HTML files. 2. Practicing basic and advanced text for formatting. 3. Practice use of image, video and sound in HTML documents. 4. Designing of web pages- Document layout, list, tables. 5. Practicing Hyperlink of web pages, working with frames. 6. Working with forms and controls. 7. Acquaintance with creating style sheet, CSS properties and styling. 8. Working with background, text, font, list properties. 9. Working with HTML elements box properties in CSS.

10. Develop simple calculator for addition, subtraction, multiplication and division operation using java script.

11. Create HTML page with java script which takes integer number as a input and tells whether the number is odd or even.

12. Create HTML page that contains form with fields name, Email, mobile number, gender, favorite colour and button; now write a java script code to validate each entry. Also write a code to combine and display the information in text box when button is clicked.

13. Write a PHP program to check if number is prime or not. 14. Write a PHP program to print first ten Fibonacci numbers. 15. Create a MySQL data base and connect with PHP. 16. Write PHP script for string and retrieving user information from my SQL table.

a. Write a HTML page which takes Name, Address, Email and Mobile number from user (register PHP).

b. Store this data in MySQL data base. c. Next page display all user in HTML table using PHP (display .PHP).

17. Using HTML, CSS, Javascript, PHP, MySQL, design a authentication module of a web page.

IST (HONOURS)

SEMESTER- V Discipline Specific Elective DSE-1 Data Science (6 Credits)


Unit-1 Data Scientist’s Tool Box: Turning data into actionable knowledge, introduction to the tools that will be used in building data analysis software: version control, markdown, git, GitHub, R, and RStudio. Unit-2 R Programming Basics: Overview of R, R data types and objects, reading and writing data, Control structures, functions, scoping rules, dates and times, Loop functions, debugging tools, Simulation, code profiling. Unit-3 Getting and Cleaning Data: Obtaining data from the web, from APIs, from databases and from colleagues in various formats, basics of data cleaning and making data “tidy” . Unit-4 Exploratory Data Analysis: Essential exploratory techniques for summarizing data, applied before formal modeling commences, eliminating or sharpening potential hypotheses about the world that can be addressed by the data, common multivariate statistical techniques used to visualize high-dimensional data. Text Books 1. Rachel Schutt, Cathy O'Neil, "Doing Data Science: Straight Talk from the Frontiline" by Schroff/O'Reilly, 2013. Reference Books 1. Foster Provost, Tom Fawcett, “Data Science for Business” What You Need to Know About

Data Mining and Data-Analytic Thinking by O'Reilly, 2013. 2. John W. Foreman, “Data Smart: Using data Science to Transform Information into Insight”

by John Wiley & Sons, 2013. 3. Eric Seigel, “Predictive Analytics: The Power to Predict who Will Click, Buy, Lie, or Die",

1st Edition, by Wiley, 2013.

Practical: Elementary Data Science Lab 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 linear search. 8. Implement binary search. 9. Implement matrices addition, subtraction and Multiplication 10. Fifteen students were enrolled in a course. There ages were:

20 20 20 20 20 21 21 21 22 22 22 22 23 23 23 i. Find the median age of all students under 22 years. ii. Find the median age of all students. iii. Find the mean age of all students.

iv. Find the modal age for all students. v. Two more students enter the class. The age of both students is 23. What is now mean,

mode and median?

IST (HONOURS) SEMESTER- V

Discipline Specific Elective DSE-2 – Software Engineering (6 Credits)


Unit-1 Introduction: Evolution of Software to an Engineering Discipline, Software Development Projects, Exploratory Style of Software Development, Emergence of Software Engineering, Changes in Software Development Practices, Computer Systems Engineering. Software Lifecycle Models: Waterfall Model and its Extensions, Rapid Application Development (RAD), Agile Development Models, Spiral Model. Unit-2 Software Project Management: Software Project Management Complexities, Responsibilities of a Software Project Manager, Project Planning, Metrics for Project Size Estimation, Project Estimation Techniques, Empirical Estimation Techniques, COCOMO, Halstead’s Software Science, Staffing Level Estimation, Scheduling, Organization and Team Structures, Staffing, Risk Management, Software Configuration Management. Unit-3 Requirement Analysis and Specification: Requirements Gathering and Analysis, Software Requirement Specifications, Formal System Specification Axiomatic Specification, Algebraic Specification, Executable Specification and 4GL. Software Design: Design Process, Characterize a Good Software Design, Cohesion and Coupling, Layered Arrangements of Modules, Approaches to Software Design (Function Oriented & Object-Oriented). Unit-4 Coding and Testing: Coding: Code Review, Software Documentation, Testing, Unit Testing, Black Box and White Box Testing, Debugging, Program Analysis Tools, Integration Testing, System Testing, Software Maintenance. Text Book: 1. Fundamental of Software Engineering, Rajib Mall, Fifth Edition, PHI Publication, India. Reference Books: 1. Software Engineering– Ian Sommerville, 10/Ed, Pearson. 2. Software Engineering Concepts and Practice – Ugrasen Suman, Cengage Learning India Pvt, Ltd.

IST (HONOURS) SEMESTER- VI

Core Course C-13 - Signals and Systems (6 Credits)


THEORY

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. 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- IV 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.

Text 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. Digital Signal Processing, John G. Proakis, Dimitris G. Manolakis - Pearson Prentice Hall, 2007

PRACTICALS

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


Core Course C-14 – Programming in Python (6 Credits)


THEORY

UNIT-I Python: Features of Python, Python Virtual machine, Frozen binaries, Comments, Docstrings, How Python sees variables, Data types in Python, built in types, sequences in Python, sets, literals in Python, user defined data types, identifiers & reserved words, Naming convention in Python. Various Operators in Python , Input & Output , Control statements, if statements, while loop, for loop, infinite loop, nested loop ,else suit, break, continue, pass ,assert, return statements, command line arguments. UNIT-II Arrays in Python, advantages using arrays, creating arrays, importing the array module, indexing and slicing on arrays, Processing the arrays, Comparing arrays. Strings in Python, Creating strings, Length of a string, Indexing in strings, Slicing strings, Concatenation and Comparing strings, Finding Sub Strings, Replacing a String. UNIT-III Functions in Python , Define a function, Calling a function, return from function, pass by object Reference, Positional arguments, Default arguments, Recursive functions. Introduction to OOP, features of OOP, creating classes, the self variable, constructor, types of variables, namespaces, types of methods. UNIT-IV Inheritance: Define inheritance, types of inheritance, constructors in inheritance, overriding super class constructors & methods, the super() method Polymorphism: Duck typing philosophy of Python, operator overloading, method overriding, interfaces in Python Python Exceptions: Errors in a python program, Exceptions, Exception handling, Types of Exceptions, The Exception block, the assert statement Text Book: 1. Core Python Programming, Dr. R. Nageswar Rao, Dreamtech Press Reference Books: 1. Python Programming for Absolute Beginners, Michael Dawson, CENGAGE Learning

PRACTICALS 1. Installing and setting up the Python. 2. Simple programs using input and output. 3. Programs based on Conditional constructs, if statements, while loop, for loop, infinite loop, Nested loop. 4. Programs using break and continue statements. 5. Programs using arrays and Strings. 6. Programs using functions pass by object reference. 7. Programs using default arguments, recursions. 8. Simple class programs, constructors, and Inheritance. 9. Programs of Method Overriding, operator overloading, the super() method, MRO, interfaces. 10. Programs of Exceptions handlings including User defined exceptions.

IST(HONOURS) SEMESTER- VI

Skill Enhancement Compulsory Course SEC-4 Programming in VB.Net (4 Credits)


UNIT: I Introduction to .NET: Introduction of Language, Introduction of Web Application,Platform Dependence , Independence & Portability,Introduction of .NET Framework, Introduction of Compiler & MSIL, Introduction of CLR,Introduction of CLS, CTS, CLI . Basic Syntax, Data Types, Variable Declaration, Constants, Operators (in VB.Net). Decision making in VB.Net: If...Then, If...Then...Else, If...Else If...Else, Nested If and Select Case Statements. Loops in VB.Net: Do Loop, For...Next Loop, While... End While Loop, With... End With Statement, Nested Loops. UNIT: II Arrays in VB.Net: Creating Arrays, Multi-Dimensional Arrays Functions in VB.Net: Defining a Function, Function Returning a Value, Recursive Function, Passing Arrays as Function Arguments. Sub Procedures in VB.Net: Defining Sub Procedures, Passing Parameters by Value. Exception Handling in VB.Net, Basic Controls: Forms , TextBox , Label , Button, ListBox , ComboBox , RadioButton, CheckBox , PictureBox, ProgressBar, DateTimePicker. Control Properties and Control events. UNIT -III Database Access: ADO.Net Object Model, Data Provider, Dataset, Connecting to a Database, Database programming: Introduction, Connection, Data adapter, Data sets. ADO .NET: Introduction, Creating Connection, Creation new table, Insert data, SQL connection, SQL command, SQL data adapter, SQL data reader, Data table, Data column, Data row, Data grid view. UNIT –IV Overview of ASP.NET: Introduction to ASP.NET, Configuring ASP.NET Applications ASP.NET Frameworks , Code Behind , Page Directives, Page Events , Post Back. Asp.net controls : Label control , Textbox control , Button control, Link button control, Check box control, Radio button control, Hyper link control, Image control, Checkbox List control, Radio Button List control, Drop Down List control, ListBox control, DataGrid control , Grid View Controls. Use of ADO .NET in web applications ( Create table, Insert, Update, Delete), Datagrid view. Practical 1. VB.net Programming (Using standard all Controls)

2. ADO.net Programming (Insert, Delete, Update, Select and all its functions)

3. ASP.net Programming. (Using standard all Controls)


Discipline Specific Elective DSE-3 Communication Systems (6 Credits)


UNIT-1 Telephone instruments and Signals: Introduction, Subscriber loop, standard telephone set, Basic call procedures, call progress tones and signals, cordless telephone, caller ID, electronic Telephone, Cross talk & its types. Public Telephone Network, Instruments, Local Loops, Trunk Circuits & Exchanges.

UNIT-2 Optical Fiber transmission : - Introduction, Advantages of optical fiber over metallic cable, Electromagnetic spectrum, Block diagram of an optical fiber system, optical fiber types, Light propagation, Fiber configuration and classifications, Losses in Optical Fiber, Light sources, Optical sources : LED, construction & application, Light detectors. (PIN Diode), LASERS (types, characteristics & construction), Optical fiber system Link budget.

UNIT-3 Satellite Communication: - Introduction, Satellite Elevation Categories, Orbital patterns, Geosynchronous / Geostationary satellite & its Advantages & disadvantages, Frequency Allocation, Block diagram study of satellite system link models. Multiple Accessing, Basic concepts of TDMA, FDMA & CDMA. Applications of Satellite, VSAT, Television via Satellite (DTH).

UNIT-4 Information Theory : Introduction, Entropy, Information rate, The channel capacity, The source coding, code length and efficiency, source coding theorem, classification of codes, Entropy coding : shanaon-fano coding, Huffman coding. Cellular Concept: System Design: Fundamentals: Frequency reuse, Channel Assignment, Handoff Strategies, Interferences and System Capacity, Trunking and Grade of Service; Improving coverage and capacity in Cellular Systems – Cell Splitting, Sectoring.

Text Books: 1. Advanced Communication System by Wayne Tomasi (Sixth edition) 2. Principles of Communication Engineering. by Singh & Chhabra 3. T S Rappaport, Wireless Communications, Pearson Education, India

Communication Systems Laboratory List of Experiments 1. To Study the three basic elements in fiber optic links:

(Transmitter, Receiver, Optical fiber).

2. To set up of Fiber Optic Analog Link when used for Analog

Data transmission.

3. To set up of Fiber Optic Digital Link when used for Digital data

Transmission.

4. Measurement of Propagation Loss in Optical fiber.

5. Measurement of Bending Loss in Optical fiber.

6. Measurement of Numerical Aperture.

7. To study the Attenuation of signal in Optical fiber cable.

8. To set up of Time Division Multiplexing.

9. To Study the V-I characteristics of a LED.


Discipline Specific Elective DSE-4 - Project Work (6 Credits)

Full Marks: 100 (End Term 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.

*****

course structure of b. sc. in information science and

Documents