C3-R3: OPERATING SYSTEMS Jan 2006

1.

a) Does a process incur more execution overhead compared to a thread? Justify your answer.

b) Distinguish between multiprocessing and multiprogramming.

c) What are the “special files” in Unix?

d) What is the main difference between worm and virus?

e) State the practical limitations of implementing non-preemptive SJF algorithm.

f) What is the difference between a long-term scheduler and a short-term scheduler?

g) How can a single copy of a text editor be used to serve multiple users in a time-sharing system?

(7×4)

2.

a) What is TLB? Find out the effective memory-access time with an 80% hit ratio and the following access times:

TLB access time: 20ns; MM access time: 100ns

b) Describe the public-key encryption scheme and mention how is it advantageous to the data-encryption standard.

(8+10)

3. Consider the following page reference during a given time interval for a memory consisting of 5 frames: y,c,z,c,d,a,y,a,e,a,y,f,d,e. Using the i) FIFO replacement strategy and ii) the LRU replacement strategy compare the results. Repeat both FIFO and LRU replacement strategies for memory with 3 frames and same page reference pattern. Comment on the findings and draw a conclusion justifying the adoption of a particular replacement strategy.

(18)

4.

a) What does ‘init’ do? What happens to the parent process id of a child when the parent terminates before its child? When does a child become ‘zombie’?

b) With reference to Unix when do the following situations occur?

i) Single process table entry contains pointers to the same file table entry.

ii) Different file table entries point to the same i-node table entry.

iii) Shell ‘forks’ a copy of itself and ‘waits’ for the child to terminate.

c) How does CPU time-slice affect the Round-Robin algorithm?

(8+6+4)

5.

a) Show and explain an implementation of the classical producer-consumer (producer produces an item, keeps it in a buffer from where the consumer is picking it up) problem using semaphore.

b) What is dynamic loading? Mention its advantage. How is dynamic linking performed? Mention any disadvantage that you can think of for both the schemes.

(10+8)

6.

a) What is meant by a domain and the rights on it? Describe a Capability list and ways of protecting it from user tampering.

b) Rewrite the following code introducing code parallelism wherever applicable:

For i = 1 to k

a(i) = b(i) + c(i)

For j = 1 to k

d(j) = x(j) – y(j)

For p = 1 to k

x(p) = y(p) + b(p)

read(m,n,o,r)

q = m*n + r/o

write(q)

c) Using preemptive SJF(shortest-job-first) algorithm draw the Gannt chart and calculate the average waiting time for the following processes:

Process Arrival time Burst time

P₀ 0 6

P₁ 2 4

P₂ 3 10

P₃ 7 9

(9+4+5)

7.

a) Where and how “bit vector/table” is used? What are the advantages and disadvantages of the technique?

b) What is deadlock? How can deadlock be prevented by not allowing “Hold and Wait” ? Is it a feasible policy?

c) How can synchronization be achieved when two processes communicate by message passing?

d) Provide a programming example of multithreading giving improved performance over a single-threaded solution.

(5+5+5+3)

C2-R3: DATA STRUCTURE THROUGH ‘C’ LANGUAGE Jan 2006

1. Each question below gives a multiple choice of answers. Choose the most appropriate one and enter in the “tear-off” answer sheet attached to the question paper, following instructions therein. (1 x 10)

1.1. Adjacency matrix for a digraph is

A) Unit Matrix

B) Symmetric Matrix

C) Asymmetric matrix

D) none of the above

1.2. Time complexity of insertion sort algorithm in the best case is

A) O(n)

B) O(n log₂ n)

C) O(n²)

D) none of the above

1.3. The prefix expression for the infix expression a * ( b + c ) /e – f is

