Shivaji University, Kolhapur.

1

Shivaji University, Kolhapur.

Computer Science and Engineering Scheme of Teaching & Examination

S.E. (Semester-III)

Sr. No.

Subject Teaching Scheme Per Week

Examination (Marks)

L P T Total

Theory Paper TW

POE OE Total

Written online

1 Applied Mathematics 3 - 1 4 50 50 25 - - 125 2 Discrete Mathematical

Structures 4 - 1 5 50 50 25 - - 125

3 Data Structures 4 - - 4 50 50 - - - 100 4 Data Communications 4 - - 4 50 50 - - - 100 5 Microprocessors 3 2 - 5 50 50 25 50 175 6 Programming Lab - I 2 4 - 6 - -- 50 50 - 100

7 Soft Skills - 2 - 2 - - 50 - 25 75

Total 20 2 8 30 250 250 175

50 75 800

INDEX

Sr. No. Subject Code Page No. 1. Applied Mathematics CS201 02 2. Discrete Mathematical Structures CS202 15 3. Data Structures CS203 37 4. Data Communications CS204 49 5 Microprocessors CS205 59 6. Programming Lab - I CS206 68 7. Soft Skills CS207 81

2

Course Plan

Course APPLIED MATHEMATICS Course Code CS201

Examination Scheme

Theory Term Work POE Total

Max. Marks 100s 25 -- 125 Contact Hours/ week

3 1 -- 4

Prepared by Mr. Salgare S.S. Date 18-05-2018

Prerequisites

Set Theory (crisp SET) Probability Types of relation between bivariate data Basic concept of numerical method Matrix elementary operations

Course Outcomes At the end of the course the students should be able to: CO201.1 Associate2 the bivariate data to linear, exponential, quadratic form and to find

correlation and lines of regressions. CO201.2 Identify1 nature of random variable and apply2 proper probability distribution to solve

examples. CO201.3 Understand1 and apply3 numerical techniques for finding solution of algebraic and

transcendental equation CO201.4 Distinguish2 between crisp and fuzz set and to write different terms of fuzzy set CO201.5 Determine5 A+B, A-B, A.B and A/B also to solve A+X=B, A.X=B CO201.6 Determine5 optimal solutions of assignment problems

Mapping of COs with POs

POs COs

a b c d E f G h i j k l

CO201.1 3 2 CO201.2 3 2 CO201.3 3 1 CO201.4 2 1 CO201.5 2 2

3

CO201.6 3

Degree of compliance: 1: Low, 2: Medium 3: High

Course Contents

Unit No

Title No. of Hours

1

Curve Fitting: 1.1 Lines of regression of bivariate data, 1.2 Fitting of Curves by method of Least-squares.

1.2.1 Fitting of Straight lines 1.2.2 Fitting of exponential curves. 1.2.3 Fitting of Parabolic curves.

6

2

Probability Distribution: 2.1 Random variable 2.2 Binomial Distribution 2.3 Poisson Distribution 2.4 Normal Distribution

6

3

Numerical solution of transcendental & algebraic equations and Numerical Integration 3.1 Newton Raphson Method 3.2 Secant method 3.3 Trapezoidal Rule 3.4 Simpson's 1/3 rd rule 3.5 Simpson's 3/8 th rule

8

4

Introduction to Fuzzy sets: 4.1 Basic concepts of fuzzy sets 4.2 Crisp set and Fuzzy set. 4.3 membership functions 4.4 Basic operations on fuzzy sets 4.5 Properties of fuzzy sets

6

5

Fuzzy Arithmetic: 5.1 Fuzzy numbers 5.2 Fuzzy cardinality 5.3 Operations on Fuzzy numbers 5.4 Fuzzy equations of type A + X = B and A.X = B

7

6

Assignment Problems: 6.1 Definition, Balanced and Unbalanced assignment problems, 6.2 Hungarian method of solving balanced assignment problems. 6.3 Hungarian method of solving unbalanced assignment problems. 6.4 Traveling salesmen problem

7

4

Reference Books:

Sr. No. Title of Book Author Publisher/Edition Topics

1 Higher Engineering Mathematics

Dr. B. S. Grewal Khanna Publishers, Delhi.

2 A text book of Applied Mathematics, Vol.-I,II,III

P. N. Wartikar & J. N. Wartikar

Pune Vidyarthi Griha Prakashan, Pune.

3 Advanced Engineering Mathematics

Erwin Kreyszig Wiley India Pvt. Ltd.

4 A textbook of Engineering Mathematics Volume I

Peter V. O’Neil and Santosh K. Sengar

Cengage Learning

5 Mathematical methods of Science and Engineering

Kanti B. Datta Cengage Learning

6 A textbook of Engineering Mathematics

N. P. Bali, Iyengar Laxmi Publications (P) Ltd., New Delhi

7 Operation Research S.D. Sharma 8 Operation Research T.A. Taha

9 Fuzzy sets and Fuzzy Logic George J. Klir, Bo

Yuan 1- 4, 10and

12 upto 12.3

10 Probability and Statistics for Computer science

James L. Johnon Student Edition

Evaluation scheme

Examination Scheme

Theory Term Work POE/OE Total

Max. Marks 100 25 125 Contact Hours/ week

3 hours (theory) 1hour(Tutorial)

Scheme of Marks

Section Unit No. Title Marks

I 1 Curve Fitting 12 2 Probability Distribution 12 3 Numerical solution 12

II 4 Introduction to Fuzzy sets 12 5 Fuzzy Arithmetic 12

5

6 Assignment Problems 12

Course Utilization

Section

Unit Course Outcomes

No. of Questions in

No. Title CAT-I CAT-II

I 1 Curve Fitting CO201.1

Unit 1 and 3

Unit 2 and 4

2 Numerical Method CO201.2 3 Probability Distribution CO201.3

II 4 Introduction to Fuzzy sets CO201.4 5 Fuzzy Arithmetic CO201.5 6 Assignment Problems CO201.6

Unit wise Lesson Plan

Section I

Unit No 1 Unit Title Curve Fitting Planned Hrs. 6

Lesson schedule

Class No.

Details to be covered

1 Introduction and principal of least squares 2 Fit to linear form i.e. y a bx and exponential form i.e. ,x by ab y ax etc 3 Fitting of data to linear and quadratics form i.e. 2y a bx cx 4 To find regression coefficients for bivariate data 5 To find lines of regressions 6 To find mean, coefficient of correlation 7 Discussion of examples from university question papers

Review Questions

Q1

Find the curve of the best fit of the type bxy ae to the following data by the method of least square.

x 1 5 7 9 12

6

y 10 15 12 15 21

CO201.1

Q2 For a certain data the regression equations are 3 2 26 6 31x y and x y .

Find ,x y and r .

Q3

From the following result obtain two regressions and estimate i) y when x=29 and ii) x when y=600

x y

Mean 26.7 508.4

Standard Deviation 4.6 36.8 Where r=0.52

Q4

Find the best fitting of the type by ax to the following data

X 1 2 3 4 5 6

Y 2 16 54 128 250 432

Q5

For the following data fit a curve of the type xy ab to the following data

x 2 3 4 5 6

y 144 172.8 207.4 248.8 298.5

Q6

Find the equation of lines of regression and the best estimate of x for y=8 and y for x=13 for the following data

x 2 4 6 8 12 14

y 4 2 5 10 11 12

Q7 Fit a straight line to the following data

0 1 2 3 41 1.8 3.3 4.5 6.3y

x

Q8

Fit a second degree cure to the following data 1965 1966 1967 1968 1969 1970 1971 1972

Pr ( ) 125 140 165 195 200 215 220 230Year

ofit Laks

Also estimate the profit in 1973

Q9 For the following data fit a curve of the form by ax

1 2 3 4 5 61200 900 600 200 110 50

xy

Q10 For certain data the regression equations are 3x + 2y-26 =0 & 6x + y -31=0. Find mean of x, mean of y and r.

7

Unit No 2 Unit Title Probability distribution Planned

Hrs. 7

Lesson schedule

Class No.


1 Introduction and types of random variables 2 Examples on discrete and continuous random variable 3 Binomial probability distribution 4 Poisson probability distribution 5 Examples 6 Normal probability distribution 7 Examples from university question papers

Review Questions

Q1

Find the value of k if the following function is a probability function 21

2( )x m

f x ke

; x Where m is real and σ>0

CO201.2

Q2 Fit a Poisson distribution to the following data

0 1 2 3 4192 100 24 3 1 320

x Totalf

Q3 A fair coin is tossed 10 times. Find the probability that the coin shows head (i) exactly 2 times (ii) at most 2 times (iii) at least 8 times

Q4 Assume that on the average one telephone number out of 15 called 2 p.m. and 3 p.m. on week days is busy. What is the probability that if 6 randomly selected telephone numbers are called (i) not more than 3 (ii) at least 3 of them will be busy

Q5 If the probability that an individual suffers a bad reaction from a certain injection is 0.001, determine the probability that out of 2000 individuals (i) exactly 3 (ii) more than 2 will suffer a bad reaction

Q6

In an intelligence test administered on 1000 children the average was 42 and S.D. was 24 (i) Find the number of children exceeding a score 50 and (ii) Number of children lying between 30 and 40.

Q7 In a large institution 2.28% of employees receive income below Rs.4500 P.M. and 15.87% of employees receive income above Rs 7500P.M. Assuming that the income follows normal distribution. Find the mean and S.D. of the distribution.

Q8 The overall percentage of failures in a certain examination is 20. If six candidates appear in the examination, what is the probability that at least five pass the examination?

CO201.2 Q9 A random variable x has the following probability function

8

2 2 2

: 0 1 2 3 4 5 6 7

( ) : 0 2 2 3 2 7

x

P x k k k k k k k k

(i) Find k (ii) Evaluate P(x<6) and P (3<x≤6)

Q10 Suppose that x has a Poisson distribution, if P(x=2) = 2/3 P(x=1), find

i) P(x=0) (ii) P(x=3)

Unit No 3 Unit Title Numerical Solution of algebraic and

Transcendental equation and Numerical Integration

Planned Hrs. 6

Lesson schedule

Class No.


1 Introduction 2 Newton Raphson Method 3 Secant method 4 Trapezoidal Rule 5 Simpson's 1/3 rd rule 6 Simpson's 3/8 th rule 7 Examples

Review Questions

Q1 Use Newton's Method to find the only real root of the equation Correct to 4 decimal places.

CO201.3

Q2 Use secant method to determine the root of the equation cosx-xex=0 CO201.3

Q3 Use Trapezoidal rule to evaluate 1

3

0

x dx considering five sub-intervals. CO201.3

Q4 Evaluate

2

1

1 dxx by Simpson’s

13

rd

rule with four strips and determine the error by

direct integration.

CO201.3

Q5 Evaluate 5.2

4

loge xdx by Simpson’s 38

th

rule. CO201.3

Q6 Evaluate by Trapezoidal rule 0

sint tdt

CO201.3

Q7 Compute the value of I given by 2

1.5

0.2

xI e dx . Using Samson’s 13

rd

rule with four

subdivisions.

CO201.3

Section II Unit No 4 Unit Title Introduction of fuzzy set Planned 6

3 1 0x x

9

Hrs.

Lesson schedule Class No.


1 Introduction and some properties of crisp set 2 Membership function and examples of fuzzy set 3 To study different definitions of fuzzy set 4 Basic operations on fuzzy sets 5 Properties of fuzzy set 6 Extension principal of fuzzy set 7 Examples from university question papers

Review Questions

Q1 Define (a)∝-cut of fuzzy set (b) strong ∝-cut of fuzzy set (c) support of fuzzy set (d) Height of fuzzy set (e) Normal & subnormal fuzzy set (f) Level set of A

CO201.4

CO201.4

Q2

0.1 1 0 0.9 0.8 0.3A

x y z w v u

0.6 0.3 1 0.4 0.2 0.1

Bx y z w v u

Find (a) ( )A (b) A B (c) A B (d) A B (e) A B

Q3

Let 1 2 3 4 5

0.20 0.35 0.36 0.7 0.92Ax x x x x

1 2 3 4 5

0.15 0.40 0.60 0.65 0.82Bx x x x x

Verify A B A B A B

Q4 Determine the degree of subset hood ( , )S A B & ( , )S B A for

2( )

5x

A xx

,

( ) 15x

B x for {0,1,2,3,4,5}x

Q5

Let the fuzzy set A & B are defined by ( )5

xA x

x

& ( ) 1

5x

B x for

{0,1, 2,3, 4,5....,10}x

Find (a) A (b) B (c) A B (d) A B (d) B B (e) A A

10

Q6 Verify Demerger’s law for the fuzzy sets ( )

1x

A xx

and ( ) 110x

B x for

{0,1, 2,3, 4,5....,10}x

Q7

Define special fuzzy set and prove that [0,1]

A

A ,

where 0.3 0.4 0.6 0.8 11 2 3 4 5

A

Q8

Given a fuzzy set defined on {0,1, 4,9,.....,100}Y

0.3 0.5 0.4 11 9 16 81

A . Let :f X Y defined by 2( )f x x for

{0,1, 2,3, 4,5....,10}x . Find 1( )f A

Q9

Using extension principle, find ( , )f A B (i) 1 2 1 2( , ) 2f x x x x (ii)

1 2 1 2( , ) .f x x x x

For 0.5 0.6 0.9 1 0.21 2 3 4 5

A and 0.3 0.4 0.7 1 0.33 4 5 6 7

B

Unit No 5 Unit Title Fuzzy Arithmetic Planned Hrs.

8

Lesson schedule

Class No.


1 Define and identify fuzzy numbers 2 Find fuzzy cardinality and relative cardinality 3 Arithmetic operations on intervals 4 Arithmetic operations on fuzzy numbers A+B,A-B 5 Arithmetic operations on fuzzy numbers A*B,A/B 6 Fuzzy equations A+X=B 7 Fuzzy equations A*X=B 8 Examples from university question papers

Review Questions

Q1

Verify whether following fuzzy set is fuzzy number or not?

sin ;0

( )0 ;

x xA x

otherwise

CO201.5

Q2 Find the value of a) [2,5]+[8,9] CO201.5

11

b) [3,6]-[5,-9] c) [5,3]*[2,-1] d) [-9,5]/[2,6]

Q3

Let A and B be two fuzzy numbers defined as follows

x-6 ; 6 x 8

210

( ) ; 8 x 1020 ; otherwise

xA x

&

x-3 ; 3 x 5

27

( ) ; 5 x 720 ; otherwise

xB x

Then find the fuzzy numbers A+B, A-B, B-A &A.B

CO201.5

