SYLLABUS FOR UNDERGRADUATE

PROGRAMME IN IST
(Bachelor of Science (B.Sc.) Examination)

UNDER
CHOICE BASED CREDIT SYSTEM (CBCS)
with
Learning Based Outcomes

2019-2020

Department of IST
Ravenshaw University
Cuttack-753003

1
About the Department
In the year 2002, the second year of the third millennium, when the culture of the self-
financing programs was budding in Academic Institutions, Ravenshaw University the then
Ravenshaw College thought of initiating a program as part of its core curriculum which will
not only provide up-to-date course on Information Technology along with
Telecommunication Sciences but also prepare its students to articulate with the industries,
corporate houses and the society at large. To fulfil this mission the Department of IST came
into existence. Since then it is engaged with a state-of-the-art Centre of Excellence in the
noble task of raising the standard of the students to global levels and making them
employable. The department offers a UG Program in IST with an intake capacity of 64 which
is a unique blend of Computer Science, Information Technology, Electronics Science, and
Telecommunication. Ample of eligible Bachelors in Information Science and Electronics are
being produced by the department to contribute enormously in industries and corporate
sectors. Placement is one of the advantages that Department of IST has since its inception in
2002. It has an impeccable record in campus placement. It has always been much favoured
Talent-hunting Ground for corporate world as it delivers industry-ready students. Most
employers seek graduates having prior experiences and skills in a given field. Immersive
internships in the field of study are essential to successful outcomes after graduation.
Students therefore take up internships in various organizations like ORSAC, AIR, BSNL,
CTTC, CDAC, CEPET, etc. to gain hands on experience of the professional world. As a
result of which many organisations like TCS, Deloitte, Wipro, VOIS, Cognizant, Infosys,
Capgemini, ICICI, Accenture, etc. volunteer themselves to provide the opportunity for the
students in the Ravenshaw Campus itself to get selected in their corporate houses. In the
current academic session (2021-22), 70 out of 120 have been selected to be absorbed in these
organisations. The percentage of this record has been consistently maintained by the
department since its commencement. One of the many notable features of the department is
its Academic Excellence through which the department conquers frequently the University
Gold Medal, which is being awarded to the Toppers in Professional Courses like IST, ITM,
JMC, BBA, etc. The IST Alumni are very well-placed not only in India but also in abroad.
Countries like UK, Oman, USA, etc. have given them opportunities to work in their countries
as Software Professionals. For further information please click here

1
 B.A. in IST under Choice based Credit System (CBCS)
with Learning Based Outcomes
About the Programme
B.Sc. in IST under the Choice Based Credit System (CBCS) with Learning
Outcomes based Curriculum Framework (LOCF) aims at offering a general framework
within which IST teaching may be organized. It serves twin goals of responding to the needs
of students to grow as competent, self-reflective learners with relevant academic and
professional skills and to prepare them as contributors to the growing discipline. This
framework is intended to help maintaining the standards of teaching, its periodic review
against graduate attributes, qualification descriptors, program learning outcomes and course
level learning outcomes. It is viewed in the spirit of innovation in teaching-learning process
and adopted according to local conditions, regional priorities, national and global needs along
with the availability of the expertise.

Looking at the diversity and complexity of the subject and diversified students’
background along with subject dynamism, the curriculum is developed considering various
aspects such as:-

 Entry level expectations of students coming from various Board of examination

(CBSE/ICSE/CHSE/State Boards) and their socio-economic background
 General expectations from a three year undergraduate honours training.
 The changing profile of undergraduate students

Keeping the above aspect in mind the proposed learning objectives and outcomes have been
adapted to the local, regional and linguistic diversities with the changing academic scenario
and conditions. Further, the learning objectives and outcomes have been framed with a
projected scope on the basis of the extent of academic facilities available (e.g. availability of
faculty and their expertise, resources and opportunities for field training).

Graduate Attributes in IST

Graduates Attributes (GAs) form a set of individually assessable outcomes that are the
components indicative of the graduate’s potential to acquire competence to practice at the
appropriate level. The Graduate Attributes of B.Sc (Honours) IST are listed below:

 Scholarship of Knowledge: Acquire in-depth knowledge of specific discipline or

professional area, including wider and global perspective, with an ability to

2
 discriminate, evaluate, analyze and synthesize existing and new knowledge, and
integration of the same for enhancement of knowledge.
 Critical Thinking: Analyze complex scientific/technological problems critically;
apply independent judgment for synthesizing information to make intellectual and/or
creative advances for conducting research in a wider theoretical, practical and policy
context.
 Problem Solving: Think laterally and originally, conceptualize and solve
scientific/technological problems, evaluate a wide range of potential solutions for
those problems and arrive at feasible, optimal solutions after considering public health
and safety, cultural, societal and environmental factors in the core areas of expertise.
 Usage of modern tools: Create, select, learn and apply appropriate techniques,
resources, and modern engineering and IT tools, including prediction and modelling,
to complex scientific/technological activities with an understanding of the limitations.
 Collaborative and Multidisciplinary work: Possess knowledge and understanding of
group dynamics, recognize opportunities and contribute positively to collaborative
multidisciplinary scientific research, demonstrate a capacity for self-management and
teamwork, decision-making based on open-mindedness, objectivity and rational
analysis in order to achieve common goals and further the learning of themselves as
well as others.
 Communication: Communicate with the scientific/technological community, and
with society at large, regarding complex scientific/technological activities confidently
and effectively, such as, being able to comprehend and write effective reports and
design documentation by adhering to appropriate standards, make effective
presentations, and give and receive clear instructions.
 Life-long Learning: Recognize the need for, and have the preparation and ability to
engage in life-long learning independently, with a high level of enthusiasm and
commitment to improve knowledge and competence continuously.
 Ethical Practices and Social Responsibility: Acquire professional and intellectual
integrity, professional code of conduct, ethics of research and scholarship,
consideration of the impact of research outcomes on professional practices and an
understanding of responsibility to contribute to the community for sustainable
development of society.

3
Qualification Descriptors for a Bachelor’s Degree Program in IST
A qualification descriptor indicates the generic outcomes and attributes expected for the
award of a particular type of qualification. The learning experiences and assessment
procedures are expected to be designed to provide every student with the opportunity to
achieve the intended programme learning outcomes. The qualification descriptors reflect
followings:

1. Disciplinary knowledge and understanding

2. Skills & Ability
3. Global competencies that all students in different academic fields of study should
acquire/attain and demonstrate.

Knowledge & Understanding:

 Demonstrate extensive knowledge of the disciplinary foundation in the various areas

of Electronics, as well as insight into contemporary research and development.
 Demonstrate specialized methodological knowledge in the specialized areas of
Electronics about professional literature, statistical principles and reviewing scientific
work.