A) /* a + bc – ef

B) -/ * + abc ef

C) - / * a + bcef

D) none of the above

1.4. In linked list representation, a node contains at least

A) node address field, data field

B) node number, data field

C) next address field, information field

D) none of the above

1.5. Number of nods in a complete binary tree of depth k is

A) 2^k

B) 2k

C) 2^k-1

D) none of the above

1.6. The smallest number of keys that will force a B-Tree of order 3 to have a height 3 is:

A) 12

B) 10

C) 7

D) none of the above

1.7. Given two sorted lists of size “m” and “n” respectively, the number of comparisons needed in the worst case by the merge sort will be:

A) m*n

B) max(m,n)

C) min(m.n)

D) m + n – 1

1.8 Any string of bits of length n represents a unique non-negative integer between

A) 0 and 2^n-1 -1

B) 0 and 2^n-1

C) 1 and 2^n-1

D) none of the above

1.9 Which of the following expressions accesses the (i,j)^th entry of a m ´ n matrix stored in a column major form ?

A) m * ( i –1 ) + j

B) m * ( j –1 ) + i

C) m * ( n – j ) + i

D) m * ( m – i ) + j

1.10 The following sequence of operation is performed on a stack

push(1), push (2), pop, push(1), push(2), pop, pop, pop, push(2), pop.

The sequences of popped out values are

A) 2, 2, 1, 2, 1

B) 2, 2, 1, 1, 2

C) 2, 1, 2, 2, 1

D) 2, 1, 2, 2, 2

2. Each statement below is either TRUE or FALSE. Choose the most appropriate one and ENTER in the “tear-off” sheet attached to the question paper, following instructions therein. (1 x 10)

2.1 All primitive recursive functions can be solved iteratively.

2.2 Breadth – first search algorithm can only be used for undirected graph.

2.3 De-referencing operator * has the same effect when it is applied to a pointer or to a structure.

2.4 Binary search performs efficiently on a linked list.

2.5 A symbol table can be constructed using binary tree.

2.6 A pre-order and post-order traversal sequence uniquely defines a tree.

2.7 If an undirected graph is of “n” vertices and “e” edges then the sum of degrees of all vertices is 2e.

2.8 The adjacency matrix corresponding to a graph consisting of “n” nodes but no edges is a unit matrix.

2.9 Recursion cannot be removed without using a stack.

2.10 Pointers are used for dynamically allocated memory.

3. Match words and phrases in column X with the closest related meaning/ word(s)/phrase(s) in column Y. Enter your selection in the “tear-off” answer sheet attached to the question paper, following instructions therein. (1 x 10)

X		Y
3.1	Order notation	A.	Stack
3.2	Pattern matching	B.	Dynamic storage allocation
3.3	Dynamic data structure	C.	Two’s compliment
3.4	Height Balanced Trees	D.	Primitive data type
3.5	Data structure for back tracking	E.	Finite automata
3.6	Circular list with “head” pointing to the last node	F.	Adjacency list
3.7	Suitable data structure for efficiently computing adjacent vartices of a given vertex	G.	Adjacency matrix
3.8	Partition exchange sort	H.	AVL Trees
3.9	Stable sorting Algorithm	I.	Adjacency multi list
3.10	Unique representation for zero	J.	Queue
		K.	Tree
		L.	Breadth – first
		M.	Depth – first
		N.	Quick sort
		O.	merge sort
		P.	Complexity measurement

4. Each statement below has a blank space to fit one of the word(s) or phrase(s) in the list below. Enter your choice in the “tear-off” answer sheet attached to the question paper, following instructions therein. (1 x 10)

A.	circular queue	B.	stack	C.	simple queue
D.	band	E.	sparse	F.	many-to-many
G.	one-to-many	H.	depth-first-search	I.	breadth-first search
J.	log2 n	K.	n log2 n	L.	E / (n + 1)
M.	Insertion	N.	Log2 n + 1	O.	recursive
P.	Compaction	Q.	N

4.1 Matrices in which non-zero entries tend to cluster around the middle of each row are called __________ matrix.

4.2 A graph represents ________ relationship between nodes.

4.3 ___________ can be used to find the shortest distance between given two nodes in a graph.

4.4 Time complexity of inserting an element to a heap of “n” elements is of the order of _________.

4.5 If “E” is the total external length of a binary tree with “n” nodes then average number of comparisons for unsuccessful search is ________________.

4.6 _________ data structure may give overflow error, even though the current number of elements in it is less than its size.

4.7 Conversion of infix arithmetic expression to prefix expression requires the use of __________.

4.8 The minimum number of edges in a connected cyclic graph of “n” vertices is_________.

4.9 Linked list is preferred over an array for _________ operation.

4.10 Recursion often provides elegant solution to programming task but _______ function chew up a lot of memory.

PART TWO

(Answer any FOUR questions)

5.

a) What are the limitations of array data structure?

b) Show with the help of an example, how the above limitations can be avoided by “linked” representation of lists?

c) Show the representation of linked lists using arrays.

d) What do you mean by linear list and generalized list?

(4+4+4+3)

6.

a) Write a “C” function to copy one stack to another assuming the stack is implemented using array.

b) Write an algorithm to evaluate Postfix expression with the help of a stack.

(8+7)

7.

a) Write a “C” function to implement the Knuth Mooris Pratt algorithm for string searching.

b) A function A(m,n) is defined as follows.

A(m,n) = n + 1, if m = 0

= A ( m – 1, 1), if n = 0

= A(m – 1, A(m, n-1)), otherwise

write a recursive “C” function to compute A(m,n)

(8+7)

8.

a) Prove that the maximum number of nodes in a binary tree of height “k” is 2^k+1-1.

b) Consider the following binary tree

Indicate the output in the following cases: -

i) When the tree is traversed in an “inorder” fashion.

ii) When the tree is traversed in an “preorder” fashion.

iii) When the tree is traversed in an “Postorder” fashion.

(6+[3×3])

9.

a) Show with the help of an example that the simple selection sort is not data sensitive.

b) Find the time complexity of the simple selection sort.

c) Write a recursive “C” function to implement binary search.

(6+3+6)

10.

a) Write a “C” function to compute the in-degree and out-degree of a vertex of a directed graph when the graph is represented by an adjacency list.

b) What is a spanning tree? What do you mean by minimal spanning tree?

(9+[3+3])

C1-R3: COMPUTER ORGANIZATION Jan 2006

1. Each question below gives a multiple choice of answers. Choose the most appropriate one and enter in the “tear-off” answer sheet attached to the question paper, following instructions therein. (1 x 10)

1.1 ‘Cycle Stealing’ is associated with

A) Data transfer among registers

B) DMA

C) Pipelining

D) Microprogramming

1.2 The largest integer that can be represented in signed-2’s complement representation using n bits is

A) 2n-1

B) 2ⁿ

C) 2^n-1 – 1

D) 2ⁿ – 1

1.3 Using an additional NOT gate, a JK flip-flop can be converted into

A) T flip-flop

B) RS flip-flop

C) Master Slave flip-flop

D) D flip-flop

1.4 A microprocessor has a data bus with 64 lines and an address bus with 32 lines. The maximum number of bits that can be stored in this memory is

A) 32 x 2³²

B) 32 x 2⁶⁴

C) 64 x 2³²

D) 64 x 2⁶⁴

1.5 The expression ‘delayed load’ is used in context of

A) Processor-printer communication

B) Memory-monitor communication

C) Pipelining

D) Computer Arithmetic

1.6 Break points are used for

A) stopping a program at a desired place

B) manipulating the stack

C) executing each instruction individually

D) calling a subroutine

1.7 A truth table of n variables has _______ minterms.

A) n²

B) (n – 1)²

C) 2ⁿ

D) 2^{n -1}

1.8 Which of the following shift operations divide a signed binary number by 2?

A) logical left shift

B) logical right shift

C) arithmetic left shift

D) arithmetic right shift

1.9 The condition to detect overflow during the addition of two binary numbers is

A) C_n XOR C_n-1

B) C_n NOR C_n-1

C) C_n OR C_n-1

D) C_n AND C_n-1

where C_i is the carry out of the i^th significant bit.

1.10 Dual of a + b • c is

A) (a + b) • (a + c)

B) a • ( b + c)

C) a′ • ( b′ + c′)

D) (a′ + b′) • (a′ + c′)

2. Each statement below is either TRUE or FALSE. Choose the most appropriate one and ENTER in the “tear-off” sheet attached to the question paper, following instructions therein. (1 x 10)

2.1 A high-level language program is converted to the executable form by the compiler itself.

2.2 A negative number has same representation in signed-magnitude, signed 1’s complement and signed 2’s complement forms.

2.3 In Booth’s algorithm, numbers in 2’s complement are multiplied along with their sign bits.

2.4 In virtual memory management, physical addresses are mapped to logical addresses.

2.5 x + y • z = (x + y) • (x + z) is true in Boolean algebra.

2.6 An instruction pipeline operates on a stream of instructions by overlapping the phases of instruction cycle.

2.7 A race condition is not possible in combinational circuits.

2.8 Zero cannot be normalized.

2.9 In content addressable memories all the words in the memory are compared simultaneously.

2.10 Retrieving instruction from the memory is the instruction cycle.

3. Match words and phrases in column X with the closest related meaning/ word(s)/phrase(s) in column Y. Enter your selection in the “tear-off” answer sheet attached to the question paper, following instructions therein. (1 x 10)

X		Y
3.1	Single Output Line	A.	von Neumann
3.2	Self complementing code	B.	Programmed Control Transfer
3.3	Indirect Address	C.	BSA
3.4	Stored program concept	D.	Multiplexer
3.5	CPU checking I/O flag	E.	2421
3.6	Subroutine call	F.	Odd function
3.7	Bracket less expression	G.	M[AR]
3.8	Simple instructions computer	H.	BCD
3.9	Zero address instructions	I.	Decoder
3.10	Multiple variable exclusive –OR	J.	Interrupt driven transfer
		K.	M[M[AR]]
		L.	Prefix
		M.	BUN
		N.	RISC
		O.	ISZ
		P.	Stack Organized Computer
		Q.	Infix
		R.	Even function
		S.	CISC

4. Each statement below has a blank space to fit one of the word(s) or phrase(s) in the list below. Enter your choice in the “tear-off” answer sheet attached to the question paper, following instructions therein. (1 x 10)

A.	AR	B.	First	C.	Adders
D.	Two’s Complement	E.	Sequential	F.	Serial
G.	Stored Program	H.	Virtual	I.	IR
J.	Combinational	K.	Subtractor	L.	Second
M.	Memory mapped	N.	One’s Complement	O.	Primary
P.	PC	Q.	Locality of reference	R.	Parallel
S.	ROM	T.	Isolated	U.	Magnetic tape

4.1 In two pass assembler, the address symbol table is generated in ________ pass.

4.2 An adder-subtractor single unit can be designed using full ________ and XOR gates.

4.3 A(n) ________ circuit can be described using truth table.

4.4 The carry out of the most significant bit is discarded during addition of two numbers in ________ form.

4.5 CPU register storing the address of next instruction to be executed is ________.

4.6 Having same read/write instructions for memory and I/O addresses is ________ I/O concept.

4.7 High hit ratio of cache memory is possible because of ________.

4.8 In ________ memory management, there is no need to have entire program in the primary memory.

4.9 In daisy-chaining priority method, all the devices that can request an interrupt are connected in ________.

4.10 A(n) ________ is a random access device.

PART TWO

(Answer any FOUR questions)

5.

a) A computer uses a memory unit with 128MB words of 64 bits each. A binary instruction code is stored in one word of memory. The instruction has four parts – some bits to differentiate between one of the four addressing modes supported by the system, an operation code, a register code part to specify one of the 512 registers and an address part. Draw the instruction word format and indicate the number of bits in each part.

b) What disadvantage of strobe control method of data transfer does the handshaking protocol overcome and how?

c) Briefly describe the working of DMA.

(4+5+6)

6. A minority function is desired to be generated in a combinatorial circuit. The output should be 1 when the number of 1’s is less than the number of 0’s in the input. The output should be 0 otherwise. Design a 4 input minority function. Draw the circuit also.

(15)

7.

a) Using a stack organized computer with zero-address operation instructions, write a program to evaluate the arithmetic statement

b) List at least three differences between a branch, a subroutine call and an interrupt.

(9+6)

8.

a) Write a subroutine in assembly language to compare two words for equality.

b) Consider a computer with virtual memory having four frames/block and eight pages. Through diagrams show how many page faults will occur with the reference string 0, 1, 7, 2, 3, 2, 7, 1, 0, 3 if page replacement policies used are (i) First In First Out (ii) Least Recently Used.

(7+8)

9.

a) Draw the flowchart to perform the subtraction of two numbers in signed magnitude form.

b) An instruction is stored at location 100 with its address field at location 101. The address field has the value 600. The value at location 600 is 400, at 900 is 300 and at 400 is 200. A processor register R1 contains the number 300. Evaluate the effective address and the operand if the addressing mode of instruction is

i) indirect

ii) direct

iii) immediate

iv) indexed with R1 as index register.

Also diagrammatically show the contents of the part of the memory according to the data given above.

(9+6)

B5.3-R3: NETWORK MANAGEMENT & INFORMATION SECURITY Jan 2006

1.

a) What is digital signature? Which algorithms are used for digital signatures?

b) Differentiate between steganography and cryptography.

c) How does message digest help in checking the integrity of a transmitted text?

d) State four primary functions of CERT.

e) Differentiate between active and passive attacks on a computer.

f) What is an application level firewall and why is it necessary?

g) State any four acts amounting to “cybercrime” as per IT Act 2000.

(7×4)

2.

a) Suppose you are doing RSA encryption with the prime numbers p=13 and q=7. Also, assume that encryption exponent e=5. Find the least positive decryption exponent d. Next, encrypt the message m=7. Now decrypt the cipher c=2.

b) Explain the distributed DoS (Denial of Service) attack with a suitable diagram? Why is this kind of attack very common during the final hours of the Internet auction?

c) What is the importance of “no read up” plus “no write down” rule for a multilevel security system?

(9+6+3)

3.

a) What is meant by IP spooling? How can a router be used to prevent IP spooling?

b) How does RSA based digital signature help in “non-repudiation”? Explain with a concrete example scenario between a sender and a receiver.

c) Describe the Digital Signature (DS) Algorithm based on DS standard of NIST. How are signing and verifying done in DS standard?

(3+6+9)

4.

a) Consider the following threats to Web security and describe how each is countered by a particular feature of SSL (Secure Sockets Layer):

i) Brute-Force Cryptanalytic Attack

ii) Replay Attack

iii) Packet Sniffing

iv) Password Cracker

v) SYN Flooding

vi) Man-In-The-Middle Attack

b) Name the six participants in the SET system and show their interconnections in a secure electronic commerce component diagram.

([6x2]+6)

5.

a) In most of the campus/corporate networks, we find firewalls preceded by a router, but not the reverse. Can you explain why this has become almost a de-facto standard?

b) What is the difference between “reactive” and “proactive” fault management? State the four steps usually followed in reactive fault management.

c) What does SNMP define as manager, agent and client? Why does SNMP need SMI and MIB to manage a network? How are they related to UDP?

(3+6+9)

6.

a) Describe briefly the Bell-La Padula Model and its limitations. What is tranquility principle in this model?

b) What are the three classes of intruders? Discuss any three metrics used in profile-based anomaly detection. Explain the architecture of a distributed intrusion detection system (with a suitable diagram) and name the various components.

(8+10)

7. Write short notes on any three:

i) Pretty Good Privacy (PGP)

ii) IPsec VPN

iii) Risk Assessment (RA)

iv) Biometrics

(3×6)

B5.2-R3: OBJECT ORIENTED DATABASE MANAGEMENT SYSTEMS Jan 2006

1. Briefly explain the following:

a) Compare object oriented design with procedure-oriented design.

b) Define classes, abstract classes and interfaces and explain their utility.

c) What is meant by separation of interface and implementation in object-oriented design?

d) Distinguish between coupling and cohesion. Which is encouraged by object-oriented technology?

e) Distinguish between a function call and message dispatch.

f) Distinguish between method overloading and method-overriding.

g) Explain static and dynamic binding.

(7×4)

2.

a) Define inheritance relationship, composition relationship and association relationship in object-oriented technology. Also define and discuss their role in system development.

b) Explain single and multiple inheritances and how Java supports them. Illustrate with suitable examples

c) Define inheriting rule, subtype rule and method selection rule. Explain with examples.

(6+6+6)

3.

a) Distinguish between procedural programming paradigm and object-oriented programming paradigm. What are the benefits of object-oriented programming over procedural programming?

b) Explain static and dynamic polymorphism with suitable examples.

c) Explain abstraction and encapsulation concepts in object-oriented technology with a suitable example. Can abstraction and encapsulation be achieved in C programming language? If yes, then illustrate with an example in C otherwise explain.

(4+6+8)

4.

a) What is OMG? Explain in brief.

b) What is an ORB and what are its functions?

c) What is CORBA? Give a brief explanation about the CORBA and its architecture.

d) What are CORBA services? Explain with some example.

(3+3+6+6)

5. Consider the following details of a database system, which is required by an academic institute to automate many of its administrative activities. Carryout the questions (a), (b) and (c) listed below:

- The database system caters to the needs of three types of members – faculty, student and staff members.

- All members have a name (string), an address (string) and an Id (integer). In addition, faculty-members have a few research interests (an array of strings) and Office-telephone number (integer); student-members have an academic program number (integer) and staff-members have an employee-number (integer).

a) Identify the features of the above systems, which would help in object-oriented design.

b) How the above object-orientation can be supported in SQL? List the characteristic features of SQL to deal with object-orientation.

c) Create an object-oriented database schema definition for this database.

(6+6+6)

6.

a) What is object serialization? How is the concept linked to object-persistence? How does a persistent programming language help in object-oriented databases?

b) Differentiate between a relational database and object-relational database models.

c) Using description given in question 5, describe how does the concept of an object in the object-oriented model differ from the concept of an entity in the entity-relationship model?

(6+6+6)

7.

a) How are large objects such as multimedia objects are stored in object-oriented database systems? Explain in details.

b) If an object is created without any reference to it how can it be deleted?

c) Distinguish between relational database and object-relational database models.

d) Explain in brief the features of deductive databases.

(6+4+4+4)

B5.1-R3: PROFESSIONAL AND BUSINESS COMMUNICATION Jan 06

1.

a) ‘Needless repetition of words and ideas add to the length of sentences without contributing to their meanings. Therefore, avoiding repetition of words and ideas enhances the effectiveness of the communication.’ In the light of this statement, write down sentences to eliminate repetition of words and ideas shown in italics from the following statements:

i) We must assemble together at 10:30 AM in the morning.

ii) If you are not satisfied, then return it back to us.

iii) One should understand the basic fundamentals of clear writing.

iv) We should plan in advance for future.

b) State whether you agree or disagree with the following statements:

i) Most of the oral communication in an organisation is informal.

ii) In an organization, oral communication as a means of formal communication is more effective than written communication.

iii) Rules of communications are same whether we communication good news or bad news.

iv) Nonverbal communication is also a part of verbal communication.

c) Comment to establish the truth of the following statements:

i) “Long, involved sentences tend to be difficult to understand. Therefore, the shorter the sentence, the better.”

ii) “Action speaks louder than words.”

d) Explain the utility of teleconferencing and videoconferencing. As a business tool, which may be considered as more effective.

e) Highlight the importance of interpersonal communication.

f) Name six golden rules for conducting an effective meeting.

g) Explain the components of virtual office and give two examples for the same.

(7×4)

2.

a) Suggest, what steps one should take in order to improve upon one’s listening?

b) “Good communication makes a mahanagar more efficient and effective in achieving organizational goals.” Critically examine the statement.

c) Do you agree with the statement that – ‘Silence is also sometimes a good means of communication.’

(5+7+6)

3.

a) Explain, how graphs, charts and other graphics in a written report make the report more effective in communicating desired messages and information.

b) ‘A memo is in nature of a letter and is yet not a letter.’ Discuss.

c) Explain in most cases what make us a poor communicator.

(6+6+6)

4.

a) Assume that in your company, the rate of dearness allowance has increased from 25% to 30% of basic pay of employees. As a head of the Establishment Section, write a circular for the company’s employees informing about such an increase in dearness allowance.

b) Due to some urgent personal work, you are supposed to go out of city and it is likely that you will not join office for the next 4 days. Write down an e-mail, which you would like to send to your boss informing about your absence from office and the fact that you will be out of city.

(9+9)

5.

a) You know that ‘an effective representation before the management improves the chances of promotion in an organization’. Therefore, you are very particular about ensuring effective representation. Suppose that you have to make a presentation to the management next week regarding the activities of your department, suggest how you will plan about it and what steps you would like to follow in order to make your presentation very effective.

b) State any five points which one should always remember to make one’s resume.

c) What are the difference between curriculum vitae (CV) and a resume?

(10+5+3)

6.

a) ‘A good leader is responsible for ensuring an effective communication within a group.’ In the light of this statement, discuss how a leader can ensure an effective system of communication among the group members.

b) ‘The emergence of information technology has revolutionized the ways by which people communicate in organizations and one of the ways is – paperless communication.’ Discuss and give examples how the emergence of information technology has made paperless communication more prevalent and cost-effective mode of communication in organizations.

(8+10)

7.

a) One of the responsibilities of an interviewer is to put the interviewee at ease. Assume that you are an interviewer. Suggest any two ways through you will put the interviewee at ease.

b) Name any two software, which you think will be of utmost use in making your annual report an effective one.

c) Write short notes on any three of the following:

i) Communication Styles

ii) Performance Appraisal Interview

iii) Characteristics of a good negotiator

iv) Body Language and its significance

(4+2+[3x4])

B4.5-R3: INTERNET TECHNOLOGIES & TOOLS Jan 2006

1.
a)	What is TCP/IP? Discuss the layers of TCP/IP.
b)	What is IP Host address? Discuss in detail.
c)	What is virtual reality? Describe its applications.
d)	What is a Proxy Server? What are its functions?
e)	What is file compression? How is it achieved?
f)	What is Domain Name System? Explain.
g)	What are digital certificates? Explain their role in Internet Security.
	(7×4)
2.
a)	What is Internet? Describe the Architecture of Internet. Explain how a router works.
b)	What are Cookies? How are they different from Microsoft Passports?
c)	What is email Spam? Explain, how, it can be blocked?
	(6+6+6)
3.
a)	What is Client/Server architecture? Explain the advantages and disadvantages of two-tier and three-tier architecture in detail.
b)	What is multimedia? What are the requirements for multimedia? Explain standardized data formats for Multimedia-based programming.
	(9+9)
4.
a)	What are Firewalls? How do they work?
b)	What are Viruses? What are the different types of viruses? Explain, how viruses work on Internet?
c)	Write short notes on: i) Smurf Attacks ii) CGI Scripts
	([2+2]+[2+2+4]+[3+3])
5.
a)	Explain briefly, the new features in IPv6 as compared to IPv4.
b)	Explain briefly, how IPv6 handles multiple headers? What is the purpose of multiple headers? Explain IPv6 addressing.
	(6+[4+4+4])

6.
a)	Explain, how graphic images are embedded in a web page?
b)	Explain the browser architecture.
c)	Explain caching in web browsers.
d)	What is Telnet?
	(4+5+5+4)
7.
a)	What are the different aspects of Network Security? What do you mean by Accountability and Authorization?
b)	Discuss the following techniques to ensure the data against accidental damage: i) parity bits ii) checksum iii) Cyclic redundancy Checks
c)	What is Internet Multicast Protocol? Explain Internet Group Management Protocol.
	(6+6+6)

B4.4-R3: COMPUTER GRAPHICS & MULTIMEDIA SYSTEM Jan 2006

1.

a) Discuss the merits and demerits of various clipping algorithms.

b) How does the Z buffer algorithm determines which surfaces are hidden?

c) Explain the Sutherland Cohen line-clipping algorithm. Is this applicable to any type of window? Justify your answer.

d) Explain how MIDI files are created and what are their applications in multimedia applications.

e) Describe briefly the Phong shading and compare it with Gouraud shading.

f) Explain the importance of vanishing point. What type of projection is associated with it? Explain that projection.

g) Describe the importance of compression in multimedia system. Compare and contrast JPEG and MPEG techniques.

(7×4)

2.

a) Differentiate between video compression standards and multimedia video compression standards.

b) What are the components of multimedia systems? Explain in brief each component.

c) Describe the functions of flat panel displays.

(4+10+4)

3.

a) Show that n^th degree B-spline basis function B_i,n (x) = 0, if x < t₁ or x > t_i+n-i.

b) A triangle having vertices at (0,0), (1,1) and (5,2) is rotated by 45 degree clockwise i) about origin and ii) about P(-1, -1) point. Obtain the coordinates of the vertices of the triangle using homogenous coordinate system.

c) What are the advantages of parametric representation of curves and surfaces in computer graphics?

(6+10+2)

4.

a) Describe different models used for illumination. How do you define surface normal vector? Explain its importance.

b) Explain ray tracing and compare it with ray casting. Describe the intersection of an arbitrary ray with yz plane.

c) Explain rendering. What are the approaches used for volume rendering? What are the steps used in the process of smooth shading?

(6+6+6)

5.

a) Explain why RGB color model is used for display. How different shades of colors are generated on the RGB monitors.

b) How is clipping done in three-dimensional domain? Discuss the various options for selecting different types of view volumes.

c) Describe Painter’s algorithm. Give its relative advantages and disadvantages over other methods.

(6+6+6)

6.

a) In a 3D coordinate system the plane XY(z = 0) represents the screen of monitor. A box is placed at the origin such that its three edges are touching x, y and z axes. Describe the transformation matrix needed to show the side view of the box on the screen.

b) What did you understand by morphing? Explain with the help of practical application.

c) Write a routing to design a two dimensional cubic Bezier curve shapes having first order continuity. Use interactive technique for selecting control points in XY plane for each section of curve.

(6+6+6)

7.

a) Explain where and why the magnetic storage is used in multimedia system?

b) Describe the operation of scanner. What criteria would you use for selecting scanner?

c) What are the main design issues for the multimedia authoring system? Briefly explain each one of these issues.

(4+4+10)

Jan 2006 B4.3-R3: SOFTWARE TESTING AND QUALITY MANAGEMENT

1. State whether the following statements are TRUE or FALSE. In each case, justify your answer using one or two sentences. Irrelevant and unnecessarily long answers will be penalized.

a) The terms software verification and software validation are essentially synonyms.

b) Introduction of additional sequence type of statements in a program can not increase its cyclomatic complexity.

c) Code walkthrough for a module is normally carried out after completion of unit test.

d) During code review you detect errors whereas during code testing you detect failures.

e) Branch coverage is a stronger testing technique compared to statement coverage technique.

f) Modern quality assurance paradigms are centered around to carryout thorough product testing.

g) A satisfactory way to test object-oriented programs is to test all the methods supported by the different classes individually and then by performing adequate integration and system testing.

(7×4)

2.

a) Explain why testing techniques used for traditional procedure-oriented programs can not effectively be used to test object-oriented programs? What additional types of tests are needed for object-oriented programs?

b) Explain the difference between code inspection and code walk through. Why is detection and correction of errors during inspection and walkthrough preferable to that achieved using testing?

c) Prepare a checklist that can be used for inspection of the user interface of a software product.

(6+6+6)

3.

a) What is the difference between the top-down and the bottom-up integration testing approaches? Explain your answer using an example. Why is the mixed integration testing approach preferred by many testers?

b) Design the black-box test suite for a program that accepts two strings and checks if the first string is a substring of the second string and displays the number of times the first string occurs in the second string.

c) Explain what do you understand by client-server software. What are its advantages over the traditional software architecture? How can a client-server software be effectively tested?

(6+6+6)

4. Consider the following program segement.

/* num is the number the function searches in a presorted integer array arr */

