Loyola College Question Paper 2007

Loyola College M.Sc. Computer Science April 2007 Software Testing & Quality Assurance Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

HC 27

SECOND SEMESTER – APRIL 2007

CS 2953 – SOFTWARE TESTING AND QUALITY ASSURANCE

 

 

 

Date & Time: 21/04/2007 / 1:00 – 4:00Dept. No.                                            Max. : 100 Marks

 

 

 

PART – A

Answer ALL the questions                                                              10 x 2 = 20

 

  1. Define the term Software Testing
  2. What are the objectives of Software Testing?
  3. List out the various reasons, which do not recommend the usage of Documentation shortcuts?
  4. Miss.Y has just started her career as tester in a company. She thinks that tables and spreadsheets are different entities, in the context of testing documentation of Testing. Is she correct?
  5. At the outset, a stopwatch may consist three states what are they, if applicable?
  6. “Test cases cannot be derived from a decision table”. Do you oppose or defend this statement? Justify your answer.
  7. What is the main objective of Configuration Testing?
  8. Write a short note on Useability Testing.
  9. Define the term Software Quality.
  10. “If Analysis, Design and Coding for a particular project is properly executed, then there is no need for a Software Review”. Do you agree with the statement? Justify your answer.

 

PART – B

Answer ALL the Questions                                                              5 x 8 = 40

 

  1. (a)Explain in detail about Evaluation of Software Testing Outline.

OR

(b)Create your own Test Oulines for any TWO Applications.

Required information about the Applications must be provided.

  1. (a) Briefly discuss about the Documentation Shortcuts.

OR

(b)What is a Test Case? Create Test case for Fuel Smart Card, with

the required information and Test Case Format.

  1. (a) Explain in detail about State Machines with an Example.

OR

(b) Brief the usage of Decision Tables and Test case with Multiple

Inputs.

  1. (a) Provide a short description on the term “Web Application’ and

explain Post Implementation Testing.

OR

(b) Demonstrate Configuration and Compatible Testing.

  1. (a) Discuss about Statistical Software Quality Assurance.

OR

(b) Discuss about ISO 9000 Quality Standards.

 

 

 

 

PART – C

 

Answer any TWO Questions                                                                       2 x 20 = 40

 

 

16 (a)   Write an essay on Incremental Testing.

(b)   Discuss the various Table Formats used for Documentation of Testing.

17.(a)   What is considered as Application with Complex Data, in the context of Testing?                                                                                  Write about testing Applications with Complex Data with an Example.

(b)   Explain the System Testing with an Example.

18.(a)   Write the Guidelines for a Software Review.

(b) Discuss about Quality Movement and Software Quality.

 

Go To Main page

Loyola College M.Sc. Computer Science April 2007 Parallel Processing & Algorithms Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

HC 22

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

FIRST SEMESTER – APRIL 2007

CS 1807 – PARALLEL PROCESSING & ALGORITHMS

 

 

 

Date & Time: 30/04/2007 / 1:00 – 4:00      Dept. No.                                       Max. : 100 Marks

 

 

PART-A

10*2=20

Answer all

  1. Define implicit parallelism?
  2. List the various factors of network performance?
  3. Define the degree of parallelism?
  4. Write the important characteristics of parallel algorithms?
  5. Describe the concept of resource conflicts?
  6. What is clock skewing?
  7. Describe about multiprogramming?
  8. Define subscript separability?
  9. Write an algorithm for O(n log n)work list ranking?
  10. Define selection?

PART-B                    

5*8=40

Answer all

  1. a) Describe about the shared memory multiprocessor?

(or)

  1. b) Explain about the VLSI complexity model?
  2. a) Explain the various standard performance measures?

(or)

  1. b) Explain the gustafson’s law for a scaled speedup model?
  2. a) Describe about the various mechanisms for instruction pipelining?

(or)

  1. b) List the difference between CISC and RISC processors?
  2. a) Explain the various categories of language features for parallel programs ?

(or)

  1. b) Describe the local and global optimizations?
  2. a) Write an algorithm for odd-even merge sort with example?

(or)

  1. b) Explain the computational model with respective example?

 

PART-C

2*20=40

Answer any two

  1. a) Explain PRAM model?
  2. b) Describe about the static connection network?
  3. a) Explain the virtual memory technology model?
  4. b) Brief about the various categories of dependence test?
  5. a) Write the preparata’s algorithm runs in O(log n) time and uses n log n CREW PRAM processors?
  6. b) Explain the linear pipeline processor?

 

 

Go To Main page

 

