VANDAYAR ENGINEERING COLLEGE

Fifth Semester
COMPUTER AND SCIENCE ENGINEERING
CS3591 – COMPUTER NETWORKS
MODEL EXAMINATION
Time: 3:00 Hours Marks: 100
Answer All the Questions

PART –A (10*2 = 20 MARKS)

1. What are the basic tasks of a communications system?

2. What is the meaning of stateful and stateful of a protocol? Give an example for each one.
3. Define Data link layer protocols.
4. What is HDLC?
5. State the function of ICMP v4 protocol.
6. Identify the address class of the following IP addresses (a) 200.55.20.165 (b) 128.167.23.20
7. How does UDP address flow control mechanism.
8. What is the significance of port number in transport layer when adopting TCP?
9. List the responsibilities of Data link layer.
10. What is a Virtual LAN?
PART – B (13 * 5 = 65 MARKS)

11. a) Explain in detail how data is transmitted as data units from source to destination in a
layered approach using the TCP/IP protocol suite.
OR
b) Briefly Explain the necessary protocols for a message to transfer from [email protected] to
[email protected] .

12. a) Give an overview of flow control and congestion control TCP.

OR
b) Explain the architecture of IEEE 802.11 wireless LAN.

13. a) Explain with suitable network topology, the working mechanism of any one uni-cast
routing protocol adopted in computer networks.
OR
b) Discuss the mechanism involved in IPV6 addressing .Also compare IPV4 with IPV6.

14. a) Consider the network shown below. Show the operation of Dijkstra’s (link state)
algorithm for computing the least cost path from router F to all destinations. Explain the
process.

Prepared by Verified by HOD sign

 OR
b) Consider two router exchanging information via BGP protocol. Explain BGP sessions and
packet formats in detail between 2 routers.

15. a) Elaborate on the CSMA protocols. What is the main downfall of the Carrier Sense
Multiple Access (CSMA) method? How does Collision Detection (CD) methods will help to
alleviate this problem?
OR
b) Discuss in detail about wireless LAN (802.11).

PART –C (15*1 = 15 marks)

16. a) (i) Briefly explain the error control techniques in data link layer. (8)

(ii) Consider the Cyclic redundancy check (CRC) based detecting scheme having the generator
polynomial X3 + X + 1. Suppose the message 11000 is to be transmitted. Find the Codeword.

Show your evaluation work for the same. (7)

OR

b) Suppose you open a startup company “foo” and want to set up your company network, your network
has the following servers:

 DNS server “dnsl.foo.com “with IP as “140.112.30.40”

 Web server: “foo.com” with two IP as “140.112.30.55” & “140.112.30.56”. The web server
also has a name as www.foo.com.
 Email server: “galaxy.foo.com” with IP as “140.112.30.60”
 Your company’s email address is [email protected].

(i) Briefly explain in detail about the working of DNS. (8)

(ii) What resources records (RRs) do you need to provide to the upper- level “.com” Registrar? (3)

(iii) What RRs do you need to put in your company’s DNS server? (4)
 VANDAYAR ENGINEERING COLLEGE
Fifth Semester
COMPUTER AND SCIENCE ENGINEERING
DISTRIBUTED COMPUTING (CS3551)
MODEL EXAMINATION
Time: 3:00 Hours Marks: 100
Answer All the Questions

PART – A (10 * 2 = 20 MARKS)

1. Distinguish between message passing systems and shared memory systems.

2. What are the motivations for the Distributed system?
3. How do you define the Scalar time and the Vector time?
4. What are the limitations of logical block?
5. List the advantages and limitations of token-based algorithms for implementing mutual
exclusion.
6. How beneficial is the Chandy-Misra-Hass algorithm in the AND model and OR model?
7. What is virtualization? Why is it required in the larger organization?
8. Outline the issues in failure recovery.
9. What is a checkpoint in the recovery system? How is it useful?
10. State the relation of compute services with strong services in a cloud environment.

PART – B (13 * 5 = 65 MARKS)

11. a) Explain message passing systems and discuss the message-oriented middleware and its types.
Also explain their functionality in distributed computing.

OR

b) Explain block, non-blocking, synchronous and asynchronous primitives for distributed

communication. Also summarize major libraries and standards for building distributed
application.

12. a) What is a snapshot and what are the needs of taking snapshot in distributed systems? Outline
Chandy- Lamport algorithm for snapshot and illustrate the algorithms.

OR

b) Describe the physical clock synchronization and logical clock synchronization and explain the
framework of a system of logical clock.

13. a) State the Lamport’s algorithm and its use and the limitations and benefits. Compare this with
any two token-based algorithms.

OR

Prepared by Verified by HOD sign

 b) Explain the system models with its preliminaries and how is it characterized in the model of
dead lock.

14. a) Explain the facts associated with agreement in failure-free systems of both synchronous &
asynchronous systems.

b) What is agreement in a failure free system? Explain how agreement is reached in message-
passing synchronous system with failures.

15. a) Explain the types of cloud computing deployment models with their relative advantages &
disadvantages.

OR

b) Explain the different cloud services and the platform that support these services. Give an
example of application services adapted by any organization.

PART – C (1 *1 5 = 15 MARKS)

16. a) Consider an ABC IT company that wanted to provide services like scientific converters, data
converter, currency converters and some of the business logic as a server-side component to the
developer to tailor make the application. Explain the various adaptable technologies to
implement in a distributed environment. State its merits and demerits.

OR

b) Outline the Koo and Toueg coordinated check pointing and recovery technique and apply this
algorithm to a specific case study to demonstrate how this algorithm avoids the domino effect
and live lock problems during the recovery.
 VANDAYAR ENGINEERING COLLEGE
