M.Sc. Computer Science Question paper

Loyola College M.Sc. Computer Science Nov 2006 Visual Basic-Oracle Programming Question Paper PDF Download

by

                LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

AK 14

FIRST SEMESTER – NOV 2006

CS 1808 – VISUAL BASIC – ORACLE PROGRAMMING

 

 

Date & Time : 02-11-2006/1.00-4.00     Dept. No.                                                       Max. : 100 Marks

 

 

PART-A

Answer all Questions                                                               10 x 2 = 20

 

  1.  What is a Variable?
  2.  What is a Control Array?
  3.  List out any four chart types.
  4.  What is flex grid?
  5.  How to register an Activex control?
  6.  List out MAPI message control methods
  7.  What is a table?
  8.  Write any two date functions in SQL?
  9.  Write about on..Delete..Cascade?
  1. List out Data report components.

PART-B

Answer all Questions                                                               5 x 8 = 40

 

  1. (a) Explain data types and their ranges in VB. (or)

(b) Write a short note on Tool bar and Status bar

 

  1. (a) Write a program using VB to demonstrate

chart and grid controls                                            (or)

(b) Explain about Timer and Shape Control

 

  1. (a) How to write a program using VB to create

Tree view and List view control                                (or)

(b) What is DHTML? Discuss the advantages of

DHTML over HTML

 

  1. (a) Explain Oracle Internal Data types (or)

(b) Explain different types of joins in SQL

 

  1. (a) Write about trigger. (or)

(b)  Generate a report for student mark sheet processing.

PART-C

Answer any Two Questions                                                     2 x 20 = 40

 

  1. a) Explain the various control structures in VB with examples
  2. b) Explain different types of arrays in VB with suitable examples.

 

  1. a) Explain about Activex controls and Activex documents
  2. b) Explain different methods of Common dialogs in VB.

 

  1. Write a short note on
    1. Constraints Sequences c. Views d. Function

 

 

Go To Main page

Loyola College M.Sc. Computer Science Nov 2006 Microprocessor & Micro Controller Question Paper PDF Download

by

                        LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

AK 17

THIRD SEMESTER – NOV 2006

CS 3875 – MICROPROCESSOR AND MICRO CONTROLLER

 

 

Date & Time : 06-11-2006/9.00-12.00   Dept. No.                                                       Max. : 100 Marks

 

 

PART A

Answer ALL the Questions                                                                          2 X 10 = 20 

 

  1. List the features of 8086 Processor?
  2. what is the purpose of segment register?
  3. What is the use of zero flag?
  4. When halt state will be enable?
  5. What is base address?
  6. Define batch processing?
  7. What is the use of I/O ?
  8. What is double Buffer?
  9. Define Operation Command Word?
  10. What are the advantages of Micro Controller?

 

PART B

Answer All the Questions                                                                             8 X 5 = 40

 

  1.       a)  Explain 8086 pin configuration with diagram.

Or

  1. Explain multi queuing processor function?

 

  1.       a) Explain internal operation of computers ?

Or

  1. Explain the concept of direct and indirect addressing mode.

 

  1.        a)   Explain the concept of Multi Processing.

Or

  1. Explain shortest job First scheduling process.

 

  1.        a) Explain the advantages Interrupt routine.

Or

  1. b) Write the features of Minimum mode system
  1.        a) Discuss the 8051 data transfer instruction.

Or

  1. b) Write about Execution of 8051 Interrupt.

 

PART C

Answer Any Two Questions                                                                        2 X 20 = 40

 

  1. Explain 8086 bus Architecture with diagram?
  2. Discuss various microprocessor programming Instruction formats.
  3. Explain the operation of DMA and its pros and Cons with diagram.

 

Go To Main page

Loyola College M.Sc. Computer Science Nov 2006 Computers In Chemistry Question Paper PDF Download

by

                        LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – CHEMISTRY

AK 19

THIRD SEMESTER – NOV 2006

CS 3902 – COMPUTERS IN CHEMISTRY

 

 

Date & Time : 03-11-2006/9.00-12.00  Dept. No.                                                  Max. : 100 Marks

 

 

PART-A

ANSWER ALL.                                                                                            10X2=20

1.What is identifier?

2.Differentiate between if and else if statement.

3.What is reserved words?

4.What is the purpose of math.h?

5.Write the syntax of for loop.

6.Write the Heats of reactions using kirchoff’s equations.

