CENTURION UNIVERSITY OF TECHNOLOGY AND

MANAGEMENT, ODISHA

SCHOOL OF BASIC SCIENCES

COURSE STRUCTURE AND SYLLABUS

FOR

(First Year)

5-YEARS MASTER’S DEGREE OF SCIENCE

In

Information Technology

M. Sc (IT)

2014 -Batch

CENTURION UNIVERSITY OF TECHNOLOGY AND MANAGEMENT,

ODISHA

Detailed Course Structure & Syllabus (1ST Year-2014)

SEMESTER-I SEMESTER-II

Sl

no

Subject

Code Subject

Contac

t Hours

per

week

(L+T+

P)

Cre

dit

s

Sl

no

Subject

Code Subject

Contact

Hours per

week

(L+T+P) Cre

dit

s

1 MSIL1101/

MSIL1102 ORIYA/HINDI 2+0+0 2 1 MSEN1201

COMMUNICATIVE

ENGLISH-I 2+0+0 2

2 MSIT1101

PROGRAMMING AND

PROBLEM SOLVING

USING ‘C’

3+1+0 4 2 MSIT1201

COMPUTER

ORGANIZATION AND

SYSTEM

ARCHITECTURE

3+1+0 4

3 MSIT1102 FUNDAMENTALS OF

COMPUTER S 3+1+0 4 3 MSIT1202

DATA STRUCTURES

USING ‘C’ 3+1+0 4

4 MSIT1103 BASIC ELECTRONICS 3+1+0 4 4 MSIT1203

DISCRETE

MATHEMATICAL

STRUCTURES

3+1+0 4

5 MSMA1102 MATHEMATICS FOR IT 3+1+0 4 5 MSES1201 ENVIRONMENTAL

STUDIES 3+1+0 4

6 MSTL1101

PROGRAMMING AND

PROBLEM SOLVING

USING ‘C’ LAB.

0+0+3 2 6 MSTL1201

COMPUTER

ORGANIZATION AND

SYSTEM

ARCHITECTURE LAB

0+0+3 2

7 MSTL1102 FUNDAMENTALS OF

COMPUTER S LAB 0+0+3 2 7 MSTL1202

DATA STRUCTURE

USING C LAB 0+0+3 2

8 MSTL1103 BASIC ELECTRONICS LAB 0+0+3 2 8 MSEL1201

COMMUNICATIVE

PRACTICE

LABORATORY-I

0+0+3 2

TOTAL CREDITS 24 TOTAL CREDITS 24

TOTAL CUMULATIVE CREDITS 24 TOTAL CUMULATIVE CREDITS 48

FIRST SEMESTER

MSIT1101 PROGRAMMING AND PROBLEM

SOLVING USING ‘C’ (3-1-0) MODULE-I

Problem solving techniques: Algorithms, Flow charts, Pseudo codes, Structured programming-

sequence, selection and iterations.

Introduction to C: Overview of C, Structure of C program, Character set, Identifiers, Keywords.

Constants, Variables Data Types: Size and range of data types, type conversions.

Operators: Arithmetic, relational and logical operators, increment and decrement operators, conditional

operator, bit-wise operators, assignment operators, expressions, precedence and order of evaluation.

Managing Input and Output: I/O functions: printf, scanf, getchar, putchar, gets, puts etc.

MODULE-II

Decision Making and Branching: if, if-else, if-else-if, nested if and switch statements.

Loop Control Structures: while, do-while and for loops. Jumping statements: goto, break, continue,

return, and exit.

Arrays: declaration, definition, accessing elements of one dimensional and two-dimensional arrays and

applications.

Strings: String Manipulation and String handling functions.

Functions: Types of functions, prototype declaration, definition, parameter passing, recursive functions,

storage classes - extern, auto, register, static, scope rules.

MODULE-III

Derived data types: Structures- declaration, definition and initialization of structures, accessing

structures, nested structures, arrays of structures, Union and typedef, bit fields.

Introductions to pointers: Pointer arithmetic, Pointers to arrays, Pointers to functions, Pointers to

structures, Self referential Structures. Pointers to pointers, pointers and multidimensional arrays,

command line arguments.

File management in C: Input and output, concept of a file, text files and binary files, streams, standard