Skills & Ability:

 Demonstrate ability to apply electronics knowledge & experimental skills critically

and systematically for assessment and solution of complex electronics problems and
issues related to communication systems, embedded systems, computers networks,
robotics, VLSI Design and fabrication and other specialized areas of electronics.
 Demonstrate ability to model, simulate and evaluate the phenomenon and systems in
the advanced areas of electronics.
 Demonstrate ability to apply one’s electronics knowledge, experimental skills,
scientific methods & advanced design, simulation and validation tools to identify and
analyze complex real life problems and frame technological solutions for them.
 Demonstrate ability to design and develop industrial products, processes and
electronics systems while taking into account the circumstances and needs of
individuals, organizations and society with focus on economical, social and
environmental aspects.

4
Competence:

 Communicate his or her conclusions, knowledge & arguments effectively and

professionally both in writing and by means of presentation to different audiences in
both national and international context.
 Ability to work in collaborative manner with others in a team, contributions to the
management, planning and implementations.
 Ability to independently propose research/developmental projects, plan its
implementation, undertake its development, evaluate its outcomes and report its
results in proper manner.
 Ability to identify the personal need for further knowledge relating to the current and
emerging areas of study by engaging in lifelong learning in practices.

Programme Outcomes of B.Sc. Programme

The programme outcomes and attributes are attained by the graduate students of
Ravenshaw University through learning acquired on completion of a programme of study.
Individual programmes of study has a defined programme specific learning outcomes which
needs to be attained for the award of a specific degree. The programme learning outcomes of
Ravenshaw University focus on various aspects of knowledge and skills that prepare students
for further study, employment, and citizenship. Therefore, the UG programme of the
Ravenshaw University has been designed with the objective to develop in-depth knowledge
of students in frontier areas of concerned subject and seeks to achieve the following:

PO1: Critical Thinking: Students will have the capability to apply analytic thought to a
body of knowledge; analyse and evaluate evidence, arguments, claims, and beliefs on the
basis of empirical evidence; identify relevant assumptions or implications; formulate coherent
arguments; critically evaluate practices, policies and theories by following scientific approach
to knowledge development

PO2: Effective Communication: Students will acquire the ability to express thoughts and
ideas effectively in writing and orally in English and regional and make meaningful
interpretation by people, ideas, books, media and technology.

PO3: Social Interaction: Elicit views of others, mediate disagreements and help reach
conclusions in group settings.

5
PO4: Effective Citizenship: Demonstrate empathetic social concern and equity centred
national development, and the ability to act with an informed awareness of issues and
participate in civic life through volunteering.

PO5: Values and Ethics: Recognize different value systems including own, understand the
moral dimensions of different decisions, and accept responsibility for them.

PO6: Environment and Sustainability: Understand the issues of environmental contexts

and sustainable development.

PO7: Self-directed and Life-long Learning: Acquire the ability to engage in independent
and life-long learning in the broadest context of socio-technological changes

Programme Specific Learning Outcome

The following program outcomes have been identified for B.Sc (HONOURS) IST.

PSO1: Ability to apply knowledge of mathematics & science in solving electronics related
problems

PSO2: Ability to design and conduct electronics experiments, as well as to analyze and
interpret data

PSO3: Ability to design and manage electronic systems or processes that conforms to a given
specification within ethical and economic constraints

PSO4: Ability to identify, formulate, solve and analyze the problems in various disciplines of
electronics.

PSO5: Ability to function as a member of a multidisciplinary team with sense of ethics,

integrity and social responsibility

PSO6: Ability to communicate effectively in term of oral and written communication skills

PSO7: Recognize the need for, and be able to engage in lifelong learning.

PSO8: Ability to use techniques, skills and modern technological/scientific/engineering

software/tools for professional practices

6
 Mapping Course with Programme specific Outcome (PSO) IST
Programme Specific Outcomes
Course Programme Outcomes (POs)
Course Name (PSOs)
Code
1 2 3 4 5 6 7 1 2 3 4 5 6 7 8
Basic Circuit Theory and √ √ √ √ √ √ √ √ √ √ √
C-I
Network Analysis
C-II Programming in C √ √ √ √ √ √ √ √ √ √ √

GE-I Mathematics I √ √ √ √ √ √ √ √ √ √ √

C-III Electronics Circuit √ √ √ √ √ √ √ √ √ √ √ √

C-IV Data Structure using C √ √ √ √ √ √ √ √ √ √ √

GE-II Mathematics II √ √ √ √ √ √ √ √ √ √ √

C-V Digital Electronics √ √ √ √ √ √ √ √ √ √ √ √ √ √

C-VI Computer Networks √ √ √ √ √ √ √ √ √ √ √ √ √ √

C-VII Programming in Java √ √ √ √ √ √ √ √ √ √ √ √ √

GE-III Mathematics III √ √ √ √ √ √ √ √ √ √ √

Micro processors and √ √ √ √ √ √ √ √ √ √ √
C-VIII
Microcontrollers
Operational Amplifier and √ √ √ √ √ √ √ √ √ √ √
C-IX
Application
C-X Operating Systems √ √ √ √ √ √ √ √ √ √ √

GE-IV Mathematics IV √ √ √ √ √ √ √ √ √ √ √

C-XI Communication Electronics √ √ √ √ √ √ √ √ √ √ √ √ √ √

Data Base Management √ √ √ √ √ √ √ √ √ √ √
C-XII
Systems
DSE-I Data Science √ √ √ √ √ √ √ √ √ √ √ √ √

DSE-II Software Engineering √ √ √ √ √ √ √ √ √ √ √

C-XIII Signals and Systems √ √ √ √ √ √ √ √ √ √ √ √ √ √ √

C-XIV Programming in Python √ √ √ √ √ √ √ √ √ √ √ √

DSE-III Communication Systems √ √ √ √ √ √ √ √ √ √ √ √ √

DSE-IV Project Work √ √ √ √ √ √ √ √ √ √ √ √ √ √

Software Project Management √ √ √ √ √ √ √ √ √ √ √ √
(VA-I)
VA Maple Programming (VA II) √ √ √ √ √ √ √ √ √ √ √ √
Digital design with VHDL (VA √ √ √ √ √ √ √ √ √ √ √ √
III)
AO Web Designing (AO) √ √ √ √ √ √ √ √ √ √ √ √

7
Teaching Learning Process
Teaching and learning is a continuous process which is surrounded by students’
attitude to learn & share the knowledge, academic curiosity, reading & practicing, creativity,
thinking ability and extending knowledge levels. Therefore, the teaching learning process of
the programme focus on learner-centric pedagogies, and
interactive and participatory pedagogies. Planning for teaching constitute a critical
dimension. The teaching and learning process revolves around a well-structured and
sequenced acquisition of knowledge and skills.