7.What is Beer-lambert’s law?

8.What is the purpose to use union?

9.What are the two woodward-hoffmann rules?

10.Define structure?

PART-B

ANSWER ALL.                                                                                            5X8=40

11.a)Brief about contents of c program?

(or)

b)Differentiate between while and do…while control statements.

  1. a) Explain.
  2. i) structure and union with example.

ii)differentiate structure and union.

(or)

b)Write the C program to find the Gibbs free energy.

  1. a)Write a C program to determine the constants a,b,d and Axial Ratio.a’:b’:c’ for crystals?

(or)

b)Write a program in C to determine the roots of a quadratic equation?

  1. a) Write a C program to determination of electronegativity of an atom from bond energy data using Pauling’s Relation?

(or)

b)Explain and write a C program to calculation of wavelength maximum for conjugated dienes and enones.

  1. a)Write a C program to interconvert units of molecular weight of a macromolecular?

(or)

b)Explain Glucose and Titrimetric methods and write corresponding C program?

 

PART-C

ANSWER ANY TWO QUESTIONS.                                            2X20=40

  1. Explain the control structures with examples.
  2. Describes the application of rotation and partition and write the corresponding C program?
  3. a) Explain and write a c program to huckel molecular orbital calculations of delocalisation

energy of butadiene using group theory?

b)Write a c program for find de-brogly wavelength?

 

Go To Main page

Loyola College M.Sc. Computer Science Nov 2006 Computer Peripheral & Interfacing Question Paper PDF Download

by

                        LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

AK 20

THIRD SEMESTER – NOV 2006

CS 3903 – COMPUTER PERIPHERAL AND INTERFACING

 

 

Date & Time : 03-11-2006/9.00-12.00   Dept. No.                                                       Max. : 100 Marks

 

 

                                    PART A                                 (10 x 2 = 20 marks)

Answer all questions.  All questions carry equal marks.

 

 

  1. What is a LCD display?

 

  1. Define serial interface?

 

  1. Define Error control and retry logic?

 

  1. What are the functions of compact disc read/write drive?

 

  1. Define memory access time?

 

  1. What are the types of network?

 

  1. What are the bus standards used?

 

  1. Write notes on I/O bus?

 

  1. What are the nature of faults?

 

  1. What are the faults that occur in a hardware unit?

 

PART B                                 (5 x 8 = 40 marks) 

Answer all questions.  All questions carry equal marks.

 

.

  1. (a).Explain the various input devices?

or

(b).Explain the different categories of printers?

 

  1. (a).Briefly explain about magnetic storage techniques?

or

(b).Briefly explain about floppy disk controller?

 

  1. (a).Explain device controller functions?

or

(b).Explain ROM BIOS?

 

  1. (a). Explain communication interface?

or

(b).What are the various topologies used in networks?

 

  1. (a).What are the steps involved in fault rectification?

or

(b).Explain about the hardware diagnostic tools?

 

 

 

PART C                                 (2 x 20 = 40 marks)

 

Answer any two questions.  All questions carry equal marks.

 

  1. (a).Explain interface standards for peripheral devices?

 

(b).Explain hard disk controller and interface standard?

 

  1. (a). Explain IBM PC hardware and motherboard components?

 

(b).Explain briefly about plug and play systems?

 

  1. (a). Briefly explain about power on self test?

 

(b). Explain the network architecture of OSI reference model?

 

Go To Main page

Loyola College M.Sc. Computer Science Nov 2006 Computer Network Question Paper PDF Download

by

             LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034  M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

AK 15

THIRD SEMESTER – NOV 2006

         CS 3808 – COMPUTER NETWORKS

 

 

Date & Time : 25-10-2006/9.00-12.00         Dept. No.                                                       Max. : 100 Marks

 

 

Part – A
Answer all the questions: (10 x 2 = 20)

 

  1. What is meant by X.25?
  2. Differentiate between copper wire and fiber optics.
  3. Define Parity bit.
  4. What are collision free protocols?
  5. Differentiate between broadcast and multicast routing.
  6. What is the work of foreign agent in mobile host routing.
  7. Define cryptography.
  8. List the design issues of presentation layer.
  9. What is meant by three-way handshake?
  10. Define File management.

 

Part – B
Answer all the questions: (5 x 8 = 40)

 

  1. a) Explain the following with suitable diagrams:
  1. ATM virtual circuits.
  2. Broadcast links.

