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

Similar documents
ASSIGNMENT - 1, DEC

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) M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75. Paper - I : INFORMATION TECHNOLOGY

Assignment-I PGDCA 01- INFORMATION TECHNOLOGY

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

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

M.C.A. FIRST YEAR DEGREE

INFORMATION TECHNOLOGY

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

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

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

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

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

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

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

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

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

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

Seth Jai Parkash Polytechnic, Damla

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

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

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

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

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

I Year MCA I Semester L T P To C FOUNDATIONS OF INFORMATION TECHNOLOGY

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

Time : 03 Hours Maximum Marks : 75

Answer any Five Questions. All questions carry equal marks.

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

Contents. 1 Introduction to Computers, the Internet and the World Wide Web 1. 2 Introduction to C Programming 26

B.Sc. Computer Science (Ancillary)

CHOICE BASED CREDIT SYSTEM (With effect from )

Syllabus of C++ Software for Hands-on Learning: This course offers the following modules: Module 1: Getting Started with C++ Programming

Quantitative Finance COURSE NUMBER: 22:839:615 COURSE TITLE: Special Topics Oriented Programming 2

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


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

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

Post Graduate Diploma in Computer Applications I Semester INTERNAL ASSIGNMENT QUESTIONS (November, 2017)

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

JAIPUR NATIONAL UNIVERSITY, JAIPUR

KLiC C++ Programming. (KLiC Certificate in C++ Programming)

CGS 2405 Advanced Programming with C++ Course Justification

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE

Course Review for. Cpt S 223 Fall Cpt S 223. School of EECS, WSU

Department of Computer Science and Technology

B.Sc. (Part II) (Information Technology) EXAMINATION, 2009

Lesson Plan for Even semester

Come and join us at WebLyceum

LIST OF EXPERIMENTS. (1) (Office Automation)

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

B.Sc II Year Computer Science (Optional)

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

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

Advanced Diploma in Computer Science (907) Computer Systems Architecture

Algorithms and Data Structures

Contents. Preface xvii Acknowledgments. CHAPTER 1 Introduction to Parallel Computing 1. CHAPTER 2 Parallel Programming Platforms 11

Week 0. Net Salary =Earnings- deductions; Read the employee number, Basic Print employee Number, Earnings,Deductions and Net salary.

About this exam review

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

Punjab Technical University Bachelor in Mobile Computing & Internet Batch 2014 onwards THIRD SEMESTER

COMPUTER PROGRAMMING LAB

Madhya Pradesh Bhoj (Open) University, Bhopal

ADMINISTRATIVE MANAGEMENT COLLEGE

SECOND SEMESTER BCA : Syllabus Copy

Discuss the following operations on One-Dimensional array with algorithms.

I BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination. June, 2015 BCS-031 : PROGRAMMING IN C ++

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

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

CLASSIC DATA STRUCTURES IN JAVA

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

M.C.A DEGREE EXAMINATION,NOVEMBER/DECEMBER 2010 Second Semester MC 9222-OBJECT ORIENTED PROGRAMMING (Regulation 2009)

CSCE 210/2201 Data Structures and Algorithms. Prof. Amr Goneid


B.Sc. Final B.SC. PART-III PAPER I COMPUTER ORGANIZATION II

Contents. Introduction

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

CSCE 210/2201 Data Structures and Algorithms. Prof. Amr Goneid. Fall 2018

KLiC C Programming. (KLiC Certificate in C Programming)

SRE VIDYASAAGAR HIGHER SECONDARY SCHOOL. TWO MARKS

Advanced Database Systems

1. [1 pt] What is the solution to the recurrence T(n) = 2T(n-1) + 1, T(1) = 1

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

BEng (Hons) Telecommunications. Examinations for 2016 / Semester 2

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 CS205: DATA STRUCTURES (CS, IT)

Data Structures and Algorithms

Syllabus for Computer Science General Part I