Teaching and learning under this programme involves classroom lectures as well
tutorials. The tutorials allow a closer interaction between the students and the teacher
as each student gets individual attention. For a visual and better learning outcomes instructors
would use ICT facilities, e-learning platforms and other innovative e-content platforms for
student-centric learning methods. As part of participative teaching-learning practices few
courses include seminars, presentations and group discussions. To cater the needs of slow and
advance learners, special, remedial and peer teaching classes will be encouraged. Apart from
these, exposure visits, special lectures by invited experts, workshops, and
National/International seminars are to be held to augment knowledge, encourage innovative
ideas and expose the students to global academic and research advancement. There is also the
provision of mentor- mentee for each class where the mentor can keep track of each student’s
progress and address her/his individual difficulties. For the experiential learning course on
project work is offered (i.e. short-term projects, research projects, assignments and field
works), which is the integral components of the programme that enable the students to solve
practical problems. The provision of written assignments and projects submitted by students
as part of the course, are also to be discussed in special classes. All the courses under this
programme have a laboratory component of minimum weightage 25% that meant to enhance
the practical and research skills including an appreciation of the link between theory and
experiment. For each course students will be assigned regular home assignments and will be
tested periodically through quizzes and class tests to ensure that they have properly learnt the
course material.

Assessment Methods / Evaluation Scheme

Assessment methods and evaluation schemes will be as per the Ravenshaw University
Examination Rules and Regulation. Each Core, discipline specific electives (DSE) and
Generic Electives (GE) papers will have maximum 100 marks with 6 credits whereas Ability

8
Enhancement (AECC) and Skill Enhancement Courses (SEC) will have maximum 50 marks
with 4 credits. The value added and add on courses if any will have maximum 50 marks with
2 credits. The distribution of marks for assessment and evaluation is follows:

For 100 Marks Paper

I. 15 marks will be assessed and evaluated by internal assessment

II. 25 Marks will be assessed and evaluated by practical/laboratory experiments
III. 60 marks will be assessed and evaluated by end term examination

For 50 Marks Paper

I. 10 marks will be assessed and evaluated by internal assessment

II. 40 marks will be assessed and evaluated by end term examination

The internal assessment and evaluation may be done through a continuous process having
assignments, class test, review works, writing of term papers, quiz or examination or lab-
experiments.

Practical Test will be conducted through submission of practical records/laboratory

experiments/specimen identification and evaluated by internal/external examiners.

The end term examination will be based on written examination for theory paper and the
question will be set following Bloom’s taxonomy which will cover the entire syllabus of the
course. For the research project paper, the student will submit the project write up and
defend his/her project through presentation/Viva-Voce as per the University rule.

9
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

COURSE STRUCTURE OF UG IST HONOURS UNDER CBCS

Semester Course code Course Name Credits Total Marks
Basic Circuit Theory and Network Analysis
C-1 6 100
(Theory+Practical)
C-2 Programming in C (Theory+Practical) 6 100
GE-1 Mathematics I (Theory+Practical) 6 100
I
AECC-1 Environmental Studies 4 100
EV-1 (Ethics
Issues related to Women 1 25
and Values)
Total 23 425
C-3 Electronics Circuit (Theory+Practical) 6 100
C-4 Data Structure using C (Theory+Practical) 6 100
GE-2 Mathematics II (Theory+Practical) 6 100
II AECC-2 MIL(Odia/Hindi/Alt.English) 4 100
EV-2 (Ethics
Values and Good Citizenship 1 25
and Values)
Total 23 425
C-5 Digital Electronics (Theory+Practical) 6 100
C-6 Computer Networks (Theory+Practical) 6 100
C-7 Programming in Java (Theory+Practical) 6 100
GE-3 Mathematics III (Theory+Practical) 6 100
III
SEC-1 Communicative English 4 100
EV-3 (Ethics
Issues of Drug, Tobacco and Achol Addiction 1 25
and Values)
Total 29 525
Micro processors and Microcontrollers
C-8 6 100
(Theory+Practical)
Operational Amplifier and Application
C-9 6 100
(Theory+Practical)
C-10 Operating Systems (Theory+Practical) 6 100
IV GE-4 Mathematics IV (Theory+Practical) 6 100
Students will choose a paper from a group of 4 100
SEC II* papers offered by university/department.
EV-4 (Ethics
Ethical Values for students life 1 25
and Values)
Total 29 525
C-11 Communication Electronics (Theory+Practical) 6 100
Data Base Management Systems
C-12 6 100
(Theory+Practical)
DSE-1 Data Science (Theory+Practical) 6 100
V
DSE-2 Software Engineering 6 100
EV-5 (Ethics Vulnerable section of society: Understanding
1 25
and Values) their issues
Total 25 425
10
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

COURSE STRUCTURE OF UG IST HONOURS UNDER CBCS

Semester Course code Course Name Credits Total Marks
C-13 Signals and Systems (Theory+Practical) 6 100
C-14 Programming in Python (Theory+Practical) 6 100
DSE-3 Communication Systems (Theory+Practical) 6 100
VI
DSE-4 Project Work 6 100
EV-6 (Ethics
Environmental and Techno Ethics 1 25
and Values)
Total 25 425

Value Added and Add On Courses offered beyond the prescribed syllabus
Total Contact
Semester Course Code Course name Credits
Marks Hours
Any VA- I Software Project Management 2 50 30
Semester VA-II Maple Programming 2 50 30

Any AO-I Digital design with VHDL (VA III) 2 50 30

Semester AO-II Web Designing (AO) 2 50 30
Note: * Following SECC papers may be
Sl. Offered by the University
1 Modern Office Management
2 Leadership and Personality Development
3 Financial Literacy and Banking
4 Data Analysis and Computer Application
5 Quantitative Aptitude & Logical Reasoning

11
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Core Paper-I
BASIC CIRCUIT THEORY AND NETWORK ANALYSIS
Credits: (4) Full Marks:75 [Mid Term:15 + End Term 60]
Course Objectives
1. To make the students capable of analyzing any given electrical network.
2. To develop an understanding of the fundamental laws and elements of electrical circuits.
3. To learn the energy properties of electric elements and the techniques to measure voltage and
current.

Course Outcomes
CO1. Student will be able to understand the basic circuital law and simplify the network using
reduction techniques.
CO2. Student will analyze the circuit using Kirchhoff‘s law and Network simplification
theorems.
CO3. Student will be able to evaluate transient response, steady state response, network
functions. Student will demonstrate about two-port network parameters.
CO4. Student will able to analyse the complex power, in terms of real and reactive components,
in single-phase sinusoidal, steady-state systems.
CO5. Student will understand the electric circuit theorems which are always beneficial to help
find voltage and currents in multi-loop circuits
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 RLCCircuits, Quality(Q) Factor and Bandwidth.
Unit –IV
DC TransientAnalysis: 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:
12
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Impedance (Z) Parameters, Admittance (Y) Parameters, and

