Master of Computer Application (MCA) Semester 4 MC0076 Management and Information Systems 4 Credits

Size: px
Start display at page:

Download "Master of Computer Application (MCA) Semester 4 MC0076 Management and Information Systems 4 Credits"

Transcription

1 MC0076 Management and Information Systems 4 Credits (Book ID: B0901) Each question carries TEN marks 1. What do you understand by Information processes data? 2. How do you retrieve information from manual system?. 3. What are the challenges of information management? 4. Explain the different components of MIS. 5. Mention different characteristics of MRS. 6. Discuss the following with respect to DSS: a. Components of DSS b. Classification of DSS

2 MC0076 Management and Information Systems 4 Credits (Book ID: B0901) Assignment Set 2 (60 Marks) Each question carries TEN marks 1. How do you define Management Reporting Systems? 2. Explain with relevant examples the concept of business process. Also mention their elements. 3. What are the uses of Executive Information Systems? 4. Explain various Organizational limits to Relational Decision Making. 5. Explain different components of DSS. 6. Write a note on Ethical and Social issues with E-Commerce.

3 MC0077 Advanced Database Systems 4 Credits (Book ID: B0882) Each Question carries TEN Marks 1. List and explain various Normal Forms. How BCNF differs from the Third Normal Form and 4th Normal forms? 2. Describe the heuristics of Query optimization. 3. Describe the concepts of Structural Semantic Data Model(SSM). 4. Describe the following with respect to Object Oriented Databases: a. Query Processing in Object-Oriented Database Systems b. Query Processing Architecture 5. Describe the theory of Fuzzy Querying to Relational Databases. 6. Describe the Differences between Distributed & Centralized Databases

4 MC0077 Advanced Database Systems 4 Credits (Book ID: B0882) Assignment Set 2 (60 Marks) Each Question carries TEN Marks 1. Discuss, how the process of retrieving a Text Data differs from the process of retrieval of an Image? 2. What are differences in Centralized and Distributed Database Systems? List the relative advantages of data distribution. 3. Describe the following with suitable examples: a. Graphic vs. Declarative Data Models b. Structural Semantic Data Model SSM 4. Explain the following: a. Query Optimization b. Text Retrieval Using SQL3/Text Retrieval 5. Describe the following: o Data Mining Functions o Data Mining Techniques 6. Describe the Data Mining Functions.

5 MC0078 Java Programming 4 Credits (Book ID: B0831 & B0832) Each Question carries TEN marks Book ID: B What are the difference between an interface and an abstract class? 2. Explain the following with respect to Inheritance in Java: a. Various Access Specifiers and their usage b. Abstract classes and their applications 3. Describe Exception Handling in JAVA Book ID: B What do you mean by Object Adapter? Explain with an example? 5. Describe the following with respect to implementation of Sockets in Java: a. Reading from and Writing to a Socket b. Writing the Server Side of a Socket 6. Define RMI. Define the architecture of RMI invocation.

6 MC0078 Java Programming 4 Credits (Book ID: B0831 & B0832) Assignment Set 2 (60 Marks) Each Question carries TEN marks Book ID: B Write a program to demonstrate the concept of I/O streams in Java. 2. How do you implements inheritance in java? 3. Explain the following with respect to Servlets in Java: a. Web Architecture b. Servlet Life cycle Book ID: B What is the difference between TCP and UDP? 5. Explain the life cycle of a Servlet? 6. Describe the following with respect to CORBA: a. Implementing a CORBA Client b. Object Implementations Also write code snippets to demonstrate the above concepts.

7 MC0079-Computer based Optimization Methods- 4 Credits (Book ID: B0902) Each Question Carries 10 Marks 1. Describe the structure of Mathematical Model in your own words. 2. Explain Erlang family of distributions of service times. 3. Explain the algorithm for solving a linear programming problem by graphical method. 4. Determine optimal solution to the problem given below. Obtain the initial solution by VAM. Write down the differences between PERT and CPM. 5. Write down the algorithm of the graphical method to solve a L.P.P 6. Customers arrive at a small post office at the rate of 30 per hour. Service by the clerk on duty takes an average of 1 minute per customer a) Calculate the mean customer time. (i) Spent waiting in line (ii) Spent receiving or waiting for service. b) Find the mean number of persons (i) in line (ii) Receiving or waiting for service.

8 MC0079-Computer based Optimization Methods- 4 Credits (Book ID: B0902) Each Question Carries 10 Marks 1. Minimize Z = 3x 1 + 8x 2 Subject to x 1 2 x, x 1 x x1 80 by using the Simplex method. x Obtain an initial basic feasible solution to the following Transportation problem using the Vogel s approximation method. 3. In a certain game, player A has three possible choices L, M and N, while player B has two, possible choices P and Q. Payments are to be made according to the choices made. Choices L, P L, Q M, P M, Q N, P N, Q Payment A pays B Rs. 3 B pays A Rs. 2 A pays B Rs. 2 B pays A Rs. 4 B pays A Rs. 2 B pays A Rs. 3 What are the best strategies for players A and B in this game? What is the value of the game for A and B?

9 4. Four jobs are to be done on four different machines. The cost in(rupees) of producing i th on the j th machine is given below Jobs Machines M1 M2 M3 M4 J J J J Assign the jobs to different machines so as to minimize the total cost. 5. The tool company s Quality control department is manned by a single clerk, who takes an average of 5 minutes in checking parts of each of the machines coming for inspection. The machines arrive once in every 8 minutes on the average. One hour of machine is valued at Rs.15 and a clerk s time is valued at Rs.4 per hour. What are the average hourly queuing system costs associated with the Quality control department? 6. Two persons A and B, without showing each other, place a coin each on the table. If the coins happen to be of the same denomination, player A will take both of them. If they happen to be of different denominations, player B will take both of them. Suppose player A has a few one-rupee coins and two-rupee coins, and suppose player B has few one-rupee, two-rupee and five-rupee coins i) Write down the pay-off matrix of A. Does the game have saddle point? If so write down the solution. ii) What happens to the game if both the players play only with one-rupee and two-rupee coins?