(Or)

  1. b) Discuss any two types of Guided media with suitable diagrams.
  1. a) Explain the different types of framing with examples.

(Or)

  1. b) Explain Ethernet with suitable examples.
  1. a) Explain Bluetooth protocol stack with a neat diagram.

(Or)

  1. b) Explain Internetworking with suitable diagrams.
  1. a) Explain Window management in TCP with suitable diagrams.

(Or)

  1. b) Explain substitution ciphers and transposition ciphers with examples.

 

  1. a) Explain Frequency dependent coding.

(Or)

  1. b) Explain File servers with suitable examples.

 

Part – C
Answer any two: (2 x 20 = 40)

 

  1. a) Explain OSI Reference model with a neat diagram.
  1. b) Differentiate between circuit and packet switching.
  1. a) Explain link state routing with suitable example.
  1. b) Explain Congestion control in Data gram subnets.
  1. Explain Connection establishment and connection release in transport layer.

 

 

Go To Main page

Loyola College M.Sc. Computer Science Nov 2006 Asp.Net Question Paper PDF Download

by

             LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034  M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

AK 16

THIRD SEMESTER – NOV 2006

         CS 3809 – ASP .NET

 

 

Date & Time : 27-10-2006/9.00-12.00         Dept. No.                                                       Max. : 100 Marks

 

 

 

 

PART A

Answer all Questions                                                       10 * 2 = 20

 

  1. Mention the distinct advantage of Unsigned Integers.
  2. “C# will become the programmers’ choice in .NET”- Comment.
  3. “Inline Code and Inline Expression can not be used independently” – Defend or Oppose the statement with justifications.
  4. “The availability of HTML Controls in ASP.NET is not appreciated” – Give your comment.
  5. Provide a short description about ADO.NET.
  6. Write the various types of commands in used in ADO.NET.
  7. What is called as Data Caching?
  8. Define the term Session Management.
  9. What is the predominant distinction between HTML and XML?
  10. What is XPath in XML?

PART B

Answer all Questions                                                       5 *8 = 40

 

11 (a)         Brief the Characteristics of C#.

(OR)

(b)         What is a Conditional Statement? What role does it play in programming?       Explain the various conditional statements in C#.

12 (a)          Explain in detail about the Server-side Controls in ASP.NET.

(OR)

(b)          What is the role played by Validation Controls in ASP.NET. Demonstrate                          their usage along with their important properties.

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

(OR)

  • Explain the Design Goals and Key Components of ADO.NET.

14  (a)          Discuss Web User Controls in ASP.NET.

(OR)

  • Explain the working of Datagrids with ADO.NET in ASP.NET

15   (a)          Explain in short about the merits of XML

(OR)

  • Explain deployment of Dataset in XML

 

 

 

 

 

 

 

 

 

 

PART C

 

Answer any two Questions                                                           2 * 20 = 40

 

 

 

  1. (a). What is called as Entry-Controlled and Exit-Controlled loops? Explain the various looping statements in C#.

(b)              Explain the Predefined Data types in C#.

 

  1. (a). Distinguish Connected ADO.NET and Disconnected ADO.NET Architecture with suitable diagram.

(b)             Explain the major Page Events with their properties.

 

  1. (a) Discuss the various concepts that govern XML.

(b)            Can we use XML for DOM? Explain.

 

 

Go To Main page

Loyola College M.Sc. Computer Science April 2007 Visual Basic-Oracle Programming Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

HC 23

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

FIRST SEMESTER – APRIL 2007

CS 1808 – VISUAL BASIC – ORACLE PROGRAMMING

 

 

 

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

 

 

Part-A

Answer all Questions                                                                          10 x 2 = 20

 

  1. What is an array?
  2. What is Drag-Drop operation?
  3. Explain OCX and DLL
  4. List out the styles in a toolbar.
  5. What is an Activex component?
  6. How to add a HTML controls to DHTML pages
  7. What is an index?
  8. What is a recursion?
  9. What is a data environment?
  1. Write any two numeric functions in SQL.

 

Part-B

Answer all Questions                                                                          5 x 8 = 40

 

  1. (a) Explain any four project types (or)

(b) Explain any four components in a tool box.

 

  1. (a) Discuss Progress bar (or)
  • Write a program to add a sub nodes using tree views

 

  1. (a) Write a program using VB to create an Activex control (or)