Data Structures. Chapter 06. 3/10/2016 Md. Golam Moazzam, Dept. of CSE, JU

[CHAPTER] 1 INTRODUCTION 1

BCA (Part II) EXAMINATION, 2009 C++ PROGRAMMING Time allowed: Three Hours Maximum Marks: 50 Attempt any five questions

Lesson Plan for Even semester Govt. Polytechnic Education Society, Lisana (Rewari) Name of the Faculty: Sh. Praveen Kumar Discipline:

An Object Oriented Programming with C

Solved by: Syed Zain Ali Bukhari (BSCS)

Department of Information Technology. II B.Tech I Sem. DATA STRUCTURES THROUGH C++ (Subject code# 53023) Dept of IT

Recursion. Comp Sci 1575 Data Structures. Introduction. Simple examples. The call stack. Types of recursion. Recursive programming

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

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

Teaching Plan. (Academic Year: ) Class : BCA III Year Semester: V. Subject : Entrepreneurship Development Paper No: XXVII E-3

Algorithm Efficiency & Sorting. Algorithm efficiency Big-O notation Searching algorithms Sorting algorithms

CS2013 Course Syllabus Spring 2017 Lecture: Friday 8:00 A.M. 9:40 A.M. Lab: Friday 9:40 A.M. 12:00 Noon

Transcription:

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 at different organizational levels. 3) What is the significance of hardware? Briefly describe the primary storage and secondary storage. 4) Discuss about various strategic hardware issues. 5) What is software? Explain about its history and significance.

ASSIGNMENT - 2, DEC - 2018. (PGDCA 01) Paper I INFORMATION TECHNOLOGY 1) Explain various methods for developing application software. 2) Discuss about traditional file systems and modern database approach. 3) What is network? Write about various network processing strategies. 4) What is an internet? Discuss about the operation of internet. 5) Explain the following : i) WWW ii) Mobile internet

ASSIGNMENT - 1, DEC - 2018. (PGDCA 02) Paper - II : PROGRAMMING WITH C++ 1) Discuss about various data types available in C++. 2) Explain the difference between if and if ------ else conditional statements. Write and test a program that solves quadratic equations. 3) Explain about different iterative statements and give illustrative example to each of them. 4) Write a note on function overloading and give an example program to demonstrate function overloading. 5) Explain the following : i) New and delete operators ii) Pointers to pointers

ASSIGNMENT - 2, DEC - 2018. (PGDCA 02) Paper - II : PROGRAMMING WITH C++ 1) Describe various string handling operations. 2) Explain about friend function and friend class with examples. 3) Write a program to demonstrate binary operator overloading. 4) What is destructor? Can a destructor be virtual? Explain. 5) Explain setw ( ), setprecision ( ) and setfill ( ) manipulators.

ASSIGNMENT - 1, DEC - 2018. (PGDCA 03) Paper - III : COMPUTER ORGANIZATION 1) Explain about the evolution of computers. 2) Explain about some basic aspects of computer performance. 3) What are the different physical forms available to establish an interconnection network? Give the summary of those? 4) Explain about the basic functional units of a computer. 5) Explain about the architecture of cache memory.

ASSIGNMENT - 2, DEC - 2018. (PGDCA 03) Paper - III : COMPUTER ORGANIZATION 1) How do you add positive members with an example. 2) Explain about the CPU organization. 3) Explain about the instruction sequencing. 4) Describe about the different types of registers. 5) Explain the memory segmentation in CPO.

ASSIGNMENT - 1, DEC - 2018. (PGDCA 04) Paper - IV : DATA STRUCTURES 1) Describe the concepts of complexity and time-space tradeoff of an algorithm with an example. 2) Develope an algorithm to print prime number less than N. Apply the algorithm for N = 30. 3) Write bubble sort algorithm and apply it on the data : 32, 51, 27, 85, 66, 23, 13, 57 4) Discuss about pointer arrays and record structures with illustrative examples. 5) Explain about different operations performed on linked lists.