10 MC0080 Analysis and Design of Algorithms 4 Credits (Book ID: B0891) Each Question carries TEN Marks 1. Describe the following: o Well known Sorting Algorithms o Divide and Conquer Techniques 2. Explain in your own words the different Asymptotic functions and notations. 3. Describe the following: o Fibonacci Heaps o Binomial Heaps 4. Discuss the process of flow of Strassen s Algorithm and also its limitations. 5. How do you formulize a greedy technique? Discuss the different steps one by one? 6. Briefly explain the Prim s algorithm.

11 MC0080 Analysis and Design of Algorithms 4 Credits (Book ID: B0891) Assignment Set 2 (60 Marks) Each Question carries TEN Marks 1. Briefly explain the concept of Djikstra s Algorithm. 2. Describe the following with suitable examples for each: o Binary Search Trees o Red Black Trees 3. Define and explain a context free grammar. 4. Explain in your own words the concept of Turing machines. 5. Describe Matrix Chain Multiplication Algorithm using Dynamic Programming. 6. Show that the clique problem is a N.P. complete problem.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING Question Bank Subject Name: CS6402- Design & Analysis of Algorithm Year/Sem : II/IV UNIT-I INTRODUCTION

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING Question Bank Subject Name: CS6402- Design & Analysis of Algorithm Year/Sem : II/IV UNIT-I INTRODUCTION Chendu College of Engineering & Technology (Approved by AICTE, New Delhi and Affiliated to Anna University) Zamin Endathur, Madurantakam, Kancheepuram District 603311 +91-44-27540091/92 www.ccet.org.in

More information

IINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

IINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad Hall Ticket No Question Paper Code: AHS012 IINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 MODEL QUESTION PAPER B. TechV Semester End Examinations (Regular), December

More information

END-TERM EXAMINATION

END-TERM EXAMINATION (Please Write your Exam Roll No. immediately) Exam. Roll No... END-TERM EXAMINATION Paper Code : MCA-205 DECEMBER 2006 Subject: Design and analysis of algorithm Time: 3 Hours Maximum Marks: 60 Note: Attempt

More information

COURSE OUTCOMES M.Sc (Computer Science)

COURSE OUTCOMES M.Sc (Computer Science) COURSE OUTCOMES M.Sc (Computer Science) CS-101 Advanced C++ Programming 1. Understand advanced concepts for handling runtime errors using stack unwinding, uncaught exception and automatic cleanup. 2. Study

More information

Adikavi Nannaya University, Rajahmundry MCA III Semester 3.1 Computer Networks (Model Question Paper) Time : 3 Hours Max.

Adikavi Nannaya University, Rajahmundry MCA III Semester 3.1 Computer Networks (Model Question Paper) Time : 3 Hours Max. 3.1 Computer Networks (Model Question Paper) 1. a)with a neat block diagram explain the TCP/IP reference model. List out the limitations of the model. [15] (b) What are the functions of the physical layer?

More information

Virtual University of Pakistan

Virtual University of Pakistan Virtual University of Pakistan Department of Computer Science Course Outline Course Instructor Dr. Sohail Aslam E mail Course Code Course Title Credit Hours 3 Prerequisites Objectives Learning Outcomes

More information

Introduction to Algorithms Third Edition

Introduction to Algorithms Third Edition Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein Introduction to Algorithms Third Edition The MIT Press Cambridge, Massachusetts London, England Preface xiü I Foundations Introduction

More information

DEPARTMENT OF COMPUTER APPLICATIONS CO 2009 REGULATION

DEPARTMENT OF COMPUTER APPLICATIONS CO 2009 REGULATION DEPARTMENT OF COMPUTER APPLICATIONS CO 2009 REGULATION Subject Code MC9211 MC9212 MC9213 MC9214 I YEAR I SEM / Subject Name Course Outcome Computer Organization Problem Solving And Programming DATABASE

More information

(DCS/DIT311) Answer question no.1 compulsory (15 1 = 15) Answer ONE question for each unit (4 15 = 60) 1) Write short notes on :

(DCS/DIT311) Answer question no.1 compulsory (15 1 = 15) Answer ONE question for each unit (4 15 = 60) 1) Write short notes on : (DCS/DIT311) B.Tech. DEGREE EXAMINATION, DEC. - 2013 (Examination at the end of Third Year Third Semester) Computer Science & IT Paper - I : OPERATING SYSTEMS Time : 3 Hours Maximum Marks : 75 Answer question

More information

MSc(IT) Program. MSc(IT) Program Educational Objectives (PEO):

MSc(IT) Program. MSc(IT) Program Educational Objectives (PEO): MSc(IT) Program Master of Science (Information Technology) is an intensive program designed for students who wish to pursue a professional career in Information Technology. The courses have been carefully

More information

SIR C R REDDY COLLEGE OF ENGINEERING

SIR C R REDDY COLLEGE OF ENGINEERING SIR C R REDDY COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY Course Outcomes II YEAR 1 st SEMESTER Subject: Data Structures (CSE 2.1.1) 1. Describe how arrays, records, linked structures,

More information

Contents. 1 Introduction. 2 Searching and Traversal Techniques. Preface... (vii) Acknowledgements... (ix)

