v.s.b. engineering college, karur department of computer … · 1.you are given a linked list l,and...

1

V.S.B. ENGINEERING COLLEGE, KARUR

Department of Computer Science and Engineering

2013 Regulations EVEN Semester Assignment Questions

S.No. YEAR /

SEMESTER

NAME OF THE SUBJECT PAGE NO.

1 I / II Semester Programming and Data

structures - I

2

2 II / IV Semester Computer networks 9

3 II / IV Semester Operating systems 12

4 II / IV Semester Design and analysis of

algorithms

15

5 II / IV Semester Microprocessor and

Microcontroller

18

6 II / IV Semester Software Engineering 21

7 III / VI Semester Distributed Systems 23

8 III / VI Semester Mobile computing 25

9 III / VI Semester Compiler Design 26

10 III / VI Semester Artificial intelligence 29

11 III / VI Semester Software testing 31

12 IV / VIII Semester Multicore architecture 35

13 IV / VIII Semester Software Project management 36

2

Assignment Questions

CS6202-Programming and Data Structures I

1.You are given a linked list L,and another linked list P,containing integers,sorted in

ascending order.The operation print_lots(L,P) will print the elements in L that are in

positions specified by P.For instance,if P=1,3,4,6, the first,third,fourth and sixth

elements in L are printed. Write the routine prine_lots(L,P).

You should use only the basic list operations.What is the running time of your routine?

2.Given two sorted lists,L1 and L2 write a procedure to compute L1 and l2 using only

the basic list operations.

3.For each of the use cases below pick a data structure (from the ones you have seen in

the lecture) that is best suited for that use case,and explain your choice.If you think there

is more than one suitable data structure, briefly discuss the trade-offs.

a.You want to store the names of weekdays and access them by the number of a day

within the week.

b.You want to store the stations of a public transportation line.New stations can be

added to both ends of the line , but not between existing stations.You should be able to

traverse the line in both directions.

4.Write a program to find a particular element in a singly linked list.Do this both

recursively and non recursively, and compare the running times. How big does the list

have to be befor the recursive version crashes?

5.Write an array implementation of self adjusting lists. A self adjusting list is like a

regular list, except

That all insertions are performed at the front, and when an element is accessed by a find,

it is moved to the front of the list without changing the relative order of the other items.

6.An alternative to the deletion strategy we have given is to use lazy deletion.To delete

an element, we merely mark it deleted (using an extra bit field) . The number of deleted

and non deleted elements in the list is kept as part of the data structure. If there are as

many deleted elements as non deleted elements, we traverse the entire list, performing

the standard deletion algorithm on all marked nodes.

a.List the advantages and disadvantages of lazy deletion.

b.Write routines to implement the standard linked list operations using lazy deletion.

7.a.Write a program to convert an infix expression which includes ‗(‗,‘)‘,‘+‘,‘-‗,‘*‘ and

‗/‘ to

Postfix.

b.Add the exponentiation operator to your repertoire.

c.Write a program to convert a postfix expression to infix.

3

8.For each of the use cases below pick a data structure that is best suited for that use

case,and explain your choice.If you think there is more than one suitable data structure,

briefly discuss the trade offs.

a.You want to store a sorted list of strings and support the operation of merging two

sorted lists into one,in place (without creating a copy of the lists).

b.You are writing software for a call center, When a client calls, his call should be stored

until there is a free operator to pick it up.Calls should be processed in the same order

they are received.

9.Show the result of running shell sort on the input 9,8,7,6,5,4,3,2,1 using the increments

{1,3,7}.

10.Show how heapsort processes the input

142,543,123,65,453,879,572,434,111,242,811,102.

11.Write a program to compute the number of collisions required in a long random

sequence of

Insertions using linear probing, quadratic probing, and double hashing.

12.Write a program to implement extendable hashing. If the table is small enough to

fit in main memory, how does its performance compare with open and closed hashing?

13.The larger binary trees were generated automatically by a program. This was done by

assigning an (x,y) coordinate to each tree node, drawing a circle around each coordinate

and connecting each node to its parent.Assume you have a binary search treestored in

memoryand that each node has two extra fields to store coordinate.

a.The x coordinate can be computed by assigning the inorder traversal

number.Write a routine to do this for each node in the tree.

b.The y coordinate can be computed by using the negative of the depth of the

node.Write a routine to do this for each node in the tree.

14.How different is that Poly_phase merge sort and the Multi_way merge sort from the

conventional algorithm.Write the algorithm and substantiate your answer.

15.Write a function to add two polynomials. Do not destroy the input. Use a linked list

implementation. If the polynomials have m and n terms respectively, What is the time

complexity of your program?

16.For each of the use cases below pick a data structure that is best suit for that use case

and explain your choice. If you think there is more than one suitable data structure,

briefly discuss the trade offs.

a.You want to store a phone book, which supports looking up a phone number by

name, as well as adding and removing entries.

b.You are looking for a way out of a maze, and you are not allowed to use

recursion. You have yourself in a dead-end and explore a new possibility from there.

17.Write routines to implement two stacks using only one array. Your stack routines

should not declare an overflow unless every in the array is used.

4

18.A palindrome is a string that reads the same forwards and backwards. Using only a

fixed number of stacks and queues, the stack and queue ADT functions and a fixed

number of int and char variables, Write an algorithm to determine if a string is a

palindrome. Assume that the string is read from an input stream one character at a time.

The algorithm should output TRUE or FALSE as appropriate.

19.Write a macro definitions with arguments for calculation of Simple Interest and

Amount.Store these macro definitions in a file called ―interest.h‖. Include this file in

your program, and use the macro definitions for calculating simple interest and amount.

20.Write a function to compute the distance between two points and use it to develop

another function that will compute the area of the triangle whose vertices are A(x1,y1),

B(x2,y2), and

C(x3,y3). Use these functions to develop a function which returns a value 1 if the point

(x,y)

Lies inside the triangle ABC, otherwise returns a value 0.

21.Twenty five numbes are entered from the keyboard into an array.The number to be

searched is entered through the keyboard by the user. Write a program to find if the

number to be searched is present in the array and if it is present, display the number of

times it appears in the array.

22.The area of a triangle can be computed by the sine law when two sides of the triangle

and the angle between them are known.

Area=(1/2)ab sin(angle).

Given the following 6 triangular pieces of land, Write a program to find their area and

determine

Which is largest.

Plot No a b angle

1 137.4 80.9 0.78

2 155.2 92.62 0.89

3 149.3 97.93 1.35

4 160.0 100.25 9.00

5 155.6 68.95 1.25

6 149.7 120.0 1.75

23.Write a program that uses an array of pointers to strings str[]. Receive two strings

str1 and str2 and check if str1 is embedded in any of the strings in str[]. If str1[] is found,

then replace it with str2.

Char *str[]={ ―we will teach you how to…‖,

―Move a mountain‖,

―Level a building‖,

5

―Erase the past‖,

―Make a million‖,

―..all through C‖

};

For example if str1 contains ―mountain‖ and str2 contains ―car‖, then the second string

in str should get changed to ―Move a car‖.

24.A factory has 3 divisions and stocks 4 categories of products. An inventory table is

updated for each division and for each product as they are received. There are three

independent suppliers of products to the factory.

(a) design a data format to represent each transaction.

(b) Write a program to take a transaction and update the inventory.

© Ifthe cost per item is also given write a program to calculate the total inventory

values.

25. An automobile company has serial number for engine parts starting from AA0 to

FF9. The other characteristics of parts to be specified in a structure are:Year of

manufacture, material and quantity manufactured.

(a) Specify a structure to store information corresponding to a part.

(b) Write a program to retrieve information on parts with serial numbers between BB1

and CC6.

26.There is a structure called employee that holds information like employee code,

name, date of joining. Write a program to create an array of structures and enter some

data into it. Then ask the user to enter current date. Display the names of those

employees whose tenure is 3 or more than 3 years according to the given current date.

27.Write a menu driven program that depicts the working of a library. The menu options

should be:

1.Add book information.

2.Display book information.

3.List all books of given author.

4.List the title of specified book.

5.List the count of boks in the library.

6.List the books in the order of accession nimber

7.Exit

28.A hospital keeps a file of blood donors in which each record has the format:

Name: 20 columns

6

Address: 40 columns

Age: 2 columns

Blood Type: 1 column (Type 1,2,3 or 4)

Write a program to read the file and print a list of all blood donors whose age is below

25 and blood is type 2.

29.You are given a data file EMPLOYEE.DAT with the following record structure:

Struct employee {

int empno;

char name[30];

int basic,grade;

};

Every employee has a unique empno and there are supposed to be no gaps between

employee numbers. Records are entered in to the data file in ascending order of

employee number. It is intended to check whether there are missing employee numbers.

Write a program to read the data file recors sequentially and display the list of missing

employee numbers.

30.Write a program to carry out the following:

-To read a text file ―TRIAL.TXT‖ consisting of a maximum of 50 lines of text, each

line with a maximum of 80 characters.

-Count and display the number of words contained in the file.

-Display the total number of four letter words in the text file.

Assume that the end of a word may be a space, comma or a full-stop followed by one or

more spaces or a newline character.

31.Write a program to read and store information about insurance policy holder. The

information contains details like gender, whether the holder is minor/major, policy name

and duration of the policy.Make use of bit-fields to store this information.

32.Ramesh‘s basic salary is input through the keyboard. His dearness allowance is 40%