Transmission(ABCD)Parameters.
Text Books:
1. NetworkTheory–PKSatpathy, PKabisatpathy,SPGhoshandAKChakraborty–
2. TataMcGrawHill,NewDelhi.
3. CircuitTheory, AKChakraborty
4. S.A.Nasar,ElectricCircuits,Schaum‘soutlineseries,TataMcGrawHill(2004)
5. Electrical Circuits, M. Nahvi and J. Edminister, Schaum‘s Outline Series, Tata
McGrawHill.(2005)

PRACTICALS
Credit-( 2) Full Mark-25

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‘sTheorem.
9. Verification of Thevenin‘s Theorem.
10. VerificationofSuperpositionTheorem.
11. RC Circuits: Time Constant of Differentiator.
12. RC Circuits: Time Constant of Integrator.

13
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Core Paper -2
C-2-Programming in C
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. To learn and understand C programming basics and paradigm like
looping, control statements, string handling, etc.
2. To acquire store knowledge, process knowledge, and communicate
knowledge with the outside world.

Course Outcomes
CO1. Student will able understand a program to solve a real-world
problem.
CO2. Student will able to analyze file connectivity in C programming
language.
CO3. Student will manage to handle industry oriented projects.
CO4. Student will manage develop and maintain problem-solving skills.
CO5. Student will describe the sequence of the program and give logical
outputs.
CO6. Student will implement strings in a C program..
CO7. Student will analyze how to store different data types in the same
memory. Manage I/O operations in your C program

THEORY ( Full Mark -75)

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.

14
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

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
StructureandUnion: 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

PRACTICALS
Credit-( 2) Full Mark-25

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
15
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

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.

Generic Elective
GE-1-Mathematics I
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]

Course Objectives
1. To introduce the concepts of Integers and application of number theory
and the concepts of differential equation, different methods for solving
system simultaneous equation and concepts of Linear programming
problem and its uses and application.

Course Outcomes

CO1. Students will able to learn how to write and understand basic proofs.
CO2. Student will able to analyze and develop problem-solving skills.
CO3. Student will able to solve the ordinary differential equations applications in real life
CO4. Student will able to communicate mathematical ideas with others
CO5. Student will able to analyze the experience using technology to address mathematical
ideas
CO6. Student will able to develop mathematical problem solving skills.
THEORY
UNIT-I

16
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

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
Credit-( 2) Full Mark-25
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.
17
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Ability Enhancement Compulsory Course

AECC-1-Environmental Studies
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. To make students aware about environment and various issues related to it.
2. The course will provide brief introduction of various topic as pollution, ,
environment, Natural Resources and Environmental Laws, etc..

Course Outcomes
CO1. Student will analyze the eco-system and need to protect it.
CO2. Student will understand various dangers to environment and how to protect it.
CO3. Student will apply appreciate concepts and methods from ecological and physical
sciences and their application in environmental problem solving.
CO4. Student will select the ethical, cross-cultural, and historical context of environmental
issues and the links between human and natural systems.
CO5. Student will use the Studies in the review demonstrated that environmental education
has led to a number of positive impacts, from improving academic performance.
CO6. Student will predict the enhancing critical thinking skills, to developing personal
growth and life-building skills including confidence, autonomy, and leadership.

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
18
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Core paper-3
C-3-Electronics Circuit
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. To study the Voltage and Current Characteristics of Diodes and the Voltage
and Current Characteristics of Bipolar Junction Transistors (BJT).
2. To study the two port network analysis and determine the hybrid,
impedance, admittance parameters and the construction details and
characteristics of Field Effect Transistor (FET).
3. To know the function of Cathode ray oscilloscope (CRO).

Course Outcomes

CO1. Student will develop determine forward resistance and reverse resistance of diodes using Voltage
and Current characteristics.
CO2. Student will classify and verify the input and output characteristics of Bipolar Junction Transistors
(BJT).
CO3. Student will Construct circuit and verify the characteristics of Field Effect Transistor (FET
CO4. Student will determine the voltage and time period of AC current using CRO.
CO5. Student will compare the two port network analysis and determine the hybrid, impedance,
admittance parameters
CO6. Student will define the construction details and characteristics of Field Effect Transistor (FET).

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

19
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

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
Credit-( 2) Full Mark-25

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.

20
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Core Course-4
C-4-Data Structure using C
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. To understand the fundamentals of data structures and data representations.
2. To study the representation, implementation and applications of linear and
nonlinear data structures.

Course Outcomes
CO1. Student will select the appropriate data structure for modeling a given problem.
CO2. Student will understand and implement various data structures along with their application
CO3. Student will explain the ability to program data structures and use them in implementations of
abstract data types.
CO4. Student will describe the novel solutions to small scale programming challenges involving data
structures and and recursion. Understanding of basic algorithmic complexity.
CO5. Student will able to define the fundamentals of data structures and data representations.
CO6. Student will manage to study the representation, implementation and applications of linear and
nonlinear data structures.

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.
21
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

2. Sastry C.V., Nayak R, Ch. Rajaramesh, Data Structure & Algorithms, I. K.

International Publishing House Pvt. Ltd, New Delhi..
PRACTICALS
Credit-( 2) Full Mark-25

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.

22
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Generic Elective-2
GE-2–Mathematics-II
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. To introduce the design and analysis of techniques to give
approximate but accurate solutions to hard problems, the variety of
which is suggested method.
2. To introduce the design and analysis of techniques to give
approximate but accurate solutions to hard problems.

Course Outcomes
CO1. Student will demonstrate numerical methods for various mathematical operations and tasks,
such as interpolation, differentiation, integration, the solution of linear and nonlinear
equations, and the solution of differential equations.
CO2. Student will analyse and evaluate the accuracy of common numerical methods.
CO3. Student will explain to predict the anomalies which are not possible in the analytical methods
CO4. Student will Understand it‘s use for forecasting and predicting in the field of machine
learning.
CO5. Student will predict the design and analysis of techniques to give approximate but accurate
solutions to hard problems.
CO6. Student will Compare the numerical method with other mathematical method

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)