Contents. 1 Introduction. 2 Searching and Traversal Techniques. Preface... (vii) Acknowledgements... (ix) Contents Preface... (vii) Acknowledgements... (ix) 1 Introduction 1.1 Algorithm 1 1.2 Life Cycle of Design and Analysis of Algorithm 2 1.3 Pseudo-Code for Expressing Algorithms 5 1.4 Recursive Algorithms

More information

Sankalchand Patel College of Engineering - Visnagar Department of Computer Engineering and Information Technology. Assignment

Sankalchand Patel College of Engineering - Visnagar Department of Computer Engineering and Information Technology. Assignment Class: V - CE Sankalchand Patel College of Engineering - Visnagar Department of Computer Engineering and Information Technology Sub: Design and Analysis of Algorithms Analysis of Algorithm: Assignment

More information

Introduction to Algorithms October 12, 2005 Massachusetts Institute of Technology Professors Erik D. Demaine and Charles E. Leiserson Quiz 1.

Introduction to Algorithms October 12, 2005 Massachusetts Institute of Technology Professors Erik D. Demaine and Charles E. Leiserson Quiz 1. Introduction to Algorithms October 12, 2005 Massachusetts Institute of Technology 6.046J/18.410J Professors Erik D. Demaine and Charles E. Leiserson Quiz 1 Quiz 1 Do not open this quiz booklet until you

More information

CS6704 RESOURCE MANAGEMENT TECHNIQUES TOPIC WISE QUESTION BANK LINEAR PROGRAMMING PROBLEMS 1) What is OR techniques? Where it can be used? 2) What is OR? List out various applications of OR. 3) Explain

More information

INTERNATIONAL INSTITUTE OF MANAGEMENT, ENGINEERING & TECHNOLOGY, JAIPUR (IIMET)

INTERNATIONAL INSTITUTE OF MANAGEMENT, ENGINEERING & TECHNOLOGY, JAIPUR (IIMET) INTERNATIONAL INSTITUTE OF MANAGEMENT, ENGINEERING & TECHNOLOGY, JAIPUR (IIMET) UNIT-1 Q.1 What is the significance of using notations in analysis of algorithm? Explain the various notations in brief?

More information

Anany Levitin 3RD EDITION. Arup Kumar Bhattacharjee. mmmmm Analysis of Algorithms. Soumen Mukherjee. Introduction to TllG DCSISFI &

Anany Levitin 3RD EDITION. Arup Kumar Bhattacharjee. mmmmm Analysis of Algorithms. Soumen Mukherjee. Introduction to TllG DCSISFI & Introduction to TllG DCSISFI & mmmmm Analysis of Algorithms 3RD EDITION Anany Levitin Villa nova University International Edition contributions by Soumen Mukherjee RCC Institute of Information Technology

More information

Programme Outcome COURSE OUTCOMES MCA

Programme Outcome COURSE OUTCOMES MCA Programme Outcome PO1: To provide trained human resource for the IT industry. COURSE OUTCOMES MCA MCA 101 : Object Oriented Programming CO1 The students develops a sound approach to problem solving using

More information

L.J. Institute of Engineering & Technology Semester: VIII (2016)

L.J. Institute of Engineering & Technology Semester: VIII (2016) Subject Name: Design & Analysis of Algorithm Subject Code:1810 Faculties: Mitesh Thakkar Sr. UNIT-1 Basics of Algorithms and Mathematics No 1 What is an algorithm? What do you mean by correct algorithm?

More information

SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY ADITYA SILVER OAK INSTITUTE OF TECHNOLOGY

SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY ADITYA SILVER OAK INSTITUTE OF TECHNOLOGY BE - SEMESTER V MID SEMESTER-I EXAMINATION WINTER 2018 SUBJECT: MICROPROCESS & INTERFACING (2150707) (CE) DATE: 10-08-2018 TIME: 02:00pm to 03:30 pm TOTAL MARKS: 40 Q.1 (a) Write an ALP to add two 16 bit

More information

Curriculum for B.Sc. in Business Information Systems

Curriculum for B.Sc. in Business Information Systems Business Information Systems Department King Abdullah II School for Information Technology (KASIT) University of Jordan 2005/2006/2007/2008/2009/2010/2011/2012 Curriculum for B.Sc. in Business Information

More information

TOTAL CREDIT UNITS L T P/ S SW/F W. Course Title: Analysis & Design of Algorithm. Course Level: UG Course Code: CSE303 Credit Units: 5

TOTAL CREDIT UNITS L T P/ S SW/F W. Course Title: Analysis & Design of Algorithm. Course Level: UG Course Code: CSE303 Credit Units: 5 Course Title: Analysis & Design of Algorithm Course Level: UG Course Code: CSE303 Credit Units: 5 L T P/ S SW/F W TOTAL CREDIT UNITS 3 1 2-5 Course Objectives: The designing of algorithm is an important

More information

CS201 Design and Analysis of Algorithms Max.Marks:75

CS201 Design and Analysis of Algorithms Max.Marks:75 Syllabus for M.Sc. Computer Science Programme Semester II CS 201 Design and Analysis of Algorithms 100 ( 75 + 25 ) CS 202 Data Communication and Computer Network 100 ( 75 + 25 ) CS 203 Optimization Techniques

More information

Syllabus for Ph.D Entrance Test, RGPV. Common for CSE/IT/CA

Syllabus for Ph.D Entrance Test, RGPV. Common for CSE/IT/CA Syllabus for Ph.D Entrance Test, RGPV. Common for CSE/IT/CA Algorithms: Algorithms and complexity; Combinatorics and graph theory; Geometric Algorithms, Parallel and Distributed Algorithms, Randomized

More information

