cse.april may.2012zxz

79
7/27/2019 CSE.april May.2012zxz http://slidepdf.com/reader/full/cseapril-may2012zxz 1/79 Reg. No. ________ Karunya University (Karunya Institute of Technology and Sciences) (Declared as Deemed to be University under Sec.3 of the UGC Act, 1956) End Semester Examination – April/May 2012 Subject Title: DATABASE SYSTEMS Time: 3 hours Subject Code: 09CS201 Maximum Marks: 100 Answer ALL questions PART – A (10 x 1 = 10 MARKS) 1. Where is the output of DDL stored? 2. Name the different levels of Abstraction. 3. What are the different types of outer joins? 4. Define View. 5. What is multivalued attribute? 6. Define Fine granularity. 7. What is the need for normalization? 8. Compare 3NF with BCNF. 9. What is Page shipping? 10. What are the advantages of B+ tree? PART – B (5 x 3 = 15 MARKS) 11. Consider the following table: Employee Person_name Street city Works Person_name Company_name salary Give the expression in SQL: a. Find the names of all employees who work for TCS.  b. Find the names and cities of residence of all employees who work for TCS. c. Find the sum of salary of all employees. 12. How are views updated? What are the restrictions in updating views? 13. How are Roles used in Granting Authorization? Give the syntax to create role. 14. State the theory of BCNF. 15. What is the sparse index? PART – C (5 x 15 = 75 MARKS) 16. With neat diagram, describe database system structure. (OR) 17. Describe the various types of join in relational algebra. 18. Explain the following operators in subquery with example (3x5) a. set membership operator b. set comparison operator c. Exists operator (OR) 19. With relevant example, discuss the following (3x5) a. Data Definition Language b. Data Manipulation Language c. Triggers [P.T.O]

Upload: jackson2

Post on 14-Apr-2018

216 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 1/79

Reg. No. ________ 

Karunya University