Q4

Find the fuzzy numbers A+B & A.B for the fuzzy numbers

x 2 ; -2 x 1

34


xA x

&

x-4 ; 4 x 7

310

( ) ; 7 x 1030 ; otherwise

xB x

CO201.5

Q5

For fuzzy number A and B solve the fuzzy equation A+X=B x 2 ; -2 x 0

22( ) ; 0 x 2

20 ; otherwise

xA x

x-2 ; 2 x 42

6& ( ) ; 0 x 620 ; otherwise

xB x

CO201.5

Unit No 6 Unit Title Assignment Problem Planned Hrs. 7

Lesson schedule

Class No. Details to be covered

1 Balanced assignment problem 2 unbalanced assignment problem 3 Hungarians method for solving balanced assignment problem 4 Hungarians method for solving unbalanced assignment problem 5 Examples 6 Travelling salesman problem

12

7 Examples 8 Examples from university question papers

Review Questions

Q1

You work as a sales manager for a toy manufacturer, and you currently have three salespeople on the road meeting buyers. Your salespeople are in Austin, TX; Boston, MA; and Chicago, IL. You want them to fly to three Other cities: Denver, CO; Edmonton, Alberta; and Fargo, ND. The table below shows the cost of airplane tickets in dollars between these cities.

From/To Denver Edmonton Fargo Austin 250 400 350 Boston 400 600 350 Chicago 200 400 250

Where should you send each of your salespeople in order to minimize airfare?

CO201.6

Q2

A construction company has four large bulldozers located at four different garages. The bulldozers are to be moved to four different construction sites. The distances in miles between the bulldozers and the construction sites are given below

Bulldozer\Site

A B C D

1 90 75 75 80 2 35 85 55 65 3 125 95 90 105 4 45 110 95 115

How should the bulldozers be moved to the construction sites in order to minimize the total distance traveled?

CO201.6

Q3

Four persons A, B, C and D are to be assigned four jobs I, II, III and IV. The cost matrix is given as under, find the proper assignment.

1 8 10 17 92 3 8 5 63 10 12 11 94 6 13 9 7

machinesA B C D

jobs

CO201.6

Q4 Define Balanced and Unbalanced assignment problem CO201.6 Q5 Solve the assignment problem CO201.6

13

16 12 14 1618 13 13 1415 16 11 1517 14 12 18

A B C D

IIIIIIIV

Model Question Paper

Course Title : Applied Mathematics Duration 2 hours

Max. Marks 50

Instructions: 1) attempt any two questions from each section 2) Use of calculator and statistical table is allowed 3) Figure to the right indicates full marks. 4) use one answer book for both sections

Section-I Marks 1 a Calculate the correlation coefficient from the following data. Hence

comment x 100 98 85 92 90 84 88 90 93 95 y 500 610 700 600 670 800 800 750 700 690

6

b Find the lines of regression for the following data x 10 14 19 26 30 34 39 y 12 16 18 26 29 35 38

And determine the reliability of estimate of y for x=14.5

7

2 a The overall percentage of failures in a certain examination is 20. If six candidates appear in the examination, what is the probability that at least five pass the examination?

4

b Fit a Poisson distribution to the following data: x 0 1 2 3 4 Total y 211 90 19 5 0 325

4

c Find the value of K, if the following function is a probability density

function 21( ) ;

1f x K x

x

4

3 a Find the root of the function y = x3 + 4x2 + 7 in the vicinity of x = -4 correct to 5 decimal places.

6

b 7 Section-II

Marks 4 a Define

(a) Level set of fuzzy set A (b) Fuzzy cardinality of fuzzy set A

4

14

(c) Complement of fuzzy set A b Calculate cut of A and B

( ) & ( ) 1 , {0,1,2,...,10}1 10

x xA x B x xx

4

c If A and B be two fuzzy sets as follows 0 0.2 0.35 0.15 0.5

1.0 1.5 2.0 2.5 3.0A

and

0 0.15 0.2 0.35 0.41.0 1.5 2.0 2.5 3.0

B

Find ( ) | | ( ) | |i A B ii A B

4

5 a Define fuzzy number 3 b Find the fuzzy numbers A+B & A.B for the fuzzy numbers

x 2 ; -2 x 1

34


xA x

&

x-4 ; 4 x 7

310

( ) ; 7 x 1030 ; otherwise

xB x

9

6 a Solve the assignment problem

Job 1 2 3 4 5 6

Machine A 3 7 3 6 5 5 B 6 1 8 4 2 7 C 2 4 5 3 4 6 D 6 4 8 7 3 4

6

b 1. Given the matrix of set-up costs, Show how to sequence the production so as to minimize the set-up cost per cycle

To

A1 A2 A3 A4 A5

From

A1 ∞ 2 5 7 1

A2 6 ∞ 3 8 2

A3 8 7 ∞ 4 7

A4 12 4 6 ∞ 5

A5 1 3 2 8 ∞

7

15

Practical/ Assignments: List of experiments/assignments to meet the requirements of the syllabus

All Batches Minimum two/three assignment on each unit

Course Plan

Course DISCRETE MATHEMATICAL STRUCTURES

Course Code 45605

Examination Scheme

Theory Term Work POE Total

Max. Marks 50(TH)+50(Online) 25 -- 125 Contact Hours/ week

4 1 (Tutorial) -- 5

Prepared by Dr. N. D. Karande Date 04/05/2018 Prerequisites Basic Mathematics, Modern logic and algebra.

Course Outcomes At the end of the course the students should be able to: CO202.1 Outline1 mathematical logic, connectives, equivalence of formula related to

computer science areas. CO202.2 Identify1 the problem solving methods in the areas of theoretical computer

science. With logic & normal forms & statement calculus CO202.3 Discuss2 the mathematical concepts in the development of computer

16

applications; get idea of discrete mathematical structures (sets, operation on sets& its representation) and application logic two state devices.

CO202.4 Convert2 the concept of relations, orderings & recursive functions and algorithms for proving theorems in the prepositional calculus.

CO202.5 Classify3 algebraic system in the area of computer science such as formal language theory, syntactic analysis and automata.

CO202.6 Illustrate4 Boolean algebra and its application to switching theory & sequential machines & understand its relation with lattice.

CO202.7 Associate2 the computer representation and manipulation with the help of graph theory

CO202.8 Determine5 the probability of an event and the algorithms to generate permutations & combinations to real time problems in well-defined distribution.

Mapping of CO’s with PO’s

PO CO

A B C D E F G H I J K L

CO1 3 2 1 CO2 2 1 1 CO3 2 3 1 CO4 2 2 CO5 2 1 2 CO6 3 2 2 CO7 1 3 CO8 2 2 1 1 Mild correlation 2 Moderate correlation 3 Strong correlation

Course Contents

Unit No. Title No. of Hours

Section I

1.

Mathematical Logic: statements and notations, connectives – negation, Conjunction, disjunction, conditional, bi-conditional, Statement formulas and truth tables well-formed formulas, Tautologies, Equivalence of formulas, Duality law, Tautological implications, functionally complete sets of connectives, other connectives, Normal and principal normal forms, completely parenthesized infix and polish notations, Theory of Inference for statement calculus – validity using truth table, rules of inference, consistency of Premises and indirect method of proof.

9

2. Set theory Basic concepts of set theory, types of operations on sets, ordered pairs, Cartesian Product, representation of discrete structures, relation,

10

17

properties of binary relations, matrix and graph representation, partition and covering of set, equivalence relation, composition, POSET and Hasse diagram, Function – types, composition of functions, Inverse function.

3 Algebraic systems Semigroups and Monoids, properties and examples, Groups: Definition and examples, subgroups and homomorphism.

5

Section II

4

Lattices and Boolean algebra Lattice as POSETs , definition , examples and properties, Lattice as algebraic systems, Special lattices, Boolean algebra definition and examples, Boolean functions, representation and minimization of Boolean functions

8

5 Graph theory Basic concepts of graph theory, Storage representation and manipulation of Graphs, PERT and related techniques

5

6.

Permutations, Combinations and Discrete Probability Permutations and Combinations: rule of sum and product, Permutations, Combinations, Algorithms for generation of Permutations and Combinations. Discrete Probability, Conditional Probability, Baye’s Theorem, Information and Mutual Information

8

Reference Books:

Sr. No.

Title of Book Author Publisher/Edition Topics

1. Discrete Mathematical Structures with Application to Computer Science

J. P. Tremblay & R. Manohar

MGH International

1,2,3,4,5

2. Elements of Discrete Mathematics

C. L. Liu and D. P. Mohapatra

Tata McGraw-Hill 6

Scheme of Marks

Section Unit No. Title Marks

1. 1,2,3 Mathematical Logic, Set theory Algebraic systems

25

2. 4,5,6, Lattices and Boolean algebra

18

Graph theory Permutations, Combinations and Discrete Probability

25

Course Unitization

Section


No. of Questions in

No. Title CAT-I CAT-II I 1 Mathematical Logic,

CO202.1 CO202.2

1 set of MCQ questions of 10 marks. 3 questions with mixing of sub question from chapters 1-2-3

2 Set theory

CO202.3 CO202.4

3 Algebraic systems CO202.5

II 4 Lattices and Boolean algebra

CO202.6 1 set of MCQ questions of 10 marks. 3 questions with mixing of sub question from chapters 4-5-6

5 Graph theory

CO202.7

6 Permutations, Combinations and Discrete Probability

CO202.8


Section I Unit No 1. Unit Title Mathematical Logic

Planned Hrs.

09

Lesson schedule Class No. Details to be covered

1 Introduction, statements and notations

2 connectives – negation, conjunction, disjunction, conditional, bi-conditional, Statement formulas and truth tables

3 well-formed formulas, Tautologies, Equivalence of formulas 4 Duality law, Tautological implications 5 functionally complete sets of connectives, other connectives 6 Normal and principal normal forms 7 completely parenthesized infix and polish notations

19

8 theory of inference for statement calculus – validity using truth table, , 9 rules of inference consistency of premises and indirect method of proof

Review Questions Q1 Show the following implication without constructing the truth table.

(Q→ (P∧⌉P))→(R→(P∧⌉P)) (R→Q)

Show the following equivalence

((Q∧(A)→C) ∧(A→)∧(A→(P∨C)) (A∧(P→Q)) →C

CO202.1

Q2 Obtain the conjunctive normal form of the formula (⌉P→R) ∧(Q P)

CO202.2

Q3 Obtain the completely parenthesized infix of the following →→PQ→→QR→→PR

CO202.2

Q4 Write the following formula in the form in prefix suffix form i. P→Q∨R∨S

ii. Q∧⌉(R P∨Q)

CO202.2

Q5 Define the Principle conjunctive normal form? Obtain the PCNF form of the following (B→A) ∧(⌉A∧B)

CO202.2

Q6 Define Converse & inverse of a conditional statement and give the converse & Inverse of the following statement “If it rains then I stay at a home”.

CO202.1

Q7 Show that, (A→B) →C≠ A→(B→C) A (B C)=(A B) C

CO202.1

Q8 Consider a binary operator ‘*’whose truth table is given as: P Q | P*Q -------- |------- F F | T F T | F T F | F T T | F . Prove that {*} is functional complete set.

CO202.1

Q9 What is well formed formula? Give example. CO202.1 Unit No 2. Unit Title Set Theory Planned Hrs. 10 Lesson schedule Class No. Details to be covered 1 Basic concepts of set theory types of operations on sets 2 Ordered pairs Cartesian Product 3 Representation of discrete structures 4 Relation, properties of binary relations 5 Matrix and graph representation

20

6 Partition and covering of set 7 Equivalence relation, composition 8 POSET and Hasse diagram 9 Function-types, composition of function 10 Inverse function Review Questions Q1 Explain the following terms with example

i. Covering of a set ii. Partition of a set

CO202.3

Q2 Let L be the set of integers show that, R={<x, y>} | x-y is divisible by m} and (x,y ∈R).m is positive integer)R is an equivalence relation.

CO202.3

Q3 Write about the properties of binary relation? CO202.4 Q4 Write a short note on functions & inverse of functions CO202.4 Q5 Dram as many one-to-one functions from the set {1,2,3} to {A,B,C}as

possible CO202.4

Q6 Define :Identity mapping & Inverse of function Give functions: f:X→Y and g:Y→x where X and Y are any two sets such that f○g=Iy , g○f≠Ix

CO202.4

Q7 Give the power set of the following 1){a,{b}} 2){1, } 3){X,Y,Z}

CO202.3

Q8 Draw the hasse diagram of following set under partial ordering relation “divides” and indicate which are totally ordered.

i. {2,6,24} ii. {3,5,15}

CO202.3

Q9 Let X={1,2,3,4,5} and R={<x,y>| x>y}.Draw the graph of R, give its matrix and discuss its properties

CO202.4

Unit No 3 Unit title Algebraic systems Planned hours 5 Lesson schedule Class No. Details to be covered 1 Semi groups and Monoids 2 Properties and examples 3 Groups: definition and examples 4 Subgroups 5 Homomorphism Review Questions Q1 Given the algebraic system<N,+> and <Z4,+4>where N is the set of

natural numbers and + is the operation of addition on N, show that there exists a homomorphism form <N,+> to <Z4,+4>

CO202.5

Q2 Discuss Clock algebra Define monoid homomorphism

CO202.5

Q3 What is semi group ?Give its isomorphism CO202.5

21

Q4 Show that if g:A→B is homomorphism of an algebraic system<A,*> onto <B, ∆> and <A1 *> is sub algebra of <A,*> then image of A1 under g is a sub algebra of <B, ∆>

CO202.5

Q5 Define w.r.t. algebra i) Epimorphism ii)Monomorohism iii)Isomorphism iv)endomorphism

CO202.5

Q6 Prove that if<A,*><B,∆> and <C, ⊕> are semigropus and g:A→B and h:B→C are semi group homomorphism’s, h○g:A→C is a semigroup homorphism from <A,*>to<C, ⊕>.

CO202.5

Q7 Explain the following terms with example covering of a set & partition of a set

CO202.5

Q8 Show that the set N of natural numbers is a semi group under the operation x*y=min {x,y}.is it a moniod?

CO202.5

Q9 Let <A:X> be an algebraic system where A:Set of all odd integers X:multiplication operation State properties satisfied by the operation X.

CO202.5

Unit No 4. Unit Title Lattices & Boolean Algebra Planned Hrs. 08 Lesson schedule Class No. Details to be covered 1 Lattices as a POSETS- definition 2 Lattices as POSETS- examples, properties 3 Lattices as a algebraic system 4 Special Lattices 5 Boolean algebra-definition and examples 6 Boolean function Representations 7 Boolean function minimization 8 Boolean function minimization Review Questions Q1 Define the following :