I/O, Formatted I/O, file I/O operations, error handling.

Text Books

1. Byron Gottfried, “Programming with C” TMH Publications

2. Ashok. N. Kamthane,“ Computer Programming”, Pearson Education

Reference Books:

1. E. Balaguruswamy “Programming in C”, Tata McGraw Hill-3rd edition

2. B.W. Kernighan & D.M. Ritchie, "C Programming Language", PHI.

3. T Jeyapoovan, A First Course in Programming with C, Vikas Publishing House Pvt Ltd.

MSIT1102 FUNDAMENTALS OF COMPUTERS (3-1-0)

Module 1 (20 hours)

Computer Basics: A simple model of computers, Digital and Analog Computers, Evolution of digital

computers, Major Components of a digital computer, hardware, software, firmware, middleware,

freeware. Input/output Devices: Input Devices, Output Devices, Printers, and Plotters, Other forms of

Output devices, Input and Output port.

Number System: Decimal Number System, Binary Number System, conversion of numbers(binary to

decimal, decimal to binary), Addition of Binary Numbers, 1’s complement and 2’s complement

representation of numbers, Binary Subtraction, Binary Multiplication, Binary Division, Hexadecimal

and octal number system, ASCII and ISCII code, EBCDIC code, Gray codes, Fixed point and Floating

Point Representation, Overflow and Underflow.

Logic Circuits: Switching circuits, AND/OR operations, NOT operations, Boolean Functions,

Canonical Forms of Boolean Functions, Logic circuits.

Module 2 (12 hours)

Processor: CPU organization, Structure of Instruction, A machine level language

Computer Memory: Read only memory, Serial Access memory, Main memory, Secondary memory:

Magnetic hard disk, Floppy disk Drives, Compact Disk Read Only memory, Magnetic tape Drives.

Computer Architecture: Interconnection of units, Processor to memory communication, I/O to

processor communication, Interrupt Structure, Multiprogramming, Processor Features, RISC, Virtual

Memory.

Module 3 (18 hours)

Computer Languages: Programming Language, Introduction to Interpreter and compiler, Assembly

Language, Higher Level Languages

Operating System: Need of an OS, Batch operating system, multiprogramming Operating system,

Time sharing Operating System, personal computer Operating system, on-line and real time system.

Computers and Communications: Computer Generations, Types of communications with and among

computers, internet and world wide web, characteristics of communication channels, Physical

Communication Model, Computer Network topologies, Local Area Network.

Text Book:

1. Fundamentals of Computers, by V.Rajaraman (chapter 1,2,3,4,5,6,7,8,9,10,12,13)

2. Reference Books:

1. Computer Fundamentals, by B.Ram

2. Computer Fundamentals by P.K.Sinha

3. Fundamentals Of Information Technology, 2nd Edition, Alexis Leon, Mathew Leon,Vikas

Publishing House Pvt Ltd.

MSIT1103 BASIC ELECTRONICS (3-1-0)

Module-I

Introduction to Electronics: Signals, Frequency spectrum of signals, Analog and digital

signals,Amplifiers.Semiconductor Diodes: Introduction, Physical operation of p-n junction diodes,

Characteristicsof p-n junction diodes,Rectifier circuits (half-wave, full-wave, bridge and peak rectifiers),

Diodeclipper and clamper circuits, Zenerdiode and voltage regulations.

Bipolar Junction Transistors (BJTs): Simplified structure and physical operation of n-p-n and p-n-p

transistors, Current-voltage characteristics of BJT (Common-Emitter, Common-Base and Common

Collector configurations), BJT as an amplifierand as a switch. DC biasing in BJT amplifier circuits,

SmallSignal Operation of BJT: Simplified hybrid-π model and its application to single stage BJT

amplifiers.

Module-II

The Operational Amplifier (Op-Amp): The ideal Op-Amp, Inverting and non-invertingconfigurations,

Difference amplifier, CMRR, Application of Op-Amp (Instrumentation amplifier,Summing amplifier,

Integrator and Differentiator).

Electronic Instruments: Basic principle of Oscilloscope, Function of the sweep generator, Blockdiagrams

of oscilloscope, Simple CRO, Measurement of frequency and phase by Lissajousmethod, Application of