23
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Reference books
1. Numerical Analysis: J. K. Mantri & S. Prahan, Laxmi Publication..
2. Introduction to Numerical Analysis, Josef Stoer and Roland Bulirsch, Springer.
PRACTICALS
Credit-( 2) Full Mark-25
(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‘s1/3rd Rule and
(12) Simpson‘s 3/8th Rule

24
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

SEMESTER-II
Ability Enhancement Compulsory Course
AECC-2 M.I.L(ODIA/ALT.ENGLISH/HINDI)
(4 Credits) Full Marks:100 [Mid Term:20 Marks + End Term:80 Marks]

25
UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

26
UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

27
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Core Course-5
C-5-Digital Electronics
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. Understanding the basics of Digital Electronics and different number
systems and conversion between them.
2. Design and construction of the basic and universal logic gates.
3. Studying the Boolean algebra and simplification of Boolean expression
using different methods.
4. Study and construction of sequential logic circuits, understanding various
design of flip flops.

Course Outcomes
CO1. Student will compare between different types of number systems, and their
conversions.
CO2. Student will design various logic gates and simplify Boolean equations.
CO3. Student will construct various flip flops, shift registers and determining outputs.
CO4. Student will design different types of MOD counters.
CO5. Student will solve the Boolean algebra and simplification of Boolean expression
using different methods.
CO6. Student will use different method for arithmetic operation upon large Boolean
expression.

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.

28
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

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
Credit-( 2) Full Mark-25
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).

29
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

CoreCourse-6
C-6-Computer Networks
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. To develop an understanding of computer networking basics and an
understanding of different components of computer networks, various
protocols, modern technologies and their applications.

Course Outcomes
CO1. Student will describe the basis and structure of an abstract layered protocol
model.
CO2. Student will Independently understand basic computer network technology.
CO3. Student will Identify the different types of network topologies and
protocols.
CO4. Student will enumerate the layers of the OSI model and TCP/IP and explain
the function(s) of each layer.
CO5. Student will develop an understanding of computer networking basics and
an understanding of different components of computer networks
CO6. Student will explain various protocols, modern technologies and their
applications.

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

30
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

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.

PRACTICALS
Credit-( 2) Full Mark-25

1. Simulate Even Parity generator and checker.

2. Simulate two dimensional Parity generator and checker.
3. Simulate check sum generator and checker.
4. Simulate Hamming code method.
5. Simulate Cyclic Redundancy Check (CRC) error detection algorithm for noisy channel.
6. Simulate and implements top and wait protocol for noisy channel.
7. Simulate and implement go back and sliding window protocol.
8. Simulate and implement selective repeat sliding window protocol.
9. Simulate and implement distance vector routing algorithm.

31
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Core Course-7
C-7 –Programming in Java
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. To understand the basic concepts and fundamentals of platform independent
object oriented language and streams and efficient user
2. To demonstrate skills in writing programs using exception handling
techniques and multithreading and also to understand

Course Outcomes
CO1. Student will use the syntax and semantics of java programming language and basic concepts of
OOP.
CO2. Student will develop reusable programs using the concepts of inheritance, polymorphism, interfaces
and packages
CO3. Student will apply the concepts of Multithreading and Exception handling to develop efficient and
error free codes.
CO4. Student will understanding different web programming concept like applet programming.
CO5. Student will able to understand the basic concepts and fundamentals of platform independent object
oriented language
CO6. Student will able to demonstrate skills in writing programs using exception handling techniques and
multithreading and also to understand streams and efficient user

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, AutoBoxing,
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 String Builder 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..
32
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

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.

PRACTICALS
Credit-( 2) Full Mark-25

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.
12. Write a program to demonstrate the concept of boxing and unboxing.
13. 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).
14. 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.
15. Write a program that creates illustrates different levels of protection in classes/subclasses belonging to same
package or different packages
16. 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.
17. Write a program to show the use of nested try statements that emphasizes the sequence of checking for catch
handler statements.
18. 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)..
19. Write a program to demonstrate priorities among multiple threads..
33
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Write a program to demonstrate different mouse handling events like mouse Clicked( ), mouse Entered( ),
mouse Exited( ), mouse Pressed( ), mouse Released( ) & mouse Dragged( )..
20. Write a program to demonstrate different keyboard handling events.

Generic Elective
GE-3–Mathematics III
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]

Course Objectives
1. To introduce the design and analysis of techniques to give approximate but
accurate solutions to hard problems, the variety of which is suggested by the
method.
2. Advanced numerical methods are essential in making numerical weather
prediction feasible
Course Outcomes
CO1. Student will derive statistical methods for various mathematical operations and tasks, such as
interpolation, differentiation, integration, the solution of linear and nonlinear equations, and the
solution of differential equations.
CO2. Student will analyse and evaluate the accuracy of common statistical method methods.
CO3. Student will Understand to predict the anomalies which are not possible in the Statistical methods
CO4. Student will explain it‘s use for forecasting and predicting in the field of machine learning.
CO5. Student will compare different Probability distribution method.
CO6. Student will explain advanced numerical methods are essential in making numerical weather
prediction feasible.

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

34
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

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
Credit-( 2) Full Mark-25

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

35
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Skill Enhancement Compulsory Course

SEC-1–Communicative English
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]

Course Objectives
1. The purpose of this course is to introduce students to the theory, fundamentals and tools of
communication and to develop in them vital communication skills which should be integral to personal,
social and professional interactions.
Course Outcomes
CO1. Upon successful completion of this course, the student will be able to find a difference in their personal
and professional interactions.

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.

TextBook:
Enriching Linguistic Knowledge & Communication Proficiency

ODISHA STATE HIGHER EDUCATION COUNCIL, BHUBANESWAR

36
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

CoreCourse-C8
C-8-Microprocessors and Microcontrollers
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. To introduce students with the architecture and operation of typical
microprocessors and microcontrollers.
2. To familiarize the students with the programming and interfacing of
microprocessors and microcontrollers
3. To provide strong foundation for designing real world applications using
microprocessors and microcontrollers.
Course Outcomes
CO1. Student will assess and solve basic binary math operations using the
microprocessor and explain the microprocessor‘s and Microcontroller‘s
internal architecture and its operation within the area of manufacturing and
performance.
CO2. Student will apply knowledge and demonstrate programming proficiency
using the various addressing modes and data transfer instructions of the
target microprocessor and microcontroller.
CO3. Student will compare accepted standards and guidelines to select
appropriate Microprocessor (8085 & 8086) and Microcontroller to meet
specified performance requirements.
CO4. Student will design electrical circuitry to the Microprocessor I/O ports in
order to interface the processor to external devices.
CO5. Student will familiarize the students with the programming and interfacing
of microprocessors and microcontrollers
CO6. Student will explain the designing real world applications using
microprocessors and microcontrollers.
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

37
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

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 Gillispie Mazidi, Rolin D. M.C. Kinlay
―The 8051 Microcontroller and Embedded Systems‖,2nd Edition, Pearson Education 2008.
4. Advanced Microprocessor and Peripherals,2nd Edition,by Ray Bhurchandi,TMH Publications

