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

Size: px
Start display at page:

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

Transcription

1 (DMCS 01) M.Sc. (Previous) DEGREE EXAMINATION, MAY (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 any Three questions 1) Explain different operations performed on a single linked list. 2) Write an algorithm to convert infix expression to postfix expression. Trace the algorithm with the expression : (A+B ^ C (D*E) / F. 3) Define binary search tree. Construct binary search tree for the data 27, 24, 33, 16, 29, 42, 20, 45, 35 and perform the operations a) delete node 27. b) delete node 20. 4) Write heap sort algorithm and trace it on the heap tree elements 99, 98, 69, 65, 85, 39, 59, 02, 47, 14, 76. 5) Define a graph. Discuss in detail the graph transversal methods with illustrative example. Section - B (5 5 = 25) Answer any Five questions 6) Discuss about the buddy system storage management system. 7) What is Tower of Hanoi problem? Give its recursive solution for n = 3.

2 8) Describe about various queue structures. 9) Define binary tree. Explain linear and linked representation of a binary tree. 10) Construct the expression tree from the postfix notation of the arithmetic expression ABC * + DE * F + G /-. 11) Briefly explain the AVL rotations. 12) Describe bucket sort with an illustrative example. 13) Explain Prim s algorithm with suitable example. 14) What is the purpose of a header node? Section - C (5 1 = 5) Answer All questions 15) What are different hashing techniques? 16) Form the expression tree of (A+B*C)-((D*E+F)/G). 17) Define weighted binary tree. 18) What is Euler s circuit?

3 (DMCS 02) M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science Paper - II : Object Oriented Programming Time : 03 Hours Maximum Marks : 75 Section A (3 15 = 45) Answer any Three questions 1) Explain different types of control statements in C++. 2) What is abstract data type (ADT)? Explain ADT using stack as an example. 3) Define multiple and multilevel inheritance. Implement these inheritances through programming. 4) What is operator overloading? Write a program to demonstrate () operator overloading. 5) a) Explain stream classes hierarchy. b) How can you throw an exception? Explain. 6) Write a note on variable scope. Section - B (5 5 = 25) Answer any Five questions 7) What is Pointer? How do you declare pointers? 8) Define friend function and writer a program to demonstrate friend function. 9) Write about function template.

4 10) Discuss about virtual destructors. 11) Explain the manipulators setw () and setprecision (). 12) Explain how can you write data to a file in some structured form. 13) Write a program to demonstrate string operations. 14) What is type conversion? Section - C (5 1 = 5) Answer All questions 15) What is in-line function? 16) Define Polymorphism. 17) What is constructor? 18) What is virtual function?

5 (DMCS 03) M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science Paper - III : Computer Organization Time : 03 Hours Maximum Marks : 75 Section A (3 15 = 45) Answer any Three questions 1) a) Explain different types of addressing systems. b) What is multiplexer? Explain any one multiplexer with neat diagram. 2) a) Explain different secondary storage device memory organization. b) Explain about memory hierarchy. 3) Explain the I/O operations logic instructions of 6300 and intel Pentium with suitable diagram and example. 4) Explain the basic organization of a micro-programmed control unit with neat diagram. 5) Explain about sequential 7 combinational circuits with one example. Section - B (5 5 = 25) Answer any Five questions 6) Write the difference between programmed I/O and interrupt initiated I/O. 7) Explain about encoding of machine instructions.

6 8) Explain about multiplication of positive numbers. 9) Explain physical characteristics of magnetic disk memories. 10) Explain about interface circuits. 11) Explain techniques of IO operations. 12) What is the functioning of a flash memory? Explain. 13) Explain the applications of micro-programming. 14) What is I/O interface? Section - C (5 1 = 5) Answer All questions 15) What is Peripheral devce? 16) What is memory bus? 17) What is cache memory? 18) What is main memory?

7 (DMCS 04) M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science Paper - I : Discrete Mathematical Structures Time : 03 Hours Maximum Marks : 75 Section A (3 15 = 45) Answer any Three questions 1) a) State all the rules of logical inference b) Show that the hypothesis It is not Sunny this afternoon and it colder than yesterday. We will go swimming only if it is sunny, If we do not go swimming, then we will take a Canoe trip and if we take a Canoe trip, then we will be home by sunset lead to the conclusion we will be home by sunset. 2) a) Prove that : x (P( x ) Q( x )) x P( x ) x Q( x ). b) Define power set of set and show that the cardinality of the power set of A p(a) is 2 n if cardinality of A is n. 3) a) Find the recurrence relation satisfying Y n = A(3) n + B (-4) n. b) Solve the recurrence relation a n = 6a n 8a n-2 for n 2, a o = 4, a 1 = 10. 4) a) Define deterministic and non-deterministic finite state automata and explain them by examples. b) Construct a tuning machine that recognizes the {0 n 1 n 2 n n 0} 5) a) Show that an undirected graph has an even number of vertices of odd degree b) Explain Eulerian graph and Hamiltonian graph with examples.