(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: DATABASE SYSTEMS Time: 3 hours

Subject Code: 09CS201 Maximum Marks: 100

Answer ALL questions

PART – A (10 x 1 = 10 MARKS)

1. Where is the output of DDL stored?2. Name the different levels of Abstraction.3. What are the different types of outer joins?4. Define View.5. What is multivalued attribute?6. Define Fine granularity.7. What is the need for normalization?

8. Compare 3NF with BCNF.9. What is Page shipping?10. What are the advantages of B+ tree?

PART – B (5 x 3 = 15 MARKS)

11. Consider the following table:Employee

Person_name Street city

Works

Person_name Company_name salary

Give the expression in SQL:a. Find the names of all employees who work for TCS. b. Find the names and cities of residence of all employees who work for TCS.c. Find the sum of salary of all employees.

12. How are views updated? What are the restrictions in updating views?13. How are Roles used in Granting Authorization? Give the syntax to create role.14. State the theory of BCNF.15. What is the sparse index?

PART – C (5 x 15 = 75 MARKS)

16. With neat diagram, describe database system structure.(OR)

17. Describe the various types of join in relational algebra.

18. Explain the following operators in subquery with example (3x5)a. set membership operator b. set comparison operator c. Exists operator  

(OR)19. With relevant example, discuss the following (3x5)

a. Data Definition Language b. Data Manipulation Language c. Triggers

[P.T.O]

Page 2: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 2/79

Page 3: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 3/79

Page 4: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 4/79

22. Write a C++ program to add and multiply two distance objects with feet and inch fields byoverloading the addition and multiplication operators.

(OR)23. Write a C++ program to calculate the area of various polygons using Virtual functions.

24. Write a program using class templates to create and manage a generic array which can store int,float or string. Write member functions for receiving and printing array values. Using main program, test the template class by creating instances with the three data types.

(OR)

25. Illustrate the usage of open, close, read and write operations performed in a file using anexample program.

Page 5: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 5/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: PROGRAMMING IN JAVA Time: 3 hours

Subject Code: 09CS204 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. List out the primitive data types in Java.2. Java supports ______, _______and _______ jump statements.3. What is Abstract Class?4. When is the finalize method called?5. The term generics means _______.6. Auto boxing is the process by which _______.7. The paint() method is called each time to _______.8. Datagrams are _______.9. An adapter class provides _______.10. _______ is an abstact class that encapsulates all of the attributes of a visual component.

PART – B (5 x 3 = 15 MARKS)

11. Write a short note about bitwise operators in Java.12. Write a short note on method overriding.13. Write short notes on Annotations.14. Demonstrate FileReader class.15. What is Event Listener?

PART – C (5 x 15 = 75 MARKS)

16. Discuss the various control statements in java.(OR)

17. Explain about Java “White Paper” Buzzwords.

18. Write in detail about Packages in Java.(OR)

19. What is Exception? How is it handled in Java?

20. Write in detail about Enumerations and Type Wrappers.(OR)21. Explain Inter thread Communication with suitable code.

22. Write in detail about various String handling functions, which are used in string modificationand comparison.

(OR)23. Write a TCP socket program to make two-way communications between client and server.

24. Explain in detail about various Event Classes.(OR)

25. Write a Java Program to implement Calculator using AWT.

Page 6: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 6/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: SOFTWARE ENGINEERING Time: 3 hours

Subject Code: 09CS205 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. Define software engineering.2. What is agility?3. Draw the flow chart for the system engineering hierarchy.4. Why is requirements elicitation difficult?5. Define archetype.6. State the three “Golden Rules” in User Interface Design.7. Define recovery testing.8. What is a “good” test?9. State the goal of quality assurance.10. Which review is called a walkthrough or an inspection?

PART – B (5 x 3 = 15 MARKS)

11. List out the generic process framework activities.12. What does a system engineering model accomplish?13. What types of design patterns are available for the software engineers?14. Differentiate between alpha and beta testing.15. Define software reliability and software availability.

PART – C (5 x 15 = 75 MARKS)

16. Explain in detail about the capability maturity model integration.(OR)

17. Explain the specialized process models with neat diagram.

18. What are the steps to build the analysis model in requirements engineering?(OR)

19. a. Draw the use-case diagram for safe home security function. (5) b. What Information is produced as a consequence of requirements gathering? (5)

c. Enumerate the role of quality function deployment. (5)

20. Briefly discuss the software design concepts in detail.(OR)

21. Explain the following:a. cohesion b. coupling (7+8)

22. Discuss the Test Strategies for Conventional Software.(OR)

23. a. What are the characteristics of testability? (7) b. Briefly explain the control structure testing. (8)

[P.T.O]

Page 7: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 7/79

24. Explain the software configuration management process in detail.(OR)

25. a. What are the roles of a software quality assurance group? (6) b. List out the elements of a configuration management system. (4)c. Highlight the software configuration management features in detail. (5)

Page 8: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 8/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: UNIX ARCHITECTURE Time: 3 hours

Subject Code: 09CS206 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. A buffer contains two parts: they are _______ and ________.2. A process is _______.3. Define Directory.4. Give the syntax for creat system call.5. A region is a _______.6. _______ inform processes of the occurrence of asynchronous events.7. What is Disk Driver?8. A Clist is a _______.9. A process attach _______to its virtual address space with _______ system call.10. _______ allow arbitrary processes to exchange data and synchronize execution.

PART – B (5 x 3 = 15 MARKS)

11. Write about Buffer header.12. Give details about stat and fstat.13. Write short notes on handling signals.14. What is Demand Paging?15. Give a brief note on Semaphore.

PART – C (5 x 15 = 75 MARKS)

16. Elaborate the architecture of UNIX Operating System.(OR)

17. Discuss about various Scenarios for Retrieval of a Buffer.

18. Write in detail about INODE.(OR)

19. Discuss about PIPES in detail.

20. Depict the complete set of Process States and explain.(OR)21. Explain about Fair Share Scheduler with suitable examples.

22. Write in detail about Swapping.(OR)

23. Explain in detail about Streams.

24. Explain in detail about Messages in System V IPC with sample coding.(OR)

25. Write in detail about all TCP Socket system calls with a client server implementation code.

Page 9: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 9/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: ANALYSIS OF ALGORITHMS Time: 3 hours

Subject Code: 09CS207 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. An algorithm is made up of two independent time complexities f (n) and g (n). Then thecomplexity of the algorithm is in the order of _______.

2. What is running time of a function?3. Mention the worst, best and average time complexity of Quick sort.4. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would

return _______.5. The output of 7th iteration for the sequence 5 7 0 3 4 2 6 1 using insertion sort is _______.6. Why do we perform topological sorts only on DAGs?7. A B-tree of minimum degree t can maximum _______ pointers in a node.8. State few applications of Dynamic Programming.9. Name any two NP complete problems.10. The depth of a tree T is logarithmic in the number of nodes whenever T is a Huffman tree.

(True/False)

PART – B (5 x 3 = 15 MARKS)

11. List down the steps involved in mathematical analysis of non-recursive algorithms.12. Define brute force design technique.13. Sort the following using topological sorting technique.14. Draw a B-tree of order 3 for the following sequence of keys: 2, 4, 9, 8, 7, 6, 3, 1, 5, 10.15. Define Complete Bipartite Graph.

PART – C (5 x 15 = 75 MARKS)

16. a. Design a recursive algorithm for computing 2n for any non-negative integer n which is based on the formula 2n = 2n-1 + 2n-1.

 b. Set up a recurrence relation for the number of additions made by the algorithm and solve it.(OR)

17. Prove the equality

18. Write and explain Merge sort Technique with example.(OR)

19. a. Find the number of comparisons required to search for ‘6’ in the given sequence of numbers: 10, 19, 7, 9, 6, 15.

 b. Sort the list E , X , A, M , P , L, E in alphabetical order by bubble sort.

20. Explain how one can identify connected components of a graph by usinga. depth-first search b. breadth-first search.

(OR)

[P.T.O]

Page 10: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 10/79

21. a. Find the smallest and the largest number of keys that a heap of height h can contain. b. Prove that the height of a heap with n nodes is equal to log2 n.

22. For the input 30, 20, 56, 75, 31, 19 and hash function h(K) = K mod 11a. Construct the closed hash table b. find the largest number of key comparisons in a successful search in this tablec. find the average number of key comparisons in a successful search in this table

(OR)23. Write an algorithm to find the adjacency matrix and its transitive closure.

24. a. Construct a Huffman code for the following data:

Character A B C D E -

Probability 0.5

0.35

0.5

0.1

0.4

0.2

 b. Encode the text DAD_BE using the code of question (a).c. Decode the text whose encoding is 11 00 11 0 11 0 in the code of question (a)

(OR)25. Discuss in detail about NP Hard and NP Complete Problems.

Page 11: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 11/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: DATA STRUCTURES Time: 3 hours

Subject Code: 09CS208 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. PUSH and POP are the two operations of _________.2. Postfix form of the expression –A+B-C+D is _________.3. In a _________ linked list, there is no beginning and no end.4. The smallest element of an array’s index is called its _________.5. A sort, which relatively passes through a list to exchange the first element with any element

less than it and then repeats with a new first element is called _________.6. The quick sort algorithm exploits _________ design technique.7. A full binary tree with n levels contains _________ nodes.8. A B-tree of minimum degree t can have maximum _________ pointers in a node.9. The number of leaf nodes in a complete binary tree of depth d is_________.10. The data structure required for Breadth First Traversal on a graph is _________.

PART – B (5 x 3 = 15 MARKS)

11. State the difference between arrays and linked lists.12. Write short notes on the implementation of circular queues.13. Show the various passes of bubble sort on an unsorted list 11, 15, 2, 13, 6.14. Write the algorithm for the insertion of elements into a B-tree.15. Consider the following specification of a graph G

V (G) = {1,2,3,4}E (G) = {(1,2), (1,3), (3,3), (3,4), (4,1)}a. Draw an undirected graph. b. Draw its adjacency matrix.

PART – C (5 x 15 = 75 MARKS)

16. Write an algorithm for finding solution to the Towers of Hanoi problem. Explain the workingof your algorithm (with 4 disks) with diagrams.

(OR)17. Convert the following infix expressions into its equivalent postfix expressions;

a. (A + B D)/(E - F)+G b. A*(B+D)/ E - F*(G +H K)

18. Write an algorithm to insert a node in the beginning of the linked list.(OR)

19. Write an algorithm to delete a given node from a doubly linked list.

20. Sort the following sequence of keys using merge sort.66, 77, 11, 88, 99, 22, 33, 44, 55

(OR)21. How will you represent a max-heap sequentially? Explain with an example.

[P.T.O]

Page 12: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 12/79

22. What is a height-balanced tree? Explain how the height is balanced after addition/deletion of nodes in it?

(OR)23. What is a Binary Search Tree (BST)? Make a BST for the following sequence of numbers.

45, 36, 76, 23, 89, 115, 98, 39, 41, 56, 69, 48. Traverse the tree in Preorder, Inorder andPostorder.

24. Which are the two standard ways of traversing a graph? Explain them with an example of each.(OR)

25. Define adjacency matrix, adjacency list, hash function, sparse matrix and reachability matrix.(5x3)

Page 13: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 13/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: SYSTEM SOFTWARE Time: 3 hours

Subject Code: 09CS209 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. What is the need of MAR?2. How do you calculate the actual address in the case of register indirect with immediate index

mode?3. They are two different types of jump statement used in MASM assembles. Which type of jump

target uses different code segment with different segment register?4. What is an assembler directive?5. Give any one difference between linking loader and linkage editor.6. What is the need of ESTAB?7. What is recursive macro expansion?8. How to design the pass structure of a macro assembler?9. Name some typical tokens.10. What do you mean by tracing?

PART – B (5 x 3 = 15 MARKS)

11. Consider the instruction in SIC/XE programming10 1000 LENGTH RESW 420 - NEW WORD 3What is the value assigned to the symbol NEW?

12. Write the steps required to translate the source program to object program.13. Write the absolute loader algorithm.14. List the advantages of line-by-line macro processor.15. What are the methods in interaction language of a text editor?

PART – C (5 x 15 = 75 MARKS)

16. Explain in detail about the VAX Architecture.(OR)

17. Describe in detail about the Ultra Sparc Architecture.

18. a. Explain the concept of program relocation. (10) b. Why does the program block refer to segment of code for control section in program unit?

(5)(OR)

19. Explain multipass Assembler Operations with an example.

20. Explain the features of automatic library search and loader option for machine independentloader.

(OR)[P.T.O]

Page 14: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 14/79

21. a. Explain the operation of linkage editor. (10) b. Discuss in detail about the function of the MPP linker (5)

22. Explain machine independent macro processor features with example.(OR)

23. Discuss the macro processor features of ANSI C programming language with example and thedata structures used in macro processing.

24. a. With the neat block diagram, explain different components of an editor structure. (10) b. What are the tasks performed in the editing process? (5)

(OR)25. Discuss in detail about the various issues related to an interactive debugging system.

Page 15: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 15/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: PROGRAMMING IN J2EE Time: 3 hours

Subject Code: 09CS210 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. What is J2EE?2. Differentiate between .ear, .jar and .war files.3. What is the difference between execute, executeQuery, executeUpdate in JDBC?4. Differentiate. doGet and doPost5. Why is ejbFindByPrimaryKey mandatory?6. List out any two services provided by the EJB Container.7. List out the roles of SMTP and POP3 in JavaMail.8. What is the difference between JavaMail API and JMS?9. What is Java API for XML Registries (JAXR)?10. What is the use of WSDL in J2EE?

PART – B (5 x 3 = 15 MARKS)

11. Write notes on Translator Pattern.12. Explain the different types of JSP tags.13. Compare Stateful and Stateless Session Beans.14. Explain briefly about the JMS Elements.15. What is SOAP? Explain the functionality of SOAP.

PART – C (5 x 15 = 75 MARKS)

16. Explain briefly about the components of J2EE multi-tier Architecture.(OR)

17. What is called Tier? Explain briefly about the Enterprise JavaBeans Tier Implementation.

18. Explain the Java Database Connectivity Steps with suitable example.(OR)

19. What is Cookie? Explain how do you create a Cookie and read the Cookie values in a ServletProgram.

20. a. What is the difference between Sessions Beans and Entity Beans? (10) b. List out the EJB Transaction Attributes. (5)

(OR)21. Explain briefly about the Message-Driven Beans.

22. Write a CORBA IDL, Server and Client programs to display the “Welcome” message.(OR)

23. What is called Message? How can you send a message to a Message Queue using JMS?

24. Explain briefly about the UDDI Inquiry API calls used for searching the UDDI registry?(OR)

25. How do you publish a web service to an XML Registry using JAXR?

Page 16: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 16/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: OPERATING SYSTEM Time: 3 hours

Subject Code: 09CS212 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. Define context switch.2. What are System calls?3. Define a thread.4. What are preemptive and non-preemptive scheduling?5. State the assumption behind the bounded buffer producer consumer problem.6. List the four conditions for deadlock.7. Define Virtual memory.8. What is the purpose of paging the page tables?

9. Mention the importance of swap-space management.10. What is the kernel of an OS?

PART – B (5 x 3 = 15 MARKS)

11. Enumerate the services of an operating system.12. Can a multithreaded solution using multiple user-level threads achieve better performance on a

multiprocessor system than on a single processor system? Justify.13. Write short notes on swapping.14. Define file. Explain its attributes.15. What is the need for disk scheduling?

PART – C (5 x 15 = 75 MARKS)

16. a. Explain the various operating system services.(10) b. Write notes on system programs.(5)

(OR)17. Illustrate how operating system acts as a resource manager.

18. a. Explain about inter process communication.(10)

 b. Describe the process lifecycles and PCB with neat illustrations.(5)

(OR)19. a. Discus the various multithreading models.

(10) b. Explain about multiple processor scheduling.

(5)

20. a. Discuss the monitor solution for Dining Philosopher problem.(10)

 b. Explain the Peterson’s solution for process synchronization.

(5)

Page 17: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 17/79

(OR)21. a. Why are segmentation and paging sometimes combined into one scheme?

(4) b. What is the cause of thrashing? How does the system detect thrashing? Once it detects

thrashing, what can the system do to eliminate this problem?(4)

c. Explain Bankers algorithm for deadlock avoidance.(7)

22. a. Given five memory partitions of 100kB, 500kB, 200kB, 300kB, and 600kB (in order), howwould each of the first-fit, best-fit and worst-fit algorithms place processes of 212kB,

417kB, 112kB, and 426kB (in order)? Which algorithm makes the most efficient use of thememory? (8) b. Write short notes on segmentation. (7)

(OR)[P.T.O]

23. Consider the following page reference string7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1

How many page faults would occur for the following replacement algorithms: LRU, FIFO, andOptimal assuming three frames that all frames are initially empty.

24. a. List and discuss the various methods for implementing a directory.(10) b. Discuss the various file operations. (5)

(OR)25. A hard disk having 500 cylinders, numbered from 0 to 499. The drive is currently serving the

request at cylinder 143, and the previous request was at cylinder 125. The status of the queue isas follows: 86, 470, 13, 177, 448, 150, 102, 175, 130. What is the total distance (in cylinders)that the disk arm moves to satisfy all the pending requests for each of the following disk 

-scheduling algorithms?a. FCFS b. SSTF c. SCAN d. LOOK  

Page 18: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 18/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: PRINCIPLES OF COMPILER DESIGN Time: 3 hours

Subject Code: 09CS214 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. What are the two parts of compilation?2. Define ambiguous grammar.3. __________ represent strings of characters in the source program.4. Write the regular expression for denoting the set containing the string ‘a’ and all strings consisting of 

zero or more ‘a’’s followed by a b.5. Why is error detection and recovery centered around syntax analysis phase?6. What is parsing?7. Mention the restrictions that are invoked by translation routines during parsing?8. Why do we need backpatching?9. List the benefits of using a machine independent form.10. Define basic block.

PART – B (5 x 3 = 15 MARKS)

11. What is the function of Query interpreters?12. List the issues involved in lexical analysis.13. Write an algorithm to eliminate left recursion from a grammar.14. What are the three storage allocation strategies?15. What are the difficulties in instruction selection?

PART – C (5 x 15 = 75 MARKS)

16. With a neat diagram, explain the various phases of a compiler.(OR)

17. Briefly list and state the various compiler construction tools.

18. Can you minimize the number of states of DFA? Write an algorithm to minimize and justify your answer with examples.

(OR)19. With examples, explain the method of converting a NFA into a DFA.

20. Give an overview of shift reduce parsing and write the issues in it.

(OR)21. Explain the two types of bottom up parsing with examples.

22. Define a Directed Acyclic Graph. Construct a DAG and write the sequence of instructions for theexpression a + a * ( b – c ) + ( b – c ) * d .

(OR)23. a. Briefly explain the types of three address code with implementation. (7)

 b. Write a short note on the syntax directed translation for assignment statements. (8)

24. Explain basic blocks and their optimization.(OR)

25. Explain the generic issues in the design of code generators.

Page 19: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 19/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: VISUAL PROGRAMMING Time: 3 hours

Subject Code: 09CS216 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. List the two basic elements of .NET framework.2. _______ function retrieves the message from the queue.3. What is a document?4. MM_TEXT is the default mapping mode for a device context. (True/False)5. Name the function defined in CTypedPtrList class which removes the last pointer in the list.6. Device coordinate is also called as _______ .7. Which class is the engine that drives the serialization mechanism?8. What do you mean by early binding?9. Specify the two principle approaches supported by MFC for database application development.10. State the two locking modes defined in CRecordset.

PART – B (5 x 3 = 15 MARKS)

11. State the difference between the queued and non queued messages.12. What is a mapping mode? Specify any four mapping modes.13. Distinguish between modal and modeless dialog boxes.14. Which function is used to define the alignment of the subsequent text output? List the

 possibilities for specifying the alignment of the text.15. Mention the three member functions of CDatabase involved in transaction processing.

PART – C (5 x 15 = 75 MARKS)

16. a. Write a MFC program to create an application window with customized icon and a pre-defined cursor “cross”(IDC-CROSS). (10)

 b. What is a “message- loop”? Describe it in detail. (5)(OR)

17. Explain the WNDCLASS structure in detail with syntax and example program segment.

18. a. Describe how to create a pen and give a brief description on different pen styles and brush

 patterns. (10) b. Give a detailed description on “Message Map” (5)(OR)

19. Write a MFC program and the steps to create a menu and to add a menu item called “Element”and with pop-up menu items, Line, Rectangle and Circle. How will you implement theCOMMAND and COMMAND UPDATE handlers for it in the document class? Add tool bar  buttons corresponding to the menu items and add the tool tip for the buttons.

20. a. Explain the CList template class in detail with all their member functions. (10) b. Give a brief description about the common dialog controls. (5)

(OR)[P.T.O]

Page 20: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 20/79

21. Write the steps and the MFC program to create a modal dialog box. In the dialog box have 3radio buttons. Each button to represent the three colors Red, Green and Blue respectively.Based on the selection of the colors made in the radio button, draw a rectangle and fill therectangle with the chosen color.

22. a. Give a detailed note on the three levels of functionality available in CObject-based classes.(6)

 b. Describe the printing process in detail. Draw a neat diagram to show the logic of the

 printing process and the functions involved. (9)(OR)

23. a. How DLLs work? Explain the process with a neat diagram and also give a brief descriptionon runtime dynamic linking. (10)

 b. Explain the role of a CArchive object in serialization. (5)

24. a. Mention the five MFC classes supporting ODBC. Discuss. (5) b. Explain the member functions of the CRecordset class that support update operations.

(10)(OR)

25. Give a detailed note on the following: (3x5)

a. Snapshot versus Dynaset Recordsets b. Record Lockingc. Sorting a Recordsets

Page 21: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 21/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: OBJECT ORIENTED SOFTWARE ENGINEERING Time: 3 hours

Subject Code: 09CS304 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. Compulsory:

a. How do you apply the coupling and coherence in system design? Explain how to reducethe coupling of subsystems. (8)

 b. Describe in detail on System Design activities that focus on subsystem decomposition andtheir properties. (12)

2. a. How do you manage the software development? Illustrate the software engineeringdevelopment activities with suitable diagrams. (16)

 b. Draw a class diagram representing a book defined by following statement: “A book iscomposed of number of parts, which in turn are composed of a number of chapters,Chapters are composed of sections”. Focus only on classes and relationship. (4)

(OR)3. a. Describe how Object oriented modeling focuses on building an abstract of system

environment as basis for system model. (12) b. Draw a usecase diagram for Airport Check in and Security where the Actors: Passengers,

Tourguide, Minor (child), passenger with special needs(disabilities). Use Cases: IndividualCheck in, Group check in, Security Screening, Baggage check in, Baggage handling extendCheck in (passengers have no luggage). (8)

4. a. What are different communication mechanism used for handling software projects andexplain their purposes in detail? (16)

 b. Enlist the concepts used in project organization. (4)(OR)

5. a. Describe the activities that transform the use cases and scenarios produced duringrequirement elicitation into an analysis model. (12)

 b. List out the responsibilities assigned for the analysis model. (8)

6. a. Discuss the basic concepts of configuration management. (10) b. Describe the activities necessary to define and manage configuration items. (10)

(OR)

7. a. Discuss the management model for Project Management. (10) b. How can you perform Project monitoring and handle the risk in the Projects. (10)

8. a. Discuss the IEEE 1074: Standard for developing life cycle processes. (16) b. How do you characterize the maturity of software life cycle models? (4)

(OR)9. a. Depict the workflow in waterfall model and V-model in detail. (10)

 b. Explain the different kinds of unified software development process. (10)

Page 22: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 22/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: REQUIREMENTS ENGINEERING Time: 3 hours

Subject Code: 09CS305 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. Compulsory:

a. Explicate the features of customer-development partnership in detail. (10) b. Mention the characteristics of excellent requirements. (5)c. Discuss the role of requirement analyst. (5)

2. a. How to find user representatives? (10) b. Summarize the significance of customer’s view in developing the software product. (10)

(OR)3. a. Elaborate the techniques to develop the vision for the product and to define the project

scope. (10) b. Discuss the importance of the product champion. (10)

4. a. How to specify the software requirements as a template? (10) b. Explicate the importance of entity relationship in software modeling. (10)

(OR)5. a. With an example, explain state transition and class diagram. (10)

 b. List out the guidelines for writing requirements. (5)c. Give a detailed note on data flow diagram. (5)

6. How to trace the requirements? What are the tools used for tracing? Explain the procedure for tracing in detail.

(OR)7. a. When does the requirement changes and what is the method used to control the change

 process? (10) b. Elaborate the requirement management procedures. (10)

8. a. Write notes on fundamentals of software process improvement and process improvementcycle. (10)

 b. Mention the requirement engineering for process asset and process improvement road map.(10)

(OR)9. a. Paraphrase the software requirements and risk management in detail. (10)

 b. How to relate requirements to different project process? (10)

Page 23: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 23/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: SECURITY IN COMPUTING Time: 3 hours

Subject Code: 09CS306 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. Compulsory:

a. Discuss about buffer overflows and their implication on security. (8) b. What do you mean by a targeted malicious code? Explain. (8)c. Discuss the different types of flaws. (4)

2. a. Discuss about memory and address protection in general purpose operating systems. (12) b. Describe the Military Security policy, which ensures confidentiality. (8)

(OR)3. a. Explain how trusted operating system is designed with kernelised design, isolation and

Reference Monitor. (12) b. Discuss in detail about file protection mechanisms. (8)

4. a. Briefly explain about requirements for database security. (8) b. What do you mean by Two-Phase update? Explain. (6)c. What is a commutative filter? Explain. (6)

(OR)5. Explain the various ways to determine sensitive data values from the database.

6. Explain about the different types of firewalls.

(OR)7. a. Briefly explain the types of Intrusion Detection Systems. (10)

 b. What are the requirements and solutions for secure E-mail? (10)

8. Briefly explain the steps in risk analysis.(OR)

9. a. Discuss in detail about parts of a security plan. (8) b. Discuss in detail about physical security. (12)

Page 24: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 24/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: REAL TIME SYSTEM SOFTWARE Time: 3 hours

Subject Code: 09CS307 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. Compulsory:

Explain in detail about systems of state machines and real time state machine communicationwith neat diagram.

2. a. Explain software architecture with a neat diagram. b. Discuss in detail about real time system.

(OR)3. Write notes on

a. Classification notation b. Dataflow diagram c. State machine

4. a. Write in brief about regular expressions and extensions. b. Distinguish between real time logic and traditional logic.

(OR)5. Explain in detail about basic RM and EDF results.

6. Discuss the applications of timer and the properties of real and ideal clocks.(OR)

7. Write short notes on the following:a. Program analysis with timing schema b. System interface with architecture

8. a. Write the features of real time programming language. b. Discuss briefly about Ada and Java real time extensions.

(OR)9. a. With a neat diagram, explain in detail about OS architectures.

 b. Explain in detail about issues in task management.

Page 25: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 25/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: DATA WAREHOUSING AND MINING Time: 3 hours

Subject Code: 09CS310 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. a. What is Data Mining? (2) b. Write notes on Data Characterization and Discrimination. (6)c. Discuss briefly about the characteristics of Data Warehousing? (12)

(OR)2. a. What are the benefits of data warehouse? (2)

 b. Elucidate the various ways to structure data within the data warehouse. (6)c. How do you integrate Data Mining system with a Database system and/or a Data warehouse?

(12)

3. a. How do you manage the flow of data to and from the data warehouse to the near-lineenvironment? (8)

 b. List out the common techniques used to limit the amount of operational data scanned at the pointof refreshing the data warehouse. (12)

(OR)4. a. Explain the following the Data Warehouse Technological Feature.

i) Efficient Index Utilization ii) Efficient Loading of Data (8) b. Discuss briefly about the Data Warehouse Data Model. (12)