PRACTICALS
Credit-( 2) Full Mark-25

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-bitnumbers.
4. Program to multiply two 8-bitnumbers.
5. Program to divide a 16 bit number by 8 bit number
6. Program to find1‘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.

8051MicrocontrollerProgramming:

1. Program to add two 8-bit numbers

2. Program to subtract two8-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 find1‘s and 2‘s Complement of 8-bit number.
6. Program to find smaller and larger among N numbers

38
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

SEMESTER-IV
Core Course
C-9–Operational Amplifier And Applications
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. To characterize and apply of operational amplifiers (op-amps).
2. To design and analysis of op-amp amplifiers, comparators, voltage and
current regulators, summers, integrators, and differentiators
Course Outcomes
CO1. Student will get familiarized with basic integrated circuit components, its
designing & packaging.
CO2. Student will understand various operating modes of Op-amp and its
linear/non-linear applications.
CO3. Student will design of signal generators and low and high order filters.
CO4. Student will explain and design of multi-vibrator and power supply circuits.
CO5. Student will able to characterize and apply of operational amplifiers
CO6. Student will construct and analysis of op-amp amplifiers, comparators,
voltage and current regulators.

THEORY
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 monostable multivibrator circuit, Applications of Monostable and Astable
multivibrators. Phase locked loops (PLL): Block diagram, phase detectors, IC565..
Unit-IV
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

39
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

PRACTICALS
Credit-( 2) Full Mark-25

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 IC555 as an astable multivibrator.
10. Study of IC555 as monostable multivibrator.
11. Designing of Fixed voltage power supply using IC regulators using 78 series and 79 series

40
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Core Course-
C 10-Operating Systems
Credits: (4) Full Marks-75 [Mid Term:15 + End Term 60]
Course Objectives
1. To understand the basic components of operating system, and the
interactions among the various components
2. The course will cover an introduction on the policies for scheduling,
deadlocks, memory management, synchronization, system calls, and file
systems.
Course Outcomes
CO1. Student will define, restate, discuss, and explain the policies for scheduling, deadlocks, memory
management, synchronization, system calls, and file systems.

CO2. Student will describe and extrapolate the interactions among the various components of computing
systems.

CO3. Student will design and construct the following OS components: System calls, Schedulers,
Memory management systems, Virtual Memory and Paging systems

CO4. Student will able to make Structure of file system and cpu scheduling and management

CO5. Student will understand the basic components of operating system, and the interactions among the
various components.

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 .

Textbook:
1. Operating System Concepts, Abraham Silberschatz, Peter B. Galvin, and Greg Gagne, Eighth
Edition, Wiley Student Edition 2009.

Referencebook:
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

41
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

PRACTICALS
Credit-( 2) Full Mark-25
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. ShellProgramming
(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
42
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

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

43
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Generic Elective
GE-4–Mathematics-IV
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. To The course objective is to provide students with an overview of
discrete mathematics.
2. To learn about topics such as logic and proofs, sets and functions,
probability, recursion, graph theory, matrices, Boolean algebra and
other important discrete math concepts.

Course Outcomes
CO1. Students will Formalize statements by using propositional logic.
CO2. Students will determine the main connective of a formula and obtain its structural tree.
CO3. Students will compute functions defined by using the structural recursive principle
CO4. Students will Compute the truth value of a given formula for a given valuation
CO5. Be able to analyze and understand middle-level proofs.
CO6. Students will to learn about topics such as logic and proofs, sets and functions, probability,
recursion, graph theory, matrices.
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 OrderRelation

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
BooleanAlgebra: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
44
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

2. C.L. Liu, D.P. Mohapatra, Elements of Discrete Mathematics, 2ndEdition, Tata McGraw
Hill,1985,

PRACTICALS
Credit-( 2) Full Mark-25
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 DeMorgan‘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.

45
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

SEMESTER-IV
Skill Enhancement Compulsory Course
SEC-2 Quantitative Aptitude & Logical Reasoning
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. To enhance the problem solving skills, to improve the basic
mathematical skills and to efficient in solving problems involving
reasoning ability.
Course Outcomes
CO1. Students will able to explain arithmetical problems of practical use.
CO2. Students will analyze with simple geometrical and statistical problems.
CO3. Students will analyze their logical reasoning abilities by solving problems related to cubes,
dices, analogy, coding-decoding, etc. and draw Ven-diagrams.
CO4. Students will determine the main connective of a formula and obtain its structural tree.
CO5. Students will compute functions defined by using the structural recursive principle

QUANTITATIVEAPTITUDE&DATAINTERPRETATION:
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
TextBook:
Quantitative Aptitude and Logical Thinking
ODISHA STATE HIGHER
EDUCATION COUNCIL
BHUBANESWAR

46
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

SEMESTER-V
Core Course C-11–Communication Electronics
Credits: (4) Full Marks : 75 [Mid Term:15 + End Term 60]
Course Objectives
1. To introduce the concepts of analogue and digital communication systems
and to equip students with various issues related to communication such as
modulation, demodulation, transmitters and receivers and noise
performance
Course Outcomes
CO1. Students will gain the knowledge of components of communication systems.
CO2. Students will analyze various methods of transmission and detection.
CO3. Students will allocate performance objectives to components of a communication system.
CO4. Students will evaluate the performance of communications in the presence of noise.
CO5. Students will able to understand the concepts of analogue and digital communication systems
CO6. Students will able to explain various issues related to communication such as modulation,
demodulation, transmitters and receivers and noise performance.
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
47
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

2. Modern Digital and Analog Communication Systems, Bhagwan Das Pannalal Lathi, Zhi
Ding Oxford University Press,2010
3. Communication Systems, S.Haykin, Wiley India(2006)

PRACTICALS
Credit-( 2) Full Mark-25
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 DeModulation
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.

48
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

SEMESTER-V
C-12-Database Management Systems
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. The objective of the course is to present an introduction to database
management systems, with an emphasis on how to organize, maintain and
retrieve - efficiently, and effectively - information from a DBMS.
Course Outcomes
CO1. Student will describe the fundamental elements of relational database management systems.
CO2. Student will explain the basic concepts of relational data model, entity-relationship model,
relational database design, relational algebra and SQL.
CO3. Student will construct ER-models to represent simple database application scenarios.
CO4. Student will convert the ER-model to relational tables, populate relational database and formulate
SQL queries on data.
CO5. Student will Improve the database design by normalization.
CO6. Student will able to analyze different database objects used in PL/SQL.

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:
49
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

1. Fundamentals of Database Systems, 6th edition, Ramez Elmasri, Shamkant B. Navathe,

Pearson Education

ReferenceBook:
1. An Introduction to Database System, Date C. J. - Pearson Education, New Delhi - 2005

PRACTICALS
Credit-( 2) Full Mark-25

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 .

50
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

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

51
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

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

52
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

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.

53
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Discipline Specific Elective

DSE-1 Data Science
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. The objective is to explore, sort and analyze mega data from various sources
in order to take advantage of them and reach conclusions to optimize
business processes or for decision support.
Course Outcomes
CO1. Student will understand the fundamental concepts of data science.
CO2. Student will evaluate the data analysis techniques for applications handling large data.
CO3. Student will analyze the basics of R Programming.
CO4. Students will demonstrate proficiency with statistical analysis of data. Students will develop the
ability to build and assess data-based models.
CO5. Students will execute statistical analyses with professional statistical software.
CO6. Student will able to explore, sort and analyze mega data from various sources.

THEORY

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,
appliedbefore formal modeling commences, eliminating or sharpening potential hypotheses
about theworld that can be addressed by the data, common multivariate statistical techniques
used tovisualize high-dimensionaldata.

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.

54
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

PRACTICALS
Credit-( 2) Full Mark-25

1. Write a program that prints ―Hello World‖ to the screen.

2. Write a program that asks the user for a number and prints the sum of the numbers 1 to n
3. Write a program that prints a multiplication table for numbers upto12.
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 themedianageofallstudentsunder22years.
ii. Find the median age of all students.

iii. Find the mean age of all students. Find the modal age for all students.
iv. Two more students enter the class. The age of both students is 23. What is now
mean, mode and median?

55
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

SEMESTER-V
Discipline Specific Elective
DSE-2–Software Engineering
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. To introduce the students with basic principles of Software Engineering.
2. To learn the Software Engineering concepts, methodologies and best
practices
3. To train the students on Software Engineering principles and approach used
in Industry.
Course Outcomes
CO1. Students will analyse the need of Software Development.
CO2. Students will create SRS Documents.
CO3. Students will design and develop basic software.
CO4. Students will Design and perform basic software testings.
CO5. Students will have ability to identify, formulate, and solve complex engineering problems by applying
principles of engineering, science, and mathematics.
CO6. Students will analyze the software development life cycle.

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:

56
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

1. Software Engineering– Ian Sommerville, 10/Ed, Pearson.

2. Software Engineering Concepts and Practice – Ugrasen Suman, Cengage Learning India Pvt, Ltd..

SEMESTER-VI
Core Course
C-13-Signals and Systems
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]