8 6) Prove that p ~ q r p q r is a Tautology. Section - B (5 5 = 25) Answer any Five questions 7) Let A be a set define P(A), the power set of A. Find P(A) when A = {1, 2, 3}. 8) Explain the recursive subroutine. 9) Define an equivalence relation and give an example of it. 10) Define finite state machine. 11) Define lattice and give one example of it. 12) How many Edges are there in a graph with 10 vertices each of degree 6? 13) Explain : a) Eulerian path. b) Hamiltonian path. 14) Define Set. Section - C (5 1 = 5) Answer All questions 15) Define Recursive subroutine. 16) Define bipinite graph. 17) Define cut set. 18) What is monoid?

9 (DMCS 05) M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science Paper - V : Software Engineering Time : 03 Hours Maximum Marks : 75 Section A (3 15 = 45) Answer any Three questions 1) Briefly explain about different evolutionary software process models.. 2) Discuss about the communication techniques of analysis. 3) Explain the following: a) Ward and Mellor extensions. b) Data flow model. 4) Describe the golden rules of interface design. 5) Explain the black-box testing technique. Section - B (5 5 = 25) Answer any Five questions 6) Write about the metrics for software quality. 7) Discuss about the formal technical reviews. 8) Describe the analysis principles. 9) Explain the design concepts: Modularity and software architecture.

10 10) What is architecture? Describe its importance. 11) Explain the activities which are involved in the user interface design process. 12) Describe about software testing fundamentals. 13) Explain the unit testing strategy. 14) What is software myth? Section - C (5 1 = 5) Answer All questions 15) What do you mean by quality assurance? 16) What are the ISO 9126 quality factors? 17) What do you mean by quality validation? 18) What is stress testing?

11 (DMCS 06) M.Sc. (Previous) DEGREE EXAMINATION, JUNE (Examination at the end of First Year) Computer Science Paper - VI : Distributed Operating System Time : 03 Hours Maximum Marks : 75 Section A (3 15 = 45) Answer any Three questions 1) Discuss in detail Layered Protocols and client-server model. 2) Explain : a) Election Algorithms. b) Atomic Transactions. 3) Explain about characterization of deadlock conditios of methos to prevent and avoid deadlock. 4) Explain : a) Threads and processor Allocation. b) Fault Tolerance. 5) Explain : a) Distributed file system design. b) Page-based shared memory in distributed system. 6) Explain locking protocol in detail. Section - B (5 5 = 25) Answer any Five questions 7) Give about Hardware Concepts.

12 8) Explain about model of processor failure. 9) Discuss RPC mechanism and design issues. 10) Describe Mutual Exclusion and solution to distributed mutual exclusion. 11) What is atomic transaction? Explain. 12) Explain Implementation of distributed file system. 13) Explain in detail shared Memory. 14) Define protocol and give its types. Section - C (5 1 = 5) Answer All questions 15) Define RPC. 16) What is processor? 17) Define fault tolerance. 18) What is an interrupt?

13 (DMCS 07) M.Sc. (Previous) DEGREE EXAMINATION, JUNE (Examination at the end of First Year) Computer Science Paper - VII : Data Base Management Systems Time : 03 Hours Maximum Marks : 75 Section A (3 15 = 45) Answer any Three questions 1) Explain database users and user interfaces. Also explain about DBA and functions of a DBA. 2) Explain the form of a basic SQL query in detail with example and also explain the concept of nested sub queries.. 3) What is normal form? Explain different normal forms based on functional dependencies. 4) Explain the following : a) B * tree index files. b) Storage access. 5) Explain the Timestamp based protocols. 6) Construct the university E-R diagram. Section - B (5 5 = 25) Answer any Five questions 7) Discuss about the extended relational algebra operations.

14 8) Describe domain constrains and referential integrity. 9) Explain about various RAID levels. 10) Write about multiple key access. 11) Explain the strict two-phase locking protocol. 12) Discuss the test for view seriabilty. 13) Explain the concept of multiple granularity. 14) Differentiate schema and instance? Section - C (5 1 = 5) Answer All questions 15) What do you mean by entity set? 16) What are join types? 17) What is sparse index? 18) What is atomicity?

15 (DMCS 08) M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science Paper - VIII : Theory of Automata and Formal Language Time : 03 Hours Maximum Marks : 75 Section A (3 15 = 45) Answer any Three questions 1) Explain Moore machine and Mealy machine. Let M 1 (Q, ε,, δ, q 0 ) be a Mealy machine then prove that there is a Moore machine M 2 equivalent to M 1 2) State and prove the Myhill Nerode theorem. 3) State and prove the complement of DCFL is a DCFL. 4) Design a turning machine M to recognize the language {1 n 2 n 3 n n 1}. 5) Explain about Syntax analysis method in detail. 6) Write a note on Free languages. Section - B (5 5 = 25) Answer any Five questions 7) Explain Church s hypothesis. 8) Show that the class of regular sets is closed under subtraction. 9) Reduce the following grammar to GNF S AO A OB B AO B 1. 10) What is a counter machine?

16 11) Write a note on Pushdown Automata. 12) Discuss about the universal turning machine. 13) What is code generation? 14) Define DFA. Section - C (5 1 = 5) Answer All questions 15) What is CFL? 16) Define derivation tree. 17) Define LBA. 18) Define finite state machine.