int bin_search(int num)

{

int min,max;

min =0;

max =100;

while(min!=max){

if(arr[(min+max)/2]>num)

max=(min+max)/2;

else if(arr[(min+max)/2]<num)

min=(min+max)/2;

else return((min+max)/2);

}

return(-1);

}

a) Draw the control flow graph for this program segment.

b) Determine the cyclomatic complexity for this program. (Show the intermediate steps in your computation. Writing only the final result is not sufficient)

c) How is the cyclomatic complexity metric useful?

(6+6+6)

5.

a) Explain, why measurement of software reliability is a much harder problem than the measurement of hardware reliability.

b) What do you understand by a reliability growth model? How is reliability growth modelling useful? Give examples of two reliability growth models.

c) Explain the importance of software configuration management in modern quality paradigms such as SEI CMM and ISO 9001. What problems might arise if a development organization does not use any configuration management tool?

(6+6+6)

6.

a) Explain two test coverage metrics for procedural code. How are these useful? Can these be used satisfactorily for object-oriented programs? Explain your answer.

b) Why effective testing of real-time and embedded systems is considered more difficult than testing traditional systems? Explain a satisfactory scheme to test real-time and embedded systems.

c) Distinguish between the static and dynamic analysis of a program. Explain at least one metric that a static analysis tool reports and one metric that a dynamic analysis tool reports. How are these metrics useful?

