M.Sc. Computer Science Question paper

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

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SC.

THIRD SEMESTER – NOVEMBER 2012

CS 3816 – NETWORK PROGRAMMING

 

 

Date : 08/11/2012            Dept. No.                                        Max. : 100 Marks

Time : 9:00 – 12:00

 

Part A

ANSWER ALL QUESTIONS                                                                  10X2=20

 

  1. What is client server model?
  2. List the advantages of BUS topology
  1. What are the responsibilities of data link layer?
  2. Give any two differences between MAC and IP address
  3. List any four error of  internet control message protocol
  4. What is routing?
  5. List the differences between Transmission Control Protocol and User Datagram Protocol
  6. What is drop policy?
  7. What is the purpose of html?
  8. List the firewall techniques.

 

 

Part B

 

ANSWER ALL QUESTIONS                                                                           5X8=40

 

11(a) What is topology? Explain any two types of topologies with examples.

(OR)

11(b) List the categories of UTP and explain.

 

12 (a) Write a program to illustrate the concept of data link layer.

(OR)

!2 (b) Write down the procedure to assign static IP.

 

13(a) What is ARP? Explain in short about the format of ARP packet structure with a

neat diagram

(OR)

13(b) Draw the block diagram of DHCP and List the methods of allocating IP addresses

by DHCP  Severs

 

14(a) Explain the concept of Transmission control protocol using program

(OR)

14(b) Write down the differences between congestion control and congestion avoidance

Mechanism

 

15(a) Explain in brief about simple network management protocol.

(OR)

15(b) Write short note on firewall techniques.

 

 

 

                                                                  Part C

 

ANSWER ANY TWO QUESTIONS                                                          20X2=40

 

16(a) Explain any two types of network cabling with a neat diagram.

(b) Discuss in detail about TCP/IP model.

 

17(a) Write in detail about Routing with examples

(b) Write in detail about the congestion control mechanism with an example.

 

18(a) What is Encryption? Explain in detail about the working of Encryption using

program

(b) Give detailed description of domain name system with an example.

 

Go To Main page

 

 

 

 

 

 

 

Loyola College M.Sc. Computer Science Nov 2012 Mobile Computing Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SC.

SECOND SEMESTER – NOVEMBER 2012

CS 2812 – MOBILE COMPUTING

 

 

Date : 06/11/2012            Dept. No.                                        Max. : 100 Marks

Time : 1:00 – 4:00

 

PART-A

 

Answer ALL questions:                                                                                                          10*2=20

 

  1. Define Burst.
  2. Give the uses of GSM –rail ?
  3. List out three priorities of medium access.
  4. Define Pico-net and Scatter- net.
  5. What is an agent solicitation?
  6. Name the messages required to optimize the mobile IP.
  7. What is slow start in TCP?
  8. Define firewalls.
  9. List out the different type of classes of transaction services

10.Draw the primitives which is used to send a data gram in WDP?

 

 

PART-B

 

Answer ALL questions:                                                                                                    5*8=40

 

 

11 a) Compare the MAC schemes SDMA, TDMA, FDMA and CDMA.

(OR)

  1. b) Explain the scheme Classical Aloha and slotted Aloha.

 

12 a) Describe about the system architecture of DECT

(OR)

  1. b) Explain about MAC management of IEEE 802.11.

 

13 a Describe about cellular IP With its advantages.

(OR)

  1. b) Describe about Hierarchical mobile IP V6.

 

14a)  What is Snooping? Discuss the approach of snooping in TCP.

(OR)

  1. b) Write about the mechanisms of Transportation control protocol.

 

 

15a)  Discuss about WSP/B –establishment, suspension, resume and termination.

(OR)

  1. b) Discuss about Wireless transaction protocols.

 

 

 

 

PART-C

 

Answer any TWO:                                                                                                                        2*20=40

 

16 a). What is GSM ? Explain their services.

 

  1. b) Explain about the networking of Blue tooth.

 

17 a) Explain the access mechanism BFWMAC-DCF using CSMA/CA.

 

  1.  b) Discuss about Indirect TCP.

 

18a) Explain in detail about architecture of wireless application protocol

 

  1. b) Discuss about the security service offered by the WTLS.

 

 

Go To Main page

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

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

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SC.

FIRST SEMESTER – NOVEMBER 2012

CS 1810 – DESIGN & ANALYSIS OF ALGORITHM

 

 

Date : 01/11/2012            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 exact and approximation algorithm?
  2. Write about pseudo code.
  3. Define Adjacency Matrix Give example.
  4. What is Binary Search Tree Give example?
  5. Define Binomial coefficient.
  6. Differentiate between Greedy and Dynamic programming method.
  7. Define subset sum problem.
  8. Define Hamiltonian circuit give example.
  9. What do you mean by tractable and intractable?
  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 Asymptotic notations and analysis.

 

12  a)   Write an algorithm to perform binary search trace out  with suitable

