2) What is the structure of an organization? Explain how IT support at different organizational levels.



Similar documents
Information and Communications Technology Courses at a Glance

Assessment Plan for CS and CIS Degree Programs Computer Science Dept. Texas A&M University - Commerce

10CS35: Data Structures Using C

Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

Machine Architecture and Number Systems. Major Computer Components. Schematic Diagram of a Computer. The CPU. The Bus. Main Memory.

1. INTRODUCTION TO RDBMS


INFORMATION TECHNOLOGY PROGRAM

Chapter 11 I/O Management and Disk Scheduling

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur

Assessment for Master s Degree Program Fall Spring 2011 Computer Science Dept. Texas A&M University - Commerce

DATA STRUCTURES USING C

Course Structure of Three Year Degree B.A Programme in Computer Application under Semester System of Dibrugarh University (General Programme)

Operating Systems OBJECTIVES 7.1 DEFINITION. Chapter 7. Note:

EUCIP IT Administrator - Module 2 Operating Systems Syllabus Version 3.0

CDS and Clearing Limited Thapathali, Kathmandu 7 th Level (Technical) Syllabus

Bachelor of Games and Virtual Worlds (Programming) Subject and Course Summaries

Chapter 2 Database System Concepts and Architecture

THREE YEAR DEGREE (HONS.) COURSE BACHELOR OF COMPUTER APPLICATION (BCA) First Year Paper I Computer Fundamentals

Core Syllabus. Version 2.6 B BUILD KNOWLEDGE AREA: DEVELOPMENT AND IMPLEMENTATION OF INFORMATION SYSTEMS. June 2006

Record Storage and Primary File Organization

OKLAHOMA SUBJECT AREA TESTS (OSAT )

OPERATING SYSTEMS Internais and Design Principles

Operating Systems CSE 410, Spring File Management. Stephen Wagner Michigan State University

Files. Files. Files. Files. Files. File Organisation. What s it all about? What s in a file?

14 Databases. Source: Foundations of Computer Science Cengage Learning. Objectives After studying this chapter, the student should be able to:

Chapter 6: Physical Database Design and Performance. Database Development Process. Physical Design Process. Physical Database Design

æ A collection of interrelated and persistent data èusually referred to as the database èdbèè.

5. A full binary tree with n leaves contains [A] n nodes. [B] log n 2 nodes. [C] 2n 1 nodes. [D] n 2 nodes.

Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

Chapter 3. Database Environment - Objectives. Multi-user DBMS Architectures. Teleprocessing. File-Server

EMC Publishing. Ontario Curriculum Computer and Information Science Grade 11

Appendix M INFORMATION TECHNOLOGY (IT) YOUTH APPRENTICESHIP

Application Architectures

KITES TECHNOLOGY COURSE MODULE (C, C++, DS)

RARITAN VALLEY COMMUNITY COLLEGE COURSE OUTLINE. CISY 103 Computer Concepts and Programming

5054A: Designing a High Availability Messaging Solution Using Microsoft Exchange Server 2007

Oracle Database 10g: Introduction to SQL

File Management. Chapter 12

Bachelor of Science in Information Technology. Course Descriptions

Krishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C

How To Understand The History Of An Operating System

THE OPEN UNIVERSITY OF TANZANIA FACULTY OF SCIENCE TECHNOLOGY AND ENVIRONMENTAL STUDIES BACHELOR OF SIENCE IN DATA MANAGEMENT

Multiprogramming. IT 3123 Hardware and Software Concepts. Program Dispatching. Multiprogramming. Program Dispatching. Program Dispatching

Chapter 13 File and Database Systems

Chapter 13 File and Database Systems

MCSE SYLLABUS. Exam : Managing and Maintaining a Microsoft Windows Server 2003:

Master s Program in Information Systems

BCA. Database Management System

Copyright 2007 Ramez Elmasri and Shamkant B. Navathe. Slide 13-1

IT2304: Database Systems 1 (DBS 1)

AQA GCSE in Computer Science Computer Science Microsoft IT Academy Mapping

Data Center Infrastructure

Filing Systems. Filing Systems

IT2305 Database Systems I (Compulsory)

Introduction to Databases

BCS2B02: OOP Concepts and Data Structures Using C++

MICHIGAN TEST FOR TEACHER CERTIFICATION (MTTC) TEST OBJECTIVES FIELD 050: COMPUTER SCIENCE

MCSE Objectives. Exam : TS:Exchange Server 2007, Configuring

Chapter 13 Disk Storage, Basic File Structures, and Hashing.

Introduction. Introduction: Database management system. Introduction: DBS concepts & architecture. Introduction: DBS versus File system

low-level storage structures e.g. partitions underpinning the warehouse logical table structures

Division of Mathematical Sciences

Chapter 13. Disk Storage, Basic File Structures, and Hashing

CHAPTER 17: File Management

50 Computer Science MI-SG-FLD050-02

M.Sc. IT Semester III VIRTUALIZATION QUESTION BANK Unit 1 1. What is virtualization? Explain the five stage virtualization process. 2.

1 PERSONAL COMPUTERS

Class XII (Theory) C++

SAN Conceptual and Design Basics

Introduction: Database management system

Computer Organization

Computer Science Course Descriptions Page 1

CS2Bh: Current Technologies. Introduction to XML and Relational Databases. Introduction to Databases. Why databases? Why not use XML?

Planning Domain Controller Capacity

BIT Course Description

DBMS Questions. 3.) For which two constraints are indexes created when the constraint is added?

In-memory Tables Technology overview and solutions

Topological Properties

Introduction. What is an Operating System?

KS3 Computing Group 1 Programme of Study hours per week

1 File Processing Systems

Management Challenge. Managing Hardware Assets. Central Processing Unit. What is a Computer System?