of basic salary, and house rent allowance is 20% of basic salary. Write a program to

calculate his gross salary.

33.The distance between two cities in km) is input through the keyboard. Write a

program to convert and print this distance in meters, feet, inches and centimeters.

34.If the marks obtained by a student in five different subjects are input through the

keyboard, Write a program to find out the aggregate marks and percentage marks

obtained by the student. Assume that the maximum marks that can be obtained by a

student in each subject is 100.

7

35.In a town, the percentage of men is 52. The percentage of total literacy is 48. If total

percentage of literate men is 35 of the total population, write a program to find the total

number of illiterate men and women if the population of the town is 80,000.

36.A cashier has currency notes of denominations 10,50 and 100. If the amount to be

withdrawn is input through keyboard in hundreds, write a program to find the total

number of currency notes of each denomination the cashier will have to give to the

withdrawer.

37.A library charges a fine for every book returned late. For first 5 days the fine is 50

paise, for 6-10 days fine is one rupee and above 10 days fine is 5 rupees. If you return

the book after 30 days your membership will be cancelled. Write a program to accept the

number of days the

Member is late to return the book and display the fine or the appropriate message.

38.The policy followed by a company to process customer orders is given by the

following rules:

(a) If a customer order quantity is less than or equal to that in stock and his credit is

OJK, supply

His requirement.

(b) If his credit is not OK do not supply. Send him an information.

©If his credit is OK but the item in stock is less than his order, supply what is in stock.

Intimate to him the date on which the balance will be shipped.

Write a C program to implement the company policy.

39.Write a program to calculate overtime pay of 10 employees. Overtime is paid at the

rate of rs.12.00 per hour for every hour worked above 40 hours.Assume that employees

do not work for fractional part of an hour.

40.Write a program for a matchstick game being played between the computer and a

user. Your program should ensure that the computer always wins. Rules for the game are

as follows:

- There are 21 matchsticks

- The computer asks the player to pick 1,2,3, or 4 matchsticks.

-After the person picks,the computer does its picking.

-Whoever is forced to pick up the last matchstick loses the game.

41. Write a menu driven program which has following options:

1.factorial of a number

2.Prime or not

3.Odd or even

4.Exit

8

Once a menu item is selected the appropriate action should be taken and once this action

is finished, the menu should reappear.unless the user selects the ‗Exit‘ option the

program should continue to work.Hint: make use of an infinite while and a switch

statement.

42.Write a program using command line arguments to search for a word in a file and

replace it with the specified word. The usage of the program is shown below.

c> change <old word> <new word> <filename>

43.Write a program that can be used at command prompt as a calculating utility. The

usage of the program is shown below:

c> calc <switch> <n> <m>

where, n and m are two integer operands. Switch can be any one of the arithmetic or

comparison operators. If arithmetic operator is supplied, the output shoud be the result

of the operation. If comparison operator is supplied then the output should be true or

false.

44.the information about colors is to be stored in bits of a char variable called color.The

bit number 0 to 6, each represent 7 colors of a rainbow, ie. Bit 0 represents violet, 1

represents indigo and so on. Write a program that asks the user to enter a number and

based on this number it reports which colors in the rainbow does the number represents.

45.Create an array of four function pointers. Each pointer should point to a different

function. Each of these functions should receive two integers and return a float. Using a

loop call each of these functions using the addresses present in the array.

46.Write a function that receives variable number of arguments, where the arguments

are the coordinates of a point. Based on the number of arguments received, the function

should display type of shape like a point, line, triangle, etc. that can be drawn.

47.Write a program, which stores information about a date in a structure containing

three members – day, month and year. Using bit fields the day number should get stored

in first 5 bits of day, the month number in 4 bits of month and year in 12 bits of year.

Write a program to read date of joining of 10 employees and display them in ascending

order of year.

48.Write a program, which displays ―hello‖ at any place in the window where you click

the left mouse button. If yo click the right mouse button, the color of subsequent

―hello‖s should change.

49.Write a program to create chessboard like boxes(8*8) in the client area. If the

window is resized the boxes should also get resized so that all the 64 boxes are visible at

all times.

50.Write a program that displays different text in different colors and fonts at different

places after every 10 seconds.

9

Class:II Year/ IV Semester B.E., Computer Science and Engineering ‘A’ &‘B’

Section’s

Name of Subject: Computer Networks

Name of Faculty Member: I.Vasudevan

1. Use anonymous FTP to connect to ftp.isi.edu (directory in-notes), and retrieve the

RFC index. Also retrieve the protocol specifications for TCP, IP, and UDP.

2. Use a Web search tool to locate useful, general, and noncommercial information

about the following topics: M Bone, ATM, MPEG, IPv6, and Ethernet.

3. The UNIX utility who is can be used to find the domain name corresponding to an

organization, or vice versa. Read the man page documentation for who is an

experiment with it. Try who is princeton.edu and who is prince on, for starters.

4. What differences in traffic patterns account for the fact that STDM is a cost effective

form of multiplexing for a voice telephone network and FDM is a cost effective form

of multiplexing for television and radio networks, yet we reject both as not being cost-

effective for a general-purpose computer network?

5. Compare the channel requirements for voice traffic with the requirements for the real-

time transmission of music, in terms of bandwidth, delay, and jitter. What would

have to improve? By approximately how much? Could any channel requirements be

relaxed?

6. Suppose a shared medium M offers to hosts A1, A2, . . ., AN in round-robin fashion

an opportunity to transmit one packet; hosts that have nothing to send immediately

relinquish M. How does this differ from STDM? How does network utilization of this

scheme compare with STDM?

7. Modify the simplex-talk socket program so that each time the client sends a line to the

server, the server sends the line back to the client. The client (and server) will now

have to make alternating calls to recv() and send().

8. Investigate the different options and parameters that you can set for a TCP connection

(Do man tcp on Unix.) Experiment with various parameter settings to see how they

affect TCP performance.

9. The Unix utility trace route, or its Windows equivalent tracert, can be used to find the

sequence of routers through which a message is routed. Use this to find the path from

your site to some others. How well does the number of hops correlate with the RTT

times from ping? How well the number of does hops correlate with geographical

distance?

10. Suppose that one byte in a buffer covered by the Internet checksum algorithm needs

to be decremented (e.g., a header hop count field). Give an algorithm to compute the

revised checksum without rescanning the entire buffer. Your algorithm should

consider whether the byte in question is low order or high order.

11. The text suggests that the sliding window protocol can be used to implement flow

control. We can imagine doing this by having the receiver delay ACKs, that is, not

send the ACK until there is free buffer space to hold the next frame. In doing so,

each ACK would simultaneously acknowledge the receipt of the last frame and tell

the source that there is now free buffer space available to hold the next frame.

Explain why implementing flow control in this way is not a good idea.

12. Describe a protocol combining the sliding window algorithm with selective ACKs.

Your protocol should retransmit promptly, but not if a frame simply arrives one or

two positions out of order. Your protocol should also make explicit what happens if

several consecutive frames are lost.

13. Why is it important for protocols configured on top of the Ethernet to have length

field in their header, indicating how long the message is?

10

14. What kinds of problems can arise when two hosts on the same Ethernet share the

same hardware address? Describe what happens and why that behavior is a

problem.

15. Ethernets use Manchester encoding. Assuming that hosts sharing the Ethernet are not

perfectly synchronized, why does this allow collisions to be detected soon after

they occur, without waiting for the CRC at the end of the packet?

16. What conditions would have to hold for a corrupted frame to circulate forever on a

token ring without a monitor? How does the monitor fix this problem?

17. Propose a mechanism that virtual circuit switches might use so that if one switch

loses all its state regarding connections, then a sender of packets along a path

through that switch is informed of the failure.

18. Propose a mechanism that might be used by datagram switches so that if one switch

loses all or part of its forwarding table, affected senders are informed of the failure.

19. Give an example of a working virtual circuit whose path traverses some link twice.

Packets sent along this path should not, however, circulate indefinitely.

20. Suppose a bridge has two of its ports on the same network. How might the bridge

detect and correct this?

21. Cell switching methods essentially always use virtual circuit routing rather than

datagram routing. Give a specific argument why this is so.

22. What aspect of IP addresses makes it necessary to have one address per network

interface, rather than just one per host? In light of your answer, why does IP

tolerate point-to-point interfaces that have non unique addresses or no addresses?

23. Why do you think IPv4 has fragment reassembly done at the endpoint, rather than at

the next router? Why do you think IPv6 abandoned fragmentation entirely? Hint:

Think about the differences between IP-layer fragmentation and link-layer

Fragmentation.

24. Having ARP table entries time out after 10–15 minutes is an attempt at a reasonable

compromise. Describe the problems that can occur if the timeout value is too small

or too large.

25. IP currently uses 32-bit addresses. If we could redesign IP to use the 6-byte MAC

address instead of the 32-bit address, would we be able to eliminate the need for

ARP? Explain why or why not.

26. IP hosts that are not designated routers are required to drop packets misaddressed to

them, even if they would otherwise be able to forward them correctly. In the

absence of this requirement, what would happen if a packet addressed to IP address

A were inadvertently broadcast at the link layer? What other justifications for

this requirement can you think of?

27. Read the man page or other documentation for the Unix/Windows utility netstat. Use

net stat to display the current IP routing table on your host. Explain the purpose of