Loyola College M.Sc. Computer Science April 2007 Oops Through Java Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

HC 33

FIRST SEMESTER – APRIL 2007

CS 1805 – OOPS THROUGH JAVA

 

 

 

Date & Time: 27/04/2007 / 1:00 – 4:00   Dept. No.                                          Max. : 100 Marks

 

 

PART-A

Answer all questions                                                                           10 x 2 = 20

 

  1. What is Byte code?
  2. List two methods of string class with examples.
  3. Differentiate between throw and throws.
  4. Define Multithreading
  5. Define Event and Event Listener.
  6. What is a Listener interface?
  7. What is a swing?
  8. Define JAR files.
  9. What is Bean?
  10. What are cookies?

PART-B

Answer all Questions                                                                          5 x 8 = 40

 

  1. a) Differentiate between method overloading and method overriding. (or)
  2. b) Discuss about the different data types in java.

 

  1. a) Explain java packages. Discuss the access specification. (or)
  2. b) Define threading? Explain various methods available for managing threads.

 

  1. a) Describe the applet skeleton. Discuss the architecture of an applet.  (or)
  2. b) Briefly state how a frame window is created in an applet

 

  1. a) Explain the various swing components                                               (or)
  2. b) What is a java bean? Write about bound and constrained properties.

 

  1. a) What is a servlet? Write about developing a simple servlet (or)
  2. b) Explain the types of drivers available in java for accessing the database.

 

PART-C

Answer any two Questions                                                                 2 x 20 = 40

 

  1. a) Elaborate on the control flow statements (10 Marks)
  2. b) Discuss in detail about constructor. (10 Marks)

 

  1. a) Explain the various mouse events in java. (10 Marks)
  2. b) Discuss about implementing interfaces (10 Marks)

 

  1. a) Write a short note on (5 x 2 = 10 Marks)

i .  Icon

  1. Label

iii. Text field

iv  Button

v  Combo boxes

  1. b) Write in detail about java database connectivity. (10 Marks)

 

Go To Main page

 

Loyola College M.Sc. Computer Science April 2007 Object Oriented Software Engineering Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

HC 21

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

FIRST SEMESTER – APRIL 2007

CS 1806 / 1950 – OBJECT ORIENTED SOFTWARE ENGINEERING

 

 

 

Date & Time: 28/04/2007 / 1:00 – 4:00      Dept. No.                                       Max. : 100 Marks

 

 

PART A

Answer ALL the questions.                                                                            10 X 2 = 20

 

  1. List out the different stages in object oriented approach.
  2. Define:                        a) Encapsulation                     b) Static binding
  3. List any three different approaches for identifying classes.
  4. What are the general guidelines for identifying the tentative associations?
  5. Describe Object Constant Language.
  6. Describe the difference between cohesion and coupling.
  7. List any three purpose of a view layer interface.
  8. What are the two different kinds of reusability?
  9. What are the steps involved in creating a test plan?
  10. What do you mean by successful testing?

 

 

PART B

Answer ALL the questions.                                                                            5 X 8 = 40

 

  1. a. Explain all structural diagrams in UML.

(or)

  1. Explain booch methodology for modeling.

 

  1. a. Explain Use – case approach for identifying class.

(or)

  1. Explain noun phrase approach for identifying classes.

 

  1. Explain the relationship between Object Oriented Technology and

Object Oriented Database Management Techniques.

(or)

  1. Explain Object Constraint language for designing classes, methods and attributes.

 

  1. a. How do you extend the extensibility?

(or)

  1. What are the major activities in designing view layer classes?.

1111111

  1. a. Describe the guidelines to identify the risk area while introducing new technology.

(or)

  1. Describe the guidelines for doing successful Quality Assurance Testing.

 

PART C

 

Answer ANY TWO questions.                                                                                   2 X 20 = 40

 

  1. Explain telephone exchange system using Jacobson’s methodology for modeling
  2. Describe the guidelines for designing
  3. forms and data entry windows.
  4. Dialog boxes and error messages.
  5. Describe
  6. Guidelines for developing a user satisfaction text.
  7. Explain software metrics.

 

 

Go To Main page

Loyola College M.Sc. Computer Science April 2007 Neural Networks Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

HC 26

SECOND SEMESTER – APRIL 2007

CS 2952 – NEURAL NETWORKS

 

 

 

Date & Time: 21/04/2007 / 1:00 – 4:00Dept. No.                                           Max. : 100 Marks

 

 

 

PART – A

 