COURSE: ADVANCED JAVA PROGRAMMING CODE: 05BMCAR17261 CREDITS: 04

COURSE: ADVANCED JAVA PROGRAMMING CODE: 05BMCAR17261 CREDITS: 04 COURSE: ADVANCED JAVA PROGRAMMING CODE: 05BMCAR17261 CREDITS: 04 Unit I: Introduction: An overview Introduction: Data Types, Operators, Classes, Inheritance, Packages and Interfaces. Exception Handling,

More information

Data Structures and Algorithm Analysis in C++

Data Structures and Algorithm Analysis in C++ INTERNATIONAL EDITION Data Structures and Algorithm Analysis in C++ FOURTH EDITION Mark A. Weiss Data Structures and Algorithm Analysis in C++, International Edition Table of Contents Cover Title Contents

More information

Total No. of Questions :09] [Total No. of Pages : 02

Total No. of Questions :09] [Total No. of Pages : 02 CS/IT 315 (CR) Total No. of Questions :09] [Total No. of Pages : 02 III/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC- 2016 First Semester CS/IT DESIGN ANALYSIS OF ALGORITHMS Time: Three Hours Answer Question

More information

Analysis of Algorithms

Analysis of Algorithms Second Edition Design and Analysis of Algorithms Prabhakar Gupta Vineet Agarwal Manish Varshney Design and Analysis of ALGORITHMS SECOND EDITION PRABHAKAR GUPTA Professor, Computer Science and Engineering

More information

2. (a) Explain the concept of virtual functions in C++ with suitable examples. (b) Explain the concept of operator overloading in C++.

2. (a) Explain the concept of virtual functions in C++ with suitable examples. (b) Explain the concept of operator overloading in C++. Code No: R059211201 Set No. 1 1. (a) What is a friend function? Explain the advantages and disadvantages of it? (b) What is static member function? Explain it s limitations. [8+8] 2. (a) Explain the concept

More information

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Paper - I : DATA STRUCTURES

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Paper - I : DATA STRUCTURES (DMCS 01) M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2014 (Examination at the end of First Year) Computer Science Paper - I : DATA STRUCTURES Time : 03 Hours Maximum Marks : 75 Section A (3 15 = 45) Answer

More information

CLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION

CLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION CLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION 1. What is performance measurement? 2. What is an algorithm? 3. How the algorithm is good? 4. What are the

More information

R13 SET - 1. ''' '' ''' ' blog: anilkumarprathipati.wordpress.com. Code No: RT32054

R13 SET - 1. ''' '' ''' ' blog: anilkumarprathipati.wordpress.com. Code No: RT32054 R13 SET - 1 III B. Tech II Semester Regular Examinations, April - 2016 1 a) Distinguish between Algorithm and Psuedocode. [3M] b) Describe the Algorithm Analysis of Binary Search. [4M] c) State the Job

More information

Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest. Introduction to Algorithms

Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest. Introduction to Algorithms Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Introduction to Algorithms Preface xiii 1 Introduction 1 1.1 Algorithms 1 1.2 Analyzing algorithms 6 1.3 Designing algorithms 1 1 1.4 Summary 1 6

More information

Course Title : Computer Fundamentals & Programming in C. SLM Code : C-101. All questions carry equal marks. Total Marks : 20

Course Title : Computer Fundamentals & Programming in C. SLM Code : C-101. All questions carry equal marks. Total Marks : 20 Course Title : Computer Fundamentals & Programming in C SLM Code : C-101 Assignment No. : M.Sc. (CA)-1/ C-101 /A-2017-2018 Q.1 What is the computer fundamental? Characteristics of computer. Q.2 What is

More information

5105 BHARATHIDASAN ENGINEERING COLLEGE

5105 BHARATHIDASAN ENGINEERING COLLEGE CS 6402 DESIGN AND ANALYSIS OF ALGORITHMS II CSE/IT /IV SEMESTER UNIT I PART A 1. Design an algorithm to compute the area and circumference of a circle?(dec 2016) 2. Define recurrence relation? (Dec 2016)

More information

Ph.D. Comprehensive Examination Design and Analysis of Algorithms

Ph.D. Comprehensive Examination Design and Analysis of Algorithms Ph.D. Comprehensive Examination Design and Analysis of Algorithms Main Books 1. Cormen, Leiserton, Rivest, Introduction to Algorithms, MIT Press, 2001. Additional Books 1. Kenneth H. Rosen, Discrete mathematics

More information

AP Computer Science 4325

AP Computer Science 4325 4325 Instructional Unit Algorithm Design Techniques -divide-and-conquer The students will be -Decide whether an algorithm -classroom discussion -backtracking able to classify uses divide-and-conquer, -worksheets

More information

1. a) Discuss primitive recursive functions with an example? 15M Or b) Statements and applications of Euler s and Fermat s Theorems?

1. a) Discuss primitive recursive functions with an example? 15M Or b) Statements and applications of Euler s and Fermat s Theorems? MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1. a) Discuss primitive recursive functions with an example? 15M b) Statements and applications of Euler s and Fermat s Theorems? 15M 2. a) Define DFA and NFA

More information

Introduction to Algorithms May 14, 2003 Massachusetts Institute of Technology Professors Erik Demaine and Shafi Goldwasser.

Introduction to Algorithms May 14, 2003 Massachusetts Institute of Technology Professors Erik Demaine and Shafi Goldwasser. Introduction to Algorithms May 14, 2003 Massachusetts Institute of Technology 6.046J/18.410J Professors Erik Demaine and Shafi Goldwasser Practice Final Practice Final Do not open this exam booklet until

More information

Data Structures and Algorithms