17 (DMCS 09) M.Sc. (Previous) DEGREE EXAMINATION, JUNE (Examination at the end of First Year) Computer Science Paper - IX : Computer Networks Time : 03 Hours Maximum Marks : 75 Section A (3 15 = 45) Answer any Three questions 1) Explain ISO/OSI model in detail with neat diagram. 2) Explain about HTTP, FTP and SMTP protocols in detail. 3) a) Explain transport layer services and principles b) Write about the principles of Reliable data transfer. 4) Discuss about IPV6 datagram in detail. 5) a) Discuss about the datalink layer services. b) Write about the point to point protocol. Section - B (5 5 = 25) Answer any Five questions 6) Write about Access Networks and physical Media. 7) Discuss about principles of application layer protocols. 8) Write a short note on multiplexing and demultiplexing. 9) Discuss about TCP and UDP. 10) Write about Routing principles.

18 11) Discuss about Network service models. 12) Write about error detection and correction techniques. 13) Discuss about Hierarchial Routing. 14) What is a protocol? Section - C (5 1 = 5) Answer All questions 15) Define Electronic Mail. 16) What is ISP? 17) What is Routing in the Internet? 18) What ARP and Ethernet?

19 (DMCS 10) M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) COMPUTER SCIENCE Paper-X : Design & Analysis of Algorithms Time : 03 Hours Maximum Marks : 75 SECTION-A (3 x 15 = 45) Answer any Three questions. 1) Develop an algorithm to construct the first N rows of Pascal s triangle. The first four rows of Pascal s triangle are given by: Analyze the algorithm for time complexity. 2) Show the snapshots of Prim s algorithm for finding the minimum-weight spanning tree for the following graph. 3) What is dynamic programming technique? How does it differ from the divide-andconquer technique? 4) What is minimum spanning tree? Write Prim s algorithm for finding minimum spanning tree. 5) Write an algorithm for performing binary search for an element in any array.

20 SECTION-B (5 x 5 = 25) Answer any Five questions. 6) Write DFS and BFS algorithms. Explain their working with suitable examples. 7) Explain Branch and Bound method with example. 8) Explain Strassen s matrix multiplication. 9) Write an algorithm of 8-queens problem using Back tracking. 10) In how many ways, the following chain of matrices can be multiplied? Enumerate them A(2, 5) B(5, 3) C(3, 6) D(6, 4) E(4, 3) 11) Write an algorithm to implement stack operations with an example. 12) Explain 0/1 knapsack through Dynamic Programming. 13) What are the general characteristics of greedy algorithm. SECTION-C (5 x 1 = 5) Answer all questions. 14) Define DFT & FFT. 15) Explain about biconnected components. 16) Describe graph coloring problem. 17) Define Binary search tree. 18) Define set. Write an example.

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

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Time : 03 Hours Maximum Marks : 75

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

More information

M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I

M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I Paper I DATA STRUCTURES (DMCS 01) 1. Explain in detail about the overview of Data structures. 2. Explain circular linked list and double-linked list. 3. Explain CPU scheduling in Multiprogramming Environment.

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

ASSIGNMENT - 1 M.Sc. DEGREE EXAMINATION, MAY 2019 First Year COMPUTER SCIENCE Data Structures MAXIMUM : 30 MARKS ANSWER ALL QUESTIONS

ASSIGNMENT - 1 M.Sc. DEGREE EXAMINATION, MAY 2019 First Year COMPUTER SCIENCE Data Structures MAXIMUM : 30 MARKS ANSWER ALL QUESTIONS ASSIGNMENT - 1 Data Structures (DMCS01) Q1) a) Write a sub-routine to implement PUSH ( ) and POP ( ) operations using linked list. b) Explain about open hashing and closed hashing. Q2) How to create double

More information

(DMTCS 01) Answer Question No.1 is compulsory (15) Answer One question from each unit (4 15=60) 1) a) State whether the following is True/False:

(DMTCS 01) Answer Question No.1 is compulsory (15) Answer One question from each unit (4 15=60) 1) a) State whether the following is True/False: (DMTCS 01) M.Tech. DEGREE EXAMINATION, DECEMBER - 2015 (Examination at the end of First Year) COMPUTER SCIENCE Paper - I : Data structures Time : 03 Hours Maximum Marks : 75 Answer Question No.1 is compulsory

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

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following. Paper I INFORMATION TECHNOLOGY Answer any THREE of the following. 1. Explain Architecture of computer in detail. 2. Explain in detail about Input and Output technologies. 3. What is MODEM? What factors

More information

1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with a neat diagram?

1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with a neat diagram? (DMCA 101) ASSIGNMENT - 1, DEC - 2014. PAPER- I : INFORMATION TECHNOLOGY 1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with

More information

INFORMATION TECHNOLOGY

INFORMATION TECHNOLOGY [DMSIT 01] M.Sc. (Previous) DEGREE EXAMINATION, DEC 2013 First Year INFORMATION TECHNOLOGY Paper I BASICS OF INFORMATION TECHNOLOGY Time : 3 hours Max. Marks : 75 Section A (3x15 = 45) Answer any THREE

More information

M.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75