ASSIGNMENT - 2, DEC - 2018. (PGDCA 04) Paper - IV : DATA STRUCTURES 1) Explain the Towers of Hanoi problem. Draw the schematic diagram of the recursive function TOWER (4, A, B, C). 2) Describe the concept of stack and write algorithms for its operations. 3) Explain binary tree traversals. Find the traversals of the corresponding binary tree of the expression (2 x y )(5a b) 3. 4) Write Huffman algorithm and apply in on the data A B C D E F G 25 5 11 19 2 11 25 5) Use Radix sort to sort the following data : 348, 143, 361, 423, 538, 128, 321, 543, 366 H 5

ASSIGNMENT - 1, DEC - 2018. (PGDCA 05) Paper - V : OPERATING SYSTEMS 1) What is an operating system? Outline the functions of operating system. 2) Describe the process state transition diagram with one and two states. 3) Explain the interprocess communication primitives of the operating system. 4) Discuss about multiple partition scheme of memory management. 5) Explain in detail the concepts of demand paging page locking and prepaging.

ASSIGNMENT - 2, DEC - 2018. (PGDCA 05) Paper - V : OPERATING SYSTEMS 1) Discuss about various file allocation methods. 2) Explain the features of text-based displays 3) Explain the following : i) Caching ii) RAID 4) What are the major components of security? Briefly explain them. 5) Discuss about intruders detection and prevention.

ASSIGNMENT - 1, DEC - 2018. (PGDCA 06) Paper - VI : DATA BASE MANAGEMENT SYSTEMS 1) What is database system? What are its applications? Explain them in brief. 2) What is one-to-many and many-to-many recursive association? Illustrate their implementation with an example. 3) What is a stack? Explain stack data structure. Illustrate with an example, creation and addition of records of stack data structure. 4) What are the three types of network data models? Explain them with examples. 5) What is normalization? Explain BCNF with an example.

ASSIGNMENT - 2, DEC - 2018. (PGDCA 06) Paper - VI : DATA BASE MANAGEMENT SYSTEMS 1) Explain the symbols used in database action diagram (DAD). Give an example of DAD. 2) What is PC-FOCUS? Describe PC-FOCUS database of an university? 3) Classify COBOL DML commands and explain the purpose of each of them. 4) List different commands of relational algebra and explain them in brief. 5) Discuss about different security mechanisms.

ASSIGNMENT - 1, DEC - 2018. (PGDCA 07) Paper - VII : ACCOUNTS & FINANCE 1) Bring out different concepts used in accounting. 2) Draw a petty cash book with imaginary figures. 3) What are the uses of trial balance? 4) State the uses of a system of budgetary control. 5) How do you analyse costs for decision making?

ASSIGNMENT - 2, DEC - 2018. (PGDCA 07) Paper - VII : ACCOUNTS & FINANCE 1) Design balance sheet of a company with imaginary figures. 2) Explain the tools employed in financial analysis. 3) How do you estimate the requirement of working capital for a concern? 4) What are the managerial uses of cash flow statement. 5) Draw funds flow statement hypothetical figures.

ASSIGNMENT - 1, DEC - 2018. (PGDCA 08) Paper - VIII : COMPUTER GRAPHICS 1) Explain about line drawing techniques in detail. 2) Explain DDA and Brasenham s algorithms. 3) What is clipping? Explain about different types of clipping techniques. 4) Explain about the segmented display files. 5) Explain about various input and output graphic devices.

ASSIGNMENT - 2, DEC - 2018. (PGDCA 08) Paper - VIII : COMPUTER GRAPHICS 1) Discuss about the applications of computer graphics. 2) Explain in detail about the fundamentals in Raster scan displays. 3) Explain about the picture structure and character generation. 4) Explain about the differences between vector and raster graphics. 5) Explain about the display file structures.