Rubrics-Based Evaluation For Final Year
Rubrics-Based Evaluation For Final Year
COURSE FILE
SEM/YEAR/SECTION
VI /III / ECE-A
R 2013
Batch: 2013-2017
SUB.NAME
PREPARED BY APPROVED BY
NAME Dr.R.LALITHA
DESIGNATION Professor,CSE
SIGNATURE
INDEX
DOC/CF/CSE/V/CS6501
a) Students will gain the knowledge of applied mathematics, applied science and allied
engineering concepts and the skills to apply them in the fields of computer science and
engineering.
b) Students are able to analyze and identify a problem, formulate and define the computing
requirements for obtaining appropriate solution.
c) Students will be proficient in designing and developing algorithms and implement them with
excellent programming skills to meet the specified needs for health and safety, social economic
and environmental consideration.
d) Students can apply their algorithmic principles, and mathematical foundations in computer
science to provide solution for complex and computational problems.
e) Students have the ability to create and apply appropriate technical resources and necessary
modern software/hardware tools for computing practice.
DOC/CF/CSE/IV/CS6403/03.01.16
f) Students will apply the contextual knowledge to understand the impact of computing on
individuals, organizations or society.
g) Students are able to demonstrate their knowledge with computing solutions for sustainable
development of the social and legal issues.
h) Students will apply their ethical principles and carry out professional ethics and responsibilities
and norms of computer science and engineering practice.
j) Students are able to write, speak, and present effectively on general and technical issues.
k) Students will enhance their managerial skills and leadership quality to design their projects in
multidisciplinary teams.
TOTAL: 45 PERIODS
TEXT BOOK:
1. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”, Fifth
Edition, Morgan Kaufmann Publishers, 2011.
REFERENCES:
1. James F. Kurose, Keith W. Ross, “Computer Networking - A Top-Down Approach
Featuring the Internet”, Fifth Edition, Pearson Education, 2009.
2. Nader. F. Mir, “Computer and Communication Networks”, Pearson Prentice Hall
Publishers, 2010.
3. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source
Approach”,Mc Graw Hill Publisher, 2011.
4. Behrouz A. Forouzan, “Data communication and Networking”, Fourth Edition, Tata
McGraw – Hill, 2011.
Course Outcomes:
UNIT NO.:- I
Proposed Actual
Remarks
Teaching
Session Topics to be covered Time Ref (if any
/ / Aids
deviation)
Period Period
T1 BB
1
BB Class
2 T1 altered
T1 BB
3
T1 BB
4
T1 BB
5
T1 BB
6
T1 BB
7
T1 BB
8
T1 BB
9
T1 BB Simple
10 topic
T1 BB
11
T1 BB Class
12 altered
T1 BB
13
T1 BB
14
DOC/CF/CSE/IV/CS6403/03.01.16
T1 BB Class
15 Altered
T1 BB
16
T1 BB
17
NO. OF PERIODS ALLOTED( as per Anna university norms 50 min/Period):-03
NO. OF PERIODS PLANNED( as per our institute norms 45 min/Period):-04
NO. OF PERIODS TAKEN:-17
UNIT NO.:- II
.
Proposed Actual
Remarks
Session Teaching
Topics to be covered Time Ref (if any
No / / Aids
deviation)
Period Period
T1 BB
18
T1 BB
18
T1 BB
20
T1 BB
21
T1 BB
22
T1 BB
23
T1 BB
24
T1 BB Small
25
topic
T1 BB Simple
26
topic
T1 PP
27
NO. OF PERIODS ALLOTED( as per Anna university norms 50 min/Period):-03
NO. OF PERIODS PLANNED( as per our institute norms 45 min/Period):-04
NO. OF PERIODS TAKEN:- 10
UNIT NO.:- IV
Proposed Actual Remarks
Session Teaching (if any
Topics to be covered Time Ref
No / / Aids deviation)
Period Period
37 T1 BB
38 T1 BB
39 T1 BB
40 T1 BB
T1 BB
41
T1 BB
42
T1 BB
43
T1 BB
44
5 T1 BB
45
7 T1 BB
46
DOC/CF/CSE/IV/CS6403/03.01.16
3 T1 BB
47
2 T1 BB
48
3 T1 BB
49
3 T1 BB
50
NO. OF PERIODS ALLOTED( as per Anna university norms 50 min/Period):-03
NO. OF PERIODS PLANNED( as per our institute norms 45 min/Period):-04
NO. OF PERIODS TAKEN:- 14
UNIT NO.:- V
BB-BLACK BOARD, PP-POWER POINT PRESENTATION, T1- TEXT BOOK 1, R1- REFERENCE BOOK1
DOC/CF/CSE/IV/CS6403/03.01.16
REFERENCES:
1. James F. Kurose, Keith W. Ross, “Computer Networking - A Top-Down Approach
Featuring the Internet”, Fifth Edition, Pearson Education, 2009.
2. Nader. F. Mir, “Computer and Communication Networks”, Pearson Prentice Hall
Publishers, 2010.
3. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source
Approach”,Mc Graw Hill Publisher, 2011.
4. Behrouz A. Forouzan, “Data communication and Networking”, Fourth Edition, Tata
McGraw – Hill, 2011.
Day / 1 2 3 4 5 6 7
8.00 – 8.55- 9.50- 10.05- 10.55- 11.45- 12.35- 1.20-2.10 2.10-3
Period
8.55 9.50 10.05 10.55 11.45 12.35 1.20
Monday
Tuesday
BREAK
LUNCH
Wednesday
Thursday
Friday
1.
DOC/CF/CSE/IV/CS6403/03.01.16
2 201302008 AJAYKUMAR L
3 201302019 BABITHA L
4 201302020 BALAJI R
5 201302028 CHIDAMBARAM K
7 201302031 DHEVARAJAN V
9 201302046 JEEVA G S
10 201302049 KALAISELVI S
11 201302062 LOKESH B
12 201302066 MANOJIKUMAR S
14 201302071 MONISA L
18 201302076 NAVEENKUMAR S
20 201302084 PARASURAMAN C
21 201302089 PAVITHRA R
22 201302090 POORNIMA M
23 201302100 RAGHAVAN K
25 201302114 SAILESH G S
27 201302117 SANTHOSH B
28 201302119 SARAVANAN B
30 201302129 SRIDEVI S
32 201302137 VIGNESH M
36 201302146 PURUSHOTHAMAN S
Full Overall
Assessment marks % CO1 CO2 CO3 CO4 CO5
Unit Test 1 100 20 62 38 100
Unit Test 2 100 20 24 76 100
Model Exam 100 40 20 40 40 100
Assisgnments 100 20 15 20 10 30 25 100
DOC/CF/CSE/IV/CS6403/03.01.16
12 MARKS
MODEL
IAT-II
IAT-I
SL.N ROLL NO. STUDENT NAME
O
1 201302004 ABINAYA P N 50 28 59
2 201302008 AJAYKUMAR L 6 10 56
3 201302019 BABITHA L 32 22 32
4 201302020 BALAJI R 8 18 33
5 201302028 CHIDAMBARAM K 6 2 34
6 201302030 DEEPAK RAJ G 0 16 9
7 201302031 DHEVARAJAN V 0 20 15
8 201302044 JAYA BALAJI M 50 64 50
9 201302046 JEEVA G S 18 0 13
10 201302049 KALAISELVI S 68 78 76
11 201302062 LOKESH B 2 4 4
12 201302066 MANOJIKUMAR S 6 12 3
MOHAMED IBRAHIM
13 201302070 MT 56 34 50
14 201302071 MONISA L 56 54 60
15 201302072 MONISH KUMAR V 10 18 0
NARASHIMMA
16 201302074 BALAJI N 6 6 8
17 201302075 NAVEEN KUMAR K 2 6 11
18 201302076 NAVEENKUMAR S AB 0 0
19 201302077 NAVIN KUMAR G 50 64 AB
20 201302084 PARASURAMAN C 2 2 33
21 201302089 PAVITHRA R 30 8 33
22 201302090 POORNIMA M 50 32 30
23 201302100 RAGHAVAN K 4 20 50
24 201302101 RAJ KUMAR E 0 34 19
25 201302114 SAILESH G S 12 16 4
26 201302115 SAI SARAN P 26 4 14
27 201302117 SANTHOSH B 0 AB 14
28 201302119 SARAVANAN B 6 10 0
29 201302124 SREYESH SARMA S 0 2 4
30 201302129 SRIDEVI S 36 20 14
31 201302135 TUSHAAR ARUN S 4 AB 1
32 201302137 VIGNESH M AB 4 50
33 201302138 VIJAY KARTHICK R AB 0 0
34 201302142 NAVEEN KUMAR M 0 0 0
YEDDULA MANOJ
35 201302145 KUMAR REDDY AB 0 0
36 201302146 PURUSHOTHAMAN S 12 0 0
Total Strength 36 36 36
DOC/CF/CSE/IV/CS6403/03.01.16
04
Total No. of Students Passed 12
Total No. of Students Failed 22
Pass Percentage 21.88%
Roll No:
RAJALAKSHMI INSTITUTE OF TECHNOLOGY, CHENNAI 600 124
DEPARTMENT OF INFORMATION TECHNOLOGY
UNIT TEST - I
Maximum marks: 50
Sub Code : CS6551
Duration: 1 hr 30mins
Sub Name : Computer Networks
Year & Section: III/
( COMMON TO ECE & CSE) ECE A,B&C, II/CSE
A,B
PART – A (10 X 2 = 20
Marks)
ANSWER ALL QUESTIONS
1(CO1) Differentiate Computer Networks & Distributed Systems
2(CO1) List the limitations of STDM and FDM.
3(CO1) Define SAN. List the two technology trends in it.
4(CO1) Differentiate virtual circuit and datagram.
5(CO1) Define RTT.List the RTT delay of dial up and wireless LAN.
6(CO1) List the CRC polynomials used in PPP.
7(CO1) Draw the frame format of HDLC and DDCMP.
8(CO2) A pure ALOHA network transmits 200 bit frames. State the requirement to
DOC/CF/CSE/IV/CS6403/03.01.16
(CO2) ii) Illustrate CSMA/CD & CSMA/CA with neat flowcharts. 4+4
B
DOC/CF/CSE/IV/CS6403/03.01.16
Roll No:
RAJALAKSHMI INSTITUTE OF TECHNOLOGY, CHENNAI 600 124
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING &
ELECTRONICS AND COMMUNICATION ENGINEERING
PART – B (2 x 15 = 30 Marks)
OR
b) (CO1) Discuss in detail about the framing approach with neat (15)
diagrams.
Prepared by Approved By
Ms.Indhumathi,AP,CSE
HOD,CSE
DOC/CF/CSE/IV/CS6403/03.01.16