M.Sc. Computer Science Question paper

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 Object Oriented Software Engineering Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science Nov 2009 Oops Through Java Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science Nov 2009 Oracle Programming Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science Nov 2009 Parallel Processing & Algorithms Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science Nov 2009 Computer Networks Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science Nov 2009 Advanced Computer Architecture Question Paper PDF Download

by

Go To Main page

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

by

Go To Main page

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

by

Go To Main page

Loyola College M.Sc. Computer Science April 2010 Object Oriented Analysis & Design Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science April 2010 Advanced Computer Architecture Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science Nov 2010 Tcp/Ip Protocol Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

THIRD SEMESTER – NOVEMBER 2010

    CS 3813  – TCP/IP PROTOCOL

 

 

 

Date : 01-11-10                 Dept. No.                                        Max. : 100 Marks

Time : 9:00 – 12:00

 

                                                                     SECTION-A

 

ANSWER ALL THE QUESTIONS:                                                                            (10 X 2 = 20)

 

  1. State the significance of RARP.
  2. Find the class of the following address and also convert it into binary notation.

227.12.14.87

  1. Mention the usage of traceroute.
  2. Draw the IP Datagram format.
  3. What is a well known port number?
  4. Define Connection Oriented Service.
  5. Write down the best features of TCP.
  6. What is a SCTP association?
  7. List out the steps involved in control connection in FTP.
  8. Illustrate the Sorcerer’s Apprentice Bug with an example.

 

SECTION-B

 

ANSWER ALL THE QUESTIONS:                                                                                (5 X 8 =40)

 

11. a) Explain about the different forwarding techniques of IP Packets.

                                                (OR)

     b) Mention and explain the salient features of ARP with its packet format.

 

  1. a) Explain about the checksum calculation in IP.

(OR)

  1. b) Discuss in brief the ICMP Query messages.

 

  1. a) Draw the format of a TCP Segment and explain its fields.

(OR)

  1. b) What is Congestion Control and highlight the points related to Congestion control in TCP.

 

  1. a) Draw the State Transition Diagram of SCTP and explain the scenario of simultaneous close.

(OR)

  1. b) Explain the concept of Error control in SCTP with examples.

 

                                                                                    ..2..

 

  1. a) Discuss in brief about the types of TFTP messages.

(OR)

  1. b) Explain briefly the following:

(i) HTML                    (ii) CGI

 

 

SECTION-C

 

ANSWER ANY TWO QUESTIONS:                                                                                        (2 X 20 = 40)

 

  1. (a) Distinguish Subnetting and Supernetting.     (4)

(b) Discuss in brief about the different methods of delivery of IP packets.     (6)

(c) Explain the structure of a router with special focus on Banyan switch.     (10)

 

 

  1. (a) Explain the IGMP Package with a neat diagram.     (10)

(b) Discuss in detail about the TCP connection with a neat diagram.               (10)

 

 

  1. (a) Draw the common layout of a chunk.                  (3)

(b) Explain the SCTP features and services.                                                       (7)

(c) Write the importance and purpose of the following:                           (5) + (5)

(i)  SNMP                         (ii) MIME

 

Go To Main page

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Loyola College M.Sc. Computer Science Nov 2010 Software Engineering Methodology Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

FIRST SEMESTER – NOVEMBER 2010

    CS 1813  – SOFTWARE ENGINEERING METHODOLOGY

 

 

 

Date : 03-11-10                 Dept. No.                                        Max. : 100 Marks

Time : 1:00 – 4:00

PART – A                                           10×2 = 20 marks

Answer all

 

  1. Write any two management myths of software.
  2. Mention the two characteristics of risk.
  3. What are all the areas of effort for requirement analysis?
  4. What is QFD?
  5. List out any four design concepts.
  6. Define the term: Functional independence.
  7. What are all the areas of concern for interface design.
  8. What is version control?
  9. Mention the benefits of software review..
  10. What is debugging?

 

PART – B                                              5×8 = 40 marks

Answer all

 

11.a).Explain about water fall model process model.

(or)

  1. b) Explain about 3 P’s in project management.

 

12.a).Write a short note on software prototyping.

(or)

  1. b) Explain about the different levels of DFD with an example.

 

13.a) List out the design principles of software design.

(or)

b).Write a short note about the following

(i) Abstraction  (ii) Refinement

 