each entry. What is the practical minimum number of entries?

28. Use the Unix utility traceroute (Windows tracert) to determine how many hops it is

from your host to other hosts in the Internet (e.g., cs.princeton.edu or

www.cisco.com). How many routers do you traverse just to get out of your local

site? Read the man page or other documentation for traceroute and explain how it is

implemented.

29. What will happen if traceroute is used to find the path to an unassigned address?

Does it matter if the network portion or only the host portion is unassigned?

30. The telephone system uses geographical addressing. Why do you think this wasn‘t

adopted as a matter of course by the Internet?

31. Determine if your site is connected to the MBone. If so, investigate and experiment

with any MBone tools, such as sdr, vat, and vic.

11

32. MPLS labels are usually 20 bits long. Explain why this provides enough labels when

MPLS is used for destination-based forwarding.

33. MPLS has sometimes been claimed to improve router performance. Explain why this

might be true, and suggest reasons why in practice this may not be the case.

34. When closing a TCP connection, why is the two-segment-lifetime timeout not

necessary on the transition from LAST ACK to CLOSED?

35. A sender on a TCP connection that receives a 0 advertised window periodically

probes the receiver to discover when the window becomes nonzero. Why would the

receiver need an extra timer if it were responsible for reporting that its advertised

window had become nonzero (i.e., if the sender did not probe)?

36. Read the man page (or Windows equivalent) for the Unix/Windows utility net stat.

Use net stat to see the state of the local TCP connections. Find out how long closing

connections spend in TIME WAIT.

37. Suppose a host wants to establish the reliability of a link by sending packets and

measuring the percentage that are received; routers, for example, do this. Explain

the difficulty of doing this over a TCP connection.

38. Explain why TIME WAIT is a somewhat more serious problem if the server initiates

the close than if the client does. Describe a situation in which this might

reasonably happen.

39. What is the justification for the exponential increase in timeout value proposed by

Karn and Partridge? Why, specifically, might a linear (or slower) increase beless

desirable?

40. The Jacobson/Karels algorithm sets Time Out to be 4 mean deviations above the

mean. Assume that individual packet round-trip times follow a statistical normal

distribution, for which 4 mean deviations are π standard deviations. Using statistical

tables, for example, what is the probability that a packet will take more than Time

Out time to arrive

41. Write your own implementation of htonl. Using both your own htonl and (if little-

endian hardware is available) the standard library version, run appropriate

experiments to determine how much longer it takes to byte-swap integers versus

merely copying them.

42. What DNS cache issues are involved in changing the IP address of, say, a Web

server host name? How might these be minimized?

43. Discuss how you might rewrite SMTP or HTTP to make use of a hypothetical

general- purpose request/reply protocol (perhaps something like CHAN RPC).

Could an appropriate analog of persistent connections be moved from the

application layer into such a transport protocol? What other application tasks

might be moved into this protocol?

44. Most Telnet clients can be used to connect to port 25, the SMTP port, instead of to

the Telnet port. Using such a tool, connect to an SMTP server and send yourself (or

someone else, with permission) some forged email. Then examine the headers for

evidence the message isn‘t genuine.

45. What features might be used by (or added to) SMTP and/or a mail daemon such as

send mail to provide some resistance to email forgeries as in the previous exercise?

46. One of the central problems faced by a protocol such as MIME is the vast number of

data formats available. Consult the MIME RFC to find out how MIME deals with

new or system-specific image and text formats.

47. MIME supports multiple representations of the same content using the multipart/

alternative syntax; for example, text could be sent as text/plain, text/richtext, and

application/postscript. Why do you think plaintext is supposed to be the first

12

format, even though implementations might find it easier to place plaintext after

their native format?

48. Consult the MIME RFC to find out how base64 encoding handles binary data of a

length not evenly divisible by three bytes.

49. Find out how to configure an HTTP server so as to eliminate the 404 not found

message and have a default (and hopefully friendlier) message returned instead.

Decide if such a feature is part of the protocol or part of an implementation, or is

technically even permitted by the protocol. (Documentation for the apache HTTP

server can be found at www.apache.org.)

50. Using the SNMP device and utilities of the previous exercise, fetch the tcp group

(numerically, group 6) or some other group. Then do something to make some of

the group‘s counters change, and fetch the group again to show the change. Try to

do this in such a way that you can be sure your actions were the cause of the change

recorded.

Operating Systems

1. Consider the following set of processes, with the length of the CPU-burst time given

in milliseconds:

Process Burst Time Priority

1. P1 10 0 3

2 .P2 29 1 1

3. P3 3 2 4

4. P4 7 3 5

5. P5 12 4 2

The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.

a. Draw four Gantt charts illustrating the execution of these processes using FCFS,SJF,A

non preemptive priority (a smaller priority number implies a higher priority), and RR

(quantum = 1) scheduling.

b. What is the turnaround time of each process for each of the scheduling algorithms in

part a?

c. What is the waiting time of each process for each of the scheduling algorithms in Part

a?

d. Which of the schedules in part a results in the minimal average waiting time (over all

processes)?

2. Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2,

1, 2, 3, 6.

How many page faults would occur for the following replacement algorithms, assuming

one, two, three,

four, five, six, or seven frames?

Remember all frames are initially empty, so your first unique pages will all cost one

fault each.

LRU replacement

FIFO replacement

Optimal replacement

3. Consider the following page reference string:

1,2,3,4,2,1,5,6,1,2,3,7,6,3,2,1,2,3,6

http://www.apache.org/

13

How many page faults would occur for the LRU, FIFO, LFU and optimal page

replacement algorithms assuming two and five frames?


1,2,3,4,2,1,5,6,1,2,3,7,6,3,2,1,2,3,6


replacement algorithms assuming three and four frames?


1,2,3,4,2,1,5,6,1,2,3,7,6,3,2,1,2,3,6


replacement algorithms assuming two and six frames?


1,2,3,4,2,1,5,6,1,2,3,7,6,3,2,1,2,3,6


replacement algorithms assuming seven frames?

7. Consider the following page reference string: 7,5,7,8,6,0,1,8,9,7,5,4,3,2,1.


one, two, three,



fault each.

LRU replacement

FIFO replacement

Optimal replacement

8. Consider the following page reference string: 8,5,6,4,7,2,1,9,7,2,0,1,6,8,9,0,1.


one, two, three,



fault each.

LRU replacement

FIFO replacement

Optimal replacement


in milliseconds:


1. P1 5 4 3

2 .P2 2 6 7

3. P3 8 2 4

4. P4 7 3 1

5. P5 6 4 3





14


part a?


a?


processes)?


in milliseconds:


1. P1 4 6 7

2 .P2 3 2 0

3. P3 1 8 5

4. P4 7 9 8

5. P5 4 3 2






part a?


a?


processes)?

11. Linux System

12. System Administration, Requirements for Linux System Administrator

13. Setting up a LINUX Multifunction Server

14. Domain Name System and Setting up Local Network Services

15. Virtualization

16. Setting Up Xen

17. VMware on Linux Host

18. Adding Guest OS

19. Windows 7

20. Windows 8

21. Windows 10


in milliseconds:


1. P1 4 5 6

2 .P2 3 4 2

3. P3 7 8 9

4. P4 5 2 3

5. P5 4 3 1





15


part a?


a?


processes)?


in milliseconds:


1. P1 4 3 5

2 .P2 8 9 7

3. P3 7 2 3

4. P4 1 2 4

5. P5 5 2 1






part a?


a?


processes)?


3,2,1,4,6,7,8,4,9,2,1,5,4,3,2,1


replacement algorithms assuming two, three, four and five frames?


7,2,4,3,8,9,4,1,6,7,9,1,4,5,3,8,7,6,4,2,1,2.


replacement algorithms assuming three and five frames?

Class: II Year / IV Semester B.E. Computer Science and Engineering- ‘A’ and ‘B’

Name of Subject: Design and Analysis of Algorithm

Name of Faculty member: Ms.M.Meenakshi Dhanalakshmi

1. Estimate how many times faster it will be to find gcd (31415, 14142) by Euclid‘s

algorithm compared with the algorithm based on checking consecutive integers from

min{m, n} down to gcd(m, n).

2. Write down driving directions for going from your school to your home with the

precision required by Travelling salesman algorithm.

3. Suggest how any sorting algorithm can be augmented in a way to make the best-case

count of its key comparisons equal to just n − 1 (n is a list‘s size, of course). Do you

think it would be a worthwhile addition to any sorting algorithm?

4. Use the most appropriate notation among O, Θ, and Ω to indicate the time efficiency

class of sequential search

16

a. in the worst case.

b. in the best case.

c. in the average case.

5. Design a recursive algorithm for computing 2n for any nonnegative integer n that is

based on the formula: 2n = 2n−1 + 2n−1.

6. Improve the implementation of the matrix multiplication algorithm by reducing the

number of additions made by the algorithm. What effect will this change have on the

algorithm‘s efficiency?

7. Consider the problem of counting, in a given text, the number of substrings that start

with an A and end with a B. (For example, there are four such substrings in

CABAAXBYA.)

(a) Design a brute-force algorithm for this problem and determine its efficiency class.

(b) Design a more efficient algorithm for this problem.

8. One can implement mergesort without a recursion by starting with merging adjacent

elements of a given array, then merging sorted pairs, and so on. Implement this bottom-

up version of mergesort in the language of your choice.