Data Structures and Algorithms Berner Fachhochschule - Technik und Informatik Data Structures and Algorithms Topic 1: Algorithm Analysis Philipp Locher FS 2018 Outline Course and Textbook Overview Analysis of Algorithm Pseudo-Code and

More information

1. For the sieve technique we solve the problem, recursively mathematically precisely accurately 2. We do sorting to, keep elements in random positions keep the algorithm run in linear order keep the algorithm

More information

CSCE 321/3201 Analysis and Design of Algorithms. Prof. Amr Goneid. Fall 2016

CSCE 321/3201 Analysis and Design of Algorithms. Prof. Amr Goneid. Fall 2016 CSCE 321/3201 Analysis and Design of Algorithms Prof. Amr Goneid Fall 2016 CSCE 321/3201 Analysis and Design of Algorithms Prof. Amr Goneid Course Resources Instructor: Prof. Amr Goneid E-mail: goneid@aucegypt.edu

More information

8/19/13. Computational problems. Introduction to Algorithm

8/19/13. Computational problems. Introduction to Algorithm I519, Introduction to Introduction to Algorithm Yuzhen Ye (yye@indiana.edu) School of Informatics and Computing, IUB Computational problems A computational problem specifies an input-output relationship

More information

COMPUTER SCIENCE/INFORMATION SYSTEMS DEGREE PLAN

COMPUTER SCIENCE/INFORMATION SYSTEMS DEGREE PLAN COMPUTER SCIENCE/INFORMATION SYSTEMS DEGREE PLAN YEAR 1, SEMESTER 1 YEAR 1, SEMESTER 2 Composition I 3 Composition II 3 Calculus I 5 Calculus II 5 Humanistic (Religion) 3 Physics I 5 Total Wellness 2 Statistics

More information

[5421]-14. M.C.A. (Commerce) (Part - I) (Semester - I) STATISTICAL AND NUMERICAL METHODS (2008 Pattern)

[5421]-14. M.C.A. (Commerce) (Part - I) (Semester - I) STATISTICAL AND NUMERICAL METHODS (2008 Pattern) Total No. of Questions : 5] P2890 SEAT No. : [5421]-14 M.C.A. (Commerce) (Part - I) (Semester - I) STATISTICAL AND NUMERICAL METHODS (2008 Pattern) [Total No. of Pages : 3 Time : 3 Hours] [Max. Marks :

More information

Department of Computer Applications. MCA 312: Design and Analysis of Algorithms. [Part I : Medium Answer Type Questions] UNIT I

Department of Computer Applications. MCA 312: Design and Analysis of Algorithms. [Part I : Medium Answer Type Questions] UNIT I MCA 312: Design and Analysis of Algorithms [Part I : Medium Answer Type Questions] UNIT I 1) What is an Algorithm? What is the need to study Algorithms? 2) Define: a) Time Efficiency b) Space Efficiency

More information

CPSC 211, Sections : Data Structures and Implementations, Honors Final Exam May 4, 2001

CPSC 211, Sections : Data Structures and Implementations, Honors Final Exam May 4, 2001 CPSC 211, Sections 201 203: Data Structures and Implementations, Honors Final Exam May 4, 2001 Name: Section: Instructions: 1. This is a closed book exam. Do not use any notes or books. Do not confer with

More information

1 Format. 2 Topics Covered. 2.1 Minimal Spanning Trees. 2.2 Union Find. 2.3 Greedy. CS 124 Quiz 2 Review 3/25/18

1 Format. 2 Topics Covered. 2.1 Minimal Spanning Trees. 2.2 Union Find. 2.3 Greedy. CS 124 Quiz 2 Review 3/25/18 CS 124 Quiz 2 Review 3/25/18 1 Format You will have 83 minutes to complete the exam. The exam may have true/false questions, multiple choice, example/counterexample problems, run-this-algorithm problems,

More information

CSC2100-Data Structures

CSC2100-Data Structures CSC2100-Data Structures Final Remarks Department of Computer Science and Engineering The Chinese University of Hong Kong, Shatin, New Territories Interesting Topics More Graph Algorithms Finding cycles,

More information

CDG2A/CDZ4A/CDC4A/ MBT4A ELEMENTS OF OPERATIONS RESEARCH. Unit : I - V

CDG2A/CDZ4A/CDC4A/ MBT4A ELEMENTS OF OPERATIONS RESEARCH. Unit : I - V CDG2A/CDZ4A/CDC4A/ MBT4A ELEMENTS OF OPERATIONS RESEARCH Unit : I - V UNIT I Introduction Operations Research Meaning and definition. Origin and History Characteristics and Scope Techniques in Operations

More information

Answer any Five Questions. All questions carry equal marks.

Answer any Five Questions. All questions carry equal marks. PART I, PAPER I (Problem Solving and Programming) 1. What do you understand by function prototype? Differentiate between call by value and call by reference methods of parameters passing to a function

More information

Subject Introduction to Information Technology Paper code MSCIT-101

Subject Introduction to Information Technology Paper code MSCIT-101 Q.1) Write a short note on following: (A) Buffer & register: MSC 1 st Sem Aug-2014 Subject Introduction to Information Technology Paper code MSCIT-101 Answer: To handle the execution of instructions and

More information

Chapter 1 Introduction

Chapter 1 Introduction Preface xv Chapter 1 Introduction 1.1 What's the Book About? 1 1.2 Mathematics Review 2 1.2.1 Exponents 3 1.2.2 Logarithms 3 1.2.3 Series 4 1.2.4 Modular Arithmetic 5 1.2.5 The P Word 6 1.3 A Brief Introduction

More information

CSE 5311 Notes 4a: Priority Queues

