M.C.A. FIRST YEAR DEGREE

Similar documents
(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75. 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 a neat diagram?

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

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

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

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

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

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

PG DIPLOMA EXAMINATION, DECEMBER INFORMATION TECHNOLOGY. Paper - I : Basics of Information Technology. Time : 3 Hours Maximum Marks : 70

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

(PGDCA 01) ASSIGNMENT -1 PG DIPLOMA DEGREE EXAMINATION, DECEMBER 2017 COMPUTER APPLICATIONS Information Technology

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

ASSIGNMENT - 1, DEC

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

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

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

INFORMATION TECHNOLOGY

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

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

Madhya Pradesh Bhoj (Open) University, Bhopal

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

M.Sc. (Previous) DEGREE EXAMINATION, MAY First Year Information Technology. 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

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

Assignment-I PGDCA 01- INFORMATION TECHNOLOGY

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

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

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

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

3. According to universal addressing, what is the address of vertex d? 4. According to universal addressing, what is the address of vertex f?

Note: Select one full question from each unit

JAIPUR NATIONAL UNIVERSITY, JAIPUR

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

CS/IT DIGITAL LOGIC DESIGN

Bharati Vidyapeeth s College Of Engineering for Women Pune-43 Department E & TC. SE- Unit Test I Subject-DS

ADMINISTRATIVE MANAGEMENT COLLEGE

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

Answer any Five Questions. All questions carry equal marks.

Syllabus for Computer Science General Part I

DYNAMIC MEMORY ALLOCATION AND DEALLOCATION

OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS

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

Total No. of Questions :09] [Total No. of Pages : 02. II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC First Semester CSE/IT DATA STRUCTURES USING C

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

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK

Fundamentals of Discrete Mathematical Structures

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

«Computer Science» Requirements for applicants by Innopolis University

Fundamental of I.T. (c) Application of computer *************

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

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

Seth Jai Parkash Polytechnic, Damla

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

CS304,EC304,DCSE16, DETE16

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

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

SPLIT-UP SYLLABUS ----CHENNAI REGION COMPUTER SCIENCE (Code: 083) Class-XII Academic Session

LOGIC AND DISCRETE MATHEMATICS

DISCRETE MATHEMATICS

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE

Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 154) Pass Marks: 24

DATA STRUCTURES THROUGH C++

B.Sc. Computer Science (Ancillary)

Sample Question Paper

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

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

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

Computational Discrete Mathematics

Answer any Five Questions. All questions carry equal marks.

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

Sub: EM-III (14MA301) Section: A & B Date: 13/07/17 One Mark Questions: 1. a) Write the iterative formula to compute 3 N by Newton s method.

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

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

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

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 DATA STRUCTURE

A Survey of Mathematics with Applications 8 th Edition, 2009

KENDRIYA VIDYALAYA SANGATHAN

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

MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE

SUBJECT: INFORMATION TECHNOLOGY

4. BOOLEAN ALGEBRA 8 5. NETWORKING AND OPEN SOURCE SOFTWARE 10

Reg. No. : Question Paper Code : 27157

LIST OF EXPERIMENTS. (1) (Office Automation)

KENDRIYA VIDYALAYA SANGATHAN

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims. Lecture 25: Review and Open Problems

Prepared By: Ms. Nidhi Solanki (Assist. Prof.) Page 1

mrrj izns k jktf kz V.Mu eqdr fo ofo ky;]bykgkckn

CSI3131 Final Exam Review

KENDRIYA VIDYALAYA SANGATHAN, KOLKATA REGION SPLIT-UP SYLLABUS ( ) CLASS XII : COMPUTER SCIENCE (THEORY)

Sai Nath University. Assignment For MCA 2nd Sem.

KENDRIYA VIDYALAYA SANGATHAN. Regional Office Delhi Split-up Syllabus Session Subject:-Computer Science Subject Code:-083

Tribhuvan University Institute of Science and Technology Computer Science and Information Technology (CSC. 154) Section A Attempt any Two questions:

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- MARCH, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours

COMPUTER SCIENCE PAPER 1

SECOND SEMESTER BCA : Syllabus Copy

VALLIAMMAI ENGINEERING COLLEGE

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

Packet #6: Counting & Graph Theory. Applied Discrete Mathematics

Draw a diagram of an empty circular queue and describe it to the reader.

Transcription:

(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 various types of personal application software. 4) What is the role of computers in payroll processing. 5) What are the functions of modems. 6) Write a note on applications of software. 7) Write a short notes on e-mail. 8) What is a file. 9) What is a processor.

(DMCA 101) ASSIGNMENT - 2, DEC - 2018. PAPER- I : INFORMATION TECHNOLOGY 1) Explain about various topologies of LAN and WAN architectures. 2) What is WWW? Differentiate between intranet and internet. 3) What is a memory? Write about their types. 4) Write about the traditional file management system and its advantages. 5) Write a note on different organization levels. 6) How a http works in the URL. 7) Define system support program. 8) What is team ware. 9) What are cookies.

(DMCA 102) ASSIGNMENT - 1, DEC - 2018. PAPER- II : PROGRAMMING WITH C++ 1) Explain the control structures in C++ using examples for each. 2) Generate the types of data with operators in detail. 3) a)write a program for passing an array to the function & find the sum of array elements. b) Discuss about arrays in detail. 4) Explain Data Encapsulation & data abstraction. 5) Explain functions with example. 6) Explain the parts of C++ program. Write a program to find factorial of a given number. 7) What is scope access operator? Write a program to use scope access operator. 8) What is destructor? 9) What is virtual function?

(DMCA 102) ASSIGNMENT - 2, DEC - 2018. PAPER- II : PROGRAMMING WITH C++ 1) Explain in detail about constructor of overloading constructor with program. 2) How to program with templates? Explain with suitable example. 3) Explain about default parameter & parameter casting. 4) How to overload main () function? Explain. 5) What is Recursive constructor? 6) Give some exception handling mechanisms. 7) Define inheritance & give its type. 8) Define container class. 9) Give the difference between vector & list.

(DMCA 103) ASSIGNMENT - 1, DEC - 2018. PAPER- III : COMPUTER ORGANIZATION 1) What is a system BUS? Describe its architecture with a neat diagram. 2) Describe the structure of magnetic disk and tape. 3) Explain different types of interrupts with examples. 4) Give the structure of computer system with a neat diagram. 5) Explain the different states of an instruction execution. 6) Explain the functions of ALU. 7) Explain about secondary storage devices. 8) What is a memory 9) What is a bus? List out different types.

(DMCA 103) ASSIGNMENT - 2, DEC - 2018. PAPER- III : COMPUTER ORGANIZATION 1) Explain the internal structure of CPU with a neat diagram. 2) Discuss about the processor organization. 3) What is stored program organization. 4) Explain about Instruction cycle. 5) Explain about floating point addition and subtraction. 6) Explain about the different types of registers. 7) What is PC and IR. 8) Write a note on peripheral devices. 9) What is seek time.

(DMCA 104) ASSIGNMENT - 1, DEC - 2018. PAPER- IV : DATA STRUCTURES 1) a) Describe the stack and queue along with the operations defined on them. b) Write a procedure to convert a given infix expression to prefix. 2) a) What is a circular linked list? Explain the operations on a circular linked list. b) Write an algorithm for polynomial addition using singly linked lists. 3) Define a Binary tree and explain various representations of a Binary Tree. 4) What is a Sparse matrix? Explain how is it represented. 5) Explain the Binary search algorithm. 6) Represent the following expression in Binary Tree format. E = (a - b) / (c * d + e) 7) Convert the following infix expression into postfix form: A / B ** C + D * E A * C 8) Define a data structure. 9) What is an Abstract Data Type?

(DMCA 104) ASSIGNMENT - 2, DEC - 2018. PAPER- IV : DATA STRUCTURES 1) Explain the Quick sort method. 2) Explain different Tree traversal methods. 3) What is an algorithm? How do you estimate the time complexity of an algorithm? 4) Write a Procedure to insert an element in to a doubly linked list. 5) Explain Binary Search Trees. 6) Explain Hashing. 7) What is a Tree? 8) What is linear search? 9) What is the Height of a Tree?

(DMCA 105) ASSIGNMENT - 1, DEC - 2018. PAPER - V : OPERATING SYSTEMS 1) Describe the process state transition diagram with one and two states. 2) Write short note on deadlock avoidance. Explain the Bankers algorithm for deadlock avoidance. 3) What is Dining Philosophers Problem? Give the solution for it. 4) Write short notes on different types of operating systems. 5) Explain the process scheduling criteria. 6) Describe the Test And Set instruction. 7) Show that the Peterson s algorithm satisfies the requirements of a mechanism to control acess to a critical section. 8) What is boot sector? 9) What is the use of buffering?