Course Objectives
1. To understand the various types of signals, types of systems, characteristics,
operations, and sampling theorem.
2. To learn the different transform like Fourier series, Fourier Transform,
Laplace Transform and also understand their importance for signals and
systems analysis.
Course Outcomes
CO1. Students will classify signals and systems based on their properties and determine the mathematical
representations of signals and systems.
CO2. Students will analyze the spectral characteristics of signals using Fourier analysis and analyze
system properties based on impulse response and Fourier analysis
CO3. Students will apply the Laplace transform for analysis of continuous-time and discrete-time signals
and systems.
CO4. Students will make analog to digital conversion and Digital data transmission.

CO5. Students will analyze the different transform like Fourier series, Fourier Transform, Laplace
Transform
CO6. Students will explain their importance for signals and systems analysis.

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.
Fourier Transform: Aperiodic signals, Periodic signals, Properties of Continuous-time Fourier
57
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

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
Credit-( 2) Full Mark-25

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

58
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

SEMESTER-VI
Core Course
C-14–Programming in Python
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. To learn and understand Python programming basics and paradigm.
2. To learn and understand python looping, control statements and string
manipulations
3. Understand key features of the object-oriented programming language
Course Outcomes
Students will design and implement a program to solve a real-world problem.
Students will understand the object-oriented programming concepts and methodology.
Students will implement object-oriented programming concepts in Python
Students will analyze Problem solving and programming capability
Students will explain key features of the object-oriented programming language
Students will demonstrate python looping, control statements and string
Manipulations

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:
59
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

1.Python Programming for Absolute Beginners, Michael Dawson, CENGAGE Learning

PRACTICALS
Credit-( 2) Full Mark-25

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.

60
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

SEMESTER-VI
Discipline Specific Elective
DSE-3 Communication Systems
Credits: (4) Full Marks :75 [Mid Term:15 + End Term 60]
Course Objectives
1. The main objective of this course is to understand and implement the basic
analog and digital communication techniques/ circuits with the help of
theoretical and practical problem solving.
2. The basic analog and digital communication techniques which in turn are
used as the building blocks of the larger communication systems.
Course Outcomes
CO1. Students will analyze the basic working of communication system.
CO2. Students will explain basic working principles of existing and advanced communication
technologies.
CO3. Students will demonstrate process of Modulation and Demodulation.
CO4. Students will analyze types, characterization and performance parameters of transmission channels.
CO5. Students will make analog to digital conversion and Digital data transmission.
CO6. Students will able to perform multiplexing Techniques.
CO7. Students will analyze analog Modulation Techniques and their comparative analysis and
applications suitability.

THEORY

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

61
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

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. TS Rappaport, Wireless Communications, Pearson Education, India

PRACTICALS
Credit-( 2) Full Mark-25

1. To Study the three basic elements in fiber optic links:(Transmitter, Receiver, Optical fiber).
2. To setup of Fiber Optic Analog Link when used for Analog Data transmission.
3. To setup 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 setup of Time Division Multiplexing.
9. To Study the V-I characteristics of a LED.

62
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

SEMESTER-VI
Discipline Specific Elective
DSE-4 –Project Work
Credits : 6 Full Marks: 100
Course Objectives
1. To get introduced to the IT/ Electronics Project Management needs and
methodologies..
Course Outcomes
CO1. Students will understand the necessity of handling projects and management.
CO2. Students will handle industry-oriented practical projects.
CO3. Students will able to demonstrate and learn managerial skills.
CO4. Students will acquire knowledge of implementation of IT/Electronics
CO5. Students will estimate project cost and perform cost-benefit evaluation among projects
CO6. Students will Perform project scheduling, activity network analysis and risk management

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.

Value Added Course

Code: VA-1-Software Project Management
Credits : 2 Full Marks: 50
Course Objectives
1. To understand the methods used to evaluate and select projects for investment
of funds.
2. To gain knowledge on the principles and techniques of software project
management
Course Outcomes
CO1. Student will estimate project cost and perform cost-benefit evaluation among projects
CO2. Student will Perform project scheduling, activity network analysis and risk management
CO3. Student will apply schedule and cost control techniques for project monitoring including
contract management.
CO4. Student will apply quality models in software projects for maintaining software quality and
reliability.
CO5. Students will Perform project scheduling, activity network analysis and risk management
CO6. Students will estimate project cost and perform cost-benefit evaluation among projects.

THEORY