CSE 5311 Notes 4a: Priority Queues Chart on p., CLRS (binary, Fibonacci heaps) CSE Notes a: Priority Queues (Last updated 9// : AM) MAKE-HEAP INSERT MINIMUM EXTRACT-MIN UNION (MELD/MERGE) DECREASE-KEY DELETE Applications - sorting (?),

More information

M.Sc. (CA) (2 nd Semester) Question Bank

M.Sc. (CA) (2 nd Semester) Question Bank M.Sc. (CA) (2 nd Semester) 040020206: Computer Oriented Operations Research Mehtods Question Bank Unit : 1 Introduction of Operations Research and Linear Programming Q : 1 Short Answer Questions: 1. Write

More information

M.Sc. (Computer Science) MSc(CS) Session

M.Sc. (Computer Science) MSc(CS) Session M.Sc. (Computer Science) MSc(CS) Session 2014-2015 Semester-I Paper Subject Marks MCS-101 Advanced Data Structures 100 MCS 102 Advanced Computer Architecture 100 MCS -103 Network Design & Performance Analysis

More information

Lecture 3, Review of Algorithms. What is Algorithm?

Lecture 3, Review of Algorithms. What is Algorithm? BINF 336, Introduction to Computational Biology Lecture 3, Review of Algorithms Young-Rae Cho Associate Professor Department of Computer Science Baylor University What is Algorithm? Definition A process

More information

D.K.M.COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE-1.

D.K.M.COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE-1. D.K.M.COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE-1. DESIGN AND ANALYSIS OF ALGORITHM UNIT- I SECTION-A 2 MARKS 1. Define an algorithm? 2. Specify the criteria of algorithm? 3. What is Computational Procedure?

More information

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE. (DMCS01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year COMPUTER SCIENCE Data Structures Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15 = 45)

More information

Ph.D. Written Examination Syllabus

Ph.D. Written Examination Syllabus Ph.D. Written Examination Syllabus August 11, 2016 1 Analysis of Algorithms Syllabus Philosophy: We are testing analytical ability: how well students think on their feet, rather than details of some data

More information

(DMCA201) ASSIGNMENT 1 M.C.A. DEGREE EXAMINATION, MAY 2018 Second Year SOFTWARE ENGINEERING. Maximum Marks 30 Answer all questions

(DMCA201) ASSIGNMENT 1 M.C.A. DEGREE EXAMINATION, MAY 2018 Second Year SOFTWARE ENGINEERING. Maximum Marks 30 Answer all questions ASSIGNMENT 1 M.C.A. DEGREE EXAMINATION, MAY 2018 SOFTWARE ENGINEERING Q1) Explain about software process frame work in detail. (DMCA201) Q2) Explain how both waterfall model and prototyping model can be

More information

DESIGN AND ANALYSIS OF ALGORITHMS

DESIGN AND ANALYSIS OF ALGORITHMS DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK Module 1 OBJECTIVE: Algorithms play the central role in both the science and the practice of computing. There are compelling reasons to study algorithms.

More information

Department of Computer Science & Engineering University of Kalyani. Syllabus for Ph.D. Coursework

Department of Computer Science & Engineering University of Kalyani. Syllabus for Ph.D. Coursework Department of Computer Science & Engineering University of Kalyani Syllabus for Ph.D. Coursework Paper 1: A) Literature Review: (Marks - 25) B) Research Methodology: (Marks - 25) Paper 2: Computer Applications:

More information

SRI VENKATESWARA UNIVERSITY: TIRUPATI DEPARTMENT OF COMPUTER SCIENCE ADMITTED BATCH

SRI VENKATESWARA UNIVERSITY: TIRUPATI DEPARTMENT OF COMPUTER SCIENCE ADMITTED BATCH SRI VENKATESWARA UNIVERSITY: TIRUPATI DEPARTMENT OF COMPUTER SCIENCE 2015-16 ADMITTED BATCH BCA Under CBCS With Effect From Academic Year 2016-17 Course of Study & Scheme of Examination IV SEMESTER Sno

More information

INSTITUTE OF AERONAUTICAL ENGINEERING

INSTITUTE OF AERONAUTICAL ENGINEERING INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad -500 043 INFORMATION TECHNOLOGY TUTORIAL QUESTION BANK Course Name : DESIGN AND ANALYSIS OF ALGORITHMS Course Code : AIT001 Class

More information

MLR Institute of Technology

MLR Institute of Technology Course Name : Engineering Optimization Course Code : 56021 Class : III Year Branch : Aeronautical Engineering Year : 2014-15 Course Faculty : Mr Vamsi Krishna Chowduru, Assistant Professor Course Objective

More information

Computer Algorithms CISC4080 CIS, Fordham Univ. Instructor: X. Zhang Lecture 1

Computer Algorithms CISC4080 CIS, Fordham Univ. Instructor: X. Zhang Lecture 1 Computer Algorithms CISC4080 CIS, Fordham Univ. Instructor: X. Zhang Lecture 1 Acknowledgement The set of slides have use materials from the following resources Slides for textbook by Dr. Y. Chen from

More information

Computer Algorithms CISC4080 CIS, Fordham Univ. Acknowledgement. Outline. Instructor: X. Zhang Lecture 1

Computer Algorithms CISC4080 CIS, Fordham Univ. Acknowledgement. Outline. Instructor: X. Zhang Lecture 1 Computer Algorithms CISC4080 CIS, Fordham Univ. Instructor: X. Zhang Lecture 1 Acknowledgement The set of slides have use materials from the following resources Slides for textbook by Dr. Y. Chen from

More information

Part I Basic Concepts 1