5. a. Define support and confidence in Association rule mining. (2) b. Write notes on Associative Classification. (6)c. What is called frequent-pattern growth method? Construct the FP Tree for the following dataset.

(12)TID Items bought100 {f, a, c, d, g, i, m, p}200 {a, b, c, f, l, m, o}300 {b, f, h, j, o, w}400 {b, c, k, s, p}500 {a, f, c, e, l, p, m, n}

(OR)6. a. Define the concept of classification. (2)

 b. Write notes on Multilevel Association Rule Mining. (6)c. Explain briefly the Classification by Decision Tree Induction. (12)

7. a. What are requirements of clustering in data mining? (2) b. Explain briefly about the Expectation-Maximization. (6)c. Discuss about the K-Means partitioning algorithm? (12)

(OR)8. a. What are the different types of data used for cluster analysis? (2)

 b. Write short notes on Dimension-Growth Subspace Clustering Method. (6)c. Explain briefly about the Distance-Based Outlier Detection. (12)

9. Compulsory:

a. What kinds of associations can be mined in multimedia data? Explain. (10) b. Explain briefly about the Text Mining Approaches? (10)

Page 26: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 26/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: SOFTWARE TESTING Time: 3 hours

Subject Code: 09CS314 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. Compulsory:

Explain about Software testing principles and origin of defects.

2. Discuss the additional white box test design approaches.(OR)

3. Explain different types of system testing.

4. a. Explain Integration testing activities in the software life cycle. (10) b. Discuss about career paths of testers. Give an Industry example. (10)

(OR)5. a. Discuss the types of reviews. (10)

 b. Explain in detail about Review metrics. (10)

6. Explain about measurement and TMM levels.(OR)

7. Discuss an approach to Usability Testing.

8. Discuss TMM Assessment Model Components in detail.(OR)

9. Explain TMM ranking procedure in detail.

Page 27: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 27/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: SOFTWARE METRICS AND QUALITY MANAGEMENT Time: 3 hours

Subject Code: 09CS315 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. a. Explain the classification of software measures. b. Describe about Goal – Question – Metrics paradigm (GQM).

(OR)2. a. Explain in detail about four principles of investigation with suitable example.

 b. Discuss about the procedures for performing experiments.

3. Describe about the DeMacro’s approach to measure the functionality of software product.(OR)

4. a. Explain about McCabe’s cyclomatic measure. b. Compare cost models and constraints models.

5. Compulsory:

Discuss about Boehm and McCall software quality model with neat diagram.

6. Write short notes on following:a. Mean Time To Failure (MTTF) b. Mean Time Between Failure (MTBF)c. Hazard rate d. Availability

(OR)7. Explain in detail about the elements of software quality system.

8. Discuss about the overview of Configuration Management (CM) with neat diagram.(OR)

9. Write short notes on followinga. Safety requirement b. Risk management

Page 28: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 28/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: C# AND .NET PROGRAMMING Time: 3 hours

Subject Code: 10CS201 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. C# supports _______and _______ predefined reference types.2. Classes and structs support inheritance. Is this statement true or false?3. What is an anonymous method?4. You can create list objects by invoking the _______.5. The garbage collector does not know how to free _______.6. _______, _______ and _______ can be used for synchronization within a process.7. Connection string contains _______.8. Define Data Binding.9. A theme consists of _______, _______and _______.10. List the ASP .NET server controls.

PART – B (5 x 3 = 15 MARKS)

11. Write the important features of Intermediate Language.12. What is Anonymous method?13. Discuss about catching an Exception.14. Write about Checkbox control.15. Write short notes on AJAX.

PART – C (5 x 15 = 75 MARKS)

16. Explicate about arrays in C# with suitable example.(OR)

17. Explain about inheritance and interfaces in C#.

18. Write in detail about delegates in C# with necessary coding.(OR)

19. How to create a List? Explain the various operations that can be performed with the List.

20. Explain about various synchronization technologies available in C# with example.(OR)21. Write about catching exceptions and user-defined exception classes.

22. Write in detail about DataSet class with suitable coding.(OR)

23. Create an application to perform insertion, deletion and updation operations with a database.

24. Design a website for Online shopping by using ASP .NET AJAX.(OR)

25. How to add forms authentication in login system using the security wizard in ASP .NET?

Page 29: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 29/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: ADVANCED DATABASE TECHNOLOGIES Time: 3 hours

Subject Code: 10CS301 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. Compulsory:

Briefly explain query evaluation algorithm for relational operators.

2. a. What is the difference between conflict serializability and view serializability? Explain indetail with an example. How to test serializability? (8)

 b. What is a dead lock? What are the mechanisms to prevent and detect dead locks? (12)(OR)