14.a) Write the guidelines for information display  in interface design

(or)

  1. b) Write short note on software configuration item with a neat diagram.

 

  1. a) Explain about McCall’s quality factor with a neat diagram.

(or)

b).Write a short note on debugging process..

 

 

 

 

 

PART- C                                                        2x 20 =40 marks

Answer any Two

 

  1. a).Explain in detail about Grady’s Process Metrics.

 

b). Explain in detail about analysis model with neat diagram.

 

17.a) Explain in detail about any five design concepts.

 

b).Explain in detail about baseline with neat diagram.

 

  1. a). Explain in detail about Graph matrices of testing.

 

  1. b) “ Quality is the most important term for the growth of  software industry ”- justify.

 

Go To Main page

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

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

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SC.

SECOND SEMESTER – APRIL 2011

CS 2953 – SOFTWARE TESTING AND QUALITY ASSURANCE

 

 

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

Time : 9:00 – 12:00

PART – A

Answer ALL the questions                                                                                                            10 x 2 = 20

 

  • What are the objectives of Software Testing?
  • What are the different options to evaluate the outline?
  • Define Use Case.
  • What are the different table formats?
  • How to reduce the decision table?
  • What is Polymorphism?
  • What is Database Testing?
  • What is Security testing?
  • Define the term “Software Reliability”.
  • What is SQA plan ?

PART – B

Answer ALL the questions                                                                                                                         5 x 8 = 40

 

  • a) Explain briefly about Schedule estimation.

OR

  1. b) Explain briefly about incremental testing approach.

12) a) Explain in brief about the documentation approaches.

OR

  1. b) Give a brief note on detailed test descriptions while documenting test cases.

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

OR

  1. b) What is state machine? Explain the State transition with a neat diagram.

14) a)Discuss in brief about End to End Transaction testing.

OR

  1. b) Explain in brief the functional and usability issues while testing a web application.

15) a) Write briefly about the ISO 9000 Quality Standards.

OR

  1. b) Explain briefly about six sigma for software engineering.

PART – C

Answer any TWO questions                                                                                                                     2 x 20 = 40

 

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

  1. b) Explain in detail about the test documentation shortcuts .(10 marks)

17)a) Discuss in detail about configuration and compatibility testing. (10 marks)

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

18) a) Discuss in detail about the formal technical reviews. (10 marks)

  1. b) Explain in detail about the Quality Movement and Software Quality. (10 marks)

 

 

Go To Main page

 

Loyola College M.Sc. Computer Science April 2011 Tcp/Ip Protocol Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SC.

THIRD SEMESTER – APRIL 2011

CS 3813 – TCP/IP PROTOCOL

 

 

Date : 12-04-2011             Dept. No.                                        Max. : 100 Marks

Time : 9:00 – 12:00

                                       SECTION-A

 

ANSWER ALL THE QUESTIONS:                                                                   (10 X 2 = 20)

 

  1. Differentiate ARP and RARP.
  2. Find the class of the following address and also convert it into binary notation.

193.14.56.22

  1. What is fragmentation?
  2. Mention the ICMP error reporting messages.
  3. List out the UDP operations.
  4. Define Process to Process communication.
  5. Compare SI and SSN.
  6. What is a SCTP association?
  7. What is a dynamic document?
  8. What is the role of MIB?

 

SECTION-B

 

ANSWER ALL THE QUESTIONS:                                                                        (5 X 8 =40)

 

           11. a) Explain about the different levels of addressing.

                                                (OR)

  1. b) Explain the salient features of ARP with its packet format.

 

  1. a) Explain about the ICMP query messages.

(OR)

  1. b) Discuss in brief the debugging tools used in Internet.

 

  1. a) Discuss about the TCP services.

(OR)

  1. b) Discuss about three way handshaking in TCP.

 

  1. a) Draw the common layout of a chunk and explain any 3 chunks.

(OR)

  1. b) Explain the concept of Flow control in SCTP with examples.

 

  1. a) Discuss in brief about the types of FTP connections.

(OR)

  1. b) Explain briefly the following:

(i) TFTP                       (ii) SMTP.

 

 

 

SECTION-C

 

ANSWER ANY TWO QUESTIONS:                                                           (2 X 20 = 40)

 

 

  1. (a) Explain in brief about TCP/IP protocol suite with a neat diagram.    (10)

