MCA – SEM-II ASSIGNMENTS

Data Structures
Assignment-1
Q1 Define and explain the static data structure with suitable example. Write algorithm
for push, pop, static fill, statch empty function.
Q2 Write an algorithm to create queue and to insert element in a queue and also define
circular queue.
Q3 Write short notes on Big O notation and priority queues.
Q4 What is analysis of an algorithm? Explain the various notations used while
analyzing an algorithm.
Q5 Write an algorithm to sort element using bubble sort.
Q6 Sort following array element using bubble sort.
7, 8, 26, 44, 13, 23, 98, 57
Assignment-2
Q1 For a singly linked list, write algorithm to
a) Count the number of nodes in the list.
b) Append two lists together.
Q2 Write an algorithm to
a) delete an element in a doubly linked list.
b) Interchange the nth element with nth element of a doubly linked list.
Q3 What is a heap. Make a heap out of the following data.
23, 7, 92, 6, 12, 14, 40, 44, 20, 21
Q4 Write an algorithm for sorting elements using shell sort.
Q5 An array contains the following elements
81, 94, 11, 96, 12, 35, 17, 95, 28, 58, 41, 75, 15
Show the contents of the array as it goes through shell sort. Consider increment
factors 5, 3, 1.
Assignment-3
Q1 Write short notes on
a) Hash function
b) Double hashing
c) Bucket hashing
Q2 Write definition of a general tree. What are the steps to convert a general tree to
binary tree. Implemnt the conversion on the given tree.
A
B D
C K
E
F
G I L M N
J
H
O
Q3 Write short notes on depth first traversal & breadth first traversal in the graph
Q4 Explain the infix, prefix, postfix traversal of tree structure with example
Q5 Write a menu driven program in C to create a binary search tree, traversal the tree
in order, pre order and post order search the tree for given node and delete the
node.
Computer Graphics
Assignment-1
Q1 Explain Sutherland – Cohen line clipping algorithm.
Given a clipping window – A(20,20) B(60,20) C(60,40) D(20,40). Using
Sutherland Cohen algorithm, find the visible portion of line segment joining the
points P1(40,80) P2(120,30).
Q2 Devise generalized Bresenham’s line drawing algorithm.
Q3 Explain window to view port mapping.
Find the normalization transformation that maps a window whose lower left corner
is at (1,1) and upper right corner is at (3,5) onto
1) a view port that is the entire normalized device screen.
2) A viewport that has lower left corner at (0,0) and upper right corner (1/2,
½).
Q4 Compare and contrast between
1. flood fill and boundary fill algorithm used for region filling.
2. parallel and perspective projection.
Q5 Explain the Midpoint Subdivision Algorithm. Prove that it works successfully
with lines that are partially inside and partitally outside the viewing window.
Q6 Derive 2D rotation and scaling transormation matrices with respect to fixed point
(Xp, Yp).
Q7 How does a raster scan system work? How is it different from random scan
system?
Q8 What are display files? Explain with examples, how are polygons and characters
represented in display file.
Q9 Deduce the Mid-point Circle Algorithm.
Q10 Explain the construction and working of CRT’s and DVST’s.
Q11 What are Homogeneous co-ordinates? Explain its significance with examples.
Q12 Construct the Bezier curve of order 3 and with 4 polygon vertices A(1,1), B(2,3),
C(4,3) & D(6,4).
Q13 Write short notes on,
a) Morphing
b) Frame Buffer
c) Kinematics and Dynamics
d) Phong Shading
e) Character generation.
Operating Systems
Assignment-1
Q1 For the processes given in the table:
Process Arrival Time (ms) Processing time (ms)
A 0 3
B 1 5
C 3 2
D 9 5
E 12 5
Using FCFS, SJF, SRT and RR (quantum=2) scheduling algorithm
(1) Draw a chart illustrating process execution.
(2) Find the average turn around time for each process
(3) Find the average waiting time for each process.
Q2 What is semaphore? Explain different types of semaphore. Explain the difference
between semaphore and monitor.
Q3 What is dynamic & fixed partition? What are the problems with them and how
can we solve these problems? Explain with suitable example.
Q4 Discuss the goal of I/O software.
Q5 What is deadlock? Write the Banker’s algorithm and explain how it can be used to
avoid a deadlock.
Q6 Consider the following snapshot of a system.
Processes Allocation Max Available
R1 R2 R3 R1 R2 R3 R1 R2 R3
P1 2 0 0 2 0 1 0 2 0
P2 1 2 0 2 5 2
P3 0 1 1 1 4 2
P4 0 0 1 2 0 1
Using Banker’s algorithm
(i) What is the context of matrix need?
(ii) Is the system is safe state? Give the sequence.
(iii) Is the system currently deadlocked?
Q7 Given reference string to the following pages by a program
1, 0, 2, 2, 1, 7, 6, 7, 0, 1, 2, 0, 3, 0, 4, 5, 1, 5, 2, 4, 5, 6, 7, 6, 7, 2, 4, 2, 7, 3, 3, 2, 3
How many page faults will occur for the following page replacement algorithms,
assuring three frames.
1. LRU replacement.
2. FIFO replacement
3. Optimal replacement
Q8 What are the difference threats to security of a system? Discuss threats
monitoring.
Q9 Explain the access matrix model of protection. How does it serve a useful
abstraction for reasoning about protection mechanisms in a computer systems?
Q10 Explain direct memory access (DMA) in detail with suitable example.
Q11 Consider the head of moving hard disk with 200 tracks is currently serving a
request at track 100. If the queue of requests in FIFO order is 27, 129, 110, 186,
 147, 41, 10, 64, 120. What is the total head movement under the following
scheduling algorithms?
(1) FCFS, (2) SSTF, (3) SCAN, (4) C-SCAN
Q12 With the help of an example and suitable diagram, explain the address mapping
scheme in paging.
Q13 Write short notes on,
a) Linker
b) RAID
c) Unix Operating System
d) Spooling
e) Context Switching
f) Translation look aside buffer (TLB)
Communication and Soft skills
Assignment-1
Q1 State the various methods of communication and process of communication.
Q2 What is internal communication and briefly explain its types.
Q3 Explain the concept of communication and the various barriers to communication.
Assignment-2
Q1 Write a formal letter to apply for a job in WIPRO for the post of Junior Software
Developer with your bio-data enclosed to the letter.
Q2 Write an official letter in the complete block form to the principal of a college
requesting him the permission to grant you late admission in MCA Semister-II as
you were out of town for a month.
Assignment-3
Q1 What are the main components of project report. Explain each component in
detail.
Q2 Write short notes on grape-wine communication and explain its pros and cons.
Assignment-4
Q1 Briefly explain the following concepts with example.
(i) Team Building
(ii) Decision Making
(iii) Time Management
(iv) External communication in an organization
(v) Negotiation
Q2 What are conflicts. Explain conflict resolution.
Assignment-5
Q1 What is meant by emotional intelligence. What is group discussion. Illustrate
with examples.
Q2 Briefly explain the verbal and non-verbal communication during an interview.
Q3 Explain in detail the concept of leadership and various leadership styles.