(6+6+6)

7.

a) What do you understand by volume testing? Explain using a suitable example how volume test cases can be designed and the types of defects these tests can help to detect.

b) Explain at least one defect metric and how this metric can be collected. Also explain how defects can be effectively tracked for a software product.

c) What do you understand by data flow testing? How is data flow testing performed? Is it possible to design data flow test cases manually? Explain your answer.

(6+6+6)

Jan 2006 B4.2-R3: DISCRETE STRUCTURES

1.

a) Can a relation R in a set A be both symmetric and anti symmetric? Justify your answer.

b) Write the negation of the following by changing the quantifiers:

“Every complete bipartite graph is not planar.”

c) Prove absorption law in a Boolean algebra.

d) How many ways can one right and one left shoe be selected from 10 pairs of shoes without obtaining a pair?

e) What is the largest possible number of vertices in a graph with 35 edges and all vertices of degree at least 3?

f) Find a grammar to generate the set

{0^m1ⁿ | m and n are non negative integers}

g) Let (A,*) be an algebraic system, where * is a binary operation such that for any a and b in A

a*b = a

Show that this operation is associative.

(7×4)

2.

a) Suppose R is an arbitrary transitive and reflexive relation on a set A. Prove that the relation E defined by “x E y iff x R y and y R x” is an equivalence relation.