3. a. Briefly explain specialized locking technique and concurrency control without locking.(12)

 b. Explain logging and recovery in detail. (8)

4. a. Write short notes on clustering and indexing. (8) b. How to tune conceptual schema, queries and views? Explain. (12)

(OR)5. Explain different access control mechanism in DBMS.

6. a. Compare centralized, client/server, parallel and distributed database. (5) b. How to palletize the following operations: (15)

(i) parallel scan (ii) parallel sort (iii) parallel aggregate (iv) parallel hash join

(v) parallel join(OR)

7. a. What is the need for building distributed database? Explain important issues in buildingdistributed database with an example. (8)

 b. Briefly explain how replication is handled in distributed database. (12)

8. How is a B+ tree index different from a spatial index? When would you use a B+ tree indexover a spatial index for point data? When would you use a spatial index over a B+ tree indexfor point data?

(OR)9. Explain the basic concepts and properties of R tree. How to make a search and insert an item

into R Tree?

Page 30: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 30/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: ADVANCED OPERATING SYSTEMS Time: 3 hours

Subject Code: 10CS302 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. a. Briefly explain Lamport’s Algorithm for Distributed mutual exclusion. (15) b. Compare the performance of Ricart –Agrawala Algorithm with Lamport’s algorithm.

(5)(OR)

2. Discuss the following distributed deadlock detection algorithm. (10+10)a. A path-pushing algorithm b. An edge – chasing algorithm

3. a. List down the different Algorithms for implementing distributed shared memory andexplain any two algorithms in detail. (10)

 b. Discuss the advantages and challenges in DSM. (10)(OR)

4. Discuss in detail the various issues in the design and implementation of distributed file system.

5. a. List out the different voting protocols. (5) b. Discuss in detail the Static Voting Algorithm to provide Fault tolerance. (15)

(OR)6. What is Fault Tolerance? What are all the issues in Fault Tolerance? Discuss in detail Two-

 phase Commit Protocol.

7. a. Give the various design issues of multiprocessor operating system. (10)

 b. With a neat diagram, explain the multiprocessor system architecture. (10)(OR)

8. What is access matrix model? Briefly discuss the implementation of the access matrix model.

9. Compulsory:

Explain in detail the Timestamp based concurrency control algorithm.

Page 31: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 31/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: DISTRIBUTED SYSTEMS Time: 3 hours

Subject Code: 10CS303 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. Compulsory:

a. Explain the basic architectural model for the management of replicated data. (10) b. Discuss the design and implementation issues of distributed shared memory. (10)

2. a. Explain the challenges provided by distributed system. (10) b. Describe the software layers and system architectures of architectural model of a

distributed system. (10)(OR)

3. Discuss about client server communication and its primitives.

4. a. Explain the architecture for distributed event notification. (10) b. Discuss the operating system architecture for distributed systems. (10)

(OR)5. a. Explain the file service architecture. (10)

 b. Describe the components of Sun network file system. (10)

6. a. Discuss the concept of synchronizing physical clocks in distributed systems. (10) b. Explain the ‘Snapshot’ algorithm for determining global states of distributed systems.

(10)

(OR)7. a. Explain DNS queries and DNS name servers in detail. (10)

 b. Discuss about Napster and its legacy. (10)

8. a. Explain the bully algorithm to choose a unique process in distributed system. (10) b. Briefly explain about the timestamp ordering. (10)

(OR)9. a. Explain the various operations for two-phase commit protocol. (10)

 b. Describe the concept of concurrency control in distributed transactions. (10)

Page 32: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 32/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: REAL TIME SYSTEMS Time: 3 hours

Subject Code: 10CS304 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. Compulsory:

a. Using the Iterative Network Flow graph, find out the feasible frame size and the scheduleof the following periodic tasks when they are scheduled preemptively and in prioritydriven manner on a single processor. The number of preemptions should be kept small.T1 = (4, 3); T2 = (6, 1.5) (12)

 b. Explain any one of the ways to improve the average response time of the aperiodic jobs inthe presence of the periodic jobs with diagram. (8)

2. a. Explain the functional parameters of the jobs and the resource parameters of the jobs.(15) b. What are the conditions to be satisfied by a valid schedule? (5)

(OR)3. Explain the challenges in validating the timing constraints in priority-driven systems.

4. Which is the simplest of the bandwidth-preserving servers? Explain its operations with suitableexample.

(OR)5. a. How is slack stealing done in the systems where periodic tasks are scheduled according to

the Earliest Deadline First algorithm? (10) b. What are the consumption and the replenishment rules of a simple sporadic server?

Explain its operations with an example. (10)

6. a. Justify the following statement with an example.“When resource accesses of a system of preemptive, priority-driven jobs on one processor are controlled by the basic priority-inheritance protocol, deadlock may occur”. (15)

 b. What is uncontrolled priority inversion in resource access control? How can this beavoided? (5)

(OR)7. Explain the scheduling rule, allocation rule and the priority inheritance rule of the resource

access control protocol that deal with multiple unit resources.

8. a. Explain software redundancy and hardware redundancy. (14) b. Compare real-time databases with general-purpose databases. (6)

(OR)9. a. Describe the classification of faults according to their temporal behavior and output

 behavior. (10) b. Write short notes on databases for hard real-time systems. (10)

Page 33: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 33/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: CRYPTOGRAPHY AND NETWORK SECURITY Time: 3 hours

Subject Code: 10CS306 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. Compulsory:

a. Explain about PGP services. (10) b. Describe S/MIME. (10)

2. a. Explain the OSI Architecture. (10) b. Explain Classical Encryption Techniques. (10)

(OR)3. a. Explain DES and AES Algorithm. (10)

 b. Describe about Traffic Confidentiality. (10)

4. a. Describe Diffie-Hellman Key Exchange. (10) b. Explain RSA algorithm and state approaches for attacking RSA algorithm and the

counter measures for the same. (10)(OR)

5. a. Describe Public Key Cryptography. (10) b. Explain Elliptic Curve arithmetic. (10)

6. a. Explain Authentication Functions. (10) b. Describe HMAC algorithm. (10)

(OR)7. a. Explain any one of approach and algorithm for Digital Signatures. (10)

 b. Explain Authentication protocols. (10)

8. a. Explain Intrusion Detection. (10) b. State and Explain Password Management and password selection strategies. (10)

(OR)9. a. Explain the Firewall Design Principles. (10)

 b. Describe about Trusted Systems. (10)

Page 34: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 34/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: WEB SECURITY Time : 3 hours

Subject Code: 10CS308 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. Compulsory:

Explain the following with suitable diagram:a. World Wide Web. b. The Web Security.

2. Write short notes on the following:a. Digital identification techniques. b. Microsoft’s Authenticode.

(OR)3. Enumerate on the following:

a. Flash and Shockwave. b. Antitheft and plugin’s.

4. Explain how you will control the access to your web content and secure your service.(OR)

5. Write short notes on the following:a. Physical security of servers. b. Secure CGI/API Programming.

6. Discuss about secure SSL/TLS protocol and explain how the transaction security can beachieved.

(OR)7. Discuss in detail about the various strategies used for Disaster Recovery and public key

infrastructure.

8. What is Digital payment? Discuss the functions of Digital payment system. Why is orientationand standardization required for Digital payment business?

(OR)9. Discuss in detail about the methods of protecting intellectual properties and actionable contents

in the web?

Page 35: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 35/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: PROGRAMMING IN C Time: 3 hours

Subject Code: 11CS101 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. What does void mean?2. What would be the value of ‘a’ after execution of the following ‘C’ language statements?

int a, b = 10; char x = ‘a’; a = b + x;3. Which operator is called as ternary operator?4. What is the purpose of the goto statement?5. Write the two types of array initialization.6. What is a static variable?7. Give the syntax for Function declaration.8. What is meant by Pointer initialization?9. Give the general format of ‘UNION’ in C language?10. What is argc?

PART – B (5 x 3 = 15 MARKS)

11. What is a variable? Give the rules for constructing variable names.12. Write a C program to accept character from user and inform whether it is a vowel or a

consonant.13. What is circular definition?14. List any three-string handling functions with syntax.15. Write the difference between structure and union.

PART – C (5 x 15 = 75 MARKS)

16. a. Explain the various types of C constants. (10) b. What are the two types of type conversion? (5)

(OR)17. a. What are the four basic data types in C? Give the various qualifiers available in C. (10)

 b. Without using ‘If ’ syntax, find the biggest of two numbers. (5)

18. With suitable example, explain various decision making statements used in C language.(OR)19. a. With suitable example, give the difference between Break and Continue Statements. (5)

 b. Write a C program to generate the sum of series up to N terms. (10)

20. Explain the following with suitable examples for each.a. Automatic b. Register c. External d. Static

(OR)21. a. What is a function? Give its uses. What are the various arguments in a function? (5)

 b. Explain about the two ways of passing arguments to a function with suitable example.(10)

[P.T.O]

Page 36: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 36/79

22. a. Write a program in C to Sort N numbers in ascending and descending order. (10) b. What is meant by an array? Give example. How to enter data into an array? (5)

(OR)23. a. Write a C program to find the largest of 4 numbers by passing arrays to function. (8)

 b. Explain about pointer declaration and pointer operators. (7)

24. a. Explain the various user defined Data Types with suitable example. (10) b. Explain about self-referential structure. (5)

(OR)25. a. Explain the basic file operations. (3)

 b. Write a C program to display Student Details using files. (12)

Page 37: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 37/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: COMMUNICATION AND SWITCHING TECHNIQUES Time: 3 hours

Subject Code: 11CS301 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. Compulsory:

a. Briefly explain Time Division Multiplexing and Frequency Division Multiplexing. b. Explain the functions of Various Layers of an ISO Open Systems Interconnection seven

layer Model.

2. a. Discuss in detail about the functions of a Switching System. b. Explain the congestion and traffic measurement with a suitable mathematical model.

(OR)3. a. Explain the advantages of Digital Switching Systems.

 b. Briefly explain packet Switching and Circuit Switching.

4. a. Explain in detail about Trunking and Grade of Service. b. With a suitable example, describe the application of Graph theory to link systems.

(OR)5. a. Explain in detail about Rearrangeable network and non-blocking network.

 b. How is the synchronization achieved in Time Division switching networks? Explain.

6. Discuss the basic common control functions required for the call processing of a switchingsystem.

(OR)7. Discuss in detail about the various signaling concepts.

8. a. Explain the features and applications of Local Area and Wide Area Networks. b. Explain the concept of Cellular Radio Networks.

(OR)9. Discuss in detail about the Integrated Services Digital Network (ISDN) principles and

architecture.

Page 38: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 38/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: DIGITAL IMAGE PROCESSING Time: 3 hours

Subject Code: 11CS306 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. Compulsory:

a. With a neat diagram, explain the basic steps involved in Digital Image Processing. (10)

 b. Discuss in detail about Image sensing and acquisition. (10)

2. a. Explain in detail about basic steps for filtering in the frequency domain. (10) b. Discuss in detail about ideal Low pass filters. (10)

(OR)3. Explain the following filters:

a. Butter worth High Pass filter b. Gaussian High Pass filter (5+5)c. Homomorphic Filter. (10)

4. Explain the following terms:a. Subband Coding b. Haar Transform. (10+10)

(OR)5. a. Explain in detail about the different image compression models. (10)

 b. Write short note on Lossless Predictive Coding (5)c. Explain about the Transform coding with block diagram. (5)

6. Explain the following terms:a. Point Detection b. Line Detection. (5+5)c. Edge Detection. (10)