9. Apply mergesort to sort the list E, X, A, M, P, L, E in alphabetical order.

10. What is Travelling Salesperson Problem? Write about the branch and bound solution for

TSP. Solve the following TSP:

11. Give an example of an array of n elements for which the sentinel mentioned in the text is

actually needed. What should be its value? Also explain why a single sentinel suffices

for any input.

12. Apply quick sort to sort the list E, X, A, M, P, L, E in alphabetical order. Draw the tree

of the recursive calls made.

13. Traverse the following binary tree

a.. in preorder. b. in inorder. c. in postorder.

14. Shortest path around There is a fenced area in the two-dimensional Euclidean plane in

the shape of a convex polygon with vertices at points P1(x1, y1), P2(x2, y2), ..., Pn(xn,

yn) (not necessarily in this order). There are two more points, A(xA, yA) and B(xB,

yB), such that xA < min{x1, x2, ..., xn} and xB > max{x1, x2, ..., xn}. Design a

reasonably efficient algorithm for computing the length of the shortest path between A

and B.

17

15. Explain how merge sort works? Sort the following sequence: { 17, 28, 31, 35, 65, 25,

42, 86, 45, 52 }. Write the Merge Sort Algorithm. Analyze the time complexity .

16. Apply insertion sort to sort the list E, X, A, M, P, L, E in alphabetical order.

17. Apply shellsort to the list

S, H, E, L, L, S, O, R, T, I, S, U, S, E, F, U, L

18. A graph is said to be bipartite if all its vertices can be partitioned into two disjoint

subsets X and Y so that every edge connects a vertex in X with a vertex in Y . (We can

also say that a graph is bipartite if its vertices can be colored in two colors so that

every edge has its vertices colored in different colors; such graphs are also called 2-

colorable). For example, graph (i) is bipartite while graph (ii) is not.

a. Design a DFS-based algorithm for checking whether a graph is bipartite.

b. Design a BFS-based algorithm for checking whether a graph is bipartite.

19. Construct a 2-3 tree for the list C, O, M, P, U, T, I, N, G.

20. Explain how hashing can be applied to check whether all elements of a list are distinct.

What is the time efficiency of this application?

21. A top-down 2-3-4 tree is a B-tree of order 4 with the following modification of the

insert operation. Whenever a search for a leaf for a new key encounters a full node (i.e.,

a node with three keys), the node is split into two nodes by sending its middle key to

the node‘s parent (or, if the full node happens to be the root, the new root for the middle

key is created). Construct a top-down 2-3-4 tree by inserting the following list of keys

in the initially empty tree:

10, 6, 15, 31, 20, 27, 50, 44, 18.

22. Discuss about Optimal Binary Search Trees with help of an example? Let n=4, and

(a1, a2, a3, a4) = (do, if, int, while), p(a:4)=(0.15,0.10,0.05,0.10,0.20) and q(0:4) =

0.05,0.10,0.05,0.05,0.10), generate the OBST.

23. Find a stable-marriage matching for the instance defined by the following ranking

matrix:

18

24. Consider the problem of scheduling n jobs of known durations t1, ..., tn for execution

by a single processor. The jobs can be executed in any order, one job at a time. You

want to find a schedule that minimizes the total time spent by all the jobs in the system.

(The time spent by one job in the system is the sum of the time spent by this job in

waiting plus the time spent on its execution.

25. Consider the linear programming problem

Minimize c1x + c2y

subject to x + y ≥ 4

x +3y ≥ 6

x ≥ 0, y ≥ 0

where c1 and c2 are some real numbers not both equal to zero.

(a) Give an example of the coefficient values c1 and c2 for which the problem has a

unique optimal solution.

(b) Give an example of the coefficient values c1 and c2 for which the problem has

infinitely many optimal solutions.

(c) Give an example of the coefficient values c1 and c2 for which the problem does

not have an optimal solution.

Class: II Year IV Semester B.E. Computer Science and Engineering

Name of Subject: Microprocessor and Microcontroller

Name of Faculty member: Ms. G. Misal

1. Interface alpha numeric display with processor and display ―COMPUTER‖ word

in rotating mode.

2. Search a key element in a list of ‗n‘ 16-bit numbers using the Binary search

algorithm using 8086.

3. Sort a given set of ‗n‘ numbers in ascending order using the Bubble Sort

algorithm using 8086.

4. Read the current time from the system and display it in the standard format on

the screen. P4. Compute nCr using recursive procedure. Assume that ‗n‘ and ‗r‘

are non-negative integers.

5. Write a program to create a file (input file) and to delete an existing file.

6. Write two ALP modules stored in two different files; one module is to read a

character from the keyboard and the other one is to display a character. Use the

above two modules to read a string of characters from the keyboard terminated

by the carriage return and print the string on the display in the next line.

7. Reverse a given string and check whether it is a palindrome or not.

8. Read two strings, store them in locations STR1 and STR2. Check whether they

are equal or not and display appropriate messages. Also display the length of the

stored strings.Design XML Schema and XML instance document WSDL based:

Implement Arithmetic Service that implements add, and subtract operations /

Java based: Implement Trigonometric Service.

7. Read your name from the keyboard and display it at a specified location on the

screen after

19

the message ―What is your name?‖ You must clear the entire screen before

display.

8. Read an alphanumeric character and display its equivalent ASCII code at the

center of the

screen.

9. Read a pair of input co-ordinates in BCD and move the cursor to the specified

location on

the screen.

10. Write a program to simulate a Decimal Up-counter to display 00-99.

11. Read the status of eight input bits from the Logic Controller Interface and display

‗FF‘ if it is

the parity of the input read is even; otherwise display 00.

12. Implement a BCD Up-Down Counter on the Logic Controller Interface

13. Read the status of two 8-bit inputs (X & Y) from the Logic Controller Interface

and display

X*Y.

14. Drive a Stepper Motor interface to rotate the motor in specified direction

(clockwise or

counter-clockwise) by N steps (Direction and N are specified by the examiner).

Introduce

suitable delay between successive steps. (Any arbitrary value for the delay may

be assumed

by the student).

15. Display messages FIRE and HELP alternately with flickering effects on a 7-

segment display

interface for a suitable period of time. Ensure a flashing rate that makes it easy to

read both

the messages (Examiner does not specify these delay values nor is it necessary

for the

student to compute these values).

16. Assume any suitable message of 12 characters length and display it in the rolling

fashion on

a 7-segment display interface for a suitable period of time. Ensure a flashing rate

that makes

it easy to read both the messages. (Examiner does not specify these delay values

nor is it

necessary for the student to compute these values).

17. Convert a 16-bit binary value (assumed to be an unsigned integer) to BCD and

display it

from left to right and right to left for specified number of times on a 7-segment

display

interface.

20

18. Scan a 8 x 3 keypad for key closure and to store the code of the key pressed in a

memory

location or display on screen. Also display row and column numbers of the key

pressed.

19. Generate the Sine Wave using DAC interface (The output of the DAC is to be

displayed on

the CRO).

20. Generate a Half Rectified Sine wave form using the DAC interface. (The output

of the

DAC is to be displayed on the CRO).

21. Generate a Fully Rectified Sine waveform using the DAC interface. (The output

of the DAC

is to be displayed on the CRO).

22. Drive an elevator interface in the following way:

i. Initially the elevator should be in the ground floor, with all requests in OFF

state.

ii. When a request is made from a floor, the elevator should move to that floor,

wait there

for a couple of seconds (approximately), and then come down to ground floor

and stop.

If some requests occur during going up or coming down they should be

ignored.

23. Design a microcontroller based automobile alarm system. Give a general block

diagram,

circuit diagram and program. The purpose of the system is to prevent intruders

from stealing

the car or any other items in the vehicle.

24. Write a program using 8086 for copying the 12 bytes of data from source to

destination and

verify.

25. Implementation of temperature sensor using Nuvoton board.

26. Write a program for digital clock using design using 8086.

27. Write an assembly language program based on 8085 microprocessor to

implement a look-up

table translation to generate the codes for seven-segment display with our digits.

(Assume

INPUT PORT O D 6 H, and OUTPUT PORT OD 4H).

28. a. Given that the stack segment register is pointing to location 1105h, the stack

pointer

register contains 001Ah, AX = 2456h, BX = 4562h, indicate the address of

the bottom of

the stack, and the address of the top of the stack. If the instruction PUSH AX

21

followed

by instruction PUSH BX are performed, calculate the new value of SP and

indicate how

the values of AX and BX are stored in memory.

28.b. Given that the stack segment register is pointing to location 2408h, the stack

pointer

register contains 000Ah, location 2408Ah contains 8934h and location 2408Ch

contains

1243h, indicate the address of the bottom of the stack, and the address of the

top of the

stack. If the instruction POP AX followed by instruction POP BX are

performed, calculate

the new value of SP and the values of AX and BX.

29. Write ALP to find mean, median and mode of the given series of number.

30. Write a program to transfer 5 words from starting source address 8000ch to the

starting

destination address 80010h, all the memory segments should be overlapped.

CS6403 Software Engineering

1. What IBM Enterprise IT Automation Services can do for software engineering?

2. Give a detail study about Automating outcomes versus automating processes.

3. Influence of IBM Watson in automation of software engineering.

4. What is the scope of Software Engineering? What‘s going on in software

engineering? What‘s the current ―next big thing?‖

5. Explain future trends in Software Engineering Research for Mobile Apps.

6. What makes automation possible? Why semi-automation is better than full

automation? So, when is full automation preferable to semi-automation?

7. What's the use of PEGA technology (Business Process Management tool)?

8. What are Software Analysis Tools? How software analysis work throughout the

development cycle?

9. Why Testing Tools are used? Give examples of widely used Testing Tools.

10. You have been appointed a project manager for a major software products company.

Your job is to manage the development of the next generation version of its widely

used word-processing software. Because competition is intense, tight deadlines have

been established and announced. What team structure would you choose and why?

What software process model(s) would you choose and why?

11. Assume that you are the technical manager of software of a software development

organization. A client approached you for a software solution. The problems stated

by the client have uncertainties which lead to loss if it not planned and solved.

Which software development model you will suggest for this project – Justify.

Explain that model with its pros and cons and neat sketch.

12. For a case study of your choice show the architectural and component design.

13. Why does software fail after it has passed from acceptance testing?

14. Draw the diagram which represent ―Translating requirements model into design

model‖.

15. Consider a program for determining the previous date. Its input is a triple of day,

month and year with the values in the range 1 <-month <=12,

22

1<=day<=31,1990<=year<=2014. The possible outputs would be previous date or

invalid input date. Design the boundary value test cases.

16. A program specs state the following for the input field. The program shall accept an

input value of 4-digit integer equal or greater than 2000 and less than or equal 8000.

Determine the test cases using

17. Equivalence class partitioning

18. Boundary value analysis.

19. Mr.Koushan is the project manager on a project to build a new cricket stadium in

Mumbai, India. After six months of work, the project is 27% complete. At the start

of the project, Koushan estimated that it would cost $50,000.000, What is the Earned

Value?

20. Suggest three measures, three metrics, and corresponding indicators that might be

used to assess the service department of an automobile dealership.

21. Apply Spiral model or Waterfall model for the development of the Railway

Reservation System.

22. Consider a University registration system. The system is to handle student

registration for various courses offered by the university as well as for examinations.

Identify the risks associated with such a software system.

23. You are developing a safety critical system which will control the operations at a

nuclear power plant. Which software development model will you use and why?

24. A software development company is developing a website for FIFA Soccer world

cup 2016. The web site will remain operational for 3 months. What process model

should be used for software development? Justify your answer.

25. An Educational Institute requires a library management system and has contacted

your firm. You have 25 programmers, out of which 18 are busy with other projects

for the time being. The Institute intends to acquire library books and other

equipment, which they want to interface with the computer system. The annual

evaluation of the Institute is due soon, in which computerization initiatives are

appreciated.

i. List the process model that you think will be most appropriate for

the following situation. Also list your reasons for choosing the

process model and any assumptions that you make.

ii. List three reasons not to choose

Spiral Model

iii. List three reasons not to choose RAD Model

26. You are the project manager for a new management accounting system that will

provide monthly profit and loss accounts to a chain of 30 computer dealerships, each

of which is franchised to its local owner/manager. They have all done their own

accounting before. What change issues would you expect to encounter? Does the

fact that they are PC dealerships make any difference? Why might they have joined

together in the chain?

27. Consider the organization that employs you or where you study. What is its culture?

Why does it have that particular culture? What organizational culture would give

you most satisfaction as an employee? Where might you find such an employer?

Given your preferred organizational culture, what would it mean for you as an

employee in terms of your responsibilities and obligations?

28. If you knew about an organization‘s strategy, could you suggest IS applications that

would support it? For example, how could a large supermarket chain use information

systems for cost reduction, or for a strategy based on differentiation?

29. What would you say are the principal advantages and disadvantages of the sequential

approach to system development offered by the waterfall and ‗V‘ lifecycle models?

23

30. Increasing interest is being taken in the use of rapid application development. Why is

this, and are there any dangers associated with the RAD approach?

31. Consider how you would organize your project team for a RAD-type project. What

leadership practices would it require from the project leader and what would the

team members have to do? How, and at which points, would you involve the users?

32. The Delphi technique aims to achieve a consensus estimate from the efforts of a

number of estimators. How is this achieved and what is the advantage of the Delphi

technique over, for example, a round-table discussion?

33. Scheduling a project involves understanding the degree to which project tasks can be

partitioned. What is meant by this term and what effect does partitioning have on the

scheduling process?

34. What do you understand by the term project milestone? How would you decide how

many milestones to show on your project plan?

35. Your project is behind schedule and you are considering adding extra staff to the

team. What would be the potential advantages and disadvantages of this approach?

36. If you had to develop a strategy for a small software house employing 50 or so

professional computer people, how would you go about it? What criteria would you

use to test whether or not the strategy was sound?

Class: III Year VI Semester B.E. Computer Science and Engineering – ‘A’ & ‘B’ Sections

Name of Subject: Distributed Systems

Name of Faculty member: Mrs.M.Mythili

1. Develop a program for concurrent echo client server application using C.

2. Develop a program for concurrent day time client server application using C.

3. Test and Configure following options on server socket: SO_KEEPALIVE,

SO_LINGER, SO_SNDBUF, SO_RCVBUF, TCP_NODELAY.

4. Design a program to Incrementing a counter in shared memory.

5. Create CORBA based server client application.

6. Design XML Schema and XML instance document WSDL based: Implement

Arithmetic Service that implements add, and subtract operations / Java based:

Implement Trigonometric Service]