Fifth Semester
COMPUTER AND SCIENCE ENGINEERING
CRYPTOGRAPHY AND CYBER SECURITY (CB3491)

MODEL EXAMINATION
Time: 3:00 Hours Marks: 100
Answer All the Questions

PART-A (10 * 2 = 20 MARKS)

1. Distinguish active and passive attack with example.

2. Let message = “Anna”, and k=3, find the cipher text using Caeser.
3. Find gcd (56,86) using Euclid’s algorithm.
4. What are the properties held by a good random number generator?
5. Does fermet’s theorem hold for P=5 and a=2? Justify.
6. What is message authentication code? How does it differ from the Hash function?
7. Define digital signature. What are the properties of digital signature?
8. Write the Schemes for the distribution of public keys.
9. How to prevent SQL injection Attacks?
10. Write the key principles and practices of cloud security.

PART-B (13 * 5 = 65 MARKS)

11. a) (i) Describe OSI security architecture and derive a relativity matrix between Security,
Attacks, Services and Mechanisms. (8)
(ii) Using Play Fair Cipher algorithm encrypt the plaintext = ATTACK POSTPONED using the
key = EMERGENCY. (5)
OR
b) Explain any three types of Substitution techniques with proper examples.

12. a) (i) Solve the following using RC4 stream cipher algorithm. Assume the state vector is 8bits

Key: [1 0 0 2] (8)

Plaintext: [6 1 5 4]

(ii) Illustrate any one pseudo random number generator algorithm. (5)

OR

b) Explain block cipher mode of operation: Electronic Code Book, Cipher Block chaining and
Counter mode with neat sketch.

13. a) Determine the plaintext text from the cipher text C= 106, N= 143, e= 11 using RSA
algorithm.
Prepared by Verified by HOD sign
 OR

b) Describe Chinese Remainder theorem and its application in cyber security.

14. a) Write brief notes about the MAC on message authentication with confidentiality process.
Also discuss the security aspects of MAC.

OR

b) Demonstrate the technical operations of SHA.

15. a) Describe how spyware functions and its impact on privacy and data security. What steps can
individuals & organizations take to detect and prevent spyware infections?

OR

b) Discuss the security risks associated with public wi-fi networks & the best practices for
ensuring wireless security on personal devices.

PART – C (1 *1 5 = 15 MARKS)

16. a) Write Diffie Hellman algorithm. Find the secret key shared between user A & user B using
Diffie-Hellman algorithm for the following q= 673, α= 5; Xa = 418 & Xb = 59.

OR

b) Your company is implementing Network Access Control (NAC) to improve network security.
Outline the implementation process, including policy development, authentication techniques
& enforcement.
 VANDAYAR ENGINEERING COLLEGE
Third Semester
COMPUTER AND SCIENCE ENGINEERING
CS3301 – DATA STRUCTURES
MODEL EXAMINATION
Time: 3:00 Hours Marks: 100
Answer All the Questions

PART –A (10*2 = 20 MARKS)

1. State the advantages of modularity in programming.
2. What are ADT? Give an example.
3. A circular queue has a size of 5 and has 3 elements 11, 30, 41 where F=1 & R= 3. After inserting
50 and 60, What is the value of F and R. Trying to insert 33 at this stage what happens. Delete 2
elements from the queue and insert 71, 98. show the sequence of steps for the above questions.
4. List some applications of Queue.
5. What are the properties of AVL trees?
6. Define Binary Search tree.
7. Define Euler’s Circuits.
8. Give the topological order for the DAG in Fig1.

9. What are the different hash function?

10. What is External sorting?
PART –B (13*5 = 65 marks)
11. a) (i) What are the different ways the list can be implemented? State and explain list
(6)
(ii) Write the function to add two polynomial given as a linked list.
P1= 13 x8+7x5+32x2+54
P2= 3x2+17x5+3x3+98
(7)
OR
b) (i) Distinguish between singly, doubly & circular linked list with an example.
(6)
(ii) Write a C function to insert a node in the middle of the linked list & Count the No. Of
nodes in the circular linked list.
(7)

12. a) Outline the algorithm for evaluating a post-fix expression using stack data structure with an
example.
Prepared by Verified by HOD sign
 OR
b) Write c function for the following conversions
i) Infix to post-fix expression.
ii) Evaluate the post-fix expression. (6+7)

13. a) Identify the types of Priority Queue. Explain about Min Heap insertion and deletion
Operations.
OR
b) State the BST property & Outline the algorithm to search a binary search tree with an
example.

15. a) Distinguish between Prim’s & Kruskal’s? Using Prim’s algorithm starting with vertex “A”,
list the vertices of the graph given in fig 3. in the order they are added to maximum spanning
tree.

b) i) What is B-tree and B+tree? Explain with example. (6)

ii) Distinguish between BFS and DFS with the usage of stack & queue. (7)

15. a) Outline the algorithm to perform linear search on an array of ‘N’ numbers. Illustrate each
step of the algorithm with an example.
OR
b) Outline the algorithm to sort an array of ‘N’ number using bubble sort. Illustrate each step of
the algorithm with an example.

PART –C (15*1 = 15 marks)

16. a) What are the basic heap operation? Show how heap sort processes the input 142, 543, 123, 65,
453, 879, 572, 434, 111, 242, 811, 102.
OR
b) Write the functions for the following operations on doubly linked list.
 Sum up the values stored in the nodes of a list.
 Count the even numbers in the list.
  Delete the node with an Element X.

Prepared by Verified by HOD sign