Example.

Or

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

Strassen’s .

 

  • a) Explain about Optimal Binary Search Tree 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 to solve Subset sum 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) Compare Merge sort with Quick sort.

 

  • a) Write about the Kruskal’s algorithm and give example.
  1. b) Explain in detail about memory functions.

 

  • a) Explain in detail the 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 2012 Data Warehousing Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SC.

THIRD SEMESTER – NOVEMBER 2012

CS 3812 – DATA WAREHOUSING

 

 

Date : 01/11/2012            Dept. No.                                        Max. : 100 Marks

Time : 9:00 – 12:00

 

 

Part A

Answer all the questions:                                                                                              10 x 2 = 20 Marks

 

  1. Identify the relationship between Data Warehouse and Data Mart.
  2. Specify the sources of Metadata.
  3. What are the changes expected in dimensional tables?
  4. List the characteristics of high quality data.
  5. Differentiate Dimensional modules from ER modules.
  6. What is surrogate key?
  7. Name any four key capabilities of OLAP.
  8. List any four criteria for evaluating data mining tools.
  9. Notify the advantage of Clustered Index.
  10. What is security policy?

 

Part B

Answer all the questions:                                                                                                5 x 8 = 40 Marks

 

  1. a) Compare Data Warehouse with ERP and Knowledge Management.

(Or )

  1. b) Elaborate the phases of Joint Application Development (JAD).

 

  1. a) Write about the consideration in building technical metadata.

(Or )

  1. b) Discuss & justify the influencing factors in selection of a DBMS.

 

  1. a) Compare the characteristics of dimensional table & fact table.

(Or)

  1. b) Stress the need for aggregates and describe the ways to construct aggregate fact

tables.

 

  1. a) Review OLAP architectural options.

(Or)

  1. b) Briefly describe the cluster detection technique.

 

  1. a) Compare the significance of performance enhancement techniques.

(Or)

  1. b) Discuss the principles of Indexing and explain Bit Mapped Index.

 

 

 

Part C

Answer any two questions:                                                                                           2 x 20 = 40 Marks

 

  1. a) List and explain the components of Data Warehouse. (10 Marks)

 

  1. b) Compare server hardware available for the Data Warehouse. (10 Marks)

 

  1. a) Depict the design of star schema and explain star schema keys. (10 Marks)

 

  1. b) With neat diagram, describe information delivery framework. (10 Marks)

 

  1. a) Describe the types of pilot projects and discuss their merits. (10 Marks)

 

  1. b) Explain how a genetic algorithm helps in increasing profit of the organization.

(10 Marks)

 

 

Go To Main page

 

 

Loyola College M.Sc. Computer Science Nov 2012 Data Mining Question Paper PDF Download

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SC.

FIRST SEMESTER – NOVEMBER 2012

CS 1816 – DATA MINING

 

 

Date : 01/11/2012            Dept. No.                                        Max. : 100 Marks

Time : 1:00 – 4:00

 

Part A

Answer all the questions:                                                                                               10 x 2 = 20 Marks

 

  1. List the steps in Knowledge Discovery in Databases.
  2. Give formulae to determine Chi square.
  3. What are the two approaches in implementing classification?
  4. Give the gini ratio.
  5. Define outliers and give an example.
  6. What is Self Organizing feature Maps (SOM)?
  7. Define the term Association Rule.
  8. Mention any four merits of partitioning.
  9. Give the taxonomy of web mining.
  10. Define Spatial Association rule.

 

Part B

Answer all the questions:                                                                                                5 x 8 = 40 Marks

 

  1. a) Illustrate a method to determine correlation coefficient for the two variables given below: X= <2, 4, 6, 8, 10> and Y = <1, 3, 5, 7, 9>  (Or)

 

  1. b) List and differentiate the use of activation functions.

 

  1. a) Differentiate regression approaches to perform classification (Or)

 

  1. b) Describe the Supervised Neural Network Learning.

 

  1. a) Classify Clustering algorithms and explain (Or)

 

  1. b) Discuss the agglomerative algorithm for Clustering.

 

  1. a) Differentiate task parallelism and Data parallelism approaches and explain (Or)

 

  1. b) Describe the methods to measure the quality of rules.

 

  1. a) Stress the need for Web Personalization and illustrate the techniques used for the same (Or)

 

  1. b) With neat diagrams, compare data structures available for Spatial Mining.

 

 

 

 

Part C

Answer any two questions:                                                                                          2 x 20 = 40 Marks

 

  1. a) Elaborate the implementation issues in data mining.

 

  1. b) The table given below is the sample data to the height classification problem.

Classify a new tuple t = <Adam, M, 1.95> using Naive Bayes Classification

approach.