7. Build a program to implement sin and cos operations.

8. Test and Configure reliability and security options in sockets using Java.

9. Monitor SOAP request and response packets. Analyze parts of it and compare

them with the operations (java functions) headers.

10. Design and test BPEL module that composes Arithmetic Service and

Trigonometric Service.

11. Design a program that offers an electronic postcard service using the existing

components.

i. a client for card database and card write

ii. Server for the web browser

12. Develop the user interface in HTML three web pages.

i. First webpage presents all cards in the database a as thumbnails

ii. Second page has the image choose cards and text fill to input quality

message

24

iii. Third page consists of card with message embedded in card

13. Create a program to simulate the functioning of lamports logical clock using C

and java.

14. Create a program to simulate the distributed mutual exclusion in C & Java.

15. Design a CORBA mechanism by using C++ in one end and Java program at

other end.

16. Test a program to implement a distributed chat server using TCP sockets in C.

17. Give five types of hardware resources and five types of data or software

resources that can usefully be shared. Give examples of their sharing as it occurs

in distributed systems.

18. Give an example of a URL. List the main components of a URL, stating how

their boundaries are denoted and illustrating each one from your example. To

what extent is an URL location transparent?

19. Consider a simple server that carries out clients requests without accessing other

servers. Explain why it is generally not possible to set a limit on the time taken

by such a server to respond to a client request. What would need be done to

make the server able to execute requests within a bounded time?

20. Define the integrity property of reliable communication and list all the possible

threats to integrity from users and from systems components. What measures

can be taken to ensure the integrity property in face of each of these sources of

threats?

21. Develop a distributed program that has multiple clients and a database server.

The database server manages a single table of records. Clients are allowed to

select, insert, delete, or update records in the table. The table can be accessed by

at most one client at a time. An operation (select, insert, delete, update) is

blocking for the client, that is, it must wait for and receive a reply confirming

the operation has completed.

You must assume that the table is initially empty.

The table has the following structure:

(supp_no int,

supp_name string[30],

supp_city string[30],

primary key (supp_no))

The select operation requires a primary key value to identify a record.

The delete operation can use a primary key to delete a single record, or no

primary key value to delete all records.

The insert operation requires a value for the primary key, but other fields are

optional.

The update operation requires a primary key value and optionally values for

other fields.

22. Compare connectionless (UDP) and connection oriented (TCP) communication

for the implementation of each of the following application level or presentation

level protocols:

25

i. virtual terminal access (For example, telnet);

ii. file transfer (For example, FTP);

iii. user location (For example rwho, finger);

iv. information browsing (For example, HTTP);

v. remote procedure call�

IT 6601 MOBILE COMPUTING - ASSIGNMENT TOPIC

Assignment notice : Feb 06th

, 2016

Assignment Due : Mar 20th

, 2016

Team Size : 04 members per team

Total points : 10 [Video: 3 points, Code and implementation: 7 points]

What to submit: Create and submit an android project as tar.gz file. The assignment

should be completed in group of four. In addition to the source code, submit a video

describing the features of application. The video can be uploaded in YouTube and needs

to be shared. The best project would receive 5 extra credits.

Assignment Description: In this assignment a simple application has to be build that

acts as a diary for faculty members in our institution. The assignment will help to

understand about design activities and building simple user interfaces. Throughout the

assignment, the design may be UI flexible. Use your creativity to design the UI

elements. There are no constraints on what UI elements are allowed. An example UI will

be provided that can be used to test the application.

Initially, the application will start with a main screen, where it will show the following

options: Contact, Courses Taught, Events, and News. Each of these options represents a

separate activity of the application. More details on each of these modules are provided

below:

1. Contact will display information about the faculty member. The information will

contain the following: Office Address, contact email, office hours, and course offering

this semester. The app should have the option to edit this Contact information.

Following is the format of the ―contact‖ information in the provided XML file. The App

needs to load this information from the provided XML file and update the xml file if any

user makes changes.

<contact type="faculty"

name="Dr. Nilanjan Banerjee"

position="Assistant Professor"

office="ITE 362"

email="[email protected]"

phone="999999999"