oscilloscope for measurement of voltage, period and frequency, Blockdiagram of standard signal

generator, AF sine and square wave generator, and Functiongenerator.

Module-III

Digital Electronic Principles: Introduction, Binary digits, Logic levels and Digital

waveforms,Introduction to basic logic operation, Number system, Decimal numbers, Binary

numbers,Decimal- to-Binary conversion, Simple binary arithmetic, 1’s & 2’s complement

Logic Gates and Boolean algebra: The inverter, The AND, OR, NAND NOR, Exclusive-OR

andExclusive-NOR gate, Boolean operations and expressions, Laws and Rules of Boolean

algebra,DeMorgan’s theorem, Boolean analysis of logic circuits, Standard forms of

Booleanexpressions(SOP,POS), Boolean expression and truth table.

Combinational Logic and Their Functions: Basic combinational logic circuits, Implementation

ofCombinational logic, The universal properties of NAND and NOR gates.

Text Books:

1. Electronic Devices and Circuit Theory (Eighth Edition), Robert L. Boylestad and

LouisNashelsky, Pearson Education.

Module-1: (1.1 to 1.6 2.7 to 2.11 3.1 to 3.8 4.1 to 4.6 7.1 to 7.6)

Module-2: (1 3.1 to 13.4 14.5 21.1 to 21.5)

2. Digital Fundamentals (Eighth Edition), Thomas L. Floyd and R.P. Jain, Pearson Education.

Mdule-3: (1.1 to 1.3 2.1 to2.7 3.1 to 3.6 4.1 to 4.7 5.1 to 5.3)

3. Microelectronic Circuits (Fifth Edition), Adel S. Sedra and Kenneth C. Smith, Oxford

universityPress.

Reference Books:

1. Electronic Instrumentation, H.S. Kalsi, Tata McGraw-Hill Publishing Company Limited

2. Digital Circuits & Design, Salivahanan,Arivazhagan,4th Ed,Vikas Publishing House Pvt. Ltd

MSMA1102 MATHEMATICS FOR IT (3-1-0)

Module-1

Arithmetic: Ratio and proportions, profit and loss, Simple Interest, compound interest, time and distances,

quadratic equations.

Surface area and Volume of solids: Right circular cone, cylinder, cube, cuboids and sphere,

Statistics: mean, median, mode, mean deviation about mean and median, variance, Standard deviation.

Module-2

Set Theory: Sets, Types of sets, set operations. Relations and Functions: types of relations, types of

functions. Number Systems: Real and Complex numbers. Counting Theory: Counting, Pigeon Hole

Principle.

Module-3

Matrices and Determinants, Matrix operations and Matrix algebra, Permutations, combinations,

Binominal theorem, Sequence and series, Introduction to Probability.

Text Books

3. R S Agarwal, Quantitative Aptitude, Sultan Chand Publishing Company Pvt Ltd.

Reference Book:

1. Kenneth H. Rosen, “Discrete Mathematics and Its Applications”, Sixth Edition, 2008, Tata

McGraw-Hill (TMH) Publications Pvt. Ltd., New Delhi.

MSTL1101 PROGRAMMING AND PROBLEM

SOLVING USING ‘C’ LAB (0-0-3)

Experiment No.1

(i) Write a C program to demonstrate different data types in C.

(ii) Write a C program to find the greatest of five numbers using conditional operator.

(iii)Write a C program to perform the arithmetic operations -addition, subtraction, multiplication,

and division of integers. Error should be reported, if any attempt is made to divide by zero.

Experiment No.2

(i)Write a C program to generate all odd and even numbers within a specific range.

(ii) Write a C program to find the roots of a given quadratic equation with non-zero coefficients.

(iii) Write a C program to find whether a given integer is prime number or not.

Experiment No.3

(i) Write a program to evaluate the following series.

1+ x/2! + x2/4! + x3/6! + x4/8! +x5/10!

(ii) Write a C program to find the roots of a given quadratic equation with non-zero coefficients.

(iii) Write a C program to find whether a given integer is prime number or not.

Experiment No.4

(i) Write a C program to generate and print the first N Fibonacci numbers.

(ii) Write a C program to find factorial of a given number.