i. Distributive Lattice ii. Lattice homomorphism

iii. Boolean Algebra

CO202.6

Q2 Prove Boolean Identity i. (a*b*c) ⊕(a*b)=a*b

ii. (a*b) ⊕(a*b’)=a

CO202.6

Q3 Define Lattice as POSET. Define greatest lower bound & least upper bound with examples.

CO202.6

Q4 List & Define different types of Lattices CO202.6 Q5 Consider the POSET A=({-4,2,3,5,6,9,12,18,16}, /) find the LUB and

GLB for the sets {6,18} & {4,6,9} CO202.6

22

Q6 Consider the Lattice L= {1, 2, 3, 4, 6, 12} of factor of 12 under divisibility find the Sub lattices? Show the union of two lattices may not be sub lattices

CO202.6

Q7 Define the following i. Lattice

ii. Sub-Boolean Algebra iii. Complemented Lattice

CO202.6

Q8 Let <B,*, ⊕. ‘ , 0,1> be Boolean algebra and a+b=(a*b’)⊕(a*b),a⋅b=a*b then prove that

i. a⋅(b+c)=(a⋅b)+(a⋅c) ii. a+a=0

CO202.6

Q9

Find the least member <if any>,greatest member<if any>,maximal members, minimal members, GLB of {a,d} and LUB of {a,d}

CO202.6

Unit No 5. Unit Title Graph Theory Planned Hrs. 04 Lesson schedule Class No. Details to be covered 1 Introduction to Graph theory understanding its representation 2 Solving some problems by using graph 3 Storage representation of graph 4 Manipulation of graphs 5 PERT & related techniques in graph Review Questions Q1 a) Find the adjacency matrix (A) & Path matrix (P) of the following

graphs.

CO202.7

23

b) Find the AT and A.AT in above graph.

Q2 Explain the Algorithm of PERT with example CO202.7 Q3 Define the following terms with respect to Graph

1.Strongly connected 3.Path 2.Unilaterally connected 4.Simple path

CO202.7

Q4 Write a short note on Matrix representation of Graph CO202.7 Q5 State which of the following graphs are simple graph

CO202.7

Q6 Draw the graph of a)Methane(CH4) b)Propane(C3H8) CO202.7 Q7 Which of the following is the application of graph theory

a)Fault detection & combinational circuits c)Finding shortest path of n/w b)PERT d)All of the above

CO202.7

Q8 Explain the matrix representation of the graph in detail. CO202.7 Q9 Directed graph is associated with _____________

a)ordered pair of vertices c)unordered pair of vertices b)adjacent vertices d)unconnected vertices

CO202.7

Q10 A diagraph is called ________connected if it is connected as an undirected graph in which each directed edge is converted to an undirected graph a)strongly c)unilaterally b)twice d)none

CO202.7

Unit No 6. Unit Title Permutations, Combinations and Discrete Probability

Planned Hrs.

7

Unit Outcomes At the end of this unit the students should be able to: Lesson schedule Class No. Details to be covered 1 Permutations and Combinations 2 Rule of sum and product of Permutations 3 Rule of sum and product of Combinations

24

4 Algorithms for generation of Permutations and combinations 5 Discrete probability 6 Conditional probability 7 Baye’s Theorem 8 Information and Mutual information Review Questions Q1 Let S = {a, b, c, d, e, f}.How many distinct words of letter four can be

formed from the letter S? CO202.8

Q2 In how many ways can a team of 11 players be selected from a pool of 15 players to play the matches at national level?

CO202.8

Q3 If S ={0,1}.Find the number of different bit strings of length five. CO202.8 Q4 Three dice were rolled .given that no two faces were the same, what is

the probability that there was as ace? CO202.8

Q5 What is conditional probability ?explain with example CO202.8 Q6 Explain mutual information? CO202.8


Course Title Discrete Mathematical Structures

Duration 3 Hour Marks:50 Instructions:

1]Question No 3 and 6 are compulsory

2]Solve any one question from 1 &2andanyone from 4&5

3]Figure to the right indicate full marks

Q1

a Show the following implications without constructing truth table

i) P (QP) ii) P QP (P Q)

4

b Obtain the PPNF of

P ((PQ)(Q VP))

4

c Let I be the set of integers. Show that R = {<x,y>/ x–y is divisible by m}.(x,yR, m is a positive integer)R is an equivalence relation.

5

25

2 a Draw a Venn diagram

i) AB=AB C ii) AB C =iii) A– B=A + B iv) AB C AB

4

b What is a Monoid Homomorphism? Explain with example. 4

c Let A= {a,b},which of the following table define a semigroup of A? and monoid of A?

* a b * a b * a b

a a b a a b a b a b a a b b b b a b

5

3 Write a short note on(attempt any THREE) 12

a Properties of binary relationship

b Partially ordered relation

c Functionally complete set of connectives

d Partitioning and covering of set

4 a Define following

i) Lattice ii) Direct Product iii) Distributive Lattice

6

b Afaircoinistossed5times.Findthenumberofsequenceinwhich „H‟appearsatthemost3times.

6

5 a Write about following special lattices

i) Complete Lattice ii) Complemented Lattice

iii)Distributive Lattice

6

26

1. "" For statement formats P?Q , Q?P is called & quot;" A. Converse B. Inverse C. Contrapositive D. None of above 2. Determine true or false, A 1 belongs to {a+ 2b| a,b are even integers} B.TRUE C.FALSE 3. Let P(S) denote the power set of set S. Which of the following is always TRUE? A.P(P(S)) = P(S) B.P(S) intersection S = P(S) C.P(S) intersection P(P(S)) = {fy} D.S does not belong to P(S) 4. Let A and B be the sets and Ac and Bc denote the complements of the sets A and B. A.the set (A ¿ B) union (B ¿ A) B.union (A intersection B) is equal to A union B

b Define following

i) Geodesic ii) Weighted graph iii) Directed tree

6

6 a Therewerethreecandidatesforthepositionofthechairmanofacollage-Mr.X,Mr.Y,Mr.Zwhosechancesofgettingtheappointmentareintheratio4:2:3respectively.TheprobabilitythatMr.Xifselectedwouldintroducecomputereducationinthecollageis 0.3. The probability of Mr.Y and Mr.Z doing the same are respectively 0.5 and 0.8.What is the probability that there was computer education in collage?

6

b Find earliest completion time and the latest completion time for the nodes in the diagram. Also find critical path.

OR

Let G={1,2,3,4,5}andtheoperationadditionmodule6isdenotedbyt6.Prepare composition table and show that set G is not a group.

7

27

C.Ac union Bc A intersection B D.Ac intersection Bc 5. The number of elements in the power set P(S) of the set S={ { fy },1,{2,3}} is A.'2 B.'4 C.'8 D.none of these 6. Which of the following is not correct? A. It is a complemented lattice B. It is not a distributive lattice C. Every element has got a unique complement D .None of the above 7. Let A be a finite set of size n, the number of elements in the power set of A cartesian product A is A.2 raised to 2 raised to n B.2 raised to n raised to 2 C.(2 raised to n ) raised to 2 D. None of these 8. Let W={a,b,c,d}.Determine which set of the ordered pairs is a function from W to W (1){(b,a),(c,d),(d,a),(c,d),(a,d)} (2){(d,d),(c,a),(a,d),(d,b)} (3){(a,b),(b,b),(c,b),(d,b)} (4){(a,a),(b,a),(a,b),(c,d)} A.1 and 2 only B.1 only C.1,2 and 3 only D.None of the above 9. Suppose x and y are sets and |x| and |y| are their respective cardinalities . It is given that there are exactly 97 functions from x to y .From this one can conclude that A. |x|=1 , |y| = 97 B.|x|=97,|y|=1 C.|x|=97, |y|=97 D.None of the above 10. Suppose A is a finite set with n elements . The number of elements in the largest equivalence relation of A is A. '1 B.n C.n+1

28

D.n square 11. Let R be a non empty relation on a collection of sets defined by ARB if and only if A intersection B = fy. Then pick the true statement A.R is reflexive and transitive B.R is symmetric and not transitive C.R is an equivalence relation D.R is not reflexive and not transitive 12. Let R ans S be relations on set A . Assuming A has at least three elements , state whether the following statement is true or false ? If R and S are antisymmetric then R union S is antisymmetric . A.TRUE B.False 13. P AND Q is equivalent to A.Q AND P B.NOT PV Q C.T D.none of the above 14. The proposition ~(PVQ)is equivalent to A.PVQ B.~PV~Q C.~PÙ~Q D.PÙQ 15. Determine whether the set together with the binary operation is a semigroup A.N, where * is addition . B.S=N*N, C. where (a,b)*(a',b' )=(aa',bb') D. All of above 16. Let A be a set of integer greater than one and smaller than thousand . Let B denote set of books in library. , |B| = 999 .Let f:A--->B , assigning a unique number to each book , then f is A.one to one , onto B.one to one and not onto C. not one to one , D. onto not one to one , not onto

29

17. A relation r be defined on the set of integers as xRy , iff (x+y) is even . Which of the following statements is true ? A. R is not an equivalence relation B.R is an equivalence relation having one equivalence class C.R is an equivalence relation having two equivalence classes D.R is an equivalence relation having three equivalence classes 18. Let R ans S be relations on set A . Assuming A has at least three elements , state whether the following statement is true or false ? If R and S are antisymmetric then R union S is antisymmetric . A.TRUE B.FALSE 19. Simplification of the Boolean expression (A + B)'(C + D + E)' + (A + B)' yields which of the following results? A.A+B B.(A+B)(C+D+E) C.A'B' D.A'+B' 20. Which of the following is correct? A. It is a distributive lattice B. It is a boolean algebra C. It is a complemented lattice D. All of the above 21. I. Every element of a lattice has at least one complement. II .Elements of a lattice are idempotent A.I is true B.II is true C. both are false D. Both are true 22. ..........are very important in the theory of sequential machines,formal languages and in certain applications relating to computer arithmetic such as multiplication. A. groups B. semigroups C. monoid

30

D. group codes 23. The set of all real numbers under the usual multiplication operations is not a group since A. Multiplication is not a binary operation B. Multiplication is not associative C. Identity element does not exist D. Zero has no inverse

24. A boolean algebra is a complemented and distributive _______ A. group B. sub group C. set D. lattice Every distributive lattice is modular. A.TRUE B.FALSE 25. The A and B are sets and A UNION B=A UNION C Then A.A={ } B.B={ } C.A=B D. "None of these " 26. Example of a relation which is neither reflexive nor irreflexive in {1,2,3} is A.{<1,1>,<1,2>,<2,1>,<3,3>} B.{<1,2>,<3,2>,<2,1>,<2,3>} C.{<1,1>,<2,2>,<2,1>,<3,3>} D. none of these 27. Which one of the following is NOT necessarily a property of a Group ? A. "Commutativity " B. Associativity C. Existence of inverse for every element D. Existence of identity 28. In a group identity element is unique A.TRUE B.FALSE 29. In a group inverse of every element is unique A.TRUE

31

B.FALSE 30. Hasse diagram is drawn for A. partial ordered set B. lattices C. boolean algebra D. none of these 31. let < Z ,* > be an algebraic system where Z is set of integer * is As n*m=max(n,m)then A. <Z,*> is monoid B. <Z,*> is an abelian C. <Z,*> is a group D. none of these 32. Statements which do not contain any connectives are called_____ statements. A. regular B. nonprimitive C. atomic D. None of above 33. For any a*a=a , a ª L , so that aRa is A. reflexive B. irreflexive C. non reflexive D .none 34. IN ANY UNDIRECTED GRAPH, THE SUM OF DEGREES OF ALL THE NODES A. must be even B.is twice the number of edges C. must be ODD D. need not be EVEN 35. Two isomorphic graphs must have A. same number of vertices B. same number of edges C. equal number of vertices D. all of these 36. A totally ordered set is trivially a lattice, but not all partially ordered sets are lattice. A.TRUE

32

B.FALSE 37. The direct product of any two distributive lattices is distributive lattice. A.TRUE B.FALSE 38. SUM OF PRODUCTS CANONICAL FORM OF (x1 join x2)' * x3 A. min 1 B. min 2 C. max 1 D. max 2

39. A AND ( A --> B) has the following disjunctive normal form : A.(A AND NOT A AND A) V (A AND B) B.(A AND NOT A) V (A AND NOT B) C.(A AND NOT A) V (A AND B) D.(A AND NOT A) V (NOT NOT(A AND B)) 40. To perform product of maxterms Boolean function must be brought into A. And terms B. Or terms C. Nand terms D. Not terms 41. Suppose x and y are sets and |x| and |y| are their respective cardinalities . It is given that there are exactly 97 functions from x to y .From this one can conclude that A. |x|=1 , |y| = 97 B. |x|=97,|y|=1 C. |x|=97, |y|=97 D. None of the above 42. The time complexity of computing the transitive closure of a bonary relation on a set of n elements is know to be A.O(n) B.O(n log n ) C.O(n raised to 3/2) D.O(n cube) 43. Suppose A is a finite set with n elements . The number of elements in the largest equivalence relation of A is (1) A.1

33