(b) Explain the structure of a router and the common fields in a routing

table.                                                                                                          (10)

 

 

  1. (a) Explain the IGMP Operations in detail.     (10)

(b) Discuss in detail about the Congestion Control in TCP.                              (10)

 

 

  1. (a) Compare the features of UDP, TCP and SCTP.     (10)

(b) Explain the following:                                                                           (5) + (5)

(i) MIME                     (ii)   SNMP

 

 

Go To Main page

 

 

Loyola College M.Sc. Computer Science Nov 2010 Data Warehousing Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

THIRD SEMESTER – NOVEMBER 2010

    CS 3812  – DATA WAREHOUSING

 

 

 

Date : 29-10-10                 Dept. No.                                        Max. : 100 Marks

Time : 9:00 – 12:00

Part A

Answer ALL questions                                                                                                10 x 2 = 20

 

  1. List any two differences between the operational system and data warehouse.
  2. Define the term facts in information package diagram.
  3. What are the three major areas in the data warehouse?
  4. Why Meta data is said to be a nerve centre of the data warehouse?
  5. Define the term star index.
  6. What is aggregate fact table?
  7. Highlight any four services to be made available in the managed query environment.
  8. What is data mining?
  9. Define data clustering.
  10. Why back up the data warehouse?

 

PART B

Answer ALL questions                                                                                             5 x 8 = 40

 

  1. (a) Explain in detail the data staging component.

(OR)

(b) How do business requirements affect the choice of DBMS? Describe any three of the ways in which the selection of DBMS is affected.

 

  1. (a) What are the four common methods for data movement within the data warehouse? Explain any two of these methods.

(OR)

(b) Briefly explain business Meta data.

 

 

 

  1. (a) What are the three types of slowly changing dimensions? Compare and contrast Type 2 and Type 3.

(OR)

(b) Discuss any two forms of families of stars.

 

  1. (a) How is the user classes named in a data warehouse? Explain any two in detail.

(OR)

(b) In detail, write about any three data mining techniques.

 

  1. (a) Write short notes on Bit map index and B tree index.

(OR)

(b) List five common provisions to be found in a good security policy.

 

 

PART C

Answer any TWO questions                                                                                    2 x 20 = 40

 

  1. (a) List the significant trends in data warehouse. Explain any four in detail.

(b)Discuss the technical architecture with neat diagram?

 

  1. (a) A dimension table is wide; the fact table is deep. Explain with example.

(b) List the data capture techniques with its advantages and disadvantages.

 

  1. (a) Write an essay about OLAP models.

(b)  List the types of pilot projects and explain any four in detail,

 

Go To Main page

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Loyola College M.Sc. Computer Science Nov 2010 Design & Analysis Of Algorithm Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

FIRST SEMESTER – NOVEMBER 2010

    CS 1810  – DESIGN & ANALYSIS OF ALGORITHM

 

 

 

Date : 30-10-10                 Dept. No.                                        Max. : 100 Marks

Time : 1:00 – 4:00

Section – A 

      Answer all Questions                                                                                      (10 X 2 = 20 Marks)

 

 

  1. What do you mean by Worst case efficiency?
  2. Write about Time efficiency?
  3. Define Adjacency Matrix Give example?
  4. What is Binary Search Tree Give example?
  5. Write the formula of finding optimal solution for the binomial equation?
  6. Differentiate between Greedy and Dynamic programming method?
  7. Define state space tree Give example?
  8. Define Hamiltonian circuit give example?
  9. Define Recursion?
  10. What do you mean by graph coloring?

 

 

 

Section – B 

      Answer all Questions                                                                                                (5 X 8 = 40 Marks)

 

11  a) Explain Mathematical analysis for recursive algorithms?

Or

  1. b) Write about different problem types which are used in

algorithm design   and analysis?

 

12  a)          Discuss Quicksort with example?

Or

  1. b) Explain with example how matrix multiplication is performed

using  Strassen’s ?

 

  • a) Explain about Warshall’s algorithm?

Or

  1. b) Explain with example the Knapsack problem?

 

 

 

 

  • a) Write an algorithm to solve N-Queen problem?

Or

  1. b) Write an algorithm for Hamiltonian circuit problem?

 

  • a) Write an algorithm for NP Hard problem?

Or

  1. b) Write about the approximation algorithm for Travelling