Name Gender Height Output
Kristina F 1.6 m Short
Jim M 2 m Tall
Maggie F 1.9 m Medium
Martha F 1.88 m Medium
Stephanie F 1.7 m Short
Bob M 1.85 m Medium
Kathy F 1.6 m Short
Dave M 1.7 m Short
Worth M 2.2 m Tall
Steven M 2.1 m Tall
Debbie F 1.8 m Medium
Todd M 1.95 m Medium
Kim F 1.9 m Medium
Amy F 1.8 m Medium
Wynette F 1.75 m Medium

 

  1. a) Describe about CURE algorithm and justify its merits.

 

  1. b) Illustrate Apriori Algorithm for the following sample data t1 = {Bread, jelly, PeanutButter}, t2 = {Bread, PeanutButter}, t3 = {Bread, Milk, PeanutButter}, t4 = {Beer, Bread}, t5 = {Beer, Milk} Support = 30% and Confidence = 50%.

 

  1. a) Draw the Directed Acyclic Graph(DAG) for a corporate website with 5 web pages {A, B, C, D, E} and their visiting sequences with an integer time stamp are given as <(A,1), (B,2), (C,2), (A, 7), (C, 10), (B, 10), (C, 12), (A, 12), (C,13), (D, 14), (C,14) ,(E, 20)>. Find the general episodes where the support threshold is 30% and the time window is 3.

 

b). Write an algorithm to generate rules from a decision tree and provide output

for the sample input data given below.

 

Height

 

 

 

≤ 1.7 m                                  > 1.95 m

 

> 1.70 m

< 1.95 m

 

 

Short                      Medium                           Tall

 

 

Go To Main page

 

 

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

by

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SC.

FIRST SEMESTER – NOVEMBER 2012

CS 1812 – COMPUTER NETWORKS

 

 

Date : 03/11/2012            Dept. No.                                        Max. : 100 Marks

Time : 1:00 – 4:00

Part A

 

ANSWER ALL THE QUESTIONS:                                                                                10 x 2 = 20 Marks

 

  1. Draw Internet Protocol Graph.
  2. Relate bandwidth with latency.
  3. Notify the drawback in Stop-And-Wait Algorithm.
  4. What is meant by Concurrent Logical Channels?
  5. Figure out flooding of link state packets.
  6. Compare Broadcast and Multicast.
  7. Specify any four common properties of a “reliable” delivery.
  8. What is Silly Window Syndrome?
  9. What is MIME? Specify the three pieces of information in a MIME.
  10. Compare and differentiate compression algorithms.

 

 

Part B

 

ANSWER ALL THE QUESTIONS:                                                                                 5 x 8 = 40 Marks

 

11 a). Briefly explain the importance of framing techniques with suitable example.

(Or)

b). Explain CRC calculation using polynomial long division method.

 

 

12 a). With neat diagrams, explain how failure occurs in dual fiber ring.

(Or)

b). Propose any method to avoid collision in WIFI.

 

13 a). With block diagram, explain Router implementation.

(Or)

b). Explain the steps involved in building routing table for the following graph.

 

 

 

 

 

 

 

 

14 a).  Explain briefly how User Datagram Protocol ensures the reliable delivery.

(Or)

b). Compare the strengths & weaknesses of Fast Retransmission and Fast Recovery method

and Slow Start Method.

 

15 a). Give the general structure of XML model and explain how it is suitable for presentation in

a heterogeneous environment.

(Or)

b). Explain how RSA algorithm is suitable for ensuring security.

 

 

 

 

Part C

 

ANSWER ANY TWO QUESTIONS:                                                                            2 x 20 = 40 Marks

 

  1. a). Propose a complete network architecture for an educational institution. (10 Marks)

 

b). Compare wireless technologies based on their physical properties. (10 Marks)

 

17 a). Explain in detail about Dynamic Host Configuration Protocol.  (10 Marks)

 

b). Draw and explain state transition diagram for the connection establishment and

termination. (10 Marks)

 

 

18 a). With neat diagram, explain Domain Name System (5 Marks) and Simple Mail Transfer

Protocol. (5 Marks)

 

b). Using Distance Vector Routing approach, find out Final Routing Table at Node A for the sample network graph given below.                                                        (10 Marks)

 

 

 

 

Go To Main page

 

Loyola College M.Sc. Computer Science April 2013 Web Programming Using Asp.Net & C# Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science Nov 2013 Object Oriented Software Engineering Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science Nov 2013 Cloud Computing Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science April 2014 Data Mining Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science Nov 2014 Object Oriented Software Engineering Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science Nov 2014 Linux Programming Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science Nov 2013 Advanced Java Programming Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science April 2015 Advanced Database Systems Question Paper PDF Download

by

Go To Main page

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

by

Go To Main page

Loyola College M.Sc. Computer Science April 2015 Digital Image Processing Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science Nov 2016 Distributed Computing Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science Nov 2015 Object Oriented Software Engineering Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science Nov 2016 Data Mining-I Question Paper PDF Download

by

Go To Main page

Loyola College M.Sc. Computer Science Nov 2016 Data Mining 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