Part I Basic Concepts 1 Introduction xiii Part I Basic Concepts 1 Chapter 1 Integer Arithmetic 3 1.1 Example Program 3 1.2 Computer Program 4 1.3 Documentation 5 1.4 Input 6 1.5 Assignment Statement 7 1.5.1 Basics of assignment

More information

Distributed Computing

Distributed Computing Distributed Computing 1 Why distributed systems: Benefits & Challenges The Sydney Olympic game system: see text page 29-30 Divide-and-conquer Interacting autonomous systems Concurrencies Transactions 2

More information

Course Name Software Engineering -I Course Number 371 CSM-3 Credit Hours 3 Contact Hours 4 Course Coordinator Dr.M.K.Jayanthi

Course Name Software Engineering -I Course Number 371 CSM-3 Credit Hours 3 Contact Hours 4 Course Coordinator Dr.M.K.Jayanthi Course Name Software Engineering -I Course Number 371 CSM-3 Credit Hours 3 Contact Hours 4 Course Coordinator Dr.M.K.Jayanthi Text Books Software Engineering 9th Ed, Sommerville, PEARSON ISBN-10 : 0-13-705346-0

More information

Computer Science 461 Midterm Exam March 14, :00-10:50am

Computer Science 461 Midterm Exam March 14, :00-10:50am NAME: Login name: Computer Science 461 Midterm Exam March 14, 2012 10:00-10:50am This test has seven (7) questions, each worth ten points. Put your name on every page, and write out and sign the Honor

More information

ADMINISTRATIVE MANAGEMENT COLLEGE

ADMINISTRATIVE MANAGEMENT COLLEGE First Semester ADMINISTRATIVE MANAGEMENT COLLEGE BACHELOR OF COMPUTER APPLICATION COURSE OUTCOME (CO) Problem solving techniques Using C CO 1: Understand the basic concepts of programming, software and

More information

Subject: OBJECT ORIENTED PROGRAMMING WITH C++ Paper (U.G): BCA -231 S. No. Course Outcomes

Subject: OBJECT ORIENTED PROGRAMMING WITH C++ Paper (U.G): BCA -231 S. No. Course Outcomes Subject: OBJECT ORIENTED PROGRAMMING WITH C++ Paper (U.G): BCA -231 1 In Object Oriented Programming in C++ the students will study about the extension version of c language and the Features of C++, Classes

More information

Faculty of King Abdullah II School for Information Technology Department of Computer Science Study Plan Master's In Computer Science (Thesis Track)

Faculty of King Abdullah II School for Information Technology Department of Computer Science Study Plan Master's In Computer Science (Thesis Track) Faculty of King Abdullah II School for Information Technology Department of Computer Science Study Plan Master's In Computer Science (Thesis Track) Plan Number Serial # Degree First: General Rules Conditions:.

More information

Design and Analysis of Algorithms

Design and Analysis of Algorithms CSE 101, Winter 018 D/Q Greed SP s DP LP, Flow B&B, Backtrack Metaheuristics P, NP Design and Analysis of Algorithms Lecture 8: Greed Class URL: http://vlsicad.ucsd.edu/courses/cse101-w18/ Optimization

More information

For 100% Result Oriented IGNOU Coaching and Project Training Call CPD: ,

For 100% Result Oriented IGNOU Coaching and Project Training Call CPD: , ASSIGNMENT OF MCS-031(ADA) Question 1: (a) Show, through appropriate examples or otherwise, that the following three characteristics of an algorithm are independent (i) finiteness An algorithm must terminate

More information

Overview of Data Structures, Algorithm Analysis

Overview of Data Structures, Algorithm Analysis SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code : Advanced Data structures and Algorithms (16CS5804) Year & Sem: M.Tech

More information

SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY

SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY BE - SEMESTER V MID SEMESTER-I EXAMINATION WINTER 2018 Enroll. No. SUBJECT: ANALYSIS AND DESIGN OF ALGITHMS (2150703) (CE\IT) DATE: 08/08/2018 TIME: 2:00

More information

TMA946/MAN280 APPLIED OPTIMIZATION. Exam instructions

TMA946/MAN280 APPLIED OPTIMIZATION. Exam instructions Chalmers/GU Mathematics EXAM TMA946/MAN280 APPLIED OPTIMIZATION Date: 03 05 28 Time: House V, morning Aids: Text memory-less calculator Number of questions: 7; passed on one question requires 2 points

More information

TECNIA INSTITUTE OF ADVANCED STUDIES

TECNIA INSTITUTE OF ADVANCED STUDIES Assignment1(UNIT1) Paper Code:MCA201 Paper: Theory of Computation (a) Positive closure. (b) Automata. Lexical analyzer. (d) Transition table. (e) Final state. Chomsky Classification. (ii) Regular Expressions.

More information

Specimen of Lesson Plan

Specimen of Lesson Plan Specimen of Lesson Plan Programming Languages(BCA-201 B) 15 s(from july 2018 to Dec 2018) ** Work Load (/)per week(in hours):- rs:-4 BCA 1 Introduction to PL, Characteristics of a good PL Syntactics and

More information

Faculty of Science FINAL EXAMINATION COMP-250 A Introduction to Computer Science School of Computer Science, McGill University

Faculty of Science FINAL EXAMINATION COMP-250 A Introduction to Computer Science School of Computer Science, McGill University NAME: STUDENT NUMBER:. Faculty of Science FINAL EXAMINATION COMP-250 A Introduction to Computer Science School of Computer Science, McGill University Examimer: Prof. Mathieu Blanchette December 8 th 2005,

More information

Algorithms and Data Structures