(OR)7. Explain in detail about Thresholding.

8. a. Discuss in detail about various approaches to describing the boundary of a region. (10) b. Discuss in detail about various approaches to describing the image region. (10)

(OR)9. Explain the following:

(4x5)a. Chain Codes b. Polygonal Approximations c. Signatures d. Skeletons

Page 39: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 39/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: OPTICAL FIBER COMMUNICATION Time: 3 hours

Subject Code: 11CS308 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. Compulsory:

a. Describe the structure of step index and graded index fibers with neat diagrams and discusstheir refractive index profiles, numerical aperture and the number of guided modes withnecessary expressions. (10)

 b. Write a brief note on the mode theory of circular waveguides. (5)c. A graded index fiber has a core with a parabolic refractive index profile and a diameter of 

50 μm. The fiber has a numerical aperture of 0.2. Estimate the total number of guidedmodes propagating in the fiber when it is operating at a wavelength of 1 μm. (5)

2. a. Explain the signal dispersion in single mode optical fibers with necessary expressions.(10) b. Explain the pulse broadening in graded index fibers briefly. Bring out the limitations of 

signal attenuation and dispersion on the fiber optic system performance. (5+5)(OR)

3. a. Explain the principle of operation of laser diodes with neat diagrams. Write the advantagesand disadvantages of laser diodes over LEDs. (8+4)

 b. Discuss the different factors that cause signal attenuation in optical fibers. (8)

4. a. Explain the principle of operation of avalanche photo diode with necessary diagrams,Compare the different types of photo detectors. (8+4)

 b. A silicon p-i-n photodiode incorporated into an optical receiver has a quantumefficiency of 60% at a wavelength of 0.9 µm. The dark current is 3 nA andload resistance is 4 KΩ. The incident optical power is 200 nW and the receiver  bandwidth is 5 MHz. Determine the photocurrent and root mean square shot noise andthermal noise currents at a temperature of 20 ºC. (8)

(OR)5. a. Explain the operation of any two preamplifiers with neat circuit diagrams. (12)

 b. Explain the operation of analog receivers with necessary expressions for the SNR. (8)

6. a. Describe the link power budget and rise time budget analyses of point to point optical linkswith suitable diagrams and examples. (15)

 b. Explain the principle of wavelength division multiplexing. (5)(OR)

7. a. Explain the principle of tunable optical filters. (12) b. Discuss the operation and applications of Mach-Zehnder multiplexer. (8)

8. a. Discuss the principle and applications of Erbium doped fiber amplifier. (10) b. Write a brief note on SONET/SDH networks. (10)

(OR)9. Explain the architecture, operation, limitations and applications of 

a. Wavelength routed optical networks (12) b. Broadcast and select networks (8)

Page 40: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 40/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: PROGRAMMING IN C Time: 3 hours

Subject Code: CS101 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. Expand COMPUTER.2. Distinguish between hardware and software.3. What is an operator?4. ___________ operator is useful for making two-way decisions.5. Define recursion.6. What is the use of continue statement?7. What is the value of b[0] in the following program?

main(){

int a[5] = {1,3,6,7,0};int *b; b = &a[2];

}8. What are the operators exclusively used with pointers?9. How will you determine the size of the union?10. Name the two types of files.

PART – B (5 x 3 = 15 MARKS)

11. What is a symbolic constant? Write a C program to find area of the circle using symbolicconstant.

12. Write down the rules for evaluation of expression.13. Write a C program to find the greatest of three numbers.14. Discuss about the dynamic memory allocation.15. What are the various types of file modes? Discuss.

PART – C (5 x 15 = 75 MARKS)

16. a. Explain the basic computer organization of a computer with a neat block diagram.

(10) b. List and explain the types of programming languages. (5)(OR)

17. List out the ‘C’ data types. Explain with examples.

18. What are the various operators supported by C language? Explain with examples.(OR)

19. a. Explain the formatted and unformatted I/O functions in C. (10) b. Discuss about the built-in library functions in C. (5)

[P.T.O]

Page 41: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 41/79

20. a. Write a C program to find the roots of quadratic equation. (10) b. Describe the statement for break, goto and continue statement. (5)

(OR)21. a. Discuss the categories of functions used in C. (10)

 b. Write a C program to swap two variables using pointers. (5)

22. Write a C program to manipulate the various string operations without library functions.(OR)

23. Explain the different types of storage classes with suitable C code for each.

24. Write a C program to implement student mark list using structure.(OR)

25. Write short notes on the following:a. Reading and writing a data file. (8) b. Command line parameters. (7)

Page 42: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 42/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: OBJECT ORIENTED ANALYSIS AND DESIGN Time: 3 hours

Subject Code: CS207 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. Define object Persistence.2. What do you mean by persistence of an object?3. List the primary symbols used in a DFD.4. What are anti-patterns?5. What is a use-case?6. What are the steps to be followed to develop an effective documentation?7. Define Schema.8. What are design Patterns?

9. Define OCL.10. What is MDBMS?

PART – B (5 x 3 = 15 MARKS)

11. What is meant by object identity? Give an example.12. List out the static and dynamic model diagrams associated with UML.13. What are the processes associated with object oriented analysis.14. How to eliminate unnecessary associations?15. Write a brief note on class visibility.

PART – C (5 x 15 = 75 MARKS)16. Explain in detail about various object oriented features with example.

(OR)17. a. Briefly explain about OOSD life cycle. (7)

 b. Compare procedural approach with object oriented approach with suitable example. (8)

18. Discuss in detail about Booch methodology with example and diagram.(OR)

19. Draw the class diagram, use case diagram for railway reservation system.

20. Discuss the importance of proper classification. Briefly explain the Noun phrase approach and

use case driven approach.(OR)

21. Explain in detail about Classes, responsibilities and collaborators with suitable diagrams.

22. a. Explain the guidelines for identifying super-sub relationship in class. (5) b. What are the guidelines for defining attributes? Define the attributes for vianet Bank 

objects. (10)(OR)

23. What is meant by axiom? Explain two object oriented design axioms and Corollaries.

24. Draw the activity and class diagram for book renewal in library management system.(OR)

25. Explain in detail about the process of creating view layer classes.

Page 43: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 43/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: JAVA PROGRAMMING Time: 3 hours

Subject Code: CS222 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. How is Java platform independent?2. List the data types available in Java.3. How will you design a package?4. Define the term ‘thread’.5. What are frames?6. Write the states of an applet.7. How will you run applets?8. What are abstract methods and classes?9. What is a package?10. Write HTML tag to use an image file.

PART – B (5 x 3 = 15 MARKS)

11. Can you use a non-zero integral value for ‘true’ and zero for ‘false’ in conditional expressions?Justify.

12. When do we declare a member of a class static?13. Write a program in Java to reverse a string.14. Write the advantages of command line arguments.15. Write the structure of a Java program.

PART – C (5 x 15 = 75 MARKS)

16. Explain about control statements in Java.(OR)

17. Write a Java program to load an array of numbers and to check whether it is in ascending order or not.

18. Discuss the use of an interface with examples.(OR)

19. Explain the following: a. Throw b. Finally

20. List any five-string functions and explain.(OR)

21. Discuss about exploring Java. lang.

22. Discuss on event handling with examples.(OR)

23. Design an applet for a feedback form.

24. Discuss about Layout mangers.(OR)

25. What is menu? What is menubar? Explain.

Page 44: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 44/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: UNIX ARCHITECTURE Time: 3 hours

Subject Code: CS227 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. What is kernel?2. Write the use of buffer cache.3. What is inode?4. Distinguish between library function and system call.5. What are the ways for normal termination of a process?6. What are signals?7. What is demand paging?8. What are sockets?9. What are IPC mechanisms?10. What is use of shared memory?

PART – B (5 x 3 = 15 MARKS)

11. What is a shell script?12. What is the difference between unlink and rm?13. Write a short note on sleep command.14. What is use of biod process?15. Write any 4 system calls for sockets.

PART – C (5 x 15 = 75 MARKS)

16. Explain about UNIX architecture and its features.(OR)

17. Discuss about Shell Control Structure in detail.

18. Discuss about inode concepts in UNIX.(OR)

19. Explain about UNIX system calls file I/O.

20. Explain UNIX system calls for process management.(OR)21. Discuss about Time system calls in UNIX.

22. Explain about Memory management in UNIX.(OR)

23. Explain about how Demand paging implemented in UNIX.

24. Give an account on IPC mechanisms in UNIX.(OR)

25. Explain about various Socket system calls for UNIX.

Page 45: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 45/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: PRINCIPLES OF COMPILER DESIGN Time: 3 hours

Subject Code: CS233 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. What is parsing?2. What do you mean by Cross-Compiler?3. Define lexeme.4. What is the role of lexical analysis phase?5. A top-down parser generates

a. right-most derivation b. right-most derivation in reversec. left-most derivation d. left-most derivation in reverse

6. Context Free Grammar can be recognized by Push Down Automata. (True/False)7. Name some variety of intermediate forms.8. Draw syntax tree for the expression a=b*-c+b*-c.9. Mention some of the major optimization techniques.10. Define basic block.

PART – B (5 x 3 = 15 MARKS)

11 Write a note on syntax directed translation.12. Write state program for the token, “id-identifier”.

13. Define left recursion. Eliminate left recursion from the grammar. S→ Aa/b, A→ Ac/Sd/e?

14. What are the three kinds of intermediate representations? Explain them.15. What is the step takes place in peephole optimization? What are the characteristics of peepholeoptimization?

PART – C (5 x 15 = 75 MARKS)

16. a. Define regular expression. (2) b. Give the precedence of regular expression operator. (3)c. Give the rules in regular expression. (5)d. Give the algebraic properties of regular expression. (5)

(OR)

17. a. Define Compiler. What are the phases of the Compiler? Explain with a neat diagram.(10) b. What are Compiler construction tools? Explain its specifications in detail. (5)

18. a. What is DFA? (3) b. What are the conditions to be satisfied for NFA? (8)c. What is meant by recognizer? (4)

(OR)19. a. Construct a finite automata that will accept a string of zeros and ones that contains an odd

number of zeros and an even number of ones. (7) b. Write a short note on Token Patterns and Lexemes. (8)

[P.T.O]

Page 46: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 46/79

20. a. Define LL (1) grammar. (5) b. What are the possibilities of non-recursive predictive parsing? (5)c. Define LR (0) items. (3)d. What are the three techniques for constructing LR parsing table? (2)

(OR)21. a. Find the item I0 for the following grammar using CLR parsing method. (10)

G: S→AS

S→ b

A→SA

A→a

 b. Why LR parsing is good and attractive? (5)

22. What are the different storage allocation strategies? Explain.(OR)

23. Explain the various source language issues.

24. Generate the Three-address code for While(i<10){x = 0;i = i+1;}

(OR)25. a. Write the 3-addr code for the statements a =b*-c + b*-c. (5)

 b. What are the three address code for a or b and not c? (5)c. Write a three address code for the expression a < b or c < d? (5)

Page 47: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 47/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: SOFTWARE ENGINEERING Time: 3 hours

Subject Code: CS234 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. Define Process.2. What is paradigm?3. What do you mean by non-functional requirement?4. List any two characteristics of good conceptual design.5. What is object orientation?6. What is meant by fault identification?7. Define software reliability.8. What is cyclometric number?9. Write about deterministic prediction system.10. List down the strategies to improve the product.

PART – B (5 x 3 = 15 MARKS)