(iii) Write C program to check a number is an Armstrong’s number or not.

Experiment No.5.

(i) Write a C program to find the GCD and LCM of two given integers.

(ii) Write a C program to reverse a given four-digit number and check whether the number is a

palindrome or not.

(iii) Write program to print the following pattern up to desired no. of lines.

1

2 3

4 5 6

Experiment No.6

(i) Write a C program to find both the largest and smallest number in a list of integers in an array.

(ii) Write a C program to insert a number in a given array.

(iii) Write a C program to delete a number in a given array.

Experiment No.7

(i) Write a C program to find sum and difference of two matrices A and B.

(ii) Write a C program to read two matrices A (M x N) and B (P x Q), and compute the product of

A.B after checking compatibility for multiplication.

Experiment No.8

(i) Check Whether Entered string is Palindrome or Not.

(ii) Write a program to sort an array of strings read through the keyboard.

(iii) Write a program to find the no of blank spaces, vowels, words and lines in a paragraph.

Experiment No.9

(i) Write C user defined functions

a. To input N real numbers into single dimension array

b. to compute their mean

c. to compute their variance

d. to compute their standard deviation

Using these functions write a C program to input N real numbers into a single dimension array,

compute their mean, variance, and standard deviation.

(ii) Write a C program to read a matrix A (M x N) and compute the following using user defined

functions:

a. Sum of the elements of the specified row

b. Sum of the elements of the specified column

c. Sum of all the elements of the matrix

Experiment No.10

(i) Write a program to create a structure for student (with fields Name, IdNo, gender and

age).read the details of student and display it.

(ii) Program to create a structure for bank customer (with fields Name, Account No and

balance).read the details of N customer details and display it.

(iii) Program to create a structure called Employee having member fields like name, gender and

salary. Write a program that accepts the details of employees. Display the employee details who

has highest salary. Display all employees in sorted order according to their salary.

Experiment No.11

(i) Write a Program to add two numbers using pointer.

(ii) Program to swap two values by using call by reference

(iii) Write a C program using pointers to read in an array of integers and print its elements in

reverse order.

Experiment No.12

(i) Write a C program which copies one file to another.

(ii) Write a C program to reverse the first n character in a file.

(NOTE: The file name and n are specified on the command line).

MSTL1102 FUNDAMENTALS OF COMPUTERS LAB (0-0-3)

Experiment 1: Introduction to computer and connectivity of different functional units.

Experiment 2: Identification of various components of a computer and its functions.

Experiment 3: Identification of various power supply units and peripheral units and their functions.

Experiment 4: Hardware Troubleshooting.

Experiment 5: Installation of operating Systems (Windows & Linux)

Experiment 6: Installation of Ms Office, Turbo C and other essential application software in

windows.

Experiment 7: Installation of Software in Linux Platform.

Experiment 8: Internet Basics: Browsing, Mailing, Domain Name Systems (DNS)

Experiment 9: Basic DOS commands

Experiment 10: Basic Linux commands

Experiment 11: Software Troubleshooting

Experiment 12: Usage of Word-Processors (Ms-Word), spread-sheets (Ms-excel) and multi-media

presentations (Ms Power Point).

MSTL1103 BASIC ELECTRONICS LABORATORY (0-0-3)

Hardware lab experiments (1-6) and Orcad Spice Software (7-12)

Best 10 experiments will be awarded marks

1. Identification, specification and testing of Electronic Components-Resistors, capacitors,

Inductors, Junction Diodes, Zener Diode, laser diode, BJT, Power BJTs, FET, OPAMP.