office hour="10-11am Mon,thursday">

<course name="Wireless Network and Systems"

CRN="CS 795"/>

<course name="App Development for Smart Devices"

CRN="CS 495"/> </contact>

2. The Courses activity will display a list of courses that are offered by the faculty

member during the current semester. It will show the following information about

26

courses: Course number (CN), Course Title, Credit Hours, Days (Class day), and Time

(class time). The user should be able to edit this information corresponding to each

course. Following is the format of the ―courses‖ tag in the input XML file. The App will

load this information from the provided XML file and update it if any changes were

made.

<courses CN="16746"

courseTitle="Database Concept"

creditHours="3.00"

Days="TR"

Time="1:30-2:45pm" />

3. In the Events module, the faculty member should be able to add/delete/edit their own

events, for example, classes. Following is the format of the ―events‖ in the input XML

file. The app will load this information from the provided XML file and update it if any

changes are made by the user.

<events

type="class"

time="1:30-2:45pm"

day="TR"note="

Class Database" />

<events

type="appointment"

time="1:30-2:45pm"

day="W"

note="TA Database" />

4. The news module will show recent news about the faculty. Basically, it will show

recent research activities/grants/achievements. The user should be able to edit news

information. Following is the format of ―news‖ in the XML file. App needs to load this

information from the provided XML file and update it if any changes are done.

<news

title="Title: Machine Learning in Vision and Brain Analytics"

keyword="Machine Learning"

highlights="Shuiwang Ji" />

Class: III Year VI Semester B.E. Computer Science and Engineering

Name of Subject: Compiler Design

Name of Faculty member: Mr. Prabakaran S

1. Given the following CFG grammar G = ({S,A,B}, S, {a, b, x), P) with P:

(1) S→A

(2) S →xb

27

(3) A→aAb

(4) A →B

(5) B →x

For this grammar answer the following questions:

9. Compute the set of LR(1) items for this grammar and the corresponding DFA.

Do not forget to augment the grammar with the default initial production S‘ →S$

as the production (0).

10. Construct the corresponding LR parsing table.

11. Would this grammar be LR(0)? Why or why not? (Note: you do not need to

construct the set of LR(0) items but rather look at the ones you have already

made for LR(1) o answer this question.

12. Show the stack contents, the input and the rules used during parsing for the input

string w = axb$e)

13. Would this grammar be suitable to be parsed using a top down LL parsing

method? Why?

Syntax-Directed Translation

2. Consider the following syntax-directed definition over the grammar defined by G =

({S, A, Sign}, S, {‗,‘, ‗-‗, ‗+‘, ‗n‘}, P) with P the set of production and the

corresponding semantic rules depicted below. There is a special terminal symbol ―n‖

that is lexically matched by any string of one numeric digit and whose value is the

numeric value of its decimal representation. For the non-terminal symbols in G we

have defined two attributes, sign and value. The non-terminal A has these two

attributes whereas S only has the value attribute and Sign only has the sign attribute.

S →A Sign || S.val = A.val; A.sign = Sign.sign; print(A.val);

Sign →+ || Sign.sign = 1

Sign →- || Sign.sign = 0

A →n ||A.val = value(n)

A →A1 , n || A1.sign = A.sign;

if(A.sign = 1) then

A.val =min(A1.val,value(n));

else

A.val =max(A1.val,value(n));

For this Syntax-Directed Definition answer to the following questions:

a) Explain the overall operation of this syntax-directed definition and indicate (with a

brief explanation) which of the attributes are either synthesized or inherited.

b) Give an attributed parse tree for the source string―5,2,3-― and evaluate the

attributes in the attributed parse tree depict ing t he order in wh ich the a t tribu tes

need to be evaluated (if more than one order i s po ss i b le i ndicate one .)

28

c) Suggest a modified grammar and actions exclusively using synthesized attributes.

Explain its basic operation.

3. Suppose that your language supports the dynamic allocation of single-dimensional

vectors or arrays and that the grammar productions are as shown below:

vec_expr →id [ expr ]

expr →id

S →id = vec_expr

S→vec_expr = expr

where expr is a generic expression with attributes place and code that indicate,

respectively the temporary variable where the result of the evaluation of the

expression will reside and the corresponding code. Note that because an array

reference might

appear on the left - hand-side or on the right-hand-side of an assignment, you need to

use a base address and an index to evaluate the expression in the context of an

assignment statement.

Regarding the code generation for these array accesses answer the following

questions:

a) Define an SDT for the generation of intermediate code that computes the value of

vec_expr. Given that the sizes of the array are only known at run-time (after

allocation) you need to have access to a dope vector structure. Assume you know

the address of this vector given by the variable reference ―dyn_vec(id.name)‖. The

first location of this auxiliary array holds the base address of the vector (and index

0) and the second location of this vector holds the size of the single dimension of

the vector (at index 1).

b) Show the results of your work on the statement ―v = a[i]‖indicating the AST with

the values of the attributes.

c) Redo a) for the case where you want to include code that checks the bounds of the

accesses to the vector. For instance when generating code for ―a[i]‖ you need to

check if the index value (in this case ―i‖) is both non-negative and less than the

dimension of the vector.

4. Explain about the Java layer compiler design.

5. Consider the production. S → aAb A → cd | c show that recursive descent parsing

fails for the input string ―acdb‖ also explain recursive descent algorithm

6. Consider the production given below

S→CC | CSC Prof. James want to parse the input string CCCCCC using recursive

descent parsing. Is it possible to do that? Justify your answer

7. Discuss about the Compiler construction and Boot strapping.

8. Find the First and Follow for the given grammars

(a) Stmt_sequence → stmt stmt_sequence‘

Stmt_sequence‘→ ; stmt_sequence | ε

(b) S → ,GH;

G → aF

F →bF | ε

H → KL

29

K → m | ε

L → n | ε

9. Explain about the optimization techniques of P3 Compiler.

10. Construct the LR (0) parsing table for the following grammar

S → Ac

A → AB| ε

B → aB | b.

11. Write a description of translation of pascal to EM code in the ACK Pascal

Compiler.

12. Write an algorithm for computation of CLOSURE of LR (0).

13. Explain about the BISON parser generator.

14. Discuss about FORTRON I Compiler.

15. What do you mean by inter procedural analysis? Discuss in detail.

Class: III Year/ V Semester B.E. Computer Science and Engineering – ‘A’

SectionName of Subject: Artificial Intelligence

Name of Faculty member: A.P.V.Raghavendra

1. Design and Implementation of an Acoustical Transmission Protocol

2. Evaluation of Multi-Agent Platforms for Ubiquitous Computing

3. Rapid Development of Realistic UAV Simulations

4. A machine learning approach in financial markets

5. Background Analysis and Design of ABOS, an Agent-Based Operating System

6. Intelligent Tourist Information System

7. Large Scale SLAM in an Urban Environment

8. Integrating actions of perception to the electric field approach

9. Performance Comparison of AI Algorithms – Anytime Algorithms

10. Software Process Improvement Using Groupware – Supporting Distributed

Cooperation in Software Development

11. Plan-Based Configuration of a Group of Robots

12. Automated Theorem Proving – Resolution vs. Tableaux

13. A Multi-Agent System for playing the board game Risk

14. Navigation for Autonomous Wheelchair Robot

15. Classification of objects in images based on various object representations

16. Visual Semantic Web Ontology based E-learning management system

17. An Electric Field Approach – A Strategy for Sony Four-Legged Robot Soccer

18. A method for collision handling for industrial robots

19. Controlling a Robot Hand in Simulation and Reality

20. Laser feedback control for robotics in aircraft assembly

21. Real Time Speech Driven Face Animation

22. The State of the Art in Distributed Mobile Robotics

23. Functional Approach towards Approximation Problem

24. Evaluation of a Machine Learning Approach To Heat Prediction

25. The Use of Case-Based Reasoning in a Human-Robot Dialog System

26. Electronic Contracting for Inter-Enterprise Collaboration

27. Intelligent decision support system for transport infrastructure investment with

emphasis on joint logistic

28. Simulation-based evaluation of berth allocation policies of container terminals

30

29. Optimizing Genetic Algorithms for Time Critical Problems

30. Load Control Management in Intelligent Networks

31. Data mining algorithms to analyze medical data

32. Face Detection by Image Discriminating

33. Directory scalability in multi-agent based system

34. AI (Artifical Intelligence) Based Image Capturing and transferring to PC/CCTV

using Robot

35. Material Dimensions Analyzing Robot

36. An intelligent mobile robot navigation technique using RFID Technology

37. IVRS Based Robot Control with Response & Feed Back

38. Library Robot – Path Guiding Robotic System with Artificial Intelligence using

Microcontroller

39. Wireless Artificial Intelligence Based Fire Fighting Robot for Relief Operations

40. A Humanoid Robot to Prevent Children Accidents

41. Motion Detection, Robotics Guidance & Proximity Sensing using Ultrasonic

Technology

42. Robust Sensor-Based Navigation for Mobile Robots

43. Visual tracking control to fast moving target for stereo vision robot

44. A Voice Guiding System for Autonomous Robots

45. Artificial Intelligent based Solar Vehicle

46. Mobile robot control based on information of the scanning laser range sensor

47. Walking Robot with Infrared Sensors / Light Sensors / RF Sensor / Tactile

Sensors

48. IVRS Based Control of Three Axis Robot With Voice Feed back