11. State the difference between validation and verification.12. Give the characteristics of requirements.13. Write short notes on internal documentation.14. What are the types of training required by the user/operator while delivering the system?15. List out the ways to determine the prediction is inaccurate.

PART – C (5 x 15 = 75 MARKS)

16. Describe in detail about waterfall model and spiral model.(OR)

17. Illustrate and explain the steps involved in risk management.

18. What is software requirement? Explain the process of determining the requirements.(OR)

19. What are the different architectural styles for software design? Explain each design in detail.

20. Illustrate and explain the OO development process with neat sketch.(OR)21. What is integration testing? Discuss about the various approaches of integration testing.

22. Describe in detail about performance testing and acceptance testing.(OR)

23. a. What are the maintenance activities to be focused while evolving the system? Explain.(10)

 b. What do you mean by configuration management? Explain. (5)

24. Explain the various approaches to evaluate the product.(OR)

25. Discuss about various levels of maturity in CMM.

Page 48: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 48/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: ENTERPRISE JAVA(J2EE) Time: 3 hours

Subject Code: CS238 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. Expand J2SE.2. Who invented J2EE?3. How do JSP tags begins and ends?4. Expand CGI.5. What are the two interfaces of session and entity bean?6. What do you mean by CORBA?7. What is the purpose of JAR files?8. Give the command to start the RMI registry on windows NT.9. Expand SOAP.10. Expand UDDI.

PART – B (5 x 3 = 15 MARKS)

11. What is the use of Java message service?12. What are the different types of JSP tags?13. What are three kinds of EJB classes?14. What is Java naming? Give example.15. Define WSDL.

PART – C (5 x 15 = 75 MARKS)

16. Explain the J2EE multi-tier Architecture.(OR)

17. Explain Java Beans and Java message service.

18. Write a simple Java servlet and explain.(OR)

19. Explain the Java server pages. (JSP)

20. Discuss about CORBA. (OR)21. Explain the Enterprise Java Beans.

22. What do you mean by RMI? Explain.(OR)

23. Explain the directory interface API.

24. Discuss about JAXR.(OR)

25. Explain the electronic Business XML.

Page 49: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 49/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: PROGRAMMING IN C Time: 3 hours

Subject Code: CS245 / DCS201 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. Define the term computer.2. Write the syntax of ‘for’ loop.3. Mention the categories of Software.4. What are the two types of functions supported in C-language?5. Define the operation of compiler.6. Consider an integer array a [5] stored in continuous memory locations. It starts from address

2000. Mention the address locations for a[0], a[1] , a[2] , a[3] , a[4].7. Define pointer.8. Which operator is used to access the member variable of structure?9. Mention the three file operations in C?10. Define command line arguments.

PART – B (5 x 3 = 15 MARKS)

11. Describe any three application of computer.12. Explain if and switch ( ) case statement.13. Define external variables.14. Explain structure within structure with example.15. Mention any three-file functions and describe its operation.

PART – C (5 x 15 = 75 MARKS)

16. Explain the components of a computer system with a neat diagram and the structure of C program.

(OR)17. Explain about operators and expression in c with suitable example.

18. Explain the loop control statement with a sample program.(OR)

19. Describe the following types of functions with sample program.a. Without arguments and return values. b. With arguments but without return values.c. With arguments and return values.

20. Explain in detail about the storage classes in C.(OR)

21. Define array with its characteristics. Write a program to add even and odd numbers from 1 to10. Store them and display their results in two separate arrays.

[P.T.O]

Page 50: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 50/79

22. Describe the features of pointer. Write a program to perform addition, subtraction,multiplication, division and modulo operations using pointer.

(OR)23. Define structure and union. Write a program to use structure within union and also display the

contents of structure elements.

24. Explain fopen ( ), fclose ( ), fprintf ( ), getw ( ), putw ( ).(OR)

25. Explain the data file processing and command line arguments.

Page 51: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 51/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: SYSTEM SOFTWARE Time: 3 hours

Subject Code: CS250 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. Write any two addressing modes of SIC/XE.2. Draw the instruction format of SIC computer.3. What are the functions of EXTREF assembler directives?4. Compare program block and control section.5. What is meant by relocation?6. What is a bootstrap loader?7. Define Macros.8. How are local labels handled in Macroprocessing?9. Define text editors.10. List down the user interface criteria.

PART – B (5 x 3 = 15 MARKS)

11. What is the need for modification record? Give its format for SIC/XE.12. Differentiate Loader and Linker.13. Write short notes about SunOS Linkers14. Provide examples for concatenation of Macro Parameters.15. What are the main functions accomplished by a typical debugger?

PART – C (5 x 15 = 75 MARKS)

16. Discuss the SIC/XE architecture and also explain in detail about the data and instructionformats.

(OR)17. Explain about CISC machine architecture in details.

18. Describe the algorithm for pass1 and pass2 assembler with an example.(OR)

19. Discuss the machine independent assembler features with suitable examples.

20. Explain in detail about Loader design option.(OR)

21. Write short notes on the followinga. MS-DOS Linker b. Cray MPP Linker 

22. Discuss machine independent macro processor features with suitable examples.(OR)

23. Describe the macro processor design option in detail.

24. Explain about the design of the functional component of the text editor.(OR)

25. Explain the interactive debugging systems in detail.

Page 52: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 52/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: CRYPTOGRAPHY AND NETWORK SECURITY Time: 3 hours

Subject Code: CS251 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. Define Security Mechanism.2. Give any two parameters and design choices that determine the actual algorithm of a Feistel

cipher?3. Identify the possible threats for RSA algorithm.4. List out the general schemes for the distribution of public keys.5. Is a 128-bit hash function (MD5) unsuitable for HMAC?6. What are the areas where Kerberos Version 5 addresses the limitation of Version 4?7. What is S/MIME?8. Mention the protocols used by IPSec to provide security.9. How are the passwords stored in password file in UNIX operating system?10. Which system is used to protect credit card transactions on the internet?

PART – B (5 x 3 = 15 MARKS)

11. Distinguish between Block and Stream Ciphers.12. Summarize trap-door one-way function.13. Give the general format of X.509 certificate.14. Why does ESP include a padding field?15. What is Virus? Mention its types.

PART – C (5 x 15 = 75 MARKS)

16. With a neat sketch, explain about the DES encryption and decryption process with the internalstructure of a single round of DES algorithm.

(OR)17. a. In AES, how is the encryption key expanded to produce keys for the 10 rounds? (10)

 b. Discuss about the evaluation criteria of AES used by NSIT. (5)

18. Summarize RSA Algorithm. Perform Key Generation for the prime numbers 17 and 11 and

 perform Encryption and Decryption for the plaintext input of 88.(OR)19. a. Users A and B want to establish a secret key using Diffie-Hellman key exchange protocol

using a common prime q= 353, a primitive root α= 3, A’s secret key X A=97 and B’s secretkey XB=233. Compute (8)i. A’s public key, YA

ii. B’s public key, YB

iii. A’s and B’s common secret key, K  b. Using elliptic curve cryptography, explain how secret keys are exchanged and messages

are encrypted. (7)

[P.T.O]

Page 53: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 53/79

20. a. Briefly describe about the overall processing of Message Digest Generation using MD5with necessary block diagram. (10)

 b. Compare the features of MD5, SHA-1 and RIPEMD-160 algorithm. (5)(OR)

21. Write down the Digital Signature Algorithm (DSA) and also show how signing and verificationof digital signatures is done using DSS with the block diagrams.

22. What is PGP? What are the principal services provided by PGP? Illustrate each PGP servicewith a neat diagram.

(OR)23. a. With a neat diagram, briefly explain about IPSec Authentication Header (AH) and Anti-

Replay mechanism in IPSec. (10) b. Give an overview of Oakley Key Determination Protocol. (5)

24. What are the services provided by the SSL Record Protocol for SSL connections? Explain theoperations performed by the SSL Record Protocol?

(OR)

25. a. Suggest any three password selection strategies and identify their advantage anddisadvantages if any. (10)

 b. What kind of attacks is possible on packet filtering firewalls and suggest appropriatecounter measures. (5)

Page 54: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 54/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: SOFTWARE ENGINEERING Time: 3 hours

Subject Code: CS252 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. Define Software Engineering.2. What are the drawbacks of RAD model?3. Define clean room software process.4. What is Modularity?5. List out the various software size measures.6. What is unit testing?7. List out the principles of system testing.8. What is meant by reachability measure?

9. List out the approaches of Evaluation.10. What are the Object Oriented software metrics?

PART – B (5 x 3 = 15 MARKS)

11. Explain the concept of effort estimation.12. Write short notes on documenting the design.13. Explain the concept of Test Planning.14. What is function testing?15. Compare assessment vs. prediction.

PART – C (5 x 15 = 75 MARKS)

16. Explain the activities of Project Planning Software scope with an example.(OR)

17. Describe the process of risk analysis and management.

18. Discuss the following:a. Software requirement specification b. Specification Review (8+7)

(OR)19. Explain Software Design Documentation in detail.

20. a. Discuss the various Software faults and failures. (8) b. Write short notes on Automated Testing Tools. (7)

(OR)21. Discuss briefly the information flow software measure, object oriented software metrics.

22. a. Explain in detail metrics for testing. (8) b. Write short notes on Software maintenance. (7)

(OR)23. Develop your own metrics for maintainability, correctness, reliability, availability and

usability of Software.

24. Describe evaluating products, processes and resources in detail.(OR)

25. Discuss improving prediction, products and processes in detail.

Page 55: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 55/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: C# PROGRAMMING Time: 3 hours

Subject Code: CS255 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. List down any two primitive types in C#.2. The methods are equivalent to _______ in C++.3. The classes can be inherited using _______ operator.4. Give an example for declaring a single dimensional string array.5. List down any two examples for windows controls.6. The web server control is linked to a web page using _______ and _______ attribute.7. Oledbcommand class inherits from _______ class.8. Dataviews can be created using _______ class.

9. The types of assemblies are _______ and _______.10. Threads can be combined using _______ method.

PART – B (5 x 3 = 15 MARKS)

11. Define inheritance.12. Give an example for a delegate in C#.13. Compare windows and web application.14. Identify the mechanism for retrieving data from database.15. What is an assembly?

PART – C (5 x 15 = 75 MARKS)16. a. Write a program to search in a regular expression. (10)

 b. With an example explain the importance of constructors. (5)(OR)

17. a. Explain about data handling functions in C#. (8) b. Write a C# program to convert string to integer. (7)

18. Compare boxing and unboxing with an example.(OR)

19. Write C# program to add values to the stack and print the values.

20. With an example explain code blocks for creating a web application.(OR)

21. Write a program to change the color, select a font and open a file. Write code routines for  performing different operations on color, font and file.

22. With an example, explain how multiple tables can be accessed in a single dataset.(OR)

23. Write a C# program for handling the hospital information.

24. a. List down the steps for creating a shared assembly. (8) b. With an example explain how threads can be synchronized in dotnet. (7)

(OR)

25. With an example demonstrate the steps for handling the assembly.

Page 56: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 56/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: DATABASE SYSTEMS Time: 3 hours

Subject Code: CS256 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. Mention the two categories of people who work with a database.2. Define primary key.3. What are the basic components in relational model?4. List the various join operations.5. Assume a sample database and mention how to add, remove and change information in

database.6. Write the general syntax for creating view.7. What is the key role of functional dependency?8. Mention any two purpose of normalization.9. What is mean by access time?10. Mention any two secondary storage devices.

PART – B (5 x 3 = 15 MARKS)