M.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75 M.C.A. DEGREE EXAMINATION, MAY - 2013 First Year Paper - I : INFORMATION TECHNOLOGY (DMCA 101) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three of the following 1) What is the

More information

(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75. Paper - I : INFORMATION TECHNOLOGY

(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75. Paper - I : INFORMATION TECHNOLOGY (DMCA 101) M.C.A. DEGREE EXAMINATION, DEC. - 2013 First Year Paper - I : INFORMATION TECHNOLOGY Time : 03 Hours Maximum Marks : 75 Section- A Answer any Three of the following (3 15=45) 1) What is the

More information

1) What is information system? Describe the basic concepts of information systems.

1) What is information system? Describe the basic concepts of information systems. (DMSIT 01) ASSIGNMENT - 1, DEC - 2018. PAPER- I : BASICS OF 1) What is information system? Describe the basic concepts of information systems. 2) Discuss about input and output technologies of computer

More information

1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices.

1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices. (DMCA 101) ASSIGNMENT - 1, MAY-2014. PAPER- I : INFORMATION TECHNOLOGY 1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices. 3) What is software?

More information

M.C.A. FIRST YEAR DEGREE

M.C.A. FIRST YEAR DEGREE (DMCA 101) ASSIGNMENT - 1, DEC - 2018. PAPER- I : INFORMATION TECHNOLOGY 1) What is MIS? Explain role of MIS in an organisation. 2) Explain in detail about input and output technologies. 3) Discuss about

More information

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions) By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable

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

B.Tech in COMPUTER SCIENCE & ENGINEERING

B.Tech in COMPUTER SCIENCE & ENGINEERING B.Tech in COMPUTER SCIENCE & ENGINEERING Paper - 1 S.No. Unit/Topic NPTEL Link 1. DIGITAL SYSTEM DESIGN Binary Systems: Introduction to Number Systems and conversions. Arithmetic with number systems, Signed

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

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

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register General Concepts 1. (a) What are combinational circuits? (b) Perform the following: (i) Convert (0.5625) 10 = ( ) 2 (ii) (010010) 2 (100011) 2 = ( ) 2 2. (a) Using truth table prove that A B= A+ B (b)

More information

Object Oriented Programming

Object Oriented Programming Program Structure for Master of Computer Application (MCA) Mumbai University (With Effect from 2012-2013) Semester I Object Oriented Programming 1 C++ Fundamentals: Data types, Operators, Preprocessor

More information

Table of Contents. Chapter 1: Introduction to Data Structures... 1

Table of Contents. Chapter 1: Introduction to Data Structures... 1 Table of Contents Chapter 1: Introduction to Data Structures... 1 1.1 Data Types in C++... 2 Integer Types... 2 Character Types... 3 Floating-point Types... 3 Variables Names... 4 1.2 Arrays... 4 Extraction

More information

Silver Oak Engineering College and technology Information Technology Department

Silver Oak Engineering College and technology Information Technology Department Silver Oak Engineering College and technology Information Technology Department Mid Semester 2 Syllabus 4th Semester IT Subject Code Subject Name Syllabus 2140709 COMPUTER NETWORKS Unit 3- Transport Layer

More information

Madhya Pradesh Bhoj (Open) University, Bhopal

Madhya Pradesh Bhoj (Open) University, Bhopal Subject- Computer Organisation & System Software Maximum Marks: 20 Q.1 What is Number System? Explain Its Types? Q.2 What is Program Interrupt? Explain it. Q.3 Explain the Floating Point Representation?

More information

(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY

(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY (DMCA101) M.C.A. DEGREE EXAMINATION, MAY - 2017 First Year INFORMATION TECHNOLOGY Time : 3 Hours Maximum Marks : 70 SECTION - A (3 15 = 45) Answer any three of the following Q1) Discuss business pressures

More information

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

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year INFORMATION TECHNOLOGY. (DMSIT01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year INFORMATION TECHNOLOGY Basics of IT Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15

More information

PROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8)

PROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8) B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2009 EC 2202 DATA STRUCTURES AND OBJECT ORIENTED Time: Three hours PROGRAMMING IN C++ Answer ALL questions Maximum: 100 Marks 1. When do we declare a

More information

M.Sc. (Previous) DEGREE EXAMINATION, MAY First Year Information Technology. Time : 03 Hours Maximum Marks : 75

M.Sc. (Previous) DEGREE EXAMINATION, MAY First Year Information Technology. Time : 03 Hours Maximum Marks : 75 M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2013 First Year Information Technology Paper - I : BASICS OF INFORMATION TECHNOLOGY (DMSIT01) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer

More information

(DMCA 101) M.C.A.(Previous) DEGREE EXAMINATION, MAY 2006 PAPER - I - INFORMATION TECHNOLOGY

(DMCA 101) M.C.A.(Previous) DEGREE EXAMINATION, MAY 2006 PAPER - I - INFORMATION TECHNOLOGY 1 (DMCA 101) PAPER - I - INFORMATION TECHNOLOGY 1. What is a computer based information system? Discuss the general technological trends for information technology. 2. (a) Describe the four main types

More information

STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR

STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR 2000-2001. MCA II SEMESTER Scheme of Evaluation Max. Marks Min. Marks to pass L P C Int. Ext.

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

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

(a) R=01[((10)*+111)*+0]*1 (b) ((01+10)*00)*. [8+8] 4. (a) Find the left most and right most derivations for the word abba in the grammar

(a) R=01[((10)*+111)*+0]*1 (b) ((01+10)*00)*. [8+8] 4. (a) Find the left most and right most derivations for the word abba in the grammar Code No: R05310501 Set No. 1 III B.Tech I Semester Regular Examinations, November 2008 FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE

More information

GATE 2018 Online Test Series - Computer science Engineering

GATE 2018 Online Test Series - Computer science Engineering Test Difficulty No of Max Test Type of test Test Live from Test details Test Syllabus No level questions Marks duration 1 Engineering Mathematics-I Linear Algebra,Statistics 2 Engineering Mathematics-II

More information

Note: Select one full question from each unit

Note: Select one full question from each unit P.E.S COLLEGE OF ENGINEERING, MANDYA-571401 (An Autonomous Institution Under VTU Belgaum) Department of Master of Computer Applications Model Question Paper Data Structures Using C (P18MCA21) Credits :

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

JAVA PROGRAMMING. Unit-3 :Creating Gui Using The Abstract Windowing Toolkit:

JAVA PROGRAMMING. Unit-3 :Creating Gui Using The Abstract Windowing Toolkit: JAVA PROGRAMMING UNIT-1: Introduction To Java, Getting Started With Java, Applets And Application, Creating A Java Application, Creating A Java Applets, Object Oriented Programming In Java, Object And

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

M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75

M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75 (DMCA 101) M.C.A. DEGREE EXAMINATION, DEC. - 2012 First Year Paper - I : INFORMATION TECHNOLOGY Time : 03 Hours Maximum Marks : 75 Section - A Answer any Three of the following (3 15 = 45) 1) Define the

More information

Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS

Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS Contents Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS 1.1. INTRODUCTION TO COMPUTERS... 1 1.2. HISTORY OF C & C++... 3 1.3. DESIGN, DEVELOPMENT AND EXECUTION OF A PROGRAM... 3 1.4 TESTING OF PROGRAMS...

More information

R13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC)

R13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC) SET - 1 II B. Tech I Semester Supplementary Examinations, May/June - 2016 PART A 1. a) Write a procedure for the Tower of Hanoi problem? b) What you mean by enqueue and dequeue operations in a queue? c)

More information

MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE

MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE A Modern Approach to Discrete Mathematics SIXTH EDITION Judith L. Gersting University of Hawaii at Hilo W. H. Freeman and Company New York Preface Note to the

More information

R10 SET a) Explain the Architecture of 8085 Microprocessor? b) Explain instruction set Architecture Design?

R10 SET a) Explain the Architecture of 8085 Microprocessor? b) Explain instruction set Architecture Design? Code No: R22054 COMPUTER ORGANIZATION (Com. to CSE, ECC) 1. a) Explain the Architecture of 8085 Microprocessor? b) Explain instruction set Architecture Design? 2. Explain Memory Subsystem Organization

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

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May www.jwjobs.net R10 SET - 1 II B. Tech I Semester, Supplementary Examinations, May - 2012 (Com. to CSE, IT, ECC ) Time: 3 hours Max Marks: 75 *******-****** 1. a) Which of the given options provides the

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

Big Java Late Objects

Big Java Late Objects Big Java Late Objects Horstmann, Cay S. ISBN-13: 9781118087886 Table of Contents 1. Introduction 1.1 Computer Programs 1.2 The Anatomy of a Computer 1.3 The Java Programming Language 1.4 Becoming Familiar

More information

JAIPUR NATIONAL UNIVERSITY, JAIPUR

JAIPUR NATIONAL UNIVERSITY, JAIPUR Paper Code: MCA - 101 Paper Title: Fundamental of Computer Master of Computer Application (MCA) (i) Differentiate between data and information. Which is more useful to the people and why? (ii) Explain

More information

«Computer Science» Requirements for applicants by Innopolis University

«Computer Science» Requirements for applicants by Innopolis University «Computer Science» Requirements for applicants by Innopolis University Contents Architecture and Organization... 2 Digital Logic and Digital Systems... 2 Machine Level Representation of Data... 2 Assembly

More information

Prof. G. Ram Reddy Centre for Distance Education Osmania University MCA II Year 2014 ASSIGNMENTS

Prof. G. Ram Reddy Centre for Distance Education Osmania University MCA II Year 2014 ASSIGNMENTS DATA COMMUNICATIONS AND COMPUTER NETWORKS ASSIGNMENT I 1. (a) Write about (i) CSMA/CD (ii) Transmission Media (b) Explain Token Ring (or) IEEE 802.5. 2. (a) Write about (i) LAN Architecture (ii) ISDN IEEE

More information

Introduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis

Introduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis Introduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis p. 5 Statement Constructs p. 5 Pseudocode Example p.

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

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

OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS

OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS C++ PROGRAMMING LANGUAGE CONTENT C++ Language Contents: Introduction to C++ Language Difference and Similarities between C and C++ Role Of Compilers and Assemblers

