Scribd
Upload
46 views

Cse - Software Engineering

CS -COMPUTER NETWORKS UNIT-4 1.Explain Briefly about elements and protocols of Transport Layer 2.Explain the remote Procedure Calls of Transport Layer 3.Explain about end to end protocols 1.Describe about Cryptographic Algorithms 2.Explain about (a)Network Security (b) Security Mechanisms 3.Describe in detail about SMTP,MIME SNMP applications.

Uploaded by

Jagadeesh Jagadish
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
46 views

Cse - Software Engineering

CS -COMPUTER NETWORKS UNIT-4 1.Explain Briefly about elements and protocols of Transport Layer 2.Explain the remote Procedure Calls of Transport Layer 3.Explain about end to end protocols 1.Describe about Cryptographic Algorithms 2.Explain about (a)Network Security (b) Security Mechanisms 3.Describe in detail about SMTP,MIME SNMP applications.

Uploaded by

Jagadeesh Jagadish
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

CSE SOFTWARE ENGINEERING UNIT-4 1) Write Briefly about the Software Architecture?

2) Explain how Designing is useful in Software Architecture 3) Explain the Styles of Implementing Software Architecture? UNIT-5 1) Explain Briefly about the Testing Methodologies? 2) Explain the Principles of Testing and its metrics? CS COMPUTER NETWORKS UNIT-4 1.Explain Briefly about elements and protocols of Transport Layer 2.Explain the remote Procedure Calls of Transport Layer 3.Explain about end to end protocols

UNIT-5

1.Describe about Cryptographic Algorithms 2.Explain about (a)Network Security (b) Security Mechanisms 3.Describe in detail about the SMTP,MIME SNMP applications.

DATABASE MANAGEMENT SYSTEMS UNIT-4 1.(a).Write a short notes on ACID Properties (b).Describe in detail about -Lock Based Concurrency Control, - Deadlocks Performance of Transaction Support in SQL. 2. Explain about Concurrency Control (Serializability, and recoverability Dealing with Dead Locks, Specialized Locking Techniques Concurrency Control without Locking.) Locking

3.Explain about -The Write-Ahead Log Protocol,

- Check pointing, -Recovering from a System Crash, - Media recovery UNIT-5 1.write a short notes on File Organization and Indexing. 2.Explain about B+ trees. 3. (a).Write a short notes on hash based Indexing. (b). Write a short notes on Disks and Files. ADVANCED DATA STRUCTURES AND ALGORITHM ANALYSIS (CSE & CS) UNIT-4 1. What is a Binary Heap? With an example explain how to insert & delete an element into Binary heap. 2. What is a priority queue? What are the different ways of representing a priority queue? 3. Define Binary search tree? With an example explain all Operations of Binary search tree. UNIT-5 1. What is an AVL tree? With an Example Describe operations in AVL tree. 2. With an example explain contrast between Red-Black and Splay Trees, B-Trees

COMPUTER ORGANIZATION AND ARCHITECTURE (CSE & CS) UNIT-4 1. Write in detail about Addition and Subtraction algorithms.

2. Explain in detail about Booths Multiplication algorithm and Division Algorithm. UNIT -5 1. What are the different computer Peripheral Devices. 2. Briefly explain about Input-Output Interface and Asynchronous data transfer. 3. Explain in detail about Input Output Processor.

Operating system
UNIT-4 1.Explain Swapping, Contiguous Memory Allocation, Paging, Segmentation? 2.write about Overview of Mass-Storage Structure, Disk Structure, Disk Scheduling?

3.Explain concepts RAID Structure, I/O Hardware, Application Interface, I/O Subsystem?

UNIT-5 1.Explain The Concept of a File, Access Methods, Directory Structure, File System Structure,
File System Implementation?

2. write about Allocation Methods, Free-Space Management, Efficiency And


Performance.

MFCS
UNIT-4 1. Explain the recurrence relation. What is its application in computer science with suitable examples? 2. a) Solve the recurrence relation T(k)-7T(k-1) + 10T(k-2)=6+8k with T(0)=1 and T(1)=2 b) Solve the recurrence relation an=an-1 +n3 where a0=5 by the method of substitution. UNIT-5 1. a) Write basic rules for constructing Hamilton paths and cycles. b) Explain the graph isomorphism 2. a) Explain Kruskal`s algorithm with an example. b) State and prove Eulers formula. 3.define spanning tree.what are its characteristics? 4.Explain euler circuits in detail.

You might also like