(DMCA 105) ASSIGNMENT - 2, DEC - 2018. PAPER - V : OPERATING SYSTEMS 1) Explain about hardware I/O organization. 2) Discuss about different program related threats. 3) What is segmentation? Write about segmentation with paging. 4) Explain the concept of file locking and blocking. 5) Write about storage disks. 6) Explain various approaches to intrusion detection. 7) Define synchronization. 8) What is file mapping? 9) What is monitor?

(DMCA 106) ASSIGNMENT - 1, DEC - 2018. PAPER - VI : DATABASE MANAGEMENT SYSTEMS 1) Describe one-to-many and many-to-many recursive associations with an illustrative example. 2) What is binary tree? Write an algorithm to create a binary tree data structure. Apply the algorithm on the data 102, 106, 104, 101, 110, 109, 107, 103, 108, 105. 3) What is the role of normalization in database design? Explain BCNF with an example. 4) What are the components of database management system?explain them in detail. 5) Illustrate the construction of an indexed sequential file with a suitable example. 6) What are the three types of network data models? Explain them with an example. 7) What is stack? Explain stack data structure. 8) What is decision support system? 9) What is a ring data structure?

(DMCA 106) ASSIGNMENT - 2, DEC - 2018. PAPER - VI : DATABASE MANAGEMENT SYSTEMS 1) Explain the following PC-FOCUS commands. a) FILETALK b) AUTOMOD c) TABLETALK 2) List different commands of relational algebra and explain them in brief. 3) What is conceptual data model? What are its inputs and outputs. 4) What are the symbols used in database action diagram? Explain them in brief. 5) Decrypt the following stream of data using the tree with a degree of 2 and three levels. (a, b, d, h, i, e, j, k, c, f, l, m, g, n, o). 6) Give the skeleton of DDL program of IDMA. 7) What is LAM? 8) What is the use of the command GET NEXT? 9) What is timestamp?

(DMCA 107) ASSIGNMENT - 1, DEC - 2018. PAPER - VII : ACCOUNTS AND FINANCE 1) Explain the rules relating to double entry system of accounting. 2) State the techniques employed to manage working capital. 3) Bring out the nature and significance of finance function. 4) Matching concept. 5) Subsidary books. 6) Trial balance. 7) Flexible budget. 8) Journal proper. 9) Cost centre.

(DMCA 107) ASSIGNMENT - 2, DEC - 2018. PAPER - VII : ACCOUNTS AND FINANCE 1) Classify costs with suitable examples. 2) How do you draw balance sheet of a corporate body? 3) Profitability ratios. 4) Funds flow statement. 5) Horizontal analysis. 6) Errors of commission. 7) Wealth maximisation. 8) Cash from operations. 9) Net working capital.

(DMCA 108) ASSIGNMENT - 1, DEC - 2018. PAPER - VIII : DISCRETE MATHEMATICS 1) a) Explain different methods of proof with example. b) Prove on disprove the validity of the following argument using Quantified proposition All men are falliable All kings are men Three fore all kings are falliable. 2) a) Prove that x P x Q x x P x x Q x. b) State all the rules of Logical Inference. 3) a) Find the Recurrence Relation satisfying Y n = A(3) n + B(-4) n. b) Write a brief note on Recursive Algorithms 4) Define strong Mathematical Induction. 5) Define Recursive subroutine. 6) Define Equivalence Relation. 7) Define order of the Recurrane Relation. 8) Define Tautology. 9) What is Recursion?

(DMCA 108) ASSIGNMENT - 2, DEC - 2018. PAPER - VIII : DISCRETE MATHEMATICS 1) Make logic circuits for the following Boolean Expressions. a) A B + ABC + C + B b) wyz wz yz xyz 2) a) Show that the sum of all vertex degree is equal to twice the no.of edges. b) Explain Travelling Salesman problem. 3) Let A be a set Define P(A) the power set of A Find P(A) when A = {1, 2, 3}. 4) What is Ackerman s function? 5) Explain the concept of graph Isomorphism. 6) Show that every planar graph is 5-olarable. 7) What is Hasse diagram? 8) Define biparite graph. 9) What Eulerian path.