11. Construct an E-R diagram for Bank transaction.12. Explain three forms of outer join.13. Write a short note on DDL statements with example.14. Give a simple definition for multivalued dependencies.15. Explain about B-tree index files. Also give example for typical nodes of B-tree.

a. Leaf node b. Non-leaf node

PART – C (5 x 15 = 75 MARKS)

16. With the help of block diagram, explain the basic structure of a database management system.(OR)

17. Explain briefly about different data models.

18. Discuss the fundamental operations in relational algebra. Give example for each one.(OR)

19. Describe briefly about data constraints. Give example of different constraints that can beapplied on the table?

20. What is aggregate function? Discuss with examples the 5 built-in aggregate function offered bySQL.

(OR)21. Explain briefly about procedures and triggers in SQL with example.

22. Why is a relation that is in 3NF generally considered good? Define BCNF with an example.(OR)

23. What is meant by normalization? Explain briefly about different Normalization forms.

[P.T.O]

Page 57: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 57/79

24. What are the different types of storage media? Explain each one briefly.(OR)

25. The following key values are organized in an extendable hashing technique1 3 5 8 9 12 17 28

Show that extendable hash structure for this file, if the hash function is h(x)=x mod 8 and buckets can hold 3 records,Show how the extendable hash structure changes as the result of each of the following steps.

- Insert 2

- Insert 24- Delete 5- Delete 12

Page 58: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 58/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: INTRODUCTION TO DATABASE MANAGEMENT SYSTEMS

Time: 3 hours

Subject Code: CS257 Maximum Marks: 100Answer ALL questions

PART – A (10 x 1 = 10 MARKS)

1. Define data model.2. List the four integrity constraints in database systems.3. Which of the following is procedural language?

a. Relational calculus, b. domain relational calculus c. relational algebrad. tuple relational calculus.

4. What is a super key?5. Why are certain functional dependencies called trivial functional dependencies?6. State the pseudo transitivity rule of Armstrong’s axioms.7. List the basic steps of query processing.8. How to evaluate an expression in a query?9. List the four types of segments in Oracle.10. Which is the most commonly used mechanism for external data sources in Oracle?

PART – B (5 x 3 = 15 MARKS)

11. How to express the logical schema of a database graphically? Give its components.12. Define left outer join and right outer join operations in relational algebra.13. Define third normal form.14. Give any three equivalence rules that are used in query optimization.15. Which is the most commonly used indexing in Oracle? Give its format.

PART – C (5 x 15 = 75 MARKS)

16. Explain the database system structure with neat diagram.(OR)

17. a. Explain the classification of data models. (8) b. Draw the E-R diagram for the customer and account entities in a banking database. (7)

18. a. Explain the different keys involved in database design. (8) b. Explain any four fundamental relational algebra operations. (7)(OR)

19. a. Explain the relational algebra operations used for modifications of the database. (8) b. Give the complete syntax of schema definition in SQL. (7)

20. Write a short note on functional dependencies and boyce codd normal form.(OR)

21. Write a short note on multivalued dependencies and fourth normal form.

22. Explain the steps involved in query processing.(OR)

[P.T.O]

Page 59: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 59/79

23. Explain how to evaluate an expression containing multiple operations.

24. Explain the object relational features and triggers in Oracle.(OR)

25. Explain the various indexing methods used in Oracle.

Page 60: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 60/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: INTRODUCTION TO ALGORITHMS Time: 3 hours

Subject Code: CS259 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. What is algorithm?2. Mention any one application of divide and conquer algorithm.3. Define knapsack problem.4. Write any one demerit of greedy method.5. What is principle of optimality?6. Draw an undirected graph with 5 vertices and 6 edges.7. Specify the time complexity of Prim’s algorithm.8. Mention any two applications of Backtracking.9. Write the time complexity of knapsack problem.10. Give examples for NP-complete problem.

PART – B (5 x 3 = 15 MARKS)

11. With an example depict selection sort strategy.12. Write the general algorithm for greedy.13. Write the Rabin-

Karp algorithm.14.

How do you represent graphs? Illustrate with an example.

15. What is Branch and Bound? Compare with Backtracking.

PART – C (5 x 15 = 75 MARKS)

16. Demonstrate Quick sort with an example.(OR)

17. How do you find maximum and minimum in a list of elements? Illustrate with an exampleusing Divide and conquer technique.

18. Solve n=4, (p1,p2,p3,p4)=(100,10,15,27), (d1,d2,d3,d4)=(2,1,2,1) using job sequencing with deadline concept.

(OR)

19. Find the shortest path for the following undirected graph using Kruskal’s algorithm.

[P.T.O]

Page 61: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 61/79

20. Find the minimum cost path from S to T for the following multistage graph.

(OR)21. Give Knuth-Morris-Pratt (KMP) algorithm. For the given Text: bacbababaabcbab find the

Pattern: ababaca using KMP algorithm.

22. Let n = 6, w [1:6] = {5,10,12,13,15,18}, m = 30.Find all the possible subsets of w that sum tom. Do this using SumOfSub. Draw the portion of state space that is generated.

(OR)23. With suitable examples, explain Depth First search and Breadth First Search algorithms.

24. Solve the following problem using 0/1 knapsack problem Weight is 10 and upperbound is$100. Draw the state space tree.

Item Weight Value Value /weight

1 4 $40 10

2 7 $42 6

3 5 $25 5

4 3 $12 4

(OR)25. Find state space tree for the following travelling sales man problem using branch and bound

method.

a  b

c d

e

3

8

5 6

81 78

9

2 3

4

Page 62: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 62/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: OBJECT ORIENTED PROGRAMMING - C++ AND JAVA Time: 3 hours

Subject Code: CS260 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. One problem with OOP is that once a class is created it can never be changed. (True/False)2. What are the major parts of a C++ program?3. What is the main advantage of passing arguments by reference?4. What is the output of the following code?

#include<iostream.h> #include<string.h>Void main(){

string s1(“12345”); string s2(“abcde”); s2.replace(1,3,s1); cout<<”s2 is:”<<s2<<”\n”;}

5. We cannot use _______ function to overload certain operators.6. How will you detect the end-of-file condition successfully?7. What is type casting?8. How does vector differ from an array?9. What are the methods by which threads can be suspended?10. How many catch blocks can be used with one try block?

PART – B (5 x 3 = 15 MARKS)

11. Why do we need preprocessor directive in C++ program?12. What is a friend function? What are the merits and demerits of using it?13. When do we make a virtual function “pure”?14. Compare and contrast overloading and overriding methods.15. List all the attributes of applet tag.

PART – C (5 x 15 = 75 MARKS)

16. Describe the major part of C++ program with examples.(OR)

17. Explain the basic concepts of object oriented programming.