49. Intelligent Mobile Robot for Multi Specialty Operations

50. Sensor Operated Path Finding Robot (Way Searching)

51. Design and Development of Obstacle Sensing and Object Guiding Robot

52. SMS controlled intelligent searching and pick and place moving robot

53. Artificial Intelligence Based Image Capturing and Transferring to PC using

Robot

54. Artificial Intelligent Based Remote controlled Automatic Path finding Cum

Video Analyzing Robot

55. Wall Follower Robot with The Help of Multiple Artificial Eyes

56. Sensor Operated Automatic Punching robot

57. Fire Fighting Robotics with AI (Artifical Intelligence) and WAP

58. Intelligent Robot with Artificial Intelligence computer Brain system

59. Remote controlled Pneumatic Four Axis Material Handling Robot

60. Advanced Robotic Pick and Place Arm and Hand System

61. Voice Controlled Material handling Robot

62. A Hands Gesture Control System of for an Intelligent Robot

63. Robotic Vision and Color Identification System with Solenoid Arm for Colored

Material Separation

64. Artificial Intelligence Based Fire fighting AGV

65. SMS controlled video analyzing robot

66. Staircase Climbing Robot – Implemented in Multi-Domain Approach

67. Fully Automated Track Guided Vehicle (ATGV) Robot

68. PC based wireless Pick and Place jumping robot with remote control

69. Three Axis Robotics With Artifical Intelligence (AI)

70. Gesture sensing robots

31

Name of the Course (Subject): Software Testing

Name of the Faculty member: Yuvarani A

Class / Semester: III Year/VI Semester B.E. Computer Science and Engineering

‘A’ & ‘B’ Sections

1. You are to write a program that adds two two-digit integers. Can you test this program

exhaustively? If so, how many test cases are required? Assuming that each test case can

be executed and analyzed in one second, how long would it take for you to run all tests?

2. We argued that the number of defects left in a program is proportional to the number

of defects detected. Give reasons why this argument looks counter intuitive. Also, give

practical reason why this phenomenon causes problems in testing.

3. Write a simple factorial and sum of positive integers program and try to take care of

as many valid and invalid conditions as possible. Identify what test data would you use

for testing program. Justify your answer.

4. For the program of standard deviation draw the flow graph and hence calculate the

Cyclomatic complexity of the program.

5. Consider the C program for deleting an element from a linked list. Suggest a set of

test data to cover each and every statement of the program.

6. Write a simple biggest among three numbers and reverse the string program and try to

take care of as many valid and invalid conditions as possible. Identify what test data

would you use for testing program. Justify your answer.

7. Discuss the pros and cons of function coverage with other forms of coverage.

8. Write a simple matrix multiplication program and try to take care of as many valid

and invalid conditions as possible. Identify what test data would you use for testing

program. Justify your answer.

9. Consider the C program for deleting an element from a linked list. What are the

boundary value conditions for that example? Identify test data to test at and around

boundary values.

10. Programmer A and Programmer B are working on a group of interfacing modules.

Programmer A tends to be a poor communicator and does not get along well with Programmer B.

Due to this situation, what types of defects are likely to surface in these interfacing modules?

11. Your organization has worked very hard to improve its testing process. The most

recent test process assessment using the Testing Maturity Model showed that you are at

TMM level 3. How would you describe your current testing process based on that

assessment? What are the maturity goals that you have achieved at that TMM level?

12. Suppose you were developing a stub that emulates a module that passes back a hash

value when passed a name. What are the levels of functionality you could implement for

this stub? What factors could influence your choice of levels?

13. An air-traffic control system can have one or many users. It interfaces with many

hardware devices such as displays, radar detectors, and communications devices. This

system can occur in a variety of configurations. Describe how you would carry out

configuration tests on this system.

32

14. From your experience with online and/or catalog shopping, develop a use case to

describe a user purchase of a television set with a credit card from a online vendor using

web-based software. With the aid of your use case, design a set of tests you could use

during system test to evaluate the software.

15. You are developing a module whose logic impacts on data acquisition for a flight

control system. Your test manager has given you limited time and budget to test the

module. The module is fairly complex; it has many loops, conditional statements, and

nesting levels. You are going to unit test the module using white box testing approaches.

Describe three test adequacy criteria you would consider

applying to develop test cases for this module. What are the pros and cons for each.

Which will have the highest strength?

16. Suppose you have developed a module with the following conditional statement:

if (value < 100 and found __ true)

call (enter_data (value))

else

print (‗‗data cannot be entered‘‘)

Create tables as shown in the text containing test data that will enable you to achieve

(i) simple decision coverage, (ii) condition coverage, and (iii) decision/condition

coverage.

17. The following is a pseudocode fragment that has no redeeming features except for

the purpose of this question. Draw a control flow graph for the example and clearly label

each node so that it is linked to its corresponding statement. Calculate its cyclomatic

complexity. How can you use this value as a measure of testability? Describe how a

tester could use the cyclomatic complexity and the control flow graph to design a set of

white box tests for this module that would at least cover all its branches.

/* a[] and b[] are global variables */

begin

int i,x

i _1

read (x)

while (i < x) do begin

a[i] _ b[i] * x

if a[i] > 50 then

print (‗‗array a is over the limit‘‘)

else

33

print (‗‗ok‘‘)

i _ i _1

end

18. The following is a unit that implements a binary search. It decides if a particular

value of x occurs in the sorted integer array v. The elements of v are sorted in increasing

order. The unit returns the position a value between 0 and n _1 if x occurs in v, and _1 if

not. Draw a control flow graph for the example, and clearly label each node to show its

correspondence to a statement. Calculate its cyclomatic complexity. How many test

cases are needed to adequately cover the code with respect to its branches? Develop the

necessary test cases using sample values for x, n, and v as needed and show how they

cover the branches.

int binsearch (int x,int v[], int n)

{

int low, high, mid;

low _ 0;

high _ n-1;

while (low <_ high) {

mid _ (low_high)/2

if (x < v[mid]

high _ mid–1;

else if (x > v[mid])

low _ mid_ 1;

else /* found match*/

return mid;

}

return–1; /* no match*/

}

19. Using your original (untested) version of the coin program, design a set of test cases

based on the branch adequacy criterion. Be sure to develop tables that identify each

branch and the test cases that are assigned to execute it. Run the tests on the original

code. Be sure that your tests actual execute all the branches; your goal is 100%

coverage. If your original set is not adequate, add more tests to the set. Compare the

defects you detected using the branch adequacy criterion in terms of number and type to

results from each of the black box testing technique. What differences were apparent?

20. For following looping construct, describe the set of tests you would develop based

on the number of loop iterations in accordance with the loop testing criteria

34

for (i _ 0; i < 50; i__)

}

text_box[i] _ value[i];

full _ full–1;

}

21. A programmer using a mutation analysis tool finds that a total of 35 mutants have

been generated for a program module A. Using a test set she has developed she finds

after running the tests the number of dead mutants is 29 and the number of equivalent

mutants is 2. What is the mutation score (MS) for module A. Is her test set for module A

mutation adequate? Should she develop additional test cases? Why?

22. A project manager estimates that the total costs of a project as $375,000. The project

is a business application. There are security, performance, and configuration

requirements (the latter due to devices that will interface with the software system). The

testers are experienced and have tool support and training. The number of test

procedures is estimated at 670, with a ratio of 5.9 hours/test procedure from the

historical database of similar projects. Assume that the salary of the testers is $37/hour.

Estimate the costs of test for this project in as many ways as you can use the information

given. Compare the results of the estimates. Which result do you have more confidence

in?

23. The implementation of a defect-prevention program is a maturity goal at TMM level

5. However, an organization on a lower level of the TMM, for example, on level 2, may

decide to try to implement such a program. Do you think that this is a wise decision?

What types of problems is the organization likely to encounter as it tries to implement

the program? Given the limited capabilities of an organization at TMM level 2, what are

some of the first steps they could take to set up a foundation for such a program?

24. Suppose you are a test manager and you observe that many defects appear in the test

procedures developed by your testing team. You decide to apply defect causal analysis

techniques to try to prevent these defects from reoccurring. Your test team consists of

many new hires. They have attended a few training sessions; most do not have advanced

degrees. Some of the team members have had extensive

development experience; others have not. Develop a fishbone diagram to trace the

causes of these defects based on the above scenario. You may need to make some

assumptions about the testing environment to supplement the information given.

25. A test engineer has just started to record defect data for her process. She spends the

bulk of her time developing test harness code. The following defect data was collected

from 10 recent projects she has worked on. The defect types are: 10, documentation; 20,

syntax; 30, build; 40, assignment; 50, interface; 60, checking; 70, data; 80, function; 90,

system; 100, environment.

Defect type Number of occurrences

_____________________________________

10 5

35

20 40

30 5

40 22

50 14

60 9

70 11

80 38

90 2

100 1

Name of the Course (Subject) : Multi-Core Architectures and Programming

Name of the Faculty member : Mrs.R.Kohila

Class/Semester: IV Year/VIII Semester B.E. Computer Science and Engineering

1. Sketch a four-dimensional hypercube and Use the inductive definition of a

hypercube to explain why the bisection width of a hypercube is p=2.

2. Explain why the performance of hardware multithreaded processing core might

degrade if it had large caches and it ran many threads.

3. Is a program that obtains linear speedup strongly scalable? Explain your answer.