Answer ALL the questions                                                              5 x 2 = 10

 

  1. Define the term Neural Networks.
  2. What is called Activation of a Node?
  3. Explain Madaline in short.
  4. Write a short note on Heb Rule.
  5. What is a Maxican Hat net?
  6. What is meant by Self-Organizing Nets?
  7. Is there any difference among various versions of ART Networks?
  8. Provide a short description on Forward-only Counterpropagation.
  9. What is called White Noise and Coloured Nosie?
  10. Define the term Annealing.

 

 

PART – B

 

Answer ALL the questions                                                              5 x 8 = 40

 

 

  1. (a) Brief the Applications of ANN.

OR

(b)  Explain Perceptron  in detail.

  1. (a) Brief Bidirectional Auto-Associative Memory Nets.

OR

(b)  Explain Auto-Associative Memory Nets.

  1. (a) Explain LVQ.

OR

(b)  Explain Counterpropogation Nets.

  1. (a) Write the Algorithm for ART Networks.

OR

(b) Present the structure of ART and explain Two-Third Rule.

  1. (a) Explain Neocognitron Networks without Algorithm.

OR

(b)  Demonstrate Cascade Correlation.

 

 

 

 

 

 

 

PART – C

 

Answer any TWO questions                                                                        2 x 20  = 40

 

 

  1. (a) Brief the Mile stones in History of Artificial Neural Networks, by

highlighting on breakthroughs by scientists.

  • Write an essay on Iterative Auto-Associative Nets.
  1. (a) Briefly explain Fixed-Weight Competitive Nets.
  • Explain ART Networks.
  1. (a) Present the Backpropagation Network Architecture and explain it with the

Algorithm.

  • Write about Recurrent Nets.

 

 

Go To Main page

Loyola College M.Sc. Computer Science April 2007 Data Structures Through Java Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

LT 16

SECOND SEMESTER – APRIL 2007

CS 2807 – DATA STRUCTURES THROUGH JAVA

 

 

 

Date & Time: 17/04/2007 / 1:00 – 4:00    Dept. No.                                     Max. : 100 Marks

 

 

 

Part-A

Answer all questions                                                                           10 x 2 = 20

 

  1. What is a vector?
  2. Define Object?
  3. What is stack?
  4. Define en-queue.
  5. Define B-Tree
  6. What is a sequential Search?
  7. What is cyclic graph?
  8. What is graph coloring?
  9. What is worst fit?
  10. What is garbage collection?

 

Part-B

Answer all Questions                                                                          5 x 8 = 40

 

  1. a) Write about abstract data types (or)
  2. b) Define String. Explain its operations

 

  1. a) Define Linked List. Write an algorithm to add a number into a list (or)
  2. b) Explicate Circular lists

 

  1. a) Explain Exchange sort (or)
  2. b) Elucidate Binary Search

 

  1. a) Explain Tree Traversals                                                                                    (or)
  2. b) Explain Kruskal’s Algorithm

 

  1. a) Explain in detail about i) First Fit ii) Best Fit (or)
  2. b) Discuss how the Lists are used in java

 

Part-C

Answer any two Questions                                                                 2 x 20 = 40

 

 

  1. a) Discuss any two stack applications. (10 Marks)
  2. b) Write an algorithm for deleting an element from a doubly linked list (10 Marks)

 

  1. a) Elucidate Dijkstra’s algorithm with suitable examples. (10 Marks)
  2. b) Write a short note on
  3. i) Merge sort (5Marks)
  4. ii) Radix sort. (5Marks)

 

  1. a) Explain DFS and BFS.  (10 Marks)
  2. b) Write in detail about compaction  (10 Marks)

 

Go To Main page

Loyola College M.Sc. Computer Science April 2007 Data Structures Through Java Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

HC 24

SECOND SEMESTER – APRIL 2007

CS 2807 – DATA STRUCTURES THROUGH JAVA

 

 

 

Date & Time: 17/04/2007 / 1:00 – 4:00    Dept. No.                                     Max. : 100 Marks

 

 

Part-A

Answer all questions                                                                                   10 x 2 = 20

 

  1. What is a vector?
  2. Define Object?
  3. What is stack?
  4. Define en-queue.
  5. Define B-Tree
  6. What is a sequential Search?
  7. What is cyclic graph?
  8. What is graph coloring?
  9. What is worst fit?
  10. What is garbage collection?

 

Part-B