b) Prove or disprove the validity of the following argument:

i) Every living thing is a plant or animal.

ii) Ram’s dog is alive and is not a plant.

iii) All animals have heart.

iv) Hence Ram’s dog has a heart.

(9+9)

3.

a) Prove that if R is a partial ordering relation on a set S, then for n ³ 2,there can not be a sequence s₁, s₂, s₃,….s_n of distinct elements of S such that s₁ R s₂ R s₃…Rs_nRs_1.

b) Minimize following switching function

S_m(0, 2, 8, 12, 13 ).

c) Consider the group (Z₄, ): the integer modulo 4 group with respect to the operation : addition modulo 4. Does H={[0], [2]} form a subgroup of Z₄. If yes, is it a normal subgroup? Justify.

(6+6+6)

4.

a) Solve the following:

a_n = 2 a _n-1 +1

where

a₀ =0

a₁= 1

a₂ = 3.

b) Find a generating function to count the number of integral solutions of

e₁ + e₂+ e₃ = 10 if for each i, 0 £ e_i

(9+9)

5.

a) Show that complement of a regular set is a regular set.

b) Write a grammar/ regular expression for the language on the alphabet{0,1} having all the strings with different first and last symbols.

c) Find a deterministic finite state machine that recognizes the set:

L={0ⁱ10^j | i ≥ 1, j ≥ 1}

(6+6+6)

6.

a) Apply Dijkstra’s algorithm to determine a shortest path between a and z in the following graph:

b 3 e

2 2 5 1

a 1 z

c

4 2 7 3

d 4 f

The numbers associated with the edges are distances between vertices.

b) Obtain the principal conjunctive normal form and principal disjunctive normal form of the formula S given by

(ØP® R )L (Q« P)

c) State Pigeon hole principle. Show that in a sequence of n²+1 distinct integers, there is either an increasing subsequence of length_(n+1) or decreasing subsequence of length.

(6+6+6)