B. n C.n+1 D. n square 44. Let R be a relation on positive integers N defined by the equation x+3y=12 that is R = { (x,y) | x+3y = 12} then R converse is A.{(2,10), (6,6), (1,11)} B.{(9,1),(6,2),(3,3)} C.{((1,9),(2,6),(3,3)} D. none of the above 45. In any undirected graph, the sum of degrees of all nodes A. must be even B. is twice the number of edges C. must be odd D. need not be even 46. Which of the following statement is false A. Multigraph contains parallel edges B. Digraph contains only directed edges C. Weighted graph must be directed D. Second statement is true 47. Given a S={a1,a2,a3,..,a8} what subset is represented by B17 A. {a5,a8} B. {a1,a4} C. {a2,a3} D. {a3,a4} 48. If A={x,y},then the power of set A is A.{{x},{y}} B.{{x,y}} C.{{},{x},{y}} D. none of these 49. Boolean algebra is a lattice. A.TRUE B.FALSE

34

50. Which of the following is not a well formed formula? A.~P Ë Q B.~(P Ë Q) C.(P -> ( P Ë Q ) ) D.P 51. Which one of the following is NOT necessarily a property of a Group ? A. Commutativity B. Associativity C. Existence of inverse for every element D. Existence of identity 52. The maximum degree of any node in a simple graph with n vertices is A.n-1 B. n C. n/2 D.n-2 53. The total number of edges in a complete graph of n vertices is A. n B. n/2 C. n(n-1)/2 D. n(n+1)/2 54. The sum m of the degree of the vertices of G where V(G) = {A,B,C,D} and E{G}={[A,B],[A,C],[A,D],[B,A],[B,B],[C,B],[C,D]} is A.6 B.8 C.10 D.14 55. "For the statement formula P -> Q, the statement formula NOT Q -> NOT P is called" A. Converse B. inverse C. contrapositive D. None of the above 56. "Q : Pune is a city then i) ~Q : It is not the case that Pune is a city. ii) ~Q: Pune is not a

35

city." A. i and ii both false B. i and ii both true C. i is true and ii is false D. i is false and ii is true 57. A JOIN (a * b) = a is ____________ property. A. Idempotent B. Commutative C. Associative D. Absorption 58. The Greatest Lower Bound (GLB)of lattice is called as ______ A. meet B. join C. both a and b D. none

Practical/ Assignments: List of experiments/assignments to meet the requirements of the syllabus

All Batches Minimum two/three assignment on each unit

36

Course Plan

Course code CS203 Course DATA STRUCTURES Prepared by Mr. M. P. Gaikwad Date 25/5/2018 Prerequisites Student should possess introductory knowledge of C programming syntax and

semantics. Course Outcomes At the end of the course the students should be able to: CO203.1 Develop4 program in C for small size practical applications. CO203.2 Analyze4 different searching and sorting techniques. CO203.3 Classify3 different sorting and searching algorithms based on their efficiency. CO203.4 Discuss2 implementation and applications of linear data structures like Stack, Queue

and linked list. CO203.5 Describe1 nonlinear data structures like Tree. CO203.6 Explain2 concepts of Graph theory and Graph traversal Techniques.


POs Cos

a b c d e f g h i j k l

CO203.1 2

CO203.2 1

CO203.3 1 1

CO203.4 2 1

CO203.5 2 1

CO203.6 2 1

1 Mild correlation 2 Moderato correlation 3 Strong correlation

Course Contents


1 Basics of Data Structures: Overview of C- Basic data types, control structures, array, function, structure, pointers, Time and Space complexity.

6

37

2

Searching and Sorting Techniques: Linear search, binary search, bubble sort, selection sort, insertion sort, merge sort, quick sort, radix sort, heap sort. Hashing – Definition, hash functions, overflow, collision, open and closed hashing, rehashing techniques.

10

3

Stacks and Queues: Stacks: Definition, representation, operations, static implementation and applications of stack. Queues: Definition, representation, operations, static implementation and applications of queue, circular queue, priority queue.

7

4

Lists: Definition, representation, operations, implementation and applications of singly, doubly and circular linked lists. Implementation of stack and queue using linked lists.

10

5

Trees: Basic terminology, representation, binary tree, traversal methods, binary search tree, AVL search tree, B tree, B+ tree, Heaps- Operations and their applications.

7

6

Graphs: Basic concept of graph theory, storage representation, graph traversal techniques- BFS and DFS, Graph representation using sparse matrix.

6

Text Books:

Sr. No. Title of Book Author Publisher/Edition Topics 1 Let us C

Yashwant Kanetkar BPB 1

2 Schaum’s Outlines Data Structures

Seymour Lipschutz MGH 2,4,5,6

Reference Books:

Sr. No. Title of Book Author Publisher/Edition Topics 1 Data Structure using C A. M. Tanenbaum, Y.

Langsam, M. J. Augenstein (PHI)

Thomson Learning 1

2 Data Structures- A Pseudocode Approach with C

Richard F. Gilberg and Behrouz A. Forouzon 2nd Edition

Pearson Education 5,6

38

Scheme of Marks

Unit No. Title Marks 50(TH)+50(Online)

1 Overview of C: Basics of Data Structures 10 2 Searching and Sorting Techniques 22 3 Stacks and Queues 16 4 Lists 20 5 Trees 20 6 Graphs 12

Course Unitization

Unit Course Outcomes No. of Questions in

No. Title CAT-I CAT-II 1 Basics of Data Structures CO203.1 2 --

2 Searching and Sorting Techniques

CO203.2, CO203.3

3 --

3 Stacks and Queues

CO203.4 1 1

4 Lists CO203.4 -- 2

5 Trees

CO203.5 -- 2

6 Graphs CO203.6 -- 1


Section I Unit No

1 Unit Title: Basics of Data Structures Planned Hrs.

6



1 Basic data types ,Control Structures, 2 Array: one dimensional and two dimensional arrays 3 Functions :definition, declaration, significance, call by value, call by reference

39

4 Structure: structures and union, declare structure variables and accessing structure members.

5 Pointer: declaration, definition, pointer to structure 6 Time and Space Complexity: basics Review Questions Q1 What are user defined data types? CO203.1 Q2 How to declare the variables using user-defined data types? CO203.1 Q3 What is function? What are library functions? CO203.1 Q4 What is an array? How array can be used and manipulated? CO203.1 Q5 What are the difference between array and Structures? CO203.1 Q6 What is Structure? What is the syntax of a Structure? CO203.1 Q7 What is pointer to Structures? CO203.1 Unit No

2 Unit Title Searching and Sorting Techniques Planned Hrs.

10



1 Searching problem, Linear search ,binary search: method and complexity 2 Sorting problem, bubble sort, selection sort: method and complexity 3 insertion sort, merge sort: method and complexity 4 quick sort, radix sort: method and complexity 5 Heap sort: method and complexity 6 Hashing- Definition, hash functions 7 Overflow condition, How to deal with overflow 8 collision : Definition and How to deal with collision 9 open and closed hashing 10 rehashing techniques Review Questions Q1 With suitable example explain Linear Search Algorithm with its

complexity? CO203.3

Q2 What is merge sort? Explain its working with example? CO203.2 Q3 Write a 'C' program to implement 'selection sort' algorithm? CO203.2 Q4 Explain the working of 'Radix Sort' algorithm with example? CO203.2 Q5 Sort the array A: 32, 51, 27,85,66,23, 13, and 57 using the bubble sort

technique? CO203.2

Q6 Explain open hashing and closed hashing? CO203.2 Q7 What is load factor in hashing? What do you mean by good hash function? CO203.3 Q8 What is collision? Explain different methods to resolve collision? CO203.2 Q9 How rehashing is used as collision resolution technique? CO203.2

40

Q10 Explain the chaining method to resolve the collision? CO203.2 Unit No

3 Unit Title: Stacks and Queues Planned Hrs.

7



1 Stacks: Definition, representation 2 Operations 3 Static implementation and applications of stack. 4 Queues: Definition, representation 5 Operations 6 static implementation and applications of queue 7 Circular queue, priority queue. Review Questions Q1. Write 'C' program to implement the following operations on stack

I) Push II) Pop. CO203.4

Q2. Explain the process of infix to postfix conversion using stack? CO203.4 Q3. What is stack? Explain with example push and pop operation on stack. ? CO203.4 Q4. Define Stack? List the operations on stack and give C implementation of

these operations?

Q5. What are queues? Explain with example insert and delete operation on queue. ?

CO203.4

Q6. Explain Types of queues? Explain with example? CO203.4 Unit No

4 Unit Title Lists Planned Hrs.

10



1 Definition representation 2 Operations 3 Implementation of singly linked lists 4 Applications of singly linked lists 5 Implementation of doubly linked lists 6 Implementation of doubly linked lists 7 Implementation of circular linked lists. 8 Implementation of stack. using linked lists 9 Implementation of stack. using linked lists 10 Implementation of queue using linked lists

41

Review Questions Q1 Explain the operations that can be performed on a singly linked list? CO203.4 Q2 Explain procedure to modify a node in a doubly circular linked? CO203.4 Q3 Write a sample code to delete a node from doubly linked list? CO203.4 Q4 Write C code to delete nodes with negative data from singly linked list? CO203.4 Q5 Explain with diagram and algorithm, the procedure to delete node

present at location LOC from a doubly linked list? CO203.4

Q6 Explain the operations that can be performed on a doubly linked list? CO203.4 Q7 Write advantages of doubly linked list over singly linked list? CO203.4 Unit No

5 Unit Title: Trees Planned Hrs.

7



1 Basic terminology, representation, 2 binary tree, traversal methods 3 binary search tree, 4 AVL search tree, 5 B tree 6 B+ tree 7 Heaps- Operations and their applications. Review Questions Q1 Explain with example the post order tree traversal techniques? CO203.5 Q2 Explain pre order tree traversal techniques? CO203.5 Q3 Explain the binary search algorithm with example? CO203.5 Q4 Compare binary tree and binary search tree? CO203.5 Q5 Write a note on:

I. Tree II. Binary tree

III. Complete binary tree IV. Almost complete binary tree.

CO203.5

Q6 Compare 'B' tree and B* tree? CO203.5 Q7 Write a C program to find the height of the binary search tree? CO203.5 Q8 Explain Heap Data structure? CO203.5 Unit No

6 Unit Title Graphs Planned Hrs.

6

Lesson schedule Class Details to be covered

42


Course Title : DATA STRUCTURES Duration: 2 Hours Max.

Marks Instructions: 50

1) Attempt any two questions from each section. 2) Figure to the right indicate full marks 3) Assume suitable data if required.

Section-I Marks

1 a What is a Structure? How is it different from an array? 6 b Explain open hashing and closed hashing?

6

2 a Write a 'C' program to implement 'selection sort' algorithm? 6

b What is collision? Explain different methods to resolve collision? 6

3 a What are queues? Explain with example insert and delete operation on queue?

7

No. 1 Basic concept of graph theory 2 storage representation 3 graph traversal techniques- BFS theory and implementation 4 DFS theory and implementation 5 Introduction to Graph representation using sparse matrix. 6 Graph representation using sparse matrix. Review Questions Q1 Explain different terminologies used in graph theory? CO203.6 Q2 Explain linked representation of Graph? CO203.6 Q3 Explain Depth First Search technique in graph? CO203.6 Q4 Write algorithm for 'depth first search graph traversal technique’? CO203.6 Q5 Explain the breadth first graph traversal technique? CO203.6 Q6 Define:

I. Graph II. Connected Graph

III. Complete graph

CO203.6

Q7 Write differences between BFS and DFS? CO203.6 Q8 Explain Depth First Search (DFS) and Breadth First Search (BFS) with

suitable example. CO203.6

43

b Write 'C' program to implement the following operations on stack I) Push II) Pop.

6

Section-II 4 a Write a sample code to delete a node from doubly linked list. 6 b Write a sample code to delete a node from doubly linked list. 6

5 a Write short notes. (any three only) I. Tree 7

II. Binary tree III. Complete binary tree IV. Almost complete binary tree

b Explain the binary search algorithm with example. 6 6 a Write algorithm for depth first search graph traversal technique? 6

b Explain different terminologies used in graph theory? 6

DATA STRUCTURES Time:1 Hour Max. Marks: 50 Marks

1 If a variable is a pointer to a structure, then which of the following operator is used to access data members of the structure through the pointer variable?

a. * b. & c. -> d. .

1

2 In C, if you pass an array as an argument to a function, what actually gets passed? a. Value of elements in array b. First element of the array

c. Base address of the array d. Address of the last element of array

2

3 Which of the following data structure is not linear data structure? a. Arrays b. Linked lists c. Both of above d. None of above

1

4 Arrays are best data structures a. for relatively permanent collections of data b. for the size of the structure and the data in the structure are constantly changing c. for both of above situation d. for none of above situation

1

5 2. The time factor when determining the efficiency of algorithm is measured by a. Counting microseconds b. Counting the number of key operations c. Counting the number of statements d. Counting the kilobytes of algorithm

1

6 Running merge sort on an array of size n which is already sorted is 1

44

a. O(n) b. O(nlogn) c. O(n2) d. None 7 If the given input array is sorted or nearly sorted, which of the following algorithm

gives the best performance? a. Insertion sort b. Selection sort c. Quick sort d. Merge sort

1

8 The data structure required for Breadth First Traversal on a graph is? a. Stack b. Array c. Queue d. Tree

1

9 14. A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is? a. Queue b. Circular queue c. Dequeue d. Priority queue

1