Module 5 Introduction to Processes and Controls

IUCLID 5 Guidance and support. Installation Guide Distributed Version. Linux - Apache Tomcat - PostgreSQL

Computer Science. General Education Students must complete the requirements shown in the General Education Requirements section of this catalog.

Skills for Employment Investment Project (SEIP)

COURSE OUTLINE Survey of Operating Systems

DBMS / Business Intelligence, SQL Server

Data Warehousing Concepts

CHAPTER 3 PROBLEM STATEMENT AND RESEARCH METHODOLOGY

COMHAIRLE NÁISIÚNTA NA NATIONAL COUNCIL FOR VOCATIONAL AWARDS PILOT. Consultative Draft Module Descriptor. Relational Database

Sorting revisited. Build the binary search tree: O(n^2) Traverse the binary tree: O(n) Total: O(n^2) + O(n) = O(n^2)

ICT Professional Optional Programmes

DE 6211 DISTANCE EDUCATION. M.Sc. (IT) DEGREE EXAMINATION, MAY PRINCIPLES OF INFORMATION TECHNOLOGY. (2002 onwards) PART A (10 3 = 30 marks)

Transcription:

(PGDIT 01) Paper - I : BASICS OF INFORMATION TECHNOLOGY 1) What is an information technology? Why you need to know about IT. 2) What is the structure of an organization? Explain how IT support at different organizational levels. 3) What is computer? Describe the salient features of the central processing unit of a computer. 4) Discuss about input and output technologies of computer hardware. 5) What is software? Write about systems software. Paper - I : BASICS OF INFORMATION TECHNOLOGY 1) Discuss about various Programming languages. (PGDIT 01) 2) What is data model? Briefly explain the logical data models. 3) Describe how networks are used in Telecommunications applications. 4) What is internet? Write about the evolution of internet. 5) Explain the following : a) Extranets. b) Mobile internet.

(PGDIT 02) Paper - II : DATA STRUCTURES WITH C 1) What is an algorithm? Write an algorithm for linear search and discuss about its complexity. 2) Discuss about different operations associated with word processing and give suitable examples. 3) Consider the linear arrays XXX( 10 : 10), YYY (1935 : 1985), ZZZ (35). Find the number of elements in each array. Suppose Base (YYY) = 400 and W = 4 words per memory cell of YYY. Find the address of YYY [1942], YYY [1977] and YYY [1988]. 4) Write bubble sort algorithm. Apply the algorithm on the array: 32, 51, 27, 85, 66, 23, 13, 57. 5) Explain the insertion and deletion operations on a linked list and write the corresponding algorithms. Paper - II : DATA STRUCTURES WITH C (PGDIT 02) 1) Describe the towers of Hanoi problem and give the schematic diagram for TOWER (4, A, B, C). 2) What is queue? How do you represent a queue? Discuss about various types of queues. 3) Explain about binary tree traversals. Find the binary tree traversals corresponding to algebraic expression : (a + (b c))*((d e)/(f + g h)). 4) Draw a binary search tree with the following values 22, 03, 09, 27, 23, 11, 05, 29, 28, 32, 19, 10, 30 and perform the operations (i) delete 19 (ii) delete 27 (iii) delete 22 on the above binary search tree. 5) Define hash function. Illustrate different hash functions and discuss about the collision resolution procedures.

(PGDIT 03) Paper - III : DBMS 1) What is a conventional file processing system? Give an example of the conventional file processing system and explain its operation and related difficulties. 2) What is hashed file organization? Explain the steps of remainder algorithm for hashing. 3) What are types of printers? Illustrate them with an example. 4) How will you map a conceptual data model into a relational data model? Give suitable example. 5) What is normalization? Explain fourth and fifth normal form with appropriate examples. Paper - III : DBMS 1) List and explain different symbols of DAD and give an example of DAD. (PGDIT 03) 2) Describe the commands of PC-FOCUS data manipulation. 3) Explain different DML retrieval and modification commands. 4) Explain the following interactive SQL commands with an example. a) UNION b) INTERSECT c) DROP VIEW 5) Describe the importance of data base recovery.

(PGDIT 04) Paper - IV : COMPUTER NETWORKS 1) What is data communications? Explain about its characteristics and its components 2) Explain about multiple access 3) Discuss about internet work routing in detail 4) Explain the different types of switching 5) Describe the binary arithmetic in security (PGDIT 04) Paper - IV : COMPUTER NETWORKS 1) Explain about hierarchical routing and its applications in detail 2) Explain the different topologies used with LANS 3) State the significance of HART communication protocol 4) Explain any one data link protocol 5) Bring out functional essentials of distributed control system.

Paper - V : COMPUTER ORGANISATION (PGDIT 05) 1) Explain about Pentium family processors 2) Discuss about various generations of computer 3) Explain about various addressing modes in detail 4) Explain about instruction execution and straight line sequencing 5) Discuss about carry, save, addition of commands (PGDIT 05) 1) Explain about the components of CPU Paper - V : COMPUTER ORGANISATION 2) Explain about different external memory devices 3) Discuss about the functions of CPU 4) Explain about Branch instruction 5) Explain about the structure and organisation of CPU

Paper - VI : OPERATING SYSTEMS (PGDIT 06) 1) Discuss about system hardware. 2) Explain about different scheduling algorithms. 3) What is deadlock? Explain different approaches to recover from deadlock. 4) Explain the dining philosophers problem. Write a monitor for the problem. 5) Discuss about simple paging and simple segmentation. (PGDIT 06) 1) Explain the following : a) Demand paging b) Directory Structure Paper - VI : OPERATING SYSTEMS 2) Discuss about file system architecture. 3) Explain the hardware I/O organization. 4) Explain the following : a) Hard disk scheduling b) RAID 5) Briefly discuss about different components of security.