(b) How to send an Email from VB.

 

  1. (a) Write a short note about DML commands                                   (or)

(b) Write a short note about DDL commands

 

  1. (a) Explain the various cursor types                                                   (or)

(b) Generate a report for payroll processing

 

Part-C

Answer any Two Questions                                                                2X20=40

 

  1. Write a short note on
  2. a) Sub procedures
  3. b) Functions
  4. c) Data types
  5. d) Arrays in VB.

 

  1. a) Explain web browser
  2. b) Explain ADO, DAO and RDO.

 

  1. a) How to access a oracle table from VB
  2. b) Explain data reports.

 

Go To Main page

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 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 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

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.Sc. Computer Science April 2008 System Software & Operating System Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

BH 22

 

SECOND SEMESTER – APRIL 2008

CS 2809 – SYSTEM SOFTWARE AND OPERATING SYSTEM

 

 

 

Date : 22-04-08                  Dept. No.                                        Max. : 100 Marks

Time : 1:00 – 4:00

                                                          PART – A (10 X 2 =20)

ANSWER ALL THE QUESTIONS

  1. What is the function of assembler?
  2. Write down the syntax of declaration statements used in assembly level language?
  3. What are the important tasks of memory allocation?
  4. Define the term LINKING
  5. What do you mean by Process Control Block?
  6. What are three requirements of any solution to the critical sections problem?
  7. What is Dispatcher?
  8. What is CPU Scheduler?
  9. What is Context Switch?
  10. What is a Safe State and what is its use in deadlock avoidance?

PART – B (5 X 8 =40)

ANSWER ALL THE QUESTIONS

  1. a) What are the data structures used in the design of Pass l of the Assembler?

(OR)

  1. b) Explain any two features of MACRO preprocessor.

 

  1. a) What are the steps involved in dynamic debugging of a program?

(OR)

  1. b) Write an algorithm for the design of an LINKER?

 

  1. a) What is fragmentation? What are the different types of fragmentation? Give the solution for the

(OR)

  1. b) What are the four conditions required for deadlock to occur? Explain it?

 

  1. a) How can you implement a lock using semaphores?

(OR)

  1. b) How will you detect the deadlock occurrence if the system has single instance of resource type?

 

  1. a) Explain about the tree structured directory structure?

(OR)

  1. b) What file allocation strategy is most appropriate for sequential access files?

 

PART – C (2 X 20 =40)

ANSWER ANY TWO QUESTIONS

  1. a) Draw the Pass 2 flowchart for the design of an assembler?
  2. b) Explain briefly about the major issues in code generations for expressions.
    a) What must the banker’s algorithm know a priori in order to prevent deadlock?
  3. b) Write down the algorithm. Explain it with suitable example.
  4. a) Explain briefly about the demand paging technique.
  5. b) Describe round robin scheduling algorithm with suitable example?

Go To Main page

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

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

BH 23

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

SECOND SEMESTER – APRIL 2008

    CS 2953 – SOFTWARE RESTING AND QUALITY ASSURANCE

 

 

 

Date : 24/04/2008            Dept. No.                                        Max. : 100 Marks

Time : 1:00 – 4:00

PART – A

Answer ALL the questions                                               10 x 2 = 20

  • What is a baseline test.
  • Define test case.
  • How to apply test category “Abort”
  • What are the different options to evaluate the outline?
  • Define document shortcut.
  • How to reduce the decision table?
  • What is encapsulation?
  • What are the steps involved in usability testing?
  • Define the term “Quality Assurance”.
  • What are the areas identified by a SQA plan for a project?

 

PART – B

Answer ALL the questions                                              5 x 8 = 40

  • a) Explain how to extract the requirements from the problem statement?

OR

  1. b) How to evaluate the outline?

12) a) Compare the different table formats.

OR

  1. b) Discuss in brief about test documentation shortcuts.

13) a) How to create a test case from table with multiple inputs?

OR

  1. b) Write a note about the following:
  2. i) Inheritance ii) Polymorphism iii) Abstraction iv) Overloading

14) a) How to configure a web environment?

OR

  1. b) What are the functionality and usability issues while testing a web application?

15) a) Write a brief about Software Quality Assurance.

OR

  1. b) Discuss in brief about software reviews.

 

PART – C

Answer any TWO questions                                              2 x 20 = 40