Algorithms and Data Structures Algorithm Analysis Page 1 - Algorithm Analysis Dr. Fall 2008 Algorithm Analysis Page 2 Outline Textbook Overview Analysis of Algorithm Pseudo-Code and Primitive Operations Growth Rate and Big-Oh Notation

More information

NP-Hardness. We start by defining types of problem, and then move on to defining the polynomial-time reductions.

NP-Hardness. We start by defining types of problem, and then move on to defining the polynomial-time reductions. CS 787: Advanced Algorithms NP-Hardness Instructor: Dieter van Melkebeek We review the concept of polynomial-time reductions, define various classes of problems including NP-complete, and show that 3-SAT

More information

M P BHOJ (OPEN) UNIVERSITY, BHOPAL ASSIGNMENT QUESTION PAPER

M P BHOJ (OPEN) UNIVERSITY, BHOPAL ASSIGNMENT QUESTION PAPER PAPER : I - Data Communication and Networks ------------------------------------------------------------------------------------------------------ 1. Discuss the advantage & disadvantage of bridge relative

More information

EST Solutions. Ans 1(a): KMP Algorithm for Preprocessing: KMP Algorithm for Searching:

EST Solutions. Ans 1(a): KMP Algorithm for Preprocessing: KMP Algorithm for Searching: EST Solutions Ans 1(a): KMP Algorithm for Preprocessing: KMP Algorithm for Searching: Ans 1(b): A priority queue is a data structure for maintaining a set S of elements, each with an associated value called

More information

Final exam. CS 2110, December 15, 2016, 9:00AM

Final exam. CS 2110, December 15, 2016, 9:00AM Final exam CS 2110, December 15, 2016, 9:00AM Question Short Trie Loop Exp Rec Gen Span Mon BigO Data Total Max 20 7 9 10 9 9 8 10 10 8 100 Score Grader The exam is closed book and closed notes. Do not

More information

Client/Server-Architecture

Client/Server-Architecture Client/Server-Architecture Content Client/Server Beginnings 2-Tier, 3-Tier, and N-Tier Architectures Communication between Tiers The Power of Distributed Objects Managing Distributed Systems The State

More information

UNIVERSITY OF SOUTH ALABAMA COMPUTER SCIENCE

UNIVERSITY OF SOUTH ALABAMA COMPUTER SCIENCE UNIVERSITY OF SOUTH ALABAMA COMPUTER SCIENCE 1 Computer Science CSC 108 Intro to Computer Science 3 cr An introduction to the major areas of computer science, such as computing systems, the binary number

More information

UNIVERSITY OF SOUTH ALABAMA COMPUTER SCIENCE

UNIVERSITY OF SOUTH ALABAMA COMPUTER SCIENCE UNIVERSITY OF SOUTH ALABAMA COMPUTER SCIENCE 1 Computer Science CSC 108 Intro to Computer Science 3 cr An introduction to the major areas of computer science, such as computing systems, the binary number

More information

Algorithmic patterns

Algorithmic patterns Algorithmic patterns Data structures and algorithms in Java Anastas Misev Parts used by kind permission: Bruno Preiss, Data Structures and Algorithms with Object-Oriented Design Patterns in Java David

More information

COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05

COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05 COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05 Unit 1 : LINEAR DATA STRUCTURES Introduction - Abstract Data Types (ADT), Arrays and its representation Structures, Stack, Queue, Circular

More information

Algorithmic Paradigms

Algorithmic Paradigms Algorithmic Paradigms Greedy. Build up a solution incrementally, myopically optimizing some local criterion. Divide-and-conquer. Break up a problem into two or more sub -problems, solve each sub-problem

More information

Contents. CS 124 Final Exam Practice Problem 5/6/17. 1 Format and Logistics 2

Contents. CS 124 Final Exam Practice Problem 5/6/17. 1 Format and Logistics 2 CS 124 Final Exam Practice Problem 5/6/17 Contents 1 Format and Logistics 2 2 Topics Covered 2 2.1 Math Fundamentals.................................... 2 2.2 Graph Search........................................

More information

2) Explain in detail about different AVL rotation applied on unbalanced trees.

2) Explain in detail about different AVL rotation applied on unbalanced trees. (DMCS 01) ASSIGNMENT - 1, MAY-2014. PAPER- I : DATA STRUCTURES 1) Define circular queue. Write an algorithm to describe insertion and deletion operation on a circular queue. Illustrate these operations

More information

College of Computing, Engineering & Construction Computing Course Descriptions

College of Computing, Engineering & Construction Computing Course Descriptions CATALOG 2010-2011 Undergraduate Information College of Computing, Engineering & Construction Computing Course Descriptions CAP4020: Multimedia Systems Prerequisites: Knowledge of object oriented programming

More information

CAD Algorithms. Categorizing Algorithms

CAD Algorithms. Categorizing Algorithms CAD Algorithms Categorizing Algorithms Mohammad Tehranipoor ECE Department 2 September 2008 1 Categorizing Algorithms Greedy Algorithms Prim s Algorithm (Minimum Spanning Tree) A subgraph that is a tree

More information

MTAT Enterprise System Integration. Lecture 2: Middleware & Web Services

MTAT Enterprise System Integration. Lecture 2: Middleware & Web Services MTAT.03.229 Enterprise System Integration Lecture 2: Middleware & Web Services Luciano García-Bañuelos Slides by Prof. M. Dumas Overall view 2 Enterprise Java 2 Entity classes (Data layer) 3 Enterprise

More information

Syllabi of the Comprehensive Examination in Computer Science

Syllabi of the Comprehensive Examination in Computer Science Syllabi of the Comprehensive Examination in Computer Science The material of the comprehensive examination is drawn mostly from the undergraduate curriculum at Kuwait University and is updated to reflect

More information