4. Write a program that can be used to determine the cost of changing the

distribution of a distributed data structure. How long does it take to change from

a block distribution of a vector to a cyclic distribution? How long does the

reverse redistribution take?

5. Explain how a queue, implemented in hardware in the CPU, could be used to

improve the performance of a write-through cache.

6. Explain why the performance of hardware multithreaded processing core might

degrade if it had large caches and it ran many threads.

7. Derive formulas for the total number of links in the various distributed- memory

interconnects

8. A parallel program that obtains a speedup greater than p—the number of pro-

cesses or threads—is sometimes said to have super linear speedup. However,

many authors don‘t count programs that overcome ―resource limitations‖ as

having super linear speedup. For example, a program that must use secondary

storage for its data when it‘s run on a single processor system might be able to

fit all its data into main memory when run on a large distributed-memory

system. Give another example of how a program might overcome a resource

limitation and obtain speedups greater than p.

36

9. Modify the mutex version of the calculation program so that the critical section

is in the for loop. How does the performance of this version compare to the

performance of the original busy-wait version? How might we explain this?

10. Write a Pthreads program that finds the average time required by your system to

create and terminate a thread. Does the number of threads affect the average

time? If so, how?

11. Run the basic serial n-body solver for 1000 timesteps with a stepsize of 0.05, no

output, and internally generated initial conditions. Let the number of particles

range from 500 to 2000. How does the run-time change as the number of

particles increases? Can you extrapolate and predict how many particles the

solver could handle if it ran for 24 hours?

12. Parallelize the reduced version of the n-body solver with OpenMP or Pthreads

and a lock/mutex for each particle. The locks/mutexes should be used to pro-tect

access to updates to the forces array. Parallelize the rest of the solver by

parallelizing the inner for loops. How does the performance compare with the

performance of the serial solver? Explain your answer.

13. Modify the Pthreads implementation of static tree search so that it uses a read-

write lock to protect the examination of the best tour. Read-lock the best tour

when calling Best tour, and write-lock it when calling Update best tour. Run the

modified program with several input sets. How does the change affect the

overall run-time?

14. If there are many processes and many redistributions of work in the dynamic

MPI implementation of the TSP solver, process 0 could become a bottleneck for

energy returns. Explain how one could use a spanning tree of processes in which

a child sends energy to its parent rather than process 0.

15. Write an MPI program in which each process generates a large, initialized m-

dimensional array of doubles. Your program should then repeatedly call MPI

Allgather on the m-dimensional arrays. Compare the performance of the calls to

MPI Allgather when the global array (the array that‘s created by the call to MPI

Allgather) has

1. a block distribution, and

2. a cyclic distribution

Name of the Course (Subject) : Software Project Management

Name of the Faculty member : S.Gunasekaran

Class/Semester : IV Year / VIII Semester B.E. CSE 'A' Section

1. An employee of a training organization has the task of creating case study exercises

and solutions for a training course which teaches a new systems analysis and design

method. The person‘s work plan has a three week task learn new method. A colleague

suggests that this is unsatisfactory as a task as there are no concrete deliverable or

products from the activity. What can be done about this?

2. In order to carry out usability tests for a new word processing package, the software

has to be written and debugged. User instructions have to be available describing hoe the

package is to be used. These have to be scrutinized in order to plan and design the tests.

Subjects who will use the package in the test will need to be selected. As part of this

selection process, they will have to complete a questionnaire giving details of their past

experience of, and training in , typing and using word processing package. The subjects

will carry out the required tasks using the word processing package. The tasks will be

37

timed and any problems the subjects encounter with the package will be noted. After the

test, the subject will complete another questionnaire about what they felt about the

package. All the data from the tests will be analyzed and a report containing

recommendations for changes the to package will be drawn up. Draw up a product

Breakdown Structure, A product Flow Diagram and a preliminary activity network for

the above.

3. Identity the actions that could prevent each of the following risks from materializing

or could reduce the impact if it did occur.

(a) a key member of the programming team leaving

(b) a new version of the operating system being introduced which has errors in it.

(c) a disk containing copies of the most up to date version of the software under

development being corrupted.

(d) system testing unearths more errors than were expected and takes longer than

planned.

(e) the government changes the taxation rules which alter the way that VAT is to be

calculated in an order processing system under development.

4. Working in a group of three or four imagine that you are about to embark upon a

programming assignment as part of the assessed work for your course. Draw up a list of

the risks that might affect the assignment outcome. Individually classify the importance

and likelihood of each of those risk as high, medium or low. When you have done this

compare your results and try to come up with an agreed project risk matrix.

5. A software package is to be designed and built to assist in software cost estimation. It

will input certain parameters and produce initial cost estimates to be used at bidding

time.

(a) It has been suggested that a software prototype would be of value in these

circumstances. Explain why this might be.

(b) Discuss how such prototyping could be controlled to ensure that it is conducted in an

orderly and effective way and within a specified rime span.

6. Consider the details held about previously developed modules shown in table. Anew

module has seven inputs, one entity type access and seven outputs. Which of the

modules a to ‗e‘ is the closest analogy in terms of Euclidean distance?

Data concerning previously developed modules.

Module Entity Types

Accessed

Inputs Outputs

Days

A 1 2 10 2.60

B 10 2 1 3.90

C 5 1 1 1.83

D 2 3 11 3.50

E 1 2 20 4.30

7. A report in a college time – tabling system produces a report showing the

students who should be attending each time tables teaching activity. Four files are

38

accessed. The staff file, the student file, the student option file and the teaching activity

file. The report contains the following information.

For each teaching activity:

Teaching activity reference

Topic name

Staff Forename

Staff Surname

Title

Semester( 1 or 2)

Day of week

Time

Duration

Location

For each student

Student Forename

Student Surname

Calculate both IFPUG and Mark II FPs that this transaction would generate. Can you

identity the factors that would tend to make the two methods generate divergent counts?

8. Identity size and productivity effort drivers for the following activities:

1. Installing computer workstations in a new office.

2. Transporting assembled personal computers from the factory where they were

assembled to warehouse distributed in different parts of the country.

3. Typing in and checking the correctness of data that is populating a new database.

4. System testing a newly written software application.

9. In each of the following cases discuss whether the type of application software to be

adopted would be most likely to be bespoke, off-the-shelf or COTS.

(a) A college requires a student fees application. It is suggested that the processes

required in the application are similar to those of any billing system with some

requirements that are peculiar to the administration of higher education.

(b) A computer based application is needed at IOE to hold personnel details of staff

employed.

(c) A national government requires a system that calculates records and notifies

individual tax payers about income tax charges.

(d)A hospital needs a knowledge based system to diagnose the causes of eye complaints.

10. An organization has detected low job satisfaction in the following departments.

The system testing group.

The computer applications help desk

Computer batch input.

11.Three different mental obstacles to good decision making were identified in the text.

faulty heuristics, escalation of commitment and information overload. What steps do

you think can be taken to reduce the danger of each of these?

12. Compute the effort estimate for the following specification using intermediate

COCOMO model, state any assumptions made clearly. The software is to be developed

for a ―communication Processing‖ function using microprocessors. The size of the

embedded software is 10KLOC . The product complexity is rated to be very high, the

programmer capability rated as low and the main storage constraint is high and the

respective efforts multipliers can be taken 1.30, 1.17 and 1.06. All other cost drivers are

assumed to take their normal values.

39

13. As a project manager you are requested to perform the effort estimation for a Air

traffic control project

The following project related information are available to you;

The software has three modules with 5KLOC, 2KLOC and 3KLOC respectively.

The effort multipliers for

(1) Data base size

(2) Product complexity and

(3) Programmer capability are given as 0.95, 1.25 and 0.8 respectively.

All other cost drivers have only nominal effect, hence the effort multiplication

factor for each of them can be assumed to be 1.0.

14. A list of your top ten risks. These should be placed in order, with your biggest

risk first—and don‘t forget to describe how you ranked them. For each risk, describe:

1. what the risk is?

2. a mitigation strategy for the risk?

3. a contingency plan for the risk?

4. how you will know when to invoke the contingency plan?

15. A description of the process you will use for managing risk. This can be

relatively brief (less than one page of text), but should be detailed enough so that each

member of the team understands his/her role in managing risk.

For example,

1. How will your team monitor risk?

2. What process will you use for deciding when to invoke a contingency plan?

3. How will you handle emergencies?

4. Will individual members of the team be authorized to carry out parts of your risk

management strategy, or will the whole team need to meet and agree each

action?

5. How often will you update your list of top ten risks?

16. To help you manage risks, you need to take regular measurements of the status of

your project. Choose a suitable set of project metrics that you will collect during your

project, to help you monitor risk. Describe five of these metrics in detail, including:

1. What you think it might tell you?

2. Whether it is a measure of your product , or a measure of the development

process?

3. How frequently you plan to collect the data?

4. How much effort you think it will take to collect (e.g in minutes per week)?

5. Whether the method for making the measurements is algorithmic or subjective?

6. Whether the scale used for the metric is nominal, ordinal, interval, or ratio?

17. You have been appointed as a project manager within an information system

organization. Your job is to build an application that is quite similar to others your team

has built,although this one is larger and more complex. Requirements have been

thoroughly documented by the customer. What team structure would you choose and

why? What software process model(s) would you choose and why?

v.s.b. engineering college, karur department of computer … · 1.you are given a linked list l,and...

Documents