10 The postfix form of the expression (A+ B)*(C*D- E)*F / G is? a. AB+ CD*E - FG /** b. AB + CD* E - F **G / c. AB + CD* E - *F *G / d. AB + CDE * - * F *G /

2

11 Which data structure is used for implementing recursion? a. Queue b. Stack c. Array d. List

1

12 Consider the linked list implementation of a stack. Which of the following node is considered as Top of the stack? a. First node b. Last node c. Any node d. Middle node

1

13 Consider the following operation performed on a stack of size 5. Push(1); Pop(); Push(2); Push(3); Pop(); Push(4); Pop(); Pop(); Push(5); After the completion of all operation, the no of element present on stack are a. 1 b. 2 c. 3 d. 4

2

14 Which of the following operations is performed more efficiently by doubly linked list than by singly linked list? a. Deleting a node whose location in given b. Searching of an unsorted list for a given item c. Inverting a node after the node with given location d. Traversing a list to process each node

1

15 Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the end node of the linked list a. I and II b. I and III c. I,II and III d. I,II,III and IV

1

16 In linked list each node contain minimum of two fields. One field is data field to store the data second field is? a. Pointer to character b. Pointer to integer

1

45

c. Pointer to node d. Node 17 What would be the asymptotic time complexity to add a node at the end of singly

linked list, if the pointer is initially pointing to the head of the list? a. O(1) b. O(n) c. θ (n) d. θ (1)

1

18 The height of a BST is given as h. Consider the height of the tree as the no. of edges in the longest path from root to the leaf. The maximum no. of nodes possible in the tree is? a. 2h-1 -1 b. 2h+1 -1 c. 2h +1 d. 2h-1 +1

1

19 Which of the following statement about binary tree is CORRECT? a. Every binary tree is either complete or full b. Every complete binary tree is also a full binary tree c. Every full binary tree is also a complete binary tree d. A binary tree cannot be both complete and full

1

20 If a node having two children is to be deleted from binary search tree, it is replaced by its a. In-order predecessor b. In-order successor c. Pre-order predecessor d. None

1

21 the run time for traversing all the nodes of a binary search tree with n nodes and printing them in an order is a. O(nlg(n)) b. O(n) c. O(√n) d. O(log(n))

1

22 The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal a. ABFCDE b. ADBFEC c. ABDECF d. ABDCEF

2

23 Which of the following sorting algorithm is of divide-and-conquer type? a. Bubble sort b. Insertion sort c. Quick sort d. All of above

1

24 An algorithm that calls itself directly or indirectly is known as a. Sub algorithm b. Recursion c. Polish notation d. Traversal algorithm

1

25 In a Heap tree a. Values in a node is greater than every value in left sub tree and smaller than right sub tree b. Values in a node is greater than every value in children of it c. Both of above conditions applies d. None of above conditions applies

1

26 In full binary search tree every internal node has exactly two children. If there are 100 leaf nodes in the tree, how many internal nodes are there in the tree? a. 25 b. 49 c. 99 d. 101

2

27 If n numbers are to be sorted in ascending order in O(nlogn) time, which of the following tree can be used a. Binary tree b. Binary search tree

1

46

c. Max-heap d. Min-heap

28 K4 and K3 are graphs with the following structure.

Which one of the following statements is TRUE in relation to these graphs? a. K4 is planar while Q3 is not b. Q3 is planar while K4 is not c. Both K4 and Q3 are planar d. Neither K4 nor Q3 is planar

2

29 Leaves of which of the following trees are at the same level? a. Binary tree b. B-tree c. AVL-tree d. Normal Tree

1

30 If you traverse a tree in the Inorder and find sorted listing of elements then it is a a. Binary search tree b. Binary tree c. Heap d. None of the above.

1

31 Evaluate the postfix expression 3574-2^*+ a. 41 b. 45 c. 48 d. None of the above.

2

32 A tree cannot contain cycles. a. True b. False

1

33 Key value pair is usually seen in __________. a. Hash Tables b. Heaps c. Both a and b d. Skip list

1

34 Where can we use Breadth First Search(BFS)? a. Binary trees b. Stacks c. Graphs d. Both a and c

1

35 Which of the following is the fastest sorting algorithm to sort a list? a. Quick sort b. Bubble sort c. Binary sort d. Linear sort

1

36 The complexity of merge sort algorithm is a. O(n) b. O(log n) c. O(n2) d. O(n log

1

47

n) 37 Int f (int a, int *pb, int **ppc)

{ int b, c; **ppc += 1; c = *ppc; *pb += 2; b = *pb; a += 3; return a + b + c; } a. 19 b. 18 c. 22 d. 24

2

38 The array that represents a binary max-heap is a. {25, 12, 16, 13, 10, 8, 14} b. {25, 14, 16, 13, 10, 8, 12} c. {25, 14, 12, 13, 10, 8, 16} d. {25, 14, 13, 16, 10, 8, 12}

1

39 On the correct answer to the previous question, the content of the array after two delete operations is a. {14, 13, 8, 12, 10} b. {14, 13, 12, 10, 8} c. {14, 12, 13, 8, 10} d. {14, 13, 12, 8, 10}

2

40 Unsigned int max (unsigned int, i, unsigned int a) { if i>0 return i%max (i/a, a); else return 0; } This recursive C function takes 2 arguments. When the function max is called as max (513, 2) the return value will be a. 2 b. 1 c. 7 d. 6

2

void main() { int z, *y, **x, z = 4; y = &z; x = &y; printf (“%d”, f (z, y, x)); }

48

DC Course Plan

Course Code CO204 Course Data Communications Prepared by Mr. Vinayak N. Malawade Date 09/05/2018 Pre-requisites The students should know the Fundamentals of Data Structure and algorithms.

Fundamentals of Digital Electronics.

Course Outcomes At the end of the course the students should be able to: CO204.1 Describe1 various Computer Network models Protocols and Standards. CO204.2 Explain2 basic concepts and principles of Data Communication. CO204.3 Choose2 Network component and Transmission Media for the communication. CO204.4 Apply3 Error Detection and Correction techniques to the data CO204.5 Compare4 F different collision avoidance techniques

CO204.6 Design5 small networks using Network Standards.


POs COs

a b c d e f g h i j k l m

CO204.1 2 1 1 1 2 CO204.2 1 1 3 1 CO204.3 3 1 2 2 1 2 CO204.4 2 1 2 1 1 CO204.5 1 1 1 2 2 1 3 CO204.6 1 2 1 1 1 Mild correlation 2 Moderato correlation 3 Strong correlation

Course Contents

Unit No. Title No. of Hours Section I

1.

Introduction: 1. Introduction : Data communications, Networks, Protocols &

standards 2. Network Models:- Layered Tasks, The OSI model, Layers in

the OSI model, TCP/IP protocol suit, ATM reference model.

3+4

2.

Communication Basics: 3. Data & Signals :- Analog & Digital, Periodic analog signals,

digital signals, Transmission Impairments, Data rate limits & Performance

4. Digital Transmission :- Line coding & line coding schemes (Unipolar, polar & bipolar) Transmission models

5+3

49

3

Physical Layer: 5. Transmission media :- Guided, Unguided media 6. Network Hardware components:-Transceivers & media

converters, Repeaters, NIC & PC cards, Bridges, switches, Routers

4+4

Section II

4

Data Link Layer: 7. Error detection & correction: Block coding, cyclic codes,

checksum 8. Data Link Control :- Framing, Flow & error control, stop &

wait protocol, sliding window protocol, HDLC protocol.

3+5

5.

The medium Access control: 9. Channel allocation Problem, Multiple Access Protocols,

ALHOA, CSMA, collision free protocols, Limited contention protocols.

7

6

IEEE standards For LANS & MANS: 10 802.3 Standard & Ethernet, 802.4 Standard & Token Bus, 802.5 Standard & Token Ring, Comparison of 802.3, 802.4 and 802.5, 802.6 standard (DQDB) and 802.2 logical link control..

8

Reference Books:

Sr. No.


1 Data Communications and Networking

Behrouz A Forouzan

The McGraw Hill 1,2,3,4,5,7,8

2 Computer Networks(5th Edition) Andrew S. Tanenbaum

Prentice Hall 9,10,11

3 Computer communications and Networking Technologies

Michael A Gallo Cengage Learning

6

4 Data & computer communications William Stallings

Pearson Education

1,2

5 Data communication and computer Networks

Ajit Pal PHI Learning 6

Evaluation scheme

Examination Scheme

Theory Term Work OE Total

Max. Marks 50(TH)+50(Online) -- -- 100 Contact 4 -- -- 4

50

Hours/ week

Scheme of Marks

Unit No. Title Marks 1 Introduction 25 2 Communication Basics 3 Physical Layer 4 Data Link Layer 25 5 The medium Access control 6 IEEE standards For LANS & MANS

Course Unitization

CO Evaluation Notes CO204.1

CAT 1


CO204.2 CO204.3

CO204.4

CAT 2


CO204.5

CO204.6


Section I

Unit No 1 Unit Title Introduction Planned Hrs. 7

Lesson schedule Class No. Details to be covered 1 Introduction :Data communications 2 Networks 3 Protocols & standards 4 Network Models: Layered Tasks 5 The OSI model 6 Layers in the OSI model 7 TCP/IP protocol suit, ATM reference model Review Questions Q1 Briefly write functionalities of different OSI layers? CO204.1 Q2 What are the seven layers of ISO’s OSI model? CO204.1

51

Q3 How two adjacent layers communicate in a layered network? (or What do you mean by Service Access Point?)

CO204.1

Q4 What are the key benefits of layered network? CO204.1 Q5 Briefly write functionalities of different TCP/IP layers? CO204.1 Q6 Briefly Explain AMT references model CO204.1 Q7 Why it is necessary to have layering in a network? CO204.1 Unit No. 2 Unit Title Communication Basics Planned

Hrs 08

Lesson schedule Class No. Details to be covered 1 1.1 Data & Signals: Analog & Digital 2 Periodic analog signals 3 digital signals 4 Transmission Impairments 5 Data rate limits & Performance Network Models 6 Digital Transmission: Line coding 7 line coding schemes (Unipolar, polar & bipolar) 8 Transmission models Review Questions Q1 Between RZ and NRZ encoding techniques, which requires higher bandwidth and

why? CO204.2

Q2 How does Manchester encoding differ from differential Manchester encoding? CO204.2 Q3 What do you mean by a “Periodic Signal”? And what are the three parameters that

characterize it? Distinguish between data and signal. CO204.2

Q4 What do you mean by the Bit Interval and Bit rate in a digital signal? CO204.2 Unit No. 3 Unit Title Physical Layer Planned

Hrs 8

Lesson schedule Class No. Details to be covered 1 Transmission media: Guided 2 Classify various Transmission Media. 3 Twisted-pair, Coaxial cable, Optical fiber cables 4 Unguided media 5 Network Hardware components: Transceivers & media converters, 6 Repeaters, 7 NIC & PC cards, Bridges, 8 switches, Routers Review Questions Q1 In what way multi-mode and single-mode fibers differ? CO204.3 Q2 Why does single-mode fibers are used for large distance communications rather

than multi-mode fibers? CO204.3

Q3 What is multiplexing? Explain transmission characteristics of CAT 5 cable. CO204.3 Q4 Explain what the classes of guided media are and which type of connectors are CO204.3

52

used for each? CO204.6 Q5 Explain in detail different Network hardware component? CO204.3 Unit No. 4 Unit Title Data Link Layer Planned

Hrs 08

Lesson schedule Class No. Details to be covered 1 Error detection & correction: What is mean by Error detection & correction 2 Block coding ,cyclic codes 3 Checksum 4 Data Link Control: Framing 5 Flow & error control 6 stop & wait protocol 7 sliding window protocol 8 HDLC protocol Review Questions Q1 Explain the use of parity check for error detection? CO204.4 Q2 Explain different types of Errors? CO204.4 Q3 Obtain the 4-bit CRC code word for the data bit sequence 10011011100 (leftmost

bit is the least significant) using the generator polynomial given in the previous problem.

CO204.4

Q4 What is mean by Flow & error control? Explain stop and wait protocol? CO204.4 Q5 What is mean by Flow & error control? Explain sliding window protocol? CO204.4

Unit No 5 Unit Title The medium Access control Planned Hrs. 7

Lesson schedule Class No. Details to be covered 1 Channel allocation Problem 2 Switching Techniques 3 Multiple Access Protocols 4 ALHOA 5 CSMA 6 collision free protocols 7 Limited contention protocols Review Questions Q1 What is ALOHA? How throughput is improved in slotted ALOHA over pure

ALOHA? CO204.3

Q2 What is vulnerable time in Network? Comment on” Vulnerable time in CSMA protocol”

CO204.4

Q3 What is collision? Why the probability of collision in more in 1-persistent CSMA protocol?

CO204.4

Q4 Explain controlled access mechanism using polling technique. CO204.5 Q5 Explain how carrier sense multiple access (CSMA) protocol works with suitable CO204.4

53

diagram.

Unit No 6 Unit Title IEEE standards For LANS & MANS Planned Hrs.

Lesson schedule Class No. Details to be covered 1 802.3 Standard & Ethernet 2 802.4 Standard & Token Bus 3 802.5 Standard & Token Ring 4 Comparison of 802.3, 802.4 and 802.5, 5 802.6 standard (DQDB) and 802.2 logical link control. Review Questions Q1 What is Ethernet (MAC) address? What are the various destination address types? CO204.1 Q2 Explain frame format of IEEE802.3 Ethernet. CO204.1 Q3 Explain different types of addresses used in Ethernet CO204.1 Q4 Why there is a need for limit on maximum and minimum frame length in Ethernet? CO204.2 Q5 Comment on “Cables used in IEEE802.3 standard Ethernet” CO204.1

Model Question Paper Course Title : Data Communication Duration 03 Hours Max.

Marks Instructions: 50

Solve any two questions from each section. Figures to the right indicate full marks. Assume suitable data if necessary

Section-I Marks 1 a Explain various data communication characteristics 4

b What are the transmission media? How the performance of twisted pair cable is measured?

4

c What is bit rate? We need to download text document at the rate of 100 pages per minute. What is the required bit rate of the channel(Page size is 24 lines with 80 characters per line and each character is encoded with 8 bits)

5

2 a What is composite signal? Explain with example. 4 b What are transmission impairments? Explain any one example. 4

C What is the role of multiplexing in data communication? Explain frequency division multiplexing with suitable diagram

5

54

3 a What are the line coding schemes? Explain any one with example/ 6 b How data transfer takes place in datagram networks? 6

Section-II Marks 4 a Draw and explain OSI network model 7

b Explain how go-back-N protocol works 6 5 a What is the role of flow control mechanism in data link layer? Explain

any protocol which runs flow control mechanism? 8

b What is Ethernet (MAC) address? What are the various destination address types?

4

6 a What is HDLC? Explain HDLC frame format. 7 b Explain how carrier sense multiple access (CSMA) protocol works

with suitable diagram. 6

Model Question Paper (Multiple choice questions) Course Title: Computer Graphics Max. Marks: 50 Duration: 1 Hour 1 The _______ is the physical path over which a message travels.

a) Protocol b) Medium c) Signal d) ) All the above

2 The information to be communicated in a data communications system is the _______. a) Medium b) Protocol c) Message d) Transmission

3 Frequency of failure and network recovery time after a failure are measures of the _______ of a network. a) Performance b) Reliability c) Security d) Feasibility

4 An unauthorized user is a network _______ issue. a) Performance b) Reliability c) Security d) All the above

5 Which topology requires a multipoint connection? a) Mesh b) Star c) Bus d) Ring

6 Communication between a computer and a keyboard involves ______________ transmission.

a) simplex b) half-duplex c) full-duplex d) automatic 7 A television broadcast is an example of _______ transmission.

a) simplex b) half-duplex c) full-duplex d) automatic 8 Which organization has authority over interstate and international commerce in the

communications field? a) ITU-T b) IEEE c) FCC d) ISOC

9 _______ is the protocol suite for the current Internet. a) TCP/IP b) NCP c) UNIX d) ACM

10 ______ refers to the physical or logical arrangement of a network. a) Data flow b) Mode of operation c) Topology d) None of the

above

55

11 A periodic signal completes one cycle in 0.001 s. What is the frequency? a) 1 Hz b) 100 Hz c) 1 KHz d) 1 MHz

12 Data can be ________. a) analog b) digital c) (a) or (b) d) none of the above

13 _______ data have discrete states and take discrete values. a) Analog b) Digital c) (a) or (b) d) None of the

above 14 Transmission media are usually categorized as _______.

a) ) fixed or unfixed b) guided or unguided

c) determinate or indeterminate

d) Metallic or nonmetallic

15 Transmission media lie below the _______ layer. a) physical b) network c) transport d) application

16 _______ cable consists of an inner copper core and a second conducting outer sheath. a) Twisted-pair b) Coaxial c) Fiber-optic d) Shielded

twisted-pair 17 In fiber optics, the signal is _______ waves.

a) light b) radio c) infrared d) very low-frequency

18 Which of the following is not a guided medium? a) twisted-pair cable b) coaxial cable c) fiber-optic cable d) atmosphere

19 The inner core of an optical fiber is _______ in composition. a) glass or plastic b) copper c) bimetallic d) liquid

20 Signals with a frequency below 2 MHz use _______ propagation. a) ground b) sky c) line-of-sight d) none of the

above 21 A(n) _____ medium provides a physical conduit from one device to another.

a) guided b) unguided c) either (a) or (b) d) none of the above

22 _______ cable is used for voice and data communications.

a) Coaxial b) Fiber-optic c) Twisted-pair d) none of the above

23 _____ cable can carry signals of higher frequency ranges than _____ cable. a) Twisted-pair; fiber-

optic b) Coaxial; fiber-

optic c) Coaxial; twisted-

pair d) none of the

above

24 ______ cables carry data signals in the form of light. a) Coaxial b) Fiber-optic c) Twisted-pair d) none of the

above 25 Radio waves are _________.

a) omnidirectional b) unidirectional c) bidirectional d) none of the above

26 ..... ________ are used for short-range communications such as those between a PC and a

56

peripheral device. a) Radio waves b) Microwaves c) Infrared waves d) none of the

above 27 Which of the following could not be an Ethernet unicast destination?

a) 43:7B:6C:DE:10:00 b) 44:AA:C1:23:45:32

c) 46:56:21:1A:DE:F4

d) 48:32:21:21:4D:34

28 _______ is the most widely used local area network protocol. a) Token Ring b) Token Bus c) Ethernet d) None of the

above 29 The IEEE 802.3 Standard defines _________ CSMA/CD as the access method for first-generation 10-

Mbps Ethernet. a) 1-persistent

b) p-persistent c) Non-persistent d) None of the

above 30 The _______ layer of Ethernet consists of the LLC sublayer and the MAC sublayer.

a) Data link b) Physical c) Network d) None of the above

31 1. The minimum frame length for 10-Mbps Ethernet is _______bytes. a) 32 b) 80 c) 128 d) None of the

above 32 __________ uses thin coaxial cable.

a) 10Base5 b) 10Base2 c) 10Base-T d) 10Base-F 33 ________ uses fiber-optic cable.

a) 10Base5 b) 10Base2 c) 10Base-T d) 10Base-F 34 In _________, auto negotiation allows two devices to negotiate the mode or data rate of operation.

a) Standard b) Fast Ethernet c) Gigabit Ethernet d) Ten-Gigabit Ethernet

35 Gigabit Ethernet has a data rate of ________Mbps. a) 10 b) 100 c) 1000 d) 10000

36 __________uses two optical fibers and a long-wave laser source. a) 1000Base-SX b) 1000Base-LX c) 1000Base-T d) None of the

above 37 ________ uses 1550-mm single mode fiber.

a) 10GBase-S b) 10GBase-L c) 10GBase-E d) None of these 38 In ________ each station sends a frame whenever it has a frame to send.

a) Pure ALOHA b) Slotted ALOHA c) Both (a) and (b) d) Neither (a) nor (b)

39 In slotted ALOHA, the vulnerable time is ______ the frame transmission time.

a) The same as b) two times c) three times d) None of the above 40 The vulnerable time for CSMA is the ________propagation time.

a) The same as b) two times c) three times d) None of the above

41 In ___________ methods, no station is superior to another station and none is assigned the control over another. a) Random access b) Controlled access c) Channelization d) None of the

above 42 ________ requires that each station first listen to the medium before sending.

57

a) MA b) CSMA c) FDMA d) CDMA 43 In _______ methods, a station cannot send unless it has been authorized by other stations.

a) Random access b) Controlled access c) Channelization d) none of these 44 ___________in data link layer separates a message from one source to a destination or from other

messages to other destinations. a) Filtering b) Framing c) Error detection d) Controlling

45 Any time when an error is detected in an exchange, specified frames are retransmitted. This process is known as_________________ a) Flow control b) Error control c) Media access

control d) Automatic

repeat request 46 In _______ framing, there is no need for defining the boundaries of frames.

a) Fixed-size b) Variable-size c) Standard d) None of the above

47 The Internet model consists of _______ layers. a) Three b) Five c) Seven d) Eight

48 The _______ layer is the layer closest to the transmission medium. a) Physical b) Data link c) Network d) Transport

49 Layer 2 lies between the physical layer and the _______ layer. a) Network b) Data link c) Transport d) None of the

above 50 The _______ model shows how the network functions of a computer thought to be organized.

a) CCITT b) OSI c) ISO d) ANSI

58

Course Plan

Course MICROPROCESSORS Course Code

Examination Scheme

Theory Marks Term Work Oral Total Written Online

Max. Marks 50 50 25 50 175 Contact Hours/ week

3 2 -- 5

Prepared by Mr. Shivaprasad S. More, Mr. Arvind S. Kamble

Date : 22/05/2018

Prerequisites Students should have the knowledge of Basic Electronics.

Students should have the knowledge of C programming language. Course Outcomes At the end of the course the students should be able to:

CO205.1 Explain2 the students to architectures of basic microprocessors. CO205.2 Write5 the hands on experience on assembly language programming for

microprocessors. CO205.3 Describe1 the architecture and Instruction set of 8085 and to develop assembly language

programs. CO205.4 Recognize1 use the program control instructions. CO205.5 Illustrate4 the operation of memory paging mechanism CO205.6 Revise5 how the memory is accessed using protected mode addressing CO205.7 Explain2 the operation of each data addressing mode, memory addressing mode CO205.8 State1 the Internal structure of Pentium Processor


POs COs

a b C D E F G H i j k m

CO205.1 1 2 3 2 2 CO205.2 1 2 1 1 2 1 CO205.3 3 2 1 CO205.4 2 1 2 3 1 CO205.5 CO205.6 3 2 2 CO205.7 2 2 1 Mild correlation 2 Moderato correlation 3 Strong correlation

59

Course Contents


Section I 1 Intel 8085 Architecture & Programming

1.1 Architecture of 8085 1.2 Instruction set & Execution in 8085 1.3 Classification of Instructions 1.4 Instruction set of 8085 1.5 Sample Programs 1.6 Assembler 1.7 Assembly Language Programs

6

2 Microprocessor and Architecture 2.1 The Microprocessor Based Personal Computer System. 2.2 Internal Microprocessor Architecture 2.3 Real Mode Memory Addressing 2.4 Introduction to Protected Mode memory Addressing 2.5 Memory Paging

6

3 Addressing Modes and Data Movement Instructions 3.1 Data Addressing Modes 3.2 Program Memory Addressing Mode 3.3 Stack Memory Addressing Mode 3.4 MOV Revisited 3.5 PUSH/POP 3.6 Load Effective Address 3.7 String Data Transfer 3.8 Miscellaneous Data Transfer Instruction 3.9 Segment Override Prefix 3.10 Assembler Details

6

Section II

4 Arithmetic, Logic & Program Control Instructions

4.1 Addition ,Subtraction and Comparison 4.2 Multiplication and Division 4.3 BCD and ASCII Arithmetic 4.4 Basic Logic Instructions 4.5 Shift and Rotate 4.6 The Jump Group 4.7 Controlling the Flow of program 4.8 Machine control and Miscellaneous Instructions

6

5 Interrupts and The 80386 Microprocessor 5.1 Basic Interrupt Processing 5.2 Hardware Interrupt 5.3 The80386 Microprocessor: The memory System 5.4 Special 80386 Registers

6

60

5.5 80386 Memory Management 5.6 Virtual 8086 Mode 5.7 The Memory Paging Mechanism

6 Pentium , Pentium Pro and Pentium 4 Microprocessor 6.1 The Pentium Microprocessor : The Memory System 6.2 Special Pentium Registers 6.3 Pentium Memory Management 6.4 The Pentium Pro Microprocessor : Internal structure of the Pentium Pro 6.5 The Pentium 4 : Memory Interface, Register Set, Hyper Threading Technology CPUID

4

Text Books:

Sr. No. Title of Book Author Publisher/Edition Topics 1 The INTEL Microprocessors -

Architecture ,Programming and Interfacing

Barry B. Brey Seventh Edition

PHI Ltd 2,3,4,5,6

2 Microprocessors and Microcontrollers

N. Senthi Kumar, M. Saravanan and S. Jeevananthan

Oxford University Press 1,2

Reference Books:

Sr. No. Title of Book Author Publisher/Edition Topics 1 Microprocessor Architecture,

Programming and Applications with 8085

Ramesh Gaonkar Prentice-Hall International 1

2 The Microcomputer systems: The 8086/8088 Family

Yu Cheng Liu , Glenn A. Gibson

PHI Ltd 1

Scheme of Marks

Section Unit No. Title Marks I

1 Intel 8085 Architecture & Programming 16 2 Microprocessor and Architecture 18 3 Addressing Modes and Data Movement Instructions 16

II 4 Arithmetic, Logic & Program Control Instructions 18 5 Interrupts and The 80386 Microprocessor 18 6 Pentium , Pentium Pro and Pentium 4 Microprocessor 14

61

Course Unitization

Section

Unit Course Outcomes No. of Questions in

No. Title CAT-I CAT-II I

1 Intel 8085 Architecture & Programming

CO205.1, CO205.2, CO205.3

2 --

2 Microprocessor and Architecture

CO205.4 2 --

3 Addressing Modes and Data Movement Instructions

CO205.5, CO205.7

2 --

II

4 Arithmetic, Logic & Program Control Instructions

CO205.6 -- 2

5 Interrupts and The 80386 Microprocessor

CO205.7, CO205.5

-- 2

6 Pentium , Pentium Pro and Pentium 4 Microprocessor

CO205.8 -- 2


Section I

Unit No 1 Unit Title: Intel 8085 Architecture & Programming Planned Hrs. 6

Unit Outcomes At the end of this unit the students should be able to:

UO1 To have an in depth knowledge of the architecture of 8-bit microprocessor -8085 CO205.1, CO205.2

UO2 To have knowledge of instructions set of 8085 CO205.3 UO3 They able to write simple programs CO205.3 UO4 To have knowledge of Assembler and assembly Language program CO205.2

Lesson schedule

Class No. Details to be covered 1 Architecture of 8085 2 Instruction set & Execution in 8085, Classification of Instructions 3 Instruction set of 8085 4 Sample Programs 5 Assembler 6 Assembly Language Programs

Review Questions

Q1 What is microprocessor? What the difference between microprocessor and CO205.2

62

CPU? Q2 Explain the microprocessor architecture of 8085 and its operations? CO205.3 Q3 How does microprocessor know what operation to perform first (Read/write

memory or read /write I/O? CO205.3

Q4 What is instruction set of 8085? Explain its classification? CO205.2 Q5 What is an assembler? CO205.3 Q6 What are the advantages of an assembly language in comparison with high

level languages? CO205.3

Unit No 2 Unit Title Microprocessor and Architecture Planned

Hrs. 6

Unit Outcomes At the end of this unit the students should be able to: UO1 Describe the function and purpose of each program visible register in the 8086-

core2 microprocessors. CO205.4

UO2 Detail the flag register and the purpose of each flag bit. CO205.4 UO3 Describe How memory is accessed using real mode-addressing techniques. CO205.4 UO4 Describe How memory is accessed using protected mode memory-addressing

techniques. CO205.4

UO5 Detail the operation of the memory paging mechanism. CO205.4


1 Introduction to Microprocessor Based Personal Computer System. 2 Internal Microprocessor Architecture 3 Real Mode Memory Addressing 4 Introduction to Protected Mode memory Addressing 5 Protected Mode memory Addressing 6 Memory Paging

Review Questions

Q1 Real mode memory addresses allow access to memory below which memory address?

CO205.4

Q2 Which register cater to the accessing of the stack segment? CO205.4 Q3 Explain the real mode memory addressing scheme using a segment address

plus an offset. CO205.4

Q4 Explain internal architecture of 80286 with neat diagram? CO205.4 Q5 Explain memory paging? Draw the control register of the microprocessor? CO205.4

Unit No 3 Unit Title: Addressing Modes and Data Movement Instructions

Planned Hrs. 6


UO1 Use the data-addressing modes to from assembly language statements. CO205.5, CO205.7

UO2 Use the program memory addressing modes to from assembly and machine language statements.

CO205.5, CO205.7

63

UO3 Select the appropriate addressing mode to accomplish a given task. CO205.5 UO4 Describe the sequence of events that place data onto the stack or remove data

from the stack. CO205.5, CO205.7

UO5 Use the assembler to set up data segment, stack and code segments. CO205.5


1 Data Addressing Modes, Program Memory Addressing Mode 2 Stack Memory Addressing Mode , MOV Revisited 3 PUSH/POP, Load Effective Address 4 String Data Transfer 5 Miscellaneous Data Transfer Instruction 6 Segment Override Prefix, Assembler Details

Review Questions

Q1. Explain the 8086-core2 data addressing modes? CO205.5, CO205.7

Q2. Write two instructions using register addressing? CO205.5, CO205.7

Q3. What are the three program memory addressing modes? CO205.5 Q4. Explain the Stack Memory Addressing Mode? CO205.5,

CO205.7 Q5. Explain following instructions

I. DI and SI II. LODS

III. STOS IV. MOVS

CO205.5

Q6. Explain how the OUT DX, AX instruction operates? CO205.5, CO205.7

Q7. What is segment override prefix? CO205.5, CO205.7

Q8. How directives different from instructions? CO205.5

Section II

Unit No 4 Unit Title: Arithmetic, Logic & Program Control Instructions

Planned Hrs. 6


UO1 Learn Addition ,Subtraction and Comparison Multiplication and Division CO205.6 UO2 Use of BCD and ASCII Arithmetic CO205.6 UO3 Use of Basic Logic Instructions CO205.6 UO4 Use of Shift and Rotate, The Jump Group, Controlling the Flow of program CO205.6 UO5 Use of Machine control and Miscellaneous Instructions CO205.6

Lesson schedule

Class No. Details to be covered 1 Addition ,Subtraction and Comparison, Multiplication and Division

64

2 BCD and ASCII Arithmetic 3 Basic Logic Instructions 4 Shift and Rotate, The Jump Group 5 Controlling the Flow of program 6 Machine control and Miscellaneous Instructions

Review Questions

Q1 What are program control instructions? Explain with example. CO205.6 Q2 Write a program to show basic arithmetic instruction execution. CO205.6 Q3 What are different machine instructions? CO205.6 Q4 What are different Miscellaneous Instructions? CO205.6 Q5 How the Shift and Rotate, The Jump Group instructions actually work? CO205.6 Q6 Explain basic logic instructions. CO205.6 Q7 Write a 8085 assembly language program to add two 8-bit numbers. CO205.6 Q8 Write a 8085 assembly language program to multiply two 8-bit numbers. CO205.6

Unit No 5 Unit Title Interrupts and The 80386 Microprocessor

Planned Hrs. 6


UO1 Use of Basic Interrupt Processing, Hardware Interrupt CO205.7 UO2 Use of & working of the 80386 Microprocessor: The memory System CO205.7 UO3 Use of Special 80386 Registers & Memory Management CO205.7 UO4 Use of & working of Virtual 8086 Mode CO205.7 UO5 Use of the Memory Paging Mechanism CO205.7,

CO205.5


1 Basic Interrupt Processing, Hardware Interrupt 2 The80386 Microprocessor: The memory System 3 Special 80386 Registers 4 80386 Memory Management 5 Virtual 8086 Mode 6 The Memory Paging Mechanism

Review Questions

Q1 Explain what is mean by interrupt and importance of it. CO205.7 Q2 Explain difference between software and hardware interrupts. CO205.7 Q3 Write a note on: Special 80386 Registers CO205.7 Q4 Explain in detail Virtual 8086 Mode. CO205.7 Q5 Explain in detail : The Memory Paging Mechanism CO205.7,

CO205.5 Q6 Explain architecture of The 80386 Microprocessor CO205.7 Q7 Explain about 80386 Memory Management CO205.7

Unit No 6 Unit Title: Pentium , Pentium Pro and Pentium 4 Microprocessor

Planned Hrs. 4

65


UO1 Use & working of the Pentium Microprocessor, it’s special registers. CO205.8 UO2 Use & working of the Pentium Microprocessor’s memory system. CO205.8 UO3 Use & working of Internal structure of the Pentium Pro. CO205.8 UO4 Use & working ox the Pentium 4 CO205.8



1 The Pentium Microprocessor : The Memory System Special Pentium Registers 2 Pentium Memory Management 3 The Pentium Pro Microprocessor : Internal structure of the Pentium Pro 4 The Pentium 4 : Memory Interface, Register Set,

Hyper Threading Technology CPUID Review Questions

Q1 Explain architecture of Pentium Microprocessor. CO205.8 Q2 Write a note on following:

1) Memory System. 2) Special Pentium Registers.

CO205.8

Q3 Explain architecture of Pentium Pro Microprocessor. CO205.8 Q4 Explain in detail Internal structure of the Pentium Pro. CO205.8 Q5 Explain following concepts in detail: Memory Interface, Register Set, and Hyper

Threading Technology CPUID. CO205.8


Course Title : MICROPROCESSORS Duration: 3 Hours Max.

Marks

Instructions: 100 Attempt any three questions from each section. Figure to the right indicate full marks Assume suitable data if required.

Section-I Marks 1 a Explain the microprocessor architecture of 8085 and its operations? 6

b What is instruction set of 8085? Explain its classification? 6 2 a Explain memory paging? Draw the control register of the microprocessor? 7

b Explain the real mode memory addressing scheme using a segment address plus an offset.

6

3 a Explain following instructions (ANY THREE) I. DI and SI II. LODS III. STOS IV. MOVS

(2+2+2)

b What are the three program memory addressing modes? 6

Section-II Marks

66

4 a Explain architecture of Pentium Pro Microprocessor? 6 b Explain in detail Virtual 8086 Mode? 6

5 a Write a note on: Special 80386 Registers? 6 b What are program control instructions? Explain with example? 7

6 a Write a program to show basic arithmetic instruction execution? 6 b Explain in detail Internal structure of the Pentium Pro? 6

Assignments:

Experiment list is common for all batches.

Sr.No

Experiment Titles Section-A

8085 Instruction Set I. Arithmetic and Logic Instructions

1 Introduction to 8085 pin diagram and description. 2 8085 assembly language program to add two 8-bit add two 16-bit numbers 3 8085 assembly language program to subtract two 8-bit numbers 4 8085 assembly language program to multiply two 8-bit numbers using successive addition 5 8085 assembly language program to divide 16-bit number by an 8-bit number II. Branching Instructions 6 8085 assembly language program to find the largest number in the array 7 8085 assembly language program to find sum of Series of numbers 8 8085 assembly language program to sort the number in ascending order III. Data Transfer Instructions 9 8085 assembly language program to transfer block from one memory location to another

memory location Section-B 8086,80286 & 80386 Instruction Set

10 Introduction to MASM software. 11 Write an 8086 assembly language program to add the content of memory location 2000H:

0500H to contents of 3000H: 0600H and store result in 5000H: 0700H. 12 Write an 8086 assembly language program to move the contents of the memory location

0500H to register BX and CX.

67

Course Plan

Course Code CS206 Course Programming Lab - I

Prepared by Dr. Mrs. B. C. Melinmath / Ms. S. A.

Pardeshi Date 10/5/2018

Prerequisites To acquire programming concepts, the students should would have the basics

of the programming in terms algorithm, flowcharts and basics of programming constructs.

Course Outcomes At the end of the course the students should be able to : CO206.1 Explain2 basics of C programming language CO206.2 Explain2 use of Arrays and Strings CO206.3 Appy3 function feature of C programming CO206.4 Explain2 use of pointers CO206.5 Explain2 use of structures and unions CO206.6 Explain6 Use of File Handling Concepts. Mapping of COs with POs

POs COs

a b c d e f g h i j k l m

CO206.1 2 2 3 CO206.2 2 3 3 2 CO206.3 3 2 3 2 CO206.4 1 1 3 2 CO206.5 1 3 CO206.6 1 3 2 1 Mild correlation 2 Moderate correlation 3 Strong correlation

Course Contents


Section I 1.1 Unit 1: An Overview of C : To Acquire the essential basics of

programming techniques like writing algorithms, representing flowcharts and learning basics of programming with the help of C Programming, The Form of a C Program, The Basic Data Types, Compilers vs. Interpreters

10

68

1.2 Expressions – Modifying the Basic Types, Identifies Names, Variables. The Four C Scopes, Type Qualifiers-const, volatile, Storage Class Specifiers.

1.3 The C program compilation- The Compilation, Library and Linking, Separate Compilation, Compiling a C Program, C's Memory Map;

1.4 Console I/O: Reading and Writing Characters, Reading and Writing Strings, Formatted Console I/O, printf(), scanf(), Suppressing Input.

1.5 Statements - Selection Statements – If, if..else, if..else if, nested if else

1.6 Iteration Statements – While, Do..While & For 1.7 Jump Statements, Expression Statements, Block Statements. 1.8 The Preprocessor and Comments -The Preprocessor, #define, #error,

#include, Conditional Compilation Directives, #Undef, Using defined, #line

2. Unit 2: Arrays: Arrays and Strings- Two-Dimensional Arrays, Arrays of Strings, Multidimensional Arrays, Array Initialization, and Variable-Length Arrays.

04

3.1 Unit 3: Functions :The General Form of a Function and writing the user defined functions, Understanding the Scope of a Function, Function prototypes and declaration, passing parameters to function, the use of return statement and understanding the difference between function and procedure.

05

3.2 Types of passing parameter approach – call by value , Passing arrays to functions, Variable Length Parameter Lists, Old-Style vs. Modem Function Parameter Declarations,

3.3 Understanding the concepts of Command line arguments- argc and argv arguments to main( ) function, return value of main( ) function. The learning of “Implicit int" Rule with respect to main () function.

3.4 The Four C Scopes, Storage Class Specifiers, The inline Keyword, understanding of Recursion by implementation of factorial program

3.5 Writing of user defined functions that simulate the predefined string functions. Use of string predefined functions strlen(),strcpy( ), strcat( ), strcmp( ), strrev().

4. Unit 4: Pointers : What Are Pointers?, Pointer Variables, The Pointer 0perators, Pointer Expressions, Arrays of Pointers, Multiple Indirection, Initializing Pointers, Pointers and Arrays, Pointers to Functions, C's Dynamic Allocation Functions, restrict-Qualified Pointers, Problems with Pointers.

05

5. Unit 5: Structures, Unions, Enumerations, and typedef : Structures, Arrays of Structures, Passing Structures to Functions, Structure Pointers, Arrays and Structures Within Structures, Unions, Bit-Fields, Enumerations, Using sizeof to Ensure Portability, typedef .

04

6. Unit 6: File I/O: File I/O, Standard C vs. Unix File I/O, Streams and Files, File System Basics, fread( ) and fwrite(), fseek() and Random-

04

69

Access I/O, fprintf( ) and fscanf(), The Standard Streams. Reference Books:

Sr. No.


1. Let Us C Yashvant Kanetkar BPB Publications All topics

2 Understanding Pointers in C Yashvant Kanetkar BPB Publications For Pointers

3 C The Complete Reference Herbert Schildt Tata McGraw-Hill Edition

1st

4 The C Programming Language

Brian W. Kernighan, Dennis Ritchie

Prentice Hall Software Series

1st , 2nd ,3rd

Scheme of Marks

Section Unit No. Title Marks I & II 1 There is no Theory Paper; therefore in practical & oral

examination all topics have equivalent weight age. 50+50

Course Unitization

Section


No. of Questions in

No. Title CAT-I CAT-II I 1.1 An Overview of C CO206.1,

No Theory No Theory

1.2 Expressions 1.3 The C program compilation 1.4 Console I/O:

1.5, 1.6 Statements CO206.1 1.7 Jump Statements CO206.1 1.8 The Preprocessor and

Comments CO206.1

2 Arrays CO206.2 3 Functions CO206.3 4 Pointers CO206.4 4.1 Use of pointers with

arrays and functions CO206.4

5 Structures, Unions, Enumerations, and typedef

CO206.5

6 File Handling CO206.6

70


Section I Unit No 01 Unit Title An Overview of C Plann

ed Hrs.

10



1.1 Understanding of programming with algorithm and flowchart and introduction to the C programming language, learning of the form of C Program, the Basic Data Types.

1.2 Understanding of the Compilation of C program, procedure of Linking program files with libraries, how to use Separate Compilation and learning and understanding of C’s Memory Map created for any program that needs to be executed.

1.3 Understating of modifying the basic types, Identifies Names, Variables, Type Qualifiers-const, volatile and their use.

1.4 Understanding of Console I/O – how to Read and Write Characters from console?, Reading and Writing Strings, Use of Formatted Console I/O functions, and understanding of format specifiers, modifiers and precision specifier with the help of- printf(), scanf(), Suppressing Input with scanf()

1.5 Understanding of Selection Statements – If, If..Else, If..else if, nested if else 1.6 Understanding of Iteration Statements – While, Do..While, For, nested For loop 1.7 Understanding Switch statement, Jump, Break, goto, Continue Statements, Expression

Statements, and Block Statements. 1.8 The Preprocessor and Comments -The Preprocessor, #define, #error, #include,

Conditional Compilation Directives, #Undef, Using defined, #line Review Questions Q1 Write down algorithm and draw a flowchart for

1) To display “Hello” on output device 2) Display your name and address on o/p device 3) To display the sum of 10 and 20

CO206.1

Q2 List out and explain the basic data types and modified data types and explain what use of variables is?

Q3 Explain C’s memory out with standard C program Q4 List out the difference between conditional, iterative and jump statement

with example Q5 What is the use preprocessor #define, #include and what is difference

between #define and Qualifiers-const Unit No 02 Unit Title Understanding of Array Pla

nned Hrs.

04

71



1 Introduction to Array, its need, Understanding of types of arrays – numerical and character type and how to use array in C programming language - declaration and initialization of array variable .

2 Understanding of Learning of numerical array and its types – single and two dimensional arrays with the help of case study of matrix addition and multiplication program

3 Understanding of character array and its use in implementation of string sorting. 4 Use of variable-Length Arrays and its use. Review Questions Q1 How arrays are stored in memory? 2) What are diff. Types of array

representation of multi-dimensional array CO206.2

Q2 If we declare char a [10][50], what does means of first dimension and second dimension.

Q3 How to initialize all elements of array a to zero int a[10] to “0” Q4 Declare character array and initialize with 10 student names. Q5 Define the array and list out 5 benefits of use of array in programming

language. Unit No 03 Unit Title Understanding of Functions Planne

d Hrs. 05



3.1 Introduction to procedural oriented programming language, the General Form of a Function and writing the user defined functions, Understanding the Scope of a Function, Function prototypes and declaration, passing parameters to function, the use of return statement and understanding the difference between function and procedure.

3.2 Types of passing parameter approach – call by value , Passing arrays to functions, Variable Length Parameter Lists, Old-Style vs. Modem Function Parameter Declarations,

3.3 Understanding the concepts of Command line arguments- argc and argv arguments to Main ( ) function, return value of main( ) function. The learning of "Implicit int" Rule with respect to main() function

3.4 The Four C Scopes, Storage Class Specifier, The inline Keyword, understanding of Recursion by implementation of factorial program

3.5 Writing of user defined functions that simulate the predefined string functions. Use of string predefined functions strlen(),strcpy( ), strcat( ), strcmp( ), strrev().

Review Questions

72

Q1 What is the need of functions? Why C programming language is called as procedural oriented language?

CO206.3

Q2 What is a command line argument method and explain the use of it? Q3 How many parameters we can pass to any functions? And how may values

any function will return? Q4 Explain the different ways of passing arrays to functions with respect to

their types. Understanding the concepts of function overloading Q5 What are the four storage classes, explain their use with example. Unit No 04 Unit Title Understanding of Pointers Planne

d Hrs. 05



4.1 Understanding of pointers, declaration of pointer variable, pointer dereference and address operators, pointer expression, performing pointer arithmetic, comparisons and conversion, multiple indirections

4.2 Use of pointers and functions and Understanding of call by reference method of passing parameters.

4.3 Use of pointers with array, understanding the phenomena of array of pointers and its use. Use of void and null pointer

4.4 Use of C’s dynamic memory allocation functions such as malloc(), calloc() and free functions

4.5 Understanding of restrict-Qualified Pointers, Problems with Pointers. Review Questions Q1 What is the use of pointers and state the difference between *ptr and &ptr CO206.4 Q2 What does mean of dynamic memory allocation? Q3 What is the use of void pointers?, where null pointer is pointing? Q4 What is difference between call by value and call by reference method of

passing parameters to functions? Q5 With the help of program explain how to pass character array to function

by using call by reference method. (calculate the length of the string) Unit No 05 Unit Title Structures, Unions, Enumerations, and typedef Planne

d Hrs. 04



5.1 Introduction to structure – declaration and initialization, use of arrays within structure, structure within structure and use of array of structures.

5.2 Use of pointers with structures – passing structure to function by using call by value and call by reference method.

73

5.3 Understanding of Unions, Bit-Fields, Enumerations, use size of to ensure portability, understanding of typedef

5.4 Learning and understanding of comparative study of Array and Structure, Structure and Union

Review Questions Q1 What is the use of structure? How do you take reference of members of

structure? CO206.5

Q2 How to pass structure to function? Explain with example of sorting of strings.

Q3 In union how memory is allocated and utilized for different data types? Q4 Explain Bit-Fields, Enumerations, size of operator? Q5 What is meant by portability and how do you achieve by using sizeof()

operator? Q6 What is difference between structure and array? Unit No 06 Unit Title File I/O Plan

ned Hrs.

04



6.1 Understanding of file handing concepts and its use, difference between standard C Vs Unix file I/O

6.2 Understanding of basic of use of file pointers, performing read and writes operations on file by means of characters data and string data. Understanding the use of fprintf(), fscanf() functions.

6.3 Learning of how perform sequential accessing of files and random access of files 6.4 To perform random access of files, understanding and use of fread(), fwrite(), fseek(),

random I/O functions. Review Questions Q1 List out different functions required for implementation of the file

handling functions. CO206.6

Q3 What is meant by file pointers and how it is declared? Q4 What is meant by file mode and what are the different modes are there,

explain with example?

Assignments

List of experiments/assignments to meet the requirements of the syllabus Assignment No. 1

Assignment Title

Use of conditional, iterative, branch and jump statements

CO206.1

74

Batch I Write a program to find out odd and even, positive and negative number Write a program to find out greater number in between two and three numbers. Write a program to generate multiplication table of any number.

Batch II Write down a program to calculate the area of circle, rectangle and triangle. Write down a program that accepts the purchase item with its rate and will display the total amount, if quantity is more than 100 then 10% discount will be given therefore display the net amount.

Batch III Write a program to find out odd and even, positive and negative number Write a program to find out greater number in between two and three numbers. Write a program to generate multiplication table of any number.

Batch IV Write down a program to calculate the area of circle, rectangle and triangle. Write down a program that accepts the purchase item with its rate and will display the total amount, if quantity is more than 100 then 10% discount will be given therefore display the net amount.

Assignment No. 2 Assignment Title


CO206.1,

Batch I Write down a program to count number those are divisible b 5 within the 0-200 numbers. Accept employees basic salary, on basic salary 20% HRA, 20%DA and 5%TA is given, write a program to calculate the net salary of employee.

Batch II Write down a program to calculate N^M, factorial of any accepted number. Write down a program that will generate marksheet of 10 students. (make use of if and for loop)

Batch III Write down a program to count number those are divisible b 5 within the 0-200 numbers. Accept employees basic salary, on basic salary 20% HRA, 20%DA and 5%TA is given, write a program to calculate the net salary of employee.

Batch IV Write down a program to calculate N^M, factorial of any accepted number.



CO206.1,CO206.2,CO206.3

Batch I Write down a program to generate by using nested for loop **** *** ** * Write down a program that will print the sum of first 10 numbers Write down a program to print the first 50 numbers.

Batch II Write down a program to display the sum of number which are divisible by either 2 or 5 but not both.

75

Write down a program that will accept any 5 digit number 12345 and it will display sum of the digits.

Batch III Write down a program to generate **** *** ** * Write down a program that will print the sum of first 10 numbers Write down a program to print the first 50 numbers.

Batch IV Write down a program to display the sum of number which are divisible by either 2 or 5 but not both.

Write down a program that will accept any 5 digit number 12345 and it will display sum of the digits.


Application of Array CO206.2

Batch I Implement the following Matrix operation by representing matrix in the form array. 1) Addition 2) Subtraction 3) Multiplication 4) Upper Triangular

Batch II 1) Finding Lower Triangular Matrix 6) Symmetric Matrix 7) Skew Symmetric Matrix 3) Multiplication

Batch III Implement the following Matrix operation by representing matrix in the form array. 1) Addition 2) Subtraction 3) Multiplication 4) Identity matrix

Batch IV 1) Finding Lower Triangular, Upper Triangular Matrix 6) Symmetric Matrix 7) Skew Symmetric Matrix 3) Multiplication


Application of Array CO206.2

Batch I Write a program to accept any number and convert to binary, octal and hexadecimal number systems and vice versa Write a program to accept 10 student names and display in a reverse order.

Batch II Implement c program that will accept a hexadecimal number as input & then display a menu that will permit any of the following operation to be carried out.

a) Display hex equivalent of one’s complement. b) Carry out a masking operating & then display the hex equivalent of

the result. c) Carry out a bit shifting operating & then display the hex equivalent

of the result. d) Exit.

If the masking operating is selected, prompt the user for the type if the operating (bit wise and, bit wise exclusive, bit wise or) & then a hex value for the mask. If the shifting operating is selected, prompt the type of shift (left or

76

right) 7 then the number of bits to be shifted. Test the program with several different (hex) input values of your own choice. Note: conversion of different equivalent forms like – binary, octal, decimal 7 others can also be performed & tested.

Batch III Write a program to accept any number and convert to binary, octal and hexadecimal number systems and vice versa. Write a program to accept 10 student names and display in a reverse order.

Batch IV Implement c program that will accept a hexadecimal number as input & then display a menu that will permit any of the following operation to be carried out.

a) Display hex equivalent of one’s complement. b) Carry out a masking operating & then display the hex equivalent of

the result. c) Carry out a bit shifting operating & then display the hex equivalent

of the result. d) Exit.

If the masking operating is selected, prompt the user for the type if the operating (bit wise and, bit wise exclusive, bit wise or) & then a hex value for the mask. If the shifting operating is selected, prompt the type of shift (left or right) 7 then the number of bits to be shifted. Test the program with several different (hex) input values of your own choice. Note: conversion of different equivalent forms like – binary, octal, decimal 7 others can also be performed & tested.

Assignment No. 6

Assignment Title

Understanding of function CO206.3

Batch I Implementation of mathematical calculator by using functions. Write a program to pass array of string to function by using call by value and call by references and demonstrate the difference between them

Batch II Write a program which shows Advantages of 1) Static Variables and Static Storage Class 2) Extern and Register Storage Class 3) Static function with multiple files 4) Local variables and global variables

Write down a program to simulate the string functions. Write down a program that will accept a sentence from the user and a word. Then find out whether the entered word is exist in file and if exist display the count of it?

Batch III Implementation of mathematical calculator by using functions. Write a program to pass array of string to function by using call by value and call by references and demonstrate the difference between them

77

Batch IV Write a program which shows Advantages of 1) Static Variables and Static Storage Class 2) Extern and Register Storage Class 3) Static function with multiple files 4) Local variables and global variables

Write down a program to simulate the string functions. Write down a program that will accept a sentence from the user and a word. Then find out whether the entered word is exist in file and if exist display the count of it?


Use of pointers , array and functions CO206.2,CO206.3

Batch I Implement simple program that demonstrate the use of pointers. Write down a program that simulates string function with the help of pointers.

Batch II Write down a program to accept the student roll and names, and display within the functions by using call by reference method.

Batch III Implement a program that demonstrates the use of string functions with use of pointers (use call by reference method).

Batch IV Write down a program that simulates string function with the help of pointers.


Use of String function and implementation of searching techniques

CO206.2, CO206.3

Batch I Explain all string functions and write down a program which demonstrates the operation of some string functions. ( Use Function Concepts Strictly)

Batch II Implement binary search with function and without function Batch III Explain all string functions and write down a program which demonstrates

the operation of some string functions. ( Use Function Concepts Strictly) Batch IV Implement linear search with function and without function

Assignment No. 9 Assignment Title Function & sorting techniques CO206.3 Batch I Implement merge/quick, selection and insertion sorting techniques and

find the number of comparison required to sort random data –set of around 10000. use the file which have 10000 numbers stored init)

Batch II write a program which demonstrate 1) Pointer to function 2) Function having parameter as a pointer to function. 3) Implement the concepts of recursion.

Batch III Implement merge/quick, selection and insertion and find the number of comparison required to sort random data –set of around 10000. (use the

78

file which have 10000 numbers stored init)

Batch IV write a program which demonstrate 1) Pointer to function 2) Function having parameter as a pointer to function. 3) Implement the concepts of recursion

Assignment No. 10 Assignment Title Array and Stack, Queue CO206.2,

CO206.3 Batch I Implement Stack operation for storing integer numbers by using array,

pointers and perform the following stack operations. 1) Push 2) Pop 3) Stack underflow 4) Stack overflow 5) Display all elements

Batch II Implement the program by using linear search method Batch III Implement Queue operation using array and pointers. Batch IV Implement the program by using binary search method.

Assignment No. 11 Assignment Title Array, Pointers and Linked List CO206.2 Batch I Implement Linked List operation with the following

1) Insert 2) Delete 3) Search 4) Display. Batch II Implement Stack operation for storing integer numbers by using array,


Batch III Implement Linked List operation with the following 1) Insert 2) Delete 3) Search 4) Display.

Batch IV Implement Queue operation using array and pointers. Assignment No. 12

Assignment Title Structure CO206.1 Batch I Implement a program to accept and display the employee data with the

help of structure, array of structure and union. Use proper menu options for guiding the user.

79

Batch II Implement Linear Search and Binary Search Program and make comparisons of linear ad binary search techniques.

Batch III Implement a program to accept and display the employee data with the help of structure, array of structure and union. Use proper menu options for guiding the user.

Batch IV Create a structure for storing student information such as rollno, name, and marks for five subjects calculate total. Create a dynamic array to store student information. Access student information form array using only pointer arithmetic. Do not use structure operator

Assignment No. 13

Assignment Title Array, Pointers and Linked List CO206.2 Batch I Implement Linear Search and Binary Search Program and make

comparisons of linear ad binary search techniques. Batch II Implement simple program which demonstrate circular and doubly

circular linked list operations. Batch III & IV Implement Stack operation for storing integer numbers by using array,


Assignment No. 14

Assignment Title File Handling CO206.7 Batch I Implement file handing program that will read student data, write to a

file and display as per user choice. Batch II Write down a program to copy a file. Batch III Implement file handing program that will read student data, write to a

file and display as per user choice. Batch IV Write down a program to copy a file.

80

Course Plan

Course Soft Skills Course Code CS207

Examination Scheme

Theory Term Work Oral Total

Max. Marks - 50 25 75 Contact Hours/ week

2 -- 2

Prepared by Mr. Uday B. Mane , Mr. S. S. More Date : 09/05/2018 Prerequisites Basic English grammar.

Basics of computers and usage of internet in order to use emails. Knowledge of word processing software’s.

Course Outcomes

Soft Skills At the end of the course the students should be able to:

CO207.1 Recognize the significance of active listening and paraphrasing for effective communication, associated with proper body language.

CO207.2 To distinguish between aggressive and assertiveness in professional communication.

CO207.3 Understand the barriers in group and elements of team work for making effective teams.

CO207.4 Apply professional writing skills in various scenarios such as, writing e-mails, notices, reports.


POs COs a b c d e f g h i j k l

CO207.1 2 1 CO207.2 3 2 2 CO207.3 3 2 1 CO207.4 2 3

81

Course Contents


1

Communication Skills: Verbal Communication - Effective Communication - Active listening – Articulation- Paraphrasing – Feedback Non Verbal Communication - Body Language of self and others Importance of feelings in communication - dealing with feelings in communication Inter and Intrapersonal communication- Self-esteem and confidence – Assertiveness.

10

2

Importance of Team work Self Enhancement - importance of developing assertive skills- developing self-confidence – developing emotional intelligence. Importance of Team work – Team vs. Group - Attributes of a successful team – Barriers Involved Working with Groups – Dealing with People- Group Decision Making Effective teams – Elements of Team work - Stages in team formation.

12

3

Writing Introduction to writing, Hallmark of good writing, Writing conventions, business writing, writing a notice, writing styles, e-mail writing, report writing, practice.

15

List of Text and Reference Books

Text Books:

Sr. No. Title of Book Author Publisher/Edition Topics

1 Developing Communication Skills

Krishna Mohan and Meera Banerji

MacMillan India Ltd., Delhi 1,3

2 Essentials of Effective Communication

Ludlow and Panthon

Prentice Hall of India 1,3

3 Seven Spiritual Laws of Success Deepak Chopra Perseus. 1,2,3 4 Good To Great Jim Collins RHUK 2

Scheme of Marks

Unit No. Title Marks 1 Communications Skills 25 2 Importance of TeamWork 20

82

3 Writing 30

Course Unitization

Section


No. of Questions in

No. Title Oral-I Oral-II

I

1 Communication Skills CO207.1, CO207.2

25

25 2 Importance of Team Work CO207.3 3 Writing CO207.1,

CO207.4


Unit No 1 Unit Title: Communication Skills Planned

Hrs. 10


1 Verbal Communications 2 Effective Communications 3 Active listening. 4 Articulation, Paraphrasing 6 Non Verbal Communication - Body Language of self and others 7 Importance of feelings in communication - dealing with feelings in

communication 8 Inter and Intrapersonal communication Basics 9 Inter and Intrapersonal communication- Self-esteem and confidence 10 Significance of Assertiveness.

Unit No 2 Unit Title Importance of Team Work Planned Hrs.

15



1 Self enhancement strategies.

83

2 Importance of developing assertive skills while being a part of a team. 3 Developing self confidence in day to day life 4 Introduction to IQ and EQ with a case study. 5 Significance of Emotional Quotient in Corporate Environment. 6 Difference between a group and a team. Group Vs. Team. 7 Meaning and importance of team. 8 Attributes of successful team. 9 Barriers Involved Working with Groups 10 Dealing with People in Professional environment. 11 Group Decision Making Effective teams 12 Elements of Team work 13 Stages in team formation 14 Case study of effectiveness of team from the prescribed text book. 15 An activity to form a team to perform a given task.

Unit No 3 Unit Title: Writing Planned

Hrs. 20


1 Introduction to writing a error free grammatically correct English. 2 Hallmark of good writing. 3 Writing conventions. 4 Business writing with a case study and assignment. 5 Writing a notice with a case study and assignment. 6 Writing styles suited to different scenarios, with a case study and assignment. 7 E-mail writing etiquettes. 8 Effective report writing with a case study and assignment.

Note: Chapter 3 has number of classes as 8. However to perform hands on assignment on writing skills it would require more number of classes. Estimated number of classes is 20.

84

Shivaji University, Kolhapur.

Documents