18. An electricity board charges the following rates to domestic users to discourage largeconsumption of energy:For the first 100 units : `. 2 per unit

For the next 200 units : `. 3 per unitBeyond 300 units : `. 3.50 per unit

All users are charged a minimum of  `. 50. If the total amount is more than `. 900 then anadditional surcharge of 15% is added. Write a program to read the names of five users andnumber of units consumed and print out the charges with names.

(OR)

[P.T.O]

Page 63: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 63/79

19. Can we have more than one constructor in a class? If yes, explain the need for such a situation.

20. What is operator overloading? Explain with examples.(OR)

21. Explain the different forms of inheritance in C++ with examples.

22. What is a package? Explain with examples.(OR)

23. Explain the most commonly used string methods with examples.

24. How are the errors handled in Java? Explain with examples.(OR)

25. Write a program to create a file that could store details about five products. Details include product code, cost and number of items available and are provided through the keyboard.

Page 64: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 64/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: MACHINE LEARNING IN BIOINFORMATICS Time: 3 hours

Subject Code: CS262 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. What is meant by functional similarity in alignment?2. What is entropy?3. Name any two-optimization algorithms.4. What is Markov chain?5. What is S score?6. EM algorithm is also called ______.7. What is Conjugate prior?8. What is GeneMark?9. What are BIOHMMs?10. What are Dirichlet Priors?

PART – B (5 x 3 = 15 MARKS)

11. Discuss about the Dynamic Programming.12. Write short notes on Metropolis algorithm.13. Mention two applications of neural networks in bioinformatics.14. Discuss about the limitations of HMM.15. Write a short note on probabilistic graphical models in bioinformatics.

PART – C (5 x 15 = 75 MARKS)

16. Discuss in detail about the Cox Jaynes Axioms.(OR)

17. Explain about statistical mechanics.

18. Discuss about stimulated annealing and genetic algorithm.(OR)

19. Write about Markov chain Monte-Carlo methods.

20. Discuss about learning algorithms. (OR)21. Explain about various performance measures.

22. Explain about HMM.(OR)

23. Discuss about applications of HMMs.

24. Describe about hybrid models and neural network parameterization of graphical models.(OR)

25. Discuss about Bidirectional recurrent neural networks for protein secondary structure prediction.

Page 65: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 65/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: PROGRAMMING IN C++ Time: 3 hours

Subject Code: CS264 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. In C++, function contained within a class is called _________.2. What header file must you #include with your program to use setw and endl?3. A relational operator is used to _________.4. The increment expression in for loop can decrement the loop variable. (True / False)5. What is the purpose of class specification declaration?6. A member function can always access the data _________.7. When you overload an arithmetic assignment operator it will _________.8. How many arguments are required in the definition of an overloaded unary operator?9. Name three-stream class commonly used for disk I/O.10. What is a file?

PART – B (5 x 3 = 15 MARKS)

11. What is the difference between a character and a character string representation?12. Write the use of default arguments.13. What is copy constructor?14. Why is it necessary to overload an operator?15. Define template and its role.

PART – C (5 x 15 = 75 MARKS)

16. Briefly discuss about different data types with examples.(OR)

17. Distinguish between the following terms:a. Cin b. Cout c. Comments d. Escape sequence e. Type conversion

18. Explain the following statements in detail with examples:a.  for statement b. do while statement c.  switch statement d. if else statement

(OR)

19. a. What do you mean by overloading of functions? When do we use this concept? b. Explain inline function with an example.

20. Write a C++ program to merge two sorted arrays consisting of integers.(OR)

21. Explain the following in detail:a. Static class data b. Const and classes c. Structure and class

22. Explain the syntax of binary operator overloading. How many arguments are required in thedefinition of an overloaded binary operator?

(OR)

[P.T.O]

Page 66: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 66/79

23. a. Illustrate how constructors are implemented when the classes are inherited. b. Illustrate the implementation of both multilevel and multiple inheritance.

24. Write a class template to represent a generic vector including member functions to perform thefollowing tasksa. To create the vector b. To modify the value of a given element

c. To multiply by a scalar value(OR)

25. Explain the various file stream classes needed for file manipulations.

Page 67: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 67/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: WINDOWS PROGRAMMING Time: 3 hours

Subject Code: CS265 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. The MessageBox function creates a _______.2. A _______ is a collection of GDI commands stored in a binary form.3. The virtual key code is stored in the _______ parameter of the WM_KEYDOWN.4. Moving the mouse while holding down a button is _______.5. Static child window controls are created by using “static” as the window class in the _______ 

function.6. Menu items in the top-level menu or in popup menus can be “enabled”, “disabled” or _______.7. _______are used for obtaining additional input from the user beyond what can be easily

managed through a menu.8. _______ is a handle to a color palette.9. The _______ function is called to unsignal an event object.10. _______ is the ability of an operating system to run multiple programs concurrently.

PART – B (5 x 3 = 15 MARKS)

11. What is meant by Bitmaps? What are its functions?12. What are the actions performed with mouse buttons?13. What is meant by Window Subclassing?14. Bring out the differences between Modal and Modeless Dialog Boxes.15. Show the parent-child hierarchy of a Windows MDI application.

PART – C (5 x 15 = 75 MARKS)

16. a. Explain briefly about WM_PAINT and WM_DESTROY messages. (8) b. Write short notes on Scroll Bars. (7)

(OR)17. a. Explain the structure of Graphics Device Interface (GDI). (8)

 b. Write short notes on Rectangles, Regions and Clipping. (7)

18. a. Explain in detail about Character Messages. (9) b. Write short notes on The Caret Functions. (6)(OR)

19. a. What are the various Client-Area Mouse Messages? Explain them. (8) b. Explain any two methods of using the Timer. (7)

20. Explain in detail the LISTBOX class with a suitable application.(OR)

21. Explain Keyboard Accelerators in detail with a suitable application.

[P.T.O]

Page 68: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 68/79

22. Explain the Modal Dialog Boxes in detail with suitable examples.(OR)

23. Explain the simple use of Clipboard.

24. a. Explain Multiples Document Interface concepts in detail. (8) b. Write short notes on Thread Synchronization and Event Signaling. (4+3)

(OR)

25. Explain the Modes of Multitasking.

Page 69: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 69/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: JAVA PROGRAMMING Time: 3 hours

Subject Code: CS266 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. State the role of JVM.2. What is encapsulation?3. What is an exception?4. What is the major difference between a class and an interface?5. What are the two methods by which we may stop threads?6. What is autoboxing?7. Define socket.8. What is an applet?9. Which is the highest class in the event delegation model?10. Which layout should you use to organize the components of a container in a tabular form?

PART – B (5 x 3 = 15 MARKS)

11. Describe the structure of a Java program.12. What is a constructor function? What are its special properties?13. What is a String? Distinguish between string class and string buffer class.14. Write a Java program to read a string from the keyboard and display its length.15. What is a Layout manager and what are the different layout managers available in java.awt?

PART – C (5 x 15 = 75 MARKS)

16. a. List out the salient features provided by Java. (8) b. What is method overloading? Explain with an example. (7)

(OR)17. a. What are the decision making statements used in Java? Explain with an example. (8)

 b. Write a Java program to generate the Fibonacci series up to 100. (7)

18. a. How do you create user defined package? Give an example. (8) b. With a suitable example, explain how exceptions are handled in Java. (7)

(OR)19. a. Explain the keywords ‘extends’ and ‘implements’ in Java with suitable programmingexamples. (8)

 b. What is a package? Discuss the purpose of various built in packages in Java. (7)

20. a. Explain multithreading with suitable Java code. (10) b. What are Wrapper classes? Explain with an example. (5)

(OR)21. a. With a neat diagram, explain the life cycle of thread and explain its methods involved it.

(8) b. What is Enumeration? Explain with an example. (7)

[P.T.O]

Page 70: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 70/79

22. a. Write a Java program that accepts a name list of five students and arrange them inascending order. (8)

 b. Explain the various categories of Input stream classes in Java. (7)(OR)

23. a. Write a program to display various shapes in an applet window. (7) b. Write a Java program to implement client server concept using TCP Sockets. (8)

24. a. Discuss in detail about event handling facility in Java. (8)

 b. Write a Java program to handle various mouse events. (7)(OR)

25. With suitable example explain the following:a. Grid Layout b. Border Layout

Page 71: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 71/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: DATABASE SYSTEMS Time: 3 hours

Subject Code: CS267 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. State any two applications of DBMS.2. A ______ is a variable whose domain is the set of all tuples.3. SQL stands for ______.4. What are the attributes of primary key?5. Write any two mapping cardinalities.6. What is meant by centralized database systems?7. A domain is ______ if elements of the domain are considered to be indivisible units.8. A ______ is a statement that the system executes automatically as a side effect of a

modification to the database.9. What are the two basic kinds of indices?10. A ______ is a unit of program execution.

PART – B (5 x 3 = 15 MARKS)

11. Represent the three levels of data abstraction in the form of block diagram.12. List out the built-in aggregate functions.13. Draw a sample E-R diagram for any one application.14. Explain the concept of multivalued dependency.15. With the help of state diagram, explain the concept of transaction.

PART – C (5 x 15 = 75 MARKS)

16. Explain the overall architecture of the database system with neat diagram.(OR)

17. Explain the basic Relational Algebra operations with the symbol used and an example for each.

18. Consider the employee-company relation. Write SQL statement for the following queries.Employee-company relation:Employees (person-name, street, city)

Works (person-name, company-name, salary)Company (company-name, city)Manages (person-name, manager-name)a. Modify the database so that ‘priya’ now lives in ‘chennai’. (4) b. Find the company that has the most employees. (3)c. Find all employees who are under the manager ‘john’ (4)d. Find all employees in the database who live in the same cities as the companies for which

they work. (4)(OR)

19. Justify the need of embedded SQL. Consider the relation student (stno, name, mark, grade).Write embedded dynamic SQL statements in C language to retrieve all the students’ recordswhose mark is more than 90.

[P.T.O]

Page 72: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 72/79

20. Explain the following with example: (3x5)a. Functional dependency b. Entity integrity c. Referential integrity

(OR)21. Draw the architecture of centralized computer system and explain.

22. With relevant examples, discuss First Normal Form, Second Normal Form and BCNF.(OR)

23. Discuss about any two techniques of organizing records in files.

24. How does a B-tree differ from a B+ tree? What is the order  P of a B+ tree? Describe thestructure of both internal and leaf nodes of a B+ tree. Give an example for each.

(OR)25. Describe the implementation of Atomicity and Durability with relevant block diagram.

Page 73: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 73/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: OPERATING SYSTEMS Time: 3 hours

Subject Code: CS268 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. What are the two types of modes used in dual modes operation?2. How is the protection for memory provided?3. Define process.4. What do you meant by throughput?5. What is the use of semaphore?6. Write some classical problems of synchronization.7. What is meant by thrashing?8. How is free-space managed using bit vector implementation?

9. What are the techniques used for performing I/O?10. How can the index blocks be implemented in the indexed allocation scheme?

PART – B (5 x 3 = 15 MARKS)

11. Draw labeled diagram for the process state transitions.12. What are the different ways in which a thread can be cancelled?13. What are conditions under which a deadlock situation may arise?14. What is meant by internal and external fragmentation?15. What criteria should be used in deciding which strategy is best utilized for a particular file?

PART – C (5 x 15 = 75 MARKS)

16. Explain about the system calls in detail.(OR)

17. What are the system components of an operating system? Explain them.

18. Explain in briefly about the various CPU scheduling algorithm.(OR)

19. Discuss briefly the various issues involved in implementing Inter Process Communication(IPC) in message system.

20. Discuss how deadlocks can be avoided and detected.(OR)

21. Explain briefly about Readers/writers problem in classical Synchronization implement usingcritical section.

22. Explain in detail about virtual memory management.(OR)

23. Explain different schemes for defining the logical structure of a directory.

24. Explain briefly about RAID.(OR)

25. Discuss on the following disk scheduling algorithms:

Shortest Seek Time First, First Come First Served, SCAN, C-LOOK.

Page 74: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 74/79

Page 75: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 75/79

21. Explain the various AVL tree rotations with suitable examples.

22. Discuss Warshall’s algorithm and Floyd’s algorithm with suitable examples.(OR)

23. a. Write short notes on hashing techniques and hash table. (5+5) b. What is meant by space and time trade-off? (5)

24. Write and explain the followinga. Prim’s algorithm b. Kruskal’s algorithm (8+7)

(OR)25. Explain P and NP complete problem, with suitable examples.

Page 76: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 76/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: C++ AND DATA STRUCTURES Time: 3 hours

Subject Code: CS274 Maximum Marks: 100

Answer ALL questionsPART – A (10 x 1 = 10 MARKS)

1. What is head node?2. Give the application of list.3. The operation of processing each element in the list is known as ________.4. What is the complexity of binary search algorithm?5. What is the purpose of a class specification (declaration)?6. A constructor’s name is the same as ________.7. The >=operator can be overloaded. (True/False)8. The statement obj A=obj B; will cause a compiler error if the object are of different classes.

(True / False)9. A C++ stream is ________.10. A file pointer always contains the address of the file. (True / False)

PART – B (5 x 3 = 15 MARKS)

11. Write an algorithm to delete any node form binary search tree.12. Apply heap sort on the given data and sort the tree

13. What are arrays? Explain how to implement array in a program with one suitable example.14. List the operation that cannot be overloaded and justify why they cannot be overloaded.15. What are the rules that need to be kept in mind in declaring virtual functions?

PART – C (5 x 15 = 75 MARKS)

16. Describe the doubly linked list. Write a function to insert a node and delete a node in a doublylinked list.(OR)

17. Write an algorithm and convert the following infix expression into a postfix expression usingstack.a. X+Y*(A-B)/(C-D) b. A*B+(C-D/E)#

18. Write an algorithm to implement bubble sort and sort the following list in descending order byusing the algorithm: 15, 12, 4, 16, 9, 10, 94.

(OR)19. Explain the quick sort for the following list 10, 1, 9, 11, 46, 20, 15, 0, 72, 2 and explain.

[P.T.O]

1119

141512

10

20

40

30

21

Page 77: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 77/79

20. Explain the class specification inside and outside the class with suitable example.(OR)

21. What are constructors and destructors? Explain how they differ from normal function.

22. Explain the syntax of binary operator overloading. How many arguments are required in thedefinition of an overloading binary operator?

(OR)23. What are the different forms of inheritance supported by C++? Explain them with an example.

24. Describe different method of realizing polymorphism in C++.(OR)

25. What is template? Explain the syntax of a class template and functional template with suitableexamples.

Page 78: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 78/79

Reg. No. ________ 

Karunya University(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – April/May 2012

Subject Title: WEB TECHNOLOGY Time: 3 hours

Subject Code: CS373 Maximum Marks: 100

Answer ALL questions (5 x 20 = 100 Marks)

1. Compulsory:

a. Differentiate with syntax and example, the Do….loop, Do While …….loop and Do Until…. Loops in VB script. (14)

 b. Write a VB script to demonstrate Timer and formatNumber function. (6)

2. a. Define Request Collection. What are all the Request collections available, narrate each one.(8)

 b. Give details of the properties of Response objects with syntax. (12)(OR)

3. a. Illustrate the usage of # include directive in ASP. (8) b. List the components of Global.asa and its events. (12)

4. Explain the syntax for cookies collection and use the same in an example of a system of your choice.

(OR)5. Describe in detail, the syntax of an SQL statement from input of the user that is used to find all

information about a patient.(Hint: Assume necessary variables and structures)

6. a. List the java-script built-in objects and explain its usage. (8) b. Write a java-script that will demonstrate the use of exception. (12)

(OR)7. a. How many types of keywords are available in java-script? List 10 each. (8)

 b. In HTTP, how are requests made? Discuss each one in detail. (12)

8. a. Code a dynamic HTML that will create a table of contents dynamically from a web page.(14)

 b. Create a CSS for the above problem. (6)(OR)

9. a. Prepare an XML document for the table: (8)

EMPLOYEEEMPNAME EMPID SAL

ABC E001 15,000

PQL E002 20,000

XYZ E003 17,000

 b. How to handle white space in Mozilla, Netscape and Firefox Browsers. (12)

Page 79: CSE.april May.2012zxz

7/27/2019 CSE.april May.2012zxz

http://slidepdf.com/reader/full/cseapril-may2012zxz 79/79