CS2302 / CS52 / 10144 CS 503 COMPUTER NETWORKS April may 2015

Anna University Questions - CS2302 / CS52 / 10144 CS 503 COMPUTER NETWORKS, april may 2015, Computer Science and Engineering, Fifth semester, regulation 2008 and 2010

Exam	B.E/B.Tech. (Full Time) DEGREE END SEMESTER EXAMINATIONS
Academic Year	April May 2015
Subject Code	CS2302 / CS52 / 10144 CS 503
Subject Name	Computer Networks
Branch	Computer Science and Engineering
Semester	Fifth Semester
Regulation	2008/2010

B.E / B.Tech. (Full Time) DEGREE END SEMESTER EXAMINATIONS, APRIL / MAY 2015

Computer Science and Engineering

Seventh Semester

CS2302 / CS52 / 10144 CS 503 COMPUTER NETWORKS

(Common to Information Technology)

(Regulations 2008/2010)

Time : 3 Hours                      Answer A L L Questions                Max. Marks 100

PART-A (10 x 2 = 20 Marks)

1. What is flow control?

2. What is refraction?

3. What are the issues in data link layer?

4. What are the criteria used to evaluate transmission medium?

5. What are the responsibilities of network layer?

6. What are datagrams?

7. What are the duties of transport layer?

8. What is the difference between network layer delivery and transport layer delivery?

9. What is the basic model of FTP?

10. Give the format of HTTP request.

Part-B (5* 16 = 80 Marks)

11. (a) Explain how to build network with OSI and TCP/IP reference model. (16)

Or

(b) Write short note om

(i) Reliable transmission

(ii) Framing

12. (a) Discuss the design procedure to build wireless LAN network

Or

(b) What are common ETHERNET implementations? Discuss about the sublayer.

13. (a) Discuss about distance vector routing with illustration.

Or

(b) Compare and contrast different types of switching methodologies.

14. (a) Explain the method of congestion avoidance.

Or

(b) Explain about UDP and TCP features with neat diagrammatic representation.

15. (a) Explain the structure of data encryption standard. List various security services.

Or

(b) Explain about RSA algorithm with illustration.

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

Normal forms and normalization MCQ

Multiple choice questions with answers explained on the concepts Normal forms and normalization, Normalization quiz with answers

Quiz

1. Carefully observe the relational schema given below, and select one of the following that would violate the 2NF property? Student (Register_No, Name, Phone, Branch, Course_No, Course_Name)
(a) Register_No, Name	(b) Course_No, Course_Name
(c) Register_No, Phone	(d) Phone, Branch
Why? – It is very evident that course_name is dependent on attribute course_no, and register_no, course_no would be the primary key for this relation. Hence, course_name shows partial dependency. But, no partial dependency is permitted for a relation to be in 2NF.
2. The rule that a value of a foreign key must appear as a value of some specific table is called a ______
(a) Referential integrity	(b) Entity integrity
(c) Unique integrity	(d) Dependent integrity
Why? – For referential integrity to hold in a relational database, any field in a table that is declared a foreign key can contain either a null value, or only values from a parent table’s referenced columns (primary key or candidate keys). In other words, when a foreign key value is used it must reference a valid, existing primary key in the parent table.
3. For a relation R with schema R (A, B, C, D), let us assume that A is the primary key. And, R consists of the set of functional dependencies F = {A → B, A → C, AB → C, C → D}. Which of the following would violate the 3NF rule?
(a) AB → C	(b) C → D
(c) A → BCD	(d) None of the above
Why? – 3NF – “no non-key attribute should depend on another non-key attribute” (i.e, no Transitive dependency). In this question, a non-key attribute D is fully functionally dependent on another non-key attribute C. Hence, it violates 3NF.
4. For a relation R (A, B, C, D), we assume that the key is (A, B), a composite key. With this information, we would say which of the following is TRUE for R.
(a) R may be in 2NF	(b) R may be in 3NF
(c) R may be in BCNF	(d) Not enough information
Why? – The only information given is the primary key of the table. And the primary is a composite key. Hence, we would say that the table can be in 2NF. We need the set of functional dependencies for deciding further.
5. Consider a relation R (A, B, C) with F = {A → B, C → B}. Assume that we decompose R into R1 (A, B) and R2 (A, C). Which of the following is TRUE for this case?
(a) R1 and R2 are in BCNF	(b) Dependency preserving decomposition
(c) R1 and R2 are in 3NF	(d) All of the above
Why? – If we have a relation with just two attributes we cannot look for partial key dependency, non-key dependency, or multiple candidate keys. Hence, the relation is in 3NF and BCNF. The decomposition given above is not dependency preserving decomposition. Because, the decomposition results in elimination of C → B.

Go back to DBMS quizzes / Multiple choice questions page

Go to Normalization Quiz Home page

Database management systems quiz questions with answers 1

DBMS quiz with answers / Database Management Systems Basics Quiz / DBMS Multiple choice questions

Quiz

1. The row/tuple of a relational table is called as an entity _________.
(a) Instance	(b) Attribute
(c) Model	(d) Relationship
2. Relational calculus is a ________
(a) Procedural language	(b) Non-Procedural language
(c) Data Definition language	(d) High level language
3. SQL is a _____________
(a) Procedural language	(b) Non-Procedural language
(c) Data Definition language	(d) High level language
4. Cartesian product (X) operation in relational algebra is ________
(a) an unary operator	(b) a binary operator
(c) both (a) and (b)	(d) not an operator
5. A database schema can be written in ________
(a) DML (Data Manipulation Language)	(b) DDL (Data Definition Language)
(c) DCL (Data Control Language)	(d) TCL (Transaction Control Language)
6. Which of the following is the advantage of relational database model?
(a) Structural dependence	(b) Conceptual complexity
(c) Complex database design	(d) Easier database design
7. A relational database management system is a single data repository in which data _______ is maintained.
(a) independence	(b) dependence
(c) complexity	(d) None of the above
8. Relational algebra is a _________
(a) Procedural language	(b) Non-Procedural language
(c) Data Definition language	(d) High level language
9. Which of the following is the external level of database architecture?
(a) Physical level	(b) Logical level
(c) View level	(d) All of the above
10. An entity set that does not have enough _________ to form a _______ is a weak entity set.
(a) attribute, primary key	(b) records, foreign key
(c) records, primary key	(d) attribute, foreign key

Go to ER modeling quiz page

Go back to DBMS Quizzes/MCQs page