2. Study of different types of measuring instruments (I-meter-V-meter, DMM, AMM,

Oscilloscope (CRO, DSO), Function Generator and regulated power supply.

3. V - I Characteristic of a semiconductor diode. Determining DC and AC resistance and

Half wave and Full wave rectifiers with capacitor filter. Record of waveforms,

Measurement of Average and RMS values.

4. V - I Characteristics of a NPN and PNP transistor. DC Biasing and measurement of dc

voltages and currents.

5. Truth Tables of logic gates.

6. Soldering Practice using passive and active devices, Wire cutting with stripper & Wire

wrapping using PCB(Single Layer and Multilayer) and Strip Board, Breadboard, splicing

of co-axial cable and data cable.

Orcad Spice Software (7-12)

7. Half wave and full wave rectifier designing and finding out the i/p and o/p waveforms.

8. RC coupled amplifier designing and finding out the i/p and o/p waveforms.

9. Designing and simulation of differentiator and integrator.

10. Introduction to digital circuit and its application designing and simulation.

11. Clipper and clamper designing and finding out the i/p and o/p waveforms

12. Project on Design of Digital Clock / Design of Remote controller / Design of burglar

alarm

SECOND SEMESTER

MSEN1201 COMMUNICATIVE ENGLISH-1 (2-0-0)

The paper in English is of 100 (Hundred) percentage marks.

MODULE-I: COMMUNICATION SKILL

Communication: Definition, concept

Channels of Communication: Sender, receiver, channel, message, encoding, decoding, context, feedback

Verbal & Non-Verbal Communication: Spoken & written-advantages & disadvantages

Bias free English,Formal & informal style.

MODULE-II: COMMUNICATIVE GRAMMAR

Time, Tense & Aspect

Verbs of state & events

Modality

Active & Passive voice

Antonyms, Synonyms, Homonyms, one word substitutions & correction of errors

MODULE-III: SOUNDS OF ENGLISH

Length of vowels:

Long vowels as in the words feel, food, shoot, card etc.

Short vowels as in the words pen, sun, cut, shut, etc.

Consonants

Stress pattern

Intonation: Rising & Falling.

Text Books:

Effective technical communication by M.A.Rizvi

Reference Books:

Communicative English & Business Communication by R.K.Panda, J.Khuntia, M.Pati, Alok

Publication.

Communicative Grammar of English Geoffery Leech

Brush up your English- S.T.Iman (Bharati Bhavan, Patna)

MSIT1201 COMPUTER ORGANIZATION AND SYSTEM

ARCHITECTURE (3-1-0)

MODULE –I

Basic structures of Computers: Functional units, Bus structures, Computer Architecture vs Computer

Organization.

Addressing Methods and Machine Program Sequencing: Memory Locations, Addressing and encoding of

information, Main memory operations, Instructions and instruction sequencing, Addressing modes,

Assembly language

MODULE –II

Processing Unit: Fundamental concept, Execution of complete instruction, Hardwires control,

Performance considerations, Micro programmed control.

Memory: Basic concepts, Semiconductor RAM memories, Read only memories, speed, Size and cost,

Cache memories, Performance considerations, Virtual memories, Memory management requirements.

Input, Output Organization: Accessing I/O devices, Interrupts, Direct memory access, I/O hardware,

Standard I/O interfaces.

MODULE –III

Arithmetic: Number representations, Addition of positive numbers, Design of fast adders, Signed addition

and subtraction, Arithmetic and branching conditions, Multiplication of positive numbers, Signed-

operand multiplication, Fast multiplication, Integer division, Floating-point numbers and operations.

Text Books:

Books Recommended:

1. V.C. Hamacher, Z.G. Varanesie & S.G. Zaky- Computer Organization, Mc Graw Hill International.

Reference Books

1. M. Mano- Computer System Architecture, Prentice Hall of India

2. J.P. Hayes – Computer Architecture and Organization, Mc Graw Hill International.

MSIT1202 DATA STRUCTURE USING ‘C’ (3-1-0)

MODULE-I

Overview: Function, Dynamic memory allocation and pointers, pointer, Structure in ‘C’

Introduction to Data Structures: Data Structures, Need of data structure, Computer Memory,

Algorithm, Pseudo code for expressing algorithms, time complexity and space complexity.

Linear Structures of Array: Memory representation, Implementation and application, sparse matrix,

Advantages and Disadvantages of array

Link list: Memory representation, implementation and application, Linked stacks and queues, operations

on Polynomials, Doubly Linked Lists, Circularly Linked Lists. Advantages and

Disadvantages of linked list.

Stack: Memory representation, implementation and application of stack (Conversion from Infix to

Postfix, Evaluation of postfix expressions), Disadvantages of stack

Queue: Queues: Memory representation, implementation and application of a queue, Priority Queues,

Circular Queues. Advantages and Disadvantages of queues

MODULE-II

Tree: Concept of tree: Definition : Tree, Binary tree, Complete binary tree, Binary search tree, : Root,

Node, Degree of a node and tree, Terminal nodes, Non terminal nodes, Siblings, Level, Edge, Path, depth,

Parent node, ancestors of a node. Binary tree: Array representation of tree, Creation of binary tree.

Traversal of Binary Tree: Preorder, Inorder and postorder.

MODULE-III

Graphs: Terminology & Representations, Graphs & Multi-graphs, Directed Graphs, Sequential

Representations of Graphs, Adjacency Matrices, Traversal, Connected Component and Spanning Trees,

Minimum Cost Spanning Trees.

Sorting and searching: Bubble, Selection, Insertion, Heap sort, Radix sort, linear search, binary search

Text Books:

1. Data Structures: Seymour Lipschutz

Reference Books:

1. Data Structures in C by Tanenbaum.

2. Fundamentals of Data Structure by Sahany

3.Data Structures, by Tremblay and Sorenson.

4. Data Structure & Algorithms using C ,Amitav Nag and J P Singh, 2nd Edition, Vikas Publishing House

Pvt Ltd.

MSMA1203 DISCRETE MATHEMETICAL STRUCTURES (3-1-0)

MODULE-I

Logic: Propositional Logic, Propositional Equivalence, Predicates and Quantifiers, Rules of Inference,

Sequences and Summations, Mathematical Induction

Recurrence relations: Recursive definition, Solution to recurrence relations, generating functions.

Relation and Diagraphs: Properties of relations, composition of relations, closure operation on relations,

equivalence relations and partitions, paths in relation and diagraphs, Operations on relations, Transitive

closure. Partial ordered sets (POSET), Hasse diagram.

MODULE -II

Graphs: Basic terminologies, Directed and undirected graphs, paths and circuits, Eulerian paths and

circuits, Hamiltonian paths and circuits, Graph coloring.

Trees: Definition, properties and applications. Tree traversals— preorder, inorder, postorder, binary trees,

spanning trees, Minimum cost spanning trees-Prim’s and Kruskal’s algorithm.

MODULE-III

Algebraic Structures: Semi groups, Monoids, Groups, Subgroups, Cosets, Lagrange’s theorem, Normal

subgroup, Homomorphism, Isomorphism, Rings, Integral Domain and Field.

Lattices: Basic properties of Lattices, Distributed and Complemented Lattices, Boolean Lattice.

Boolean algebra: Boolean Functions and Boolean Expressions, Disjunctive and Conjunctive Normal

Forms.

Recommended Text Books:

1. Bernard Kolman, Robert Busby, Sharon C. Ross, “Discrete Mathematical Structures”, Sixth

Edition, 2008, Pearson Education Inc., New Delhi. / Prentice Hall of India (PHI) Pvt. Ltd., New

Delhi.

2. Kenneth H. Rosen, “Discrete Mathematics and Its Applications”, Sixth Edition, 2008, Tata

McGraw-Hill (TMH) Publications Pvt. Ltd., New Delhi.

Reference Books:

1. D. S. Malik & M. K. Sen, “Discrete Mathematical Structures”, First Edition, 2005, CENGAGE

Learning India Pvt. Ltd., New Delhi.

2. Judith L. Gersting, “Mathematical Structures for Computer Science: A Modern treatment to

Discrete Mathematics”, Fifth / Sixth Edition (Asian Student Editions), 2008, W. H. Freeman &

Company, New Delhi.

3. Richard Johnsonbaugh, “Discrete Mathematics”, Seventh Edition, 2008, Pearson Education Inc.,

New Delhi.

4. N Ch SN Lyengar,P S Arunachalam,K A Venkataesh,V M Chandrasekheran“Discrete

Mathematics”, 2nd Edition, Vikas Publishing House Pvt Ltd.

MSES1201 ENVIRONMENTAL STUDIES (3-1-0)

MODULE-I

Concepts of Ecology & Environment: Definition-Environment, Ecology & Ecosystem; Environmental

concepts – Atmosphere, Hydrosphere, Lithosphere & Biosphere, Environmental factors – Abiotic factors

(Climate & Edaphic) & Biotic factors, Environmental gradients & limiting factor.

Concept of Ecosystem & Processes: Type & Structure, Ecosystem Processes – Energy flow, food chain,

food web & ecological pyramids; Biogeochemical cycles – Hydrological cycle(water), gaseous

cycle(carbon & oxygen), sedimentary cycle(nitrogen & sulphur).

MODULE-II

Population ecology & Ecological succession:

Population ecology: Population density, natality, mortality, population age structure, population growth

curves & carrying capacity.

Ecological succession: Characteristics, types (Hydrosere & Xerosere) & Process.

Environmental Pollution: Water pollution, Noise pollution, Air pollution(source, effect, control

measure), Depletion of ozone layer – cause, effect & control measure, Green House Effects & Global

warming, Acid rain, Biological concentration and biomagnifications, Sewage & sewage treatment.

MODULE-III

Conservation of natural resources: Natural resources – renewable, non-renewable, abstract resources,

Biodiversity & its conservation, wild wife conservation, pollution control board, Environmental

awareness & mass education.

Text Books:

1. Text book of Environmental studies by A.K.Panigrahy & A.Sahu, Sadagrantha Mandir

Publishing, Berhampur.

Reference Books:

1. Fundamentals of Ecology by E.P.Odum

2. Environmental Engineering by G.Kiely

3. Fundamentals of Environmental studies by N.K.Tripathy

4. Environmental Biology by P.D.Sharma

5. Ecology & Environment by P.D.Sharma

6. Principles of Environmental Engineering & Science by Davis & Masten

7. Principles of Environmental Science by Cunningham.

MSTL1201-COMPUTER ORGANIZATION AND SYSTEM

ARCHITECTURE LAB (0-0-3)

1. Study of various components of PC.

2. Detail Study of Keyboard and Mouse.

3. Study Anatomy of SMPS

4. Study Anatomy of Motherboard.

5. Some experiments using CPU trainer kits

6. Some experiments using printer trainer kits

7. Dismantling and assembling a PC.

8. Study Anatomy of BIOS

9. Simulation of multiplication algorithm using C / MATLAB

10. Simulation of simple fundamental units like half adder, full adder, multiplexer, de multiplexer,

Arithmetic logic Unit, Simple processor (CPU) etc using VHDL code.

MSTL1202-DATA STRUCTURE USING ‘C’ LAB (0-0-3)

1. Write a Program to Traverse an Array.

2. Write a Program to Insert and delete an Item into an Array.

3. Write a program to search an element using sequential search.

4. Write a program to search an element using binary search.

5. Write a program to implement stack operation using array.

6. Write a program to convert an infix to postfix notation using stack.

7. Write a program for stack implementation using linked list.

8. Write a program to implement queue operation using array.

9. Write a program to implement circular queue operation using array.

10. Write a program for queue implementation using linked list.

11. Write a program to implement link list (creation, insertion, deletion).

12. Write a program to implement circular link list (creation, insertion).

13. Write a program to implement double link list (creation, insertion).

14. Write a program to construct binary tree.

15. Write a program to traverse (in order, preorder, post order any one .

16. Write a program to sort N number of elements using bubble sort.

17. Write a program to sort N number of elements using quick sort.

18. Write a program to sort N number of elements using merge sort.

19. Write a program to sort N number of elements using selection Sort.

20. Write a program to sort N number of elements using insertion Sort.

MSEL1201 COMMUNICATIVE PRACTICE LAB-I (0-0-3)

LISTENING SKILLS

Listening for information

a) The students can listen to a given speech in normal speed (150/200 words per min) and locate

important points and arrange them in logical order.

b) While listening to a speech given in normal speed the student can fill up blanks, spaces, flow charts

and can take notes.

SPEAKING SKILLS

Conversation Situations and Role Plays:

Introductions, greetings, giving directions, appointments, seeking permissions, requesting for information,

asking for help and similar kind of activities.

READING SKILLS

The student can read a scientific passage for moderate length (300-400 words) for the purpose of

skimming, scanning, note making and vocabulary building.

WRITING SKILLS

a) Paragraph construction

From general - specific, data - comment, problem- solution, process-description

b) Précis writing and summarization

c) Official notices and business letters