Answer all Questions                                                                                  5 x 8 = 40

 

  1. a) Write about abstract data types (or)
  2. b) Define String. Explain its operations

 

  1. a) Define Linked List. Write an algorithm to add a number into a list (or)
  2. b) Explicate Circular lists

 

  1. a) Explain Exchange sort (or)
  2. b) Elucidate Binary Search

 

  1. a) Explain Tree Traversals                                                       (or)
  2. b) Explain Kruskal’s Algorithm

 

  1. a) Explain in detail about i) First Fit ii) Best Fit (or)
  2. b) Discuss how the Lists are used in java

 

Part-C

Answer any two Questions                                                             2 x 20 = 40

 

  1. a) Discuss any two stack applications. (10 Marks)
  2. b) Write an algorithm for deleting an element from a doubly linked list (10 Marks)

 

  1. a) Elucidate Dijkstra’s algorithm with suitable examples. (10 Marks)
  2. b) Write a short note on
  3. i) Merge sort (5Marks)
  4. ii) Radix sort. (5Marks)

 

  1. a) Explain DFS and BFS. (10 Marks)
  2. b) Write in detail about compaction  (10 Marks)

 

Go To Main page

Loyola College M.Sc. Computer Science April 2007 Asp.Net Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

HC 28

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

THIRD SEMESTER – APRIL 2007

CS 3809 – ASP .NET

 

 

 

Date & Time: 24/04/2007 / 9:00 – 12:00      Dept. No.                                       Max. : 100 Marks

 

 

Part – A

Answer ALL the questions                                                                          10 * 2 = 20

 

  1. Write significant features of C#.
  2. Mention the Data types available in C# and point on the advantages of such Data types which are unique in C#.
  3. What is called Validation and how does it help in Database-enabled Web Application?
  4. Why HTML Controls are made available in ASP.NET?
  5. What is the difference between Data Reader and Data Adapter?
  6. Differentiate Authentication and Authorization?
  7. What is Security Principal and Security Model?
  8. Why Caching is used? Mention the different types of Caching in ASP.NET?
  9. What is the fundamental difference between XML and HTML?
  10. Define the term Namespace in context of XML.

 

Part – B

Answer ALL the questions                                                                          5 * 8 = 40

 

  1. (a) Explain the Predefined Data types in C# with appropriate examples

(OR)

(b) Write in detail about the features of C#

  1. (a) Explain the ASP.NET Calendar Control and Adrotator Contol.

(OR)

(b) Explain the Advantages of ASP.NET pages

  1. (a) Explain the Connected Architecture of ADO.NET

(OR)

(b) Brief the Disconnected ADO.NET Architecture with neat diagrams.

  1. (a) Elaborate  ASP.NET Caching

(OR)

(b) Explain ASP.NET Authentication in detail

  1. (a) Brief the advantages of XML

(OR)

(b)        What is DOM and how it is being used in XML?

 

Part – C

Answer any TWO Questions                                                                       2 * 20 = 40

 

  1. (a) Brief the C# properties.

(b)  Explain the ASP.NET Validation Controls.

  1. (a) Discuss the Architecture of ASP.NET pages

(b) Write an essay on Design Goals and Key Components of ADO.NET

  1. (a) Explain the deployment of XML in ASP.NET

(b)  Discuss in detail about the Conditional and Looping Statements in C#

 

Go To Main page

Loyola College M.Com Nov 2007 Strategic Marketing Management Question Paper PDF Download

by

Go To Main page

Loyola College M.Com Nov 2007 Business Environment Question Paper PDF Download

by

Go To Main page

Loyola College M.A. Social Work Nov 2007 Sociology & Study Of Indian Society Question Paper PDF Download

by

Go To Main page

Loyola College M.A. Social Work Nov 2007 Women & Development Question Paper PDF Download

by

Go To Main page

Loyola College M.A. Social Work Nov 2007 Welfare Of Weaker Sections Question Paper PDF Download

by

Go To Main page

Loyola College M.A. Social Work Nov 2007 Rural Economy & Cooperation Question Paper PDF Download

by

Go To Main page

Loyola College M.A. Social Work Nov 2007 Rural Community Development Question Paper PDF Download

by

Go To Main page

Loyola College M.A. Social Work Nov 2007 Psychiatric Disorders Question Paper PDF Download

by

Go To Main page

Loyola College M.A. Social Work Nov 2007 Labour Legislation & Case Laws Question Paper PDF Download

by

Go To Main Page

Loyola College M.A. Social Work Nov 2007 Industrial Relations & Trade Union Question Paper PDF Download

by

Go To Main Page

© Copyright Entrance India - Engineering and Medical Entrance Exams in India | Website Maintained by Firewall Firm - IT Monteur