16)a) Discuss in detail about the outline approach. (10 marks)

  1. b) Apply different table formats to the application “Mark Calculator”. (10 marks)

17)a) Discuss in detail about managing the test. (10 marks)

  1. b) Elaborate the significance of FTR in software Quality Assurance. (10 marks)

18) Create a personal web site and perform testing on that web site. (20 marks)

 

 

Go To Main page

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

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

BH 24

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

THIRD SEMESTER – APRIL 2008

    CS 3808 – COMPUTER NETWORKS

 

 

 

Date : 26/04/2008            Dept. No.                                        Max. : 100 Marks

Time : 9:00 – 12:00

Part-A

Answer all the questions                                                                         10 X 2 = 20

 

  1. List out the uses of Computer Networks.
  2. Write any two advantages of coaxial cable.
  3. Define: Hamming distance. Give an example.
  4. What is piggybacking?
  5. List some of the internet control protocols used in the network layer.
  6. Differentiate between unicast and multicast routing.
  7. Why DNS is essential in the application layer?
  8. Define Cryptography.
  9. What is kerckhoff’s principle?
  10. List the data compression techniques.

                                                                PART-B  

ANSWER ALL THE QUESTIONS:                                                                          5 X 8 = 40

 

  1. a) Write a short note on any two OSI Reference model.

(Or)

  1. b) Differentiate between frequency division multiplexing and time division multiplexing.

 

  1. a) Compare Static and Dynamic Channel Allocation in LANs and MANs

(Or)

  1. b) Give a short note on fast Ethernet.

 

  1.  a) Explain about Bluetooth Application

(Or)

  1. b) What is tunneling? Give a real time example.

 

  1. a) What are the possible scenario for a transport connection?

(Or)

  1. b) List down the states used in TCP connection management finite state machine.

 

  1. a)Give a brief note on the design issues of presentation layer.

(Or)

  1. b) Explain about file transfer.

 

PART –C

ANSWER ANY TWO QUESTIONS:                                                                      2 X 20 = 40

 

  1. a) Differentiate between TCP/IP and OSI reference model.
  2. b) Discuss in detail about design issues of data link layer.

 

  1. Explain the principles of Network layer in the Internet.

 

  1. a)What is cryptographic? Write a note on two principles of cryptographic.
  2. b) What is the use of file management? Give a real time example.

 

Go To Main page

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

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

BH 21

SECOND SEMESTER – APRIL 2008

CS 2807 – DATA STRUCTURES THROUGH JAVA

 

 

 

Date : 17/04/2008            Dept. No.                                        Max. : 100 Marks

Time : 1:00 – 4:00

PART-A

Answer all the questions                                                   10×2=20

 

  • What is a Subsequence?
  • Write the non primitive data types in Java.
  • What is a priority queue?
  • Draw a linear linked list.
  • How to traverse a non empty binary tree in a symmetric order?
  • Name any two exchange sorts.
  • What is a cyclic graph?
  • What is a Forest?
  • What is a Garbage collection?
  • What is a Bounded workspace algorithm?

 

PART-B

 Answer all the questions                                                   5×8=40

 

11) a) Explain briefly the ADT for Varying – Length Character Strings.

(OR)

  1. b) Discuss the following

i)Array as an ADT   ii)Value and Reference Semantics.

12) a)   Discuss the following

(i) Queue as a Circular List (ii) Stack as a Circular List.

(OR)

  1. b) Explain about the Array Implementation of

13) a) Explain briefly the Binary tree traversals.

(OR)

  1. b) Discuss any 2 Insertion Sorts with example

14) a) Explain the Minimum Spanning Trees

(OR)

  1. b) Explain the depth first traversal.

15) a) Discuss the Buddy System

(OR)

  1. b) Discuss the compaction of blocks of storage

 

PART-C

Answer any two questions                                                2×20=40

 

16)  Discuss in detail the following

(i) Doubly Linked List (ii) Addition of Long integers using Doubly Linked List

 

17) a) Discuss in detail the following

(i) Quick Sort (ii) Merge Sort

  1. b) Explain in detail about the Linked List using Dynamic Variables..

 

18) a) Explain in detail the undirected graphs and their traversals.

  1. b) Discuss in detail the following
  2. i) Worst Fit ii) Best Fit  iii) First Fit

 

 

Go To Main page

Loyola College M.Sc. Computer Science Nov 2009 Network Programming 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