Salesman Problem?

 

Section – C 

      Answer any TWO Questions                                                                            (2 X 20 = 40 Marks)

 

 

  • a) Explain the two different algorithms for finding out GCD?
  1. b) Explain with example the Prim’s algorithm?

 

  • a) Write about the Dijikstra algorithm and give exanple?
  1. b) Solve the knapsack using Branch and Bound Technique?

 

  • a) Solve the following set s={1,2,5,6,8} d=9 using subset sum problem algorithm?
  1. b) Explain the Approximation algorithm for NP – Hard problem?

 

 

Go To Main page

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Loyola College M.Sc. Computer Science Nov 2010 Linux Programming & Driver Development Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

THIRD SEMESTER – NOVEMBER 2010

    CS 3814  – LINUX PROGRAMMING AND DRIVER DEVELOPMENT

 

 

 

Date : 03-11-10                 Dept. No.                                        Max. : 100 Marks

Time : 9:00 – 12:00

PART – A

                                                                                                        

       ANSWER ALL THE QUESTIONS:                                                                                    10 X 2 = 20

 

  1. Define:  $HOME.
  2. What is the use of shift command?
  3. Define the term fread.
  4. What is inode number?
  5.  Define IPC_RMID.
  6. What is critical section of code?
  7. Define SOCK_STREAM.
  8. What is  curses?
  9. Define Minor number.
  10. What is character device?

 

PART – B

 

       ANSWER ALLTHE QUESTIONS :                                                                                       5 X 8 = 40

 

11.   a) Write a brief note on arithmetic and parameter expansion.

(OR)

  1. b) Write a shell program to trap interrupt signal.

 

  1.  a) Explain the Read and Write system call.

(OR)

  1. b) Write a note on mmap.

 

  1.  a) Describe about Message queues.

(OR)

  1. b) Explain about Semaphore.

 

  1.  a) What is color pair? Explain.

(OR)

  1. b) Briefly discuss about Socket types.

 

 

 

 

  1.  a) What is Device driver? Explain its roles.

(OR)

  1. b) Write a note on modules.

 

 

PART – C

 

 

       ANSWER ANY TWO:                                                                                               2 X 20 = 40

 

  1. a) Discuss the Lists in detail.
  1. b) Explain about device files in detail.

 

  1. a) Discuss the named FIFO with a suitable example.
  1. b) Write a note on the following, (i) bind.(ii) listen. (iii) accept.

 

  1. a) Discuss about splitting the kernel.
  1. b) Explain about shell variables and functions.

 

Go To Main page

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Loyola College M.Sc. Computer Science April 2011 System Software & Operating System Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SC.

SECOND SEMESTER – APRIL 2011

CS 2809 – SYSTEM SOFTWARE AND OPERATING SYSTEM

 

 

Date : 02-04-2011             Dept. No.                                        Max. : 100 Marks

Time : 1:00 – 4:00

PART – A

 

Answer all Questions                                                                                                                 10 X 2 = 20

 

  1. What is assembler?
  2. What are macros?
  3. What  is the difference between Compiler and Interpretter
  4. What are linkers?
  5. Define Operating System.
  6. What is Deadlock?
  7. What is race Condition?
  8. What is Virtual Memory?
  9. Write any four input devices
  10. What are the file types in UNIX?

PART – B

Answer all Questions                                                                                                             5 X 8 = 40

 

  1. a) Explain the pass structure of an Assembler.

(or)

  1. b) Explain Macro definition and call

 

  1. a) Explain Code optimization

(or)

  1. b) Explain debug monitors

 

  1. a) Explain the evolution of Operating System.

(or)

  1. b) Explain deadlock prevention and recovery.

 

  1. a) Explain Semaphores in Operating System

(or)

  1. b) Explain Noncontiguous allocation and its advantages.

 

  1. a) Explain the directory Structure

(or)

  1. b) Explain file system reliability.

 

 

 

PART – C

Answer any two Questions                                                               2 X 20 = 40

 

  1. i) Explain Two pass assembler with block diagram
  1. ii) Explain the compilation of control structures

 

  1. i)  Explain Job Scheduling Algorithms
  1. ii) Explain Inter process communication

 

  1. i)  Explain Advanced I/O programming
  1. ii) Explain the file system of Unix

 

 

Go To Main page

 

 

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