Unit:I
1. Write down the problem statement for a suggested system of relevance.
2. Do requirement analysis and develop Software Requirement Specification Sheet
(SRS) for suggested system.
3. To perform the function-oriented diagram: Data Flow Diagram (DFD) and Structured chart.

Unit:II
4. To perform the user‗s view analysis for the suggested system: Use case diagram.
5. To draw the structural view diagram for the system: Class diagram, object diagram.
63
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

6. To draw the behavioral view diagram: State-chart diagram, Activity diagram

Unit:III
7. To perform the behavioral view diagram for the suggested system: Sequence diagram,
Collaboration diagram
8. To perform the implementation view diagram: Component diagram for the system.
9. To perform the environmental view diagram: Deployment diagram for the system.

Unit:IV
10. To perform various testing using the testing tool unit testing, integration testing for a
samplecode of thesuggested system.
11. Perform Estimation of effort using FP Estimation for chosen system.
12. To Prepare time line chart/Gantt Chart/PERT Chart for selected software project.

Text Book:
1. Bob Hughes, Mike Cotterell, Rajib Mall, ―Software Project Management‖, 6th Edition, Tata
McGraw
Hill, 2017.
References:
1. Royce, ―Software Project Management‖, Pearson Education, 1999.
2. Robert K. Wysocki, Effective Software Project Management, Wiley, 2009.

64
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Value Added Course (Code: VA-2)

Maple Programming
Credits : 2 Full Marks: 50

Course Objectives
1. Understanding the MAPLE environment
2. Being able to do simple calculations using MAPLE
Course Outcomes
CO1. Student will understand the main features of the MAPLE development environment
CO2. Student will use the MAPLE GUI effectively
CO3. Student will design simple algorithms to solve problems
CO4. Student will demonstrate simple programs in MAPLE to solve scientific and
mathematical problems
CO5. Student able to explain simple calculations using MAPLE
CO6. Student able to demonstrate the MAPLE environment.
THEORY
UNIT-I
MAPLE basics: The MAPLE environment. Basic computer programming. Variables and
constants, operators and simple calculations

UNIT-II
Formulas and MAPLE Functions- Built-in Functions, User defined Functions.Computer
programming - Algorithms and structures - MAPLE scripts and functions (m-files), Simple
sequential algorithms.

UNIT-III
Control structures (if…then, loops). Vectors, Arrays – Matrices. MAPLE graphic functions,
Numerical simulations - Numerical methods and simulations - Random number generation.

UNIT-IV
Mathematical Computing with Algebraic equations. Basic Symbolic Calculus and Differential
equations.

Text Books MAPLE: A Practical Introduction to Programming and Problem Solving, 3rd
edition, Stormy Attaway, Elsevier, 2013

65
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Value Added Course

Digital Design with VHDL (VA III)
Credits:2, Full Marks: 50, Contact Hours (30 hours)
Course Objectives
1. To demonstrate the use and application of Boolean Algebra in the areas of
digital circuit reduction, expansion, and factoring.
2. To learn the IEEE Standard 1076 VHDL Hardware Description Language
Course Outcomes
CO1. Student able to explain VHDL as a programming language.
CO2. Student able to construct the combinational and sequential logic circuits using VHDL.
CO3. Student able to Design Programmable logic devices (PLDs) and Networks of Arithmetic
operations.
CO4. Student able to gain proficiency with VHDL software package and utilize software package to
solve problems on a wide range of digital logic
CO5. Student will learn the IEEE Standard 1076 VHDL Hardware Description Language
CO6. Student will demonstrate the use and application of Boolean Algebra in the areas of digital circuit
reduction, expansion, and factoring.

Unit-1
Introduction
VHDL description of combinational networks, Modeling flip-flops using VHDL, VHDL models
for a multiplexer, Compilation and simulation of VHDL code, Modeling a sequential machine,
Variables, Signals and constants, Arrays, VHDL operators, VHDL functions, VHDL
procedures, Packages and libraries, VHDL model for a counter.
Unit-2
Designing With Programmable Logic Devices
Read-only memories, Programmable logic arrays (PLAs), Programmable array logic
(PLA )Other sequential programmable logic devices (PLDs), Design of a keypad scanner.
Unit-3
Design Of Networks For Arithmetic Operations
Design of a serial adder with accumulator, State graphs for control networks, Design of a binary
multiplier, Multiplication of signed binary numbers, Design of a binary divider.
Unit-4
Digital Design with SM Charts
State machine charts, Derivation of SM charts, Realization of SM charts. Implementation of the
dice game, Alternative realization for SM charts using microprogramming, Linked state
machines.

TEXT BOOK:
‗Fundamentals of Digital Logic with VHDL Design‘, by S. Brown and Z. Vranesic, Third
edition, McGraw Hill, 2009.

66
 UG IST SYLLABUS UNDER CBCS RAVENSHAW UNIVERSITY

Add on Course (Code: AO)

Web Design
Credits:2, Full Marks: 50, Contact Hours (30 hours)

Course Objectives
1. Define the principle of Web page design
2. Define the basics in web design
3. Visualize the basic concept of HTML.
Course Outcomes
CO1. Students will develop the skill & knowledge of Web page design
CO2. Students will understand the knowhow and can function either as an entrepreneur
CO3. Student can take up jobs in the multimedia and Web site development studio and other information
technology sectors.
CO4. Students will apply intermediate and advanced web development practices.
CO5. Students will define the basics in web design
CO6. Students will explain the principle of Web page design.
Unit: I:
Web Design Principles Basic principles involved in developing a web site, Planning process,
Five Golden rules of web designing, Designing navigation bar, Page design, Home Page Layout,
Design Concept.

Unit: II:
Basics in Web Design, Brief History of Internet, what is World Wide Web, Why create a web
site, Web Standards, Audience requirement, what is HTML, HTML Documents, Basic structure
of an HTML document Creating an HTML document, Mark up Tags, Heading -Paragraphs Line
Breaks, HTML Tags.

Unit: III:
Elements of HTML, Introduction to elements of HTML, Working with Text, Working with
Lists, Tables and Frames, Working with Hyperlinks, Images and Multimedia Working with
Forms and controls.

Unit: IV:
Introduction to Cascading Style Sheets: Concept of CSS, Creating Style Sheet, CSS Properties,
CSS Styling(Background, Text Format, Controlling Fonts), Working with block elements and
objects, Working with Lists and Tables, CSS Id and Class, Box Model(Introduction, Border
properties, Padding Properties, Margin properties), CSS Advanced(Grouping, Dimension,
Display, Positioning, Floating, Align, Pseudo class, Navigation Bar, Image Sprites, Attribute
sector), CSS Color, Creating page Layout and Site Designs.

Text Book:
1. Web Technologies – Black Book – DreamTech Press
2. John Duckett, Beginning HTML, XHTML, CSS and Java script.

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

67