More information

ASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 Second Year SOFTWARE ENGINEERING. Maximum : 30 MARKS Answer ALL questions.

ASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 Second Year SOFTWARE ENGINEERING. Maximum : 30 MARKS Answer ALL questions. ASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 SOFTWARE ENGINEERING (DMCA201) Q1) Explain Spiral model with suitable example. Also explain how it differs from Software Prototyping model. Q2) a) Draw

More information

AFN-1255 PCA131 P.G.D.C.A. DIPLOMA EXAMINATION, MAY 2011 First Semester Computer Applications FUNDAMENTALS OF DIGITAL COMPUTER (Non-CBCS 2004 onwards) Time : 3 Hours Maximum : 100 Marks Part A (15 1 =

More information

SYLLABUS. M.Sc. I.T. Ist Year

SYLLABUS. M.Sc. I.T. Ist Year SYLLABUS M.Sc. I.T. Ist Year CONTENT M.Sc.IT Paper I Ist Year Computer Organization & Architecture Paper II Data Communications and Computer Networking Paper III Programming in C and Data Structure Paper

More information

(3 hours) [80 marks] NOTE: Question No 1 is compulsory Attempt any three questions from remaining. Assume suitable data if necessary.

(3 hours) [80 marks] NOTE: Question No 1 is compulsory Attempt any three questions from remaining. Assume suitable data if necessary. (3 hours) [80 marks] NOTE: Question No 1 is compulsory Attempt any three questions from remaining. Assume suitable data if necessary. Q.1. a) What are the major activities of an Operating system with regard

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

WITH C+ + William Ford University of the Pacific. William Topp University of the Pacific. Prentice Hall, Englewood Cliffs, New Jersey 07632

WITH C+ + William Ford University of the Pacific. William Topp University of the Pacific. Prentice Hall, Englewood Cliffs, New Jersey 07632 DATA STRUCTURES WITH C+ + William Ford University of the Pacific William Topp University of the Pacific Prentice Hall, Englewood Cliffs, New Jersey 07632 CONTENTS Preface xvii CHAPTER 1 INTRODUCTION 1

More information

DISCRETE MATHEMATICS

DISCRETE MATHEMATICS DISCRETE MATHEMATICS WITH APPLICATIONS THIRD EDITION SUSANNA S. EPP DePaul University THOIVISON * BROOKS/COLE Australia Canada Mexico Singapore Spain United Kingdom United States CONTENTS Chapter 1 The

More information

Question Paper Code : 97044

Question Paper Code : 97044 Reg. No. : Question Paper Code : 97044 B.E./B.Tech. DEGREE EXAMINATION NOVEMBER/DECEMBER 2014 Third Semester Computer Science and Engineering CS 6301 PROGRAMMING AND DATA STRUCTURES-II (Regulation 2013)

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

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

DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR (2015-2016 REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY FACULTY OF SCIENCE AND HUMANITIES SRM NAGAR, KATTANKULATHUR

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

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year & Semester : II / III Section : CSE - 1 & 2 Subject Code : CS 6301 Subject Name : Programming

More information

DATA STRUCTURES THROUGH C++

DATA STRUCTURES THROUGH C++ II Year I Semester DATA STRUCTURES THROUGH C++ L T P C 4 0 0 3 OBJECTIVES: To be familiar with basic techniques of object oriented principles and exception handling using C++ To be familiar with the concepts

More information

Department of Computer Science SEMESTER-III CC-5 (Theory): Data Structures

Department of Computer Science SEMESTER-III CC-5 (Theory): Data Structures Department of Computer Science SEMESTER-III CC-5 (Theory): Data Structures Theory: 60 Lectures Credit: 4 1. 2. 3. 4. 5. 6. 7. 8. Arrays (5 L) Single and Multi-dimensional Arrays, Sparse Matrices (Array

More information

Department of Computer Science & Engineering School of Engineering & Technology HNB Garhwal University Srinagar Garhwal

Department of Computer Science & Engineering School of Engineering & Technology HNB Garhwal University Srinagar Garhwal Department of Computer Science & Engineering School of Engineering & Technology HNB Garhwal University Srinagar Garhwal Admission Notification for M. Tech. (Computer Science & Engineering) First Semester

More information

LESSON PLAN B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER

LESSON PLAN B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER DEPARTMENT OF COMPUTER APPLICATIONS LESSON PLAN B.C.A. - FIRST YEAR (2014-2015 REGULATION) SECOND SEMESTER SRM UNIVERSITY FACULTY OF SCIENCE AND HUMANITIES SRM NAGAR, KATTANKULATHUR 603 203 SRM UNIVERSITY

More information

M.Sc. (Final) DEGREE EXAMINATION, DEC Second Year INFORMATION TECHNOLOGY. Paper - I : Software Engineering. Time : 3 Hours Maximum Marks : 75

M.Sc. (Final) DEGREE EXAMINATION, DEC Second Year INFORMATION TECHNOLOGY. Paper - I : Software Engineering. Time : 3 Hours Maximum Marks : 75 (DMSIT21) M.Sc. (Final) DEGREE EXAMINATION, DEC. - 2014 Second Year INFORMATION TECHNOLOGY Paper - I : Software Engineering Time : 3 Hours Maximum Marks : 75 Section A (3 15 = 45) Answer any three questions

More information

VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK III SEMESTER CS8391-Data Structures Regulation 2017 Academic Year 2018 19(odd Semester)

More information

B.Sc II Year Computer Science (Optional)

B.Sc II Year Computer Science (Optional) Swami Ramanand Teerth Marathwad University, Nanded B.Sc II Year Computer Science (Optional) (Semester Pattern) ( W.E.F. June 2010) Paper No VI VII Paper Title Digital Electronics & 8085 Microprocessor

More information

Seth Jai Parkash Polytechnic, Damla

Seth Jai Parkash Polytechnic, Damla Seth Jai Parkash Polytechnic, Damla Name of the Faculty: Ms Richa Kharbanda Discipline: Computer Engg. Semester: 4 th Subject: DATA STRUCTURES USING C Lesson Plan Duration: 15 weeks (from January, 2018

More information

SECOND SEMESTER JAVA PROGRAMMING

SECOND SEMESTER JAVA PROGRAMMING PGDCA-210 SECOND SEMESTER JAVA PROGRAMMING (A) Instructions for the Paper setter: The question paper will consist of five sections: A, B, C, D a E. Sections A, B, C a D will have two questions from the

More information

ASSIGNMENTS. Progra m Outcom e. Chapter Q. No. Outcom e (CO) I 1 If f(n) = Θ(g(n)) and g(n)= Θ(h(n)), then proof that h(n) = Θ(f(n))

ASSIGNMENTS. Progra m Outcom e. Chapter Q. No. Outcom e (CO) I 1 If f(n) = Θ(g(n)) and g(n)= Θ(h(n)), then proof that h(n) = Θ(f(n)) ASSIGNMENTS Chapter Q. No. Questions Course Outcom e (CO) Progra m Outcom e I 1 If f(n) = Θ(g(n)) and g(n)= Θ(h(n)), then proof that h(n) = Θ(f(n)) 2 3. What is the time complexity of the algorithm? 4

More information

End-Term Examination Second Semester [MCA] MAY-JUNE 2006

End-Term Examination Second Semester [MCA] MAY-JUNE 2006 (Please write your Roll No. immediately) Roll No. Paper Code: MCA-102 End-Term Examination Second Semester [MCA] MAY-JUNE 2006 Subject: Data Structure Time: 3 Hours Maximum Marks: 60 Note: Question 1.

More information

ASSIGNMENT - 1, DEC

ASSIGNMENT - 1, DEC (PGDCA 01) Paper I INFORMATION TECHNOLOGY 1) What is an information technology? Discuss the general technological trends for information technology. 2) Describe how IT support at different organizational

More information

COURSE OUTCOMES OF M.Sc(IT)

COURSE OUTCOMES OF M.Sc(IT) COURSE OUTCOMES OF M.Sc(IT) Sr. No Subject Code Subject Name Sem-I CO Status Course Outcomes 1. A304101 PROGRAMMING USING C 2. A304102 FUNDAMENTALS OF COMPUTER & INFORMATION TECHNOLOGIES CO1 CO2 Understands

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

SAURASHTRA UNIVERSITY

SAURASHTRA UNIVERSITY SAURASHTRA UNIVERSITY RAJKOT INDIA Accredited Grade A by NAAC (CGPA 3.05) CURRICULAM FOR B.Sc. (Computer Science) Bachelor of Science (Computer Science) (Semester - 1 Semester - 2) Effective From June

More information

ASSIGNMENT - 1, DEC P.G. DIPLOMA IN COMPUTER APPLICATIONS Paper I INFORMATION TECHNOLOGY Maximum : 30 MARKS Answer ALL questions.

ASSIGNMENT - 1, DEC P.G. DIPLOMA IN COMPUTER APPLICATIONS Paper I INFORMATION TECHNOLOGY Maximum : 30 MARKS Answer ALL questions. ASSIGNMENT - 1, DEC - 2018. (PGDCA 01) Paper I INFORMATION TECHNOLOGY 1) What is an information technology? Discuss the general technological trends for information technology. 2) Describe how IT support

More information

COURSE STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING HELD ON JULY TO BE EFFECTIVE FROM THE ACADEMIC YEAR

COURSE STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING HELD ON JULY TO BE EFFECTIVE FROM THE ACADEMIC YEAR COURSE STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING HELD ON JULY- 2000 TO BE EFFECTIVE FROM THE ACADEMIC YEAR 2000-2001 MCA SEMESTER -1 Scheme of evaluation Max. Marks Min. Marks to

More information

P.G.D.C.A. EXAMINATION, 2009

P.G.D.C.A. EXAMINATION, 2009 P.G.D.C.A. EXAMINATION, 2009 ADVANCED DATABASE MANAGEMENT SYSTEM Time allowed: Three Hours Maximum Marks: 100 Attempt any five questions, selecting one question from each unit. All questions carry equal

More information

The Bhopal School of Social Sciences, Bhopal

The Bhopal School of Social Sciences, Bhopal Marking scheme for M.Sc. (Computer Science) II Sem. Semester II Paper Title of the paper Theory CCE Total I Data Structure & Algorithms 70 30 100 II Operating System 70 30 100 III Computer Networks with

More information

4.1.2 Merge Sort Sorting Lower Bound Counting Sort Sorting in Practice Solving Problems by Sorting...

4.1.2 Merge Sort Sorting Lower Bound Counting Sort Sorting in Practice Solving Problems by Sorting... Contents 1 Introduction... 1 1.1 What is Competitive Programming?... 1 1.1.1 Programming Contests.... 2 1.1.2 Tips for Practicing.... 3 1.2 About This Book... 3 1.3 CSES Problem Set... 5 1.4 Other Resources...

More information

CHAPTER 1 Introduction to Computers and Programming CHAPTER 2 Introduction to C++ ( Hexadecimal 0xF4 and Octal literals 031) cout Object

CHAPTER 1 Introduction to Computers and Programming CHAPTER 2 Introduction to C++ ( Hexadecimal 0xF4 and Octal literals 031) cout Object CHAPTER 1 Introduction to Computers and Programming 1 1.1 Why Program? 1 1.2 Computer Systems: Hardware and Software 2 1.3 Programs and Programming Languages 8 1.4 What is a Program Made of? 14 1.5 Input,

More information

Preface to the Second Edition Preface to the First Edition Brief Contents Introduction to C++ p. 1 A Review of Structures p.

Preface to the Second Edition Preface to the First Edition Brief Contents Introduction to C++ p. 1 A Review of Structures p. Preface to the Second Edition p. iii Preface to the First Edition p. vi Brief Contents p. ix Introduction to C++ p. 1 A Review of Structures p. 1 The Need for Structures p. 1 Creating a New Data Type Using

More information

CS 101 Advanced Computer System Architecture 100 ( ) CS 102 Operating System 100 ( )

CS 101 Advanced Computer System Architecture 100 ( ) CS 102 Operating System 100 ( ) Syllabus for M.Sc. Computer Science Programme Semester I External/ Internal CS 101 Advanced Computer System Architecture 100 ( 75 + 25 ) CS 102 Operating System 100 ( 75 + 25 ) CS 103 Mathematical Foundation

More information

1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \

1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \ BSc IT C Programming (2013-2017) Unit I Q1. What do you understand by type conversion? (2013) Q2. Why we need different data types? (2013) Q3 What is the output of the following (2013) main() Printf( %d,

More information

Code No: R Set No. 1

Code No: R Set No. 1 Code No: R05010106 Set No. 1 1. (a) Draw a Flowchart for the following The average score for 3 tests has to be greater than 80 for a candidate to qualify for the interview. Representing the conditional

More information

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE A6-R3: DATA STRUCTURE THROUGH C LANGUAGE NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be answered in the TEAR-OFF

More information

ASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, MAY 2018 (First Year) INFORMATION TECHNOLOGY Basics of Information Technology

ASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, MAY 2018 (First Year) INFORMATION TECHNOLOGY Basics of Information Technology ASSIGNMENT-1 () Basics of Information Technology (DMSIT01) Q1) Discuss in detail about IT support at different organizational levels. Q2) Explain about hierarchy of computers. Q3) Discuss different categories

More information

Time : 03 Hours Maximum Marks : 75

Time : 03 Hours Maximum Marks : 75 (DMSIT 01) Information Technology Paper - I : BASICS OF INFORMATION TECHNOLOGY Answer any Three of the following 1) Define IT. Enumerate various IT trends and their benefits to the organizations. 2) Bring

More information

MNPE In Collaboration with. Karnataka State Open University. Manasagangotri, Mysore-6. Syllabus. Diploma in Computer Application

MNPE In Collaboration with. Karnataka State Open University. Manasagangotri, Mysore-6. Syllabus. Diploma in Computer Application MNPE-09425068494 In Collaboration with Karnataka State Open University Manasagangotri, Mysore-6 Syllabus Diploma in Computer Application www.maanarmadaedu.org Diploma in Computer Application Programme

More information

E.G.S. PILLAY ENGINEERING COLLEGE (An Autonomous Institution, Affiliated to Anna University, Chennai) Nagore Post, Nagapattinam , Tamilnadu.

E.G.S. PILLAY ENGINEERING COLLEGE (An Autonomous Institution, Affiliated to Anna University, Chennai) Nagore Post, Nagapattinam , Tamilnadu. 17CA 104DATA STRUCTURES Academic Year : 018-019 Programme : MCA Year / Semester : I / I Question Bank Course Coordinator: Mrs. C.Mallika Course Objectives The student should be able to 1. To understand

More information

Topic wise Tests. Number Systems,Boolean Expression, Boolean Laws & K-maps

Topic wise Tests. Number Systems,Boolean Expression, Boolean Laws & K-maps Test No Topic code Topic CSIT-01 CSIT-02 CSIT-03 CSIT-04 GDL 1 (Digital Logic) GDL 2 (Digital Logic) GCO 1 (Computer Organization) GCO 2 (Computer Organization) Number Systems,Boolean Expression, Boolean

More information