SUBJECT: INFORMATION TECHNOLOGY

Similar documents
PGDCA Syllabus Directorate of Distance Education, University of Kashmir Directorate of Distance Education University of Kashmir Srinagar

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

Fundamentals of Discrete Mathematical Structures

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

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

MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE

ADMINISTRATIVE MANAGEMENT COLLEGE

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

ii) Do the following conversions: output is. (a) (101.10) 10 = (?) 2 i) Define X-NOR gate. (b) (10101) 2 = (?) Gray (2) /030832/31034

Madhya Pradesh Bhoj (Open) University, Bhopal

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

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

Syllabus for Computer Science General Part I

Semester-II. Credit Hours IA UE Total Value

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

GARDEN CITY UNIVERSITY. Bachelor of Computer Applications SEMESTER- I. Course: CONCEPTS OF PROGRAMMING USING C LANGUAGE CODE: 05ABCAR17111 CREDITS: 04

SIR C R REDDY COLLEGE OF ENGINEERING

Government of Karnataka SYLLABUS FOR SECOND PUC - COMPUTER SCIENCE (41) SUB-UNITS

DISCRETE MATHEMATICS

CERTIFICATE IN WEB PROGRAMMING

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

Data Communications SYLLABUS. Transmission Impairments, Transmission Media. Data-Digital Signals, Analog Data-analog Signals.

M.C.A. FIRST YEAR DEGREE

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

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

KENDRIYA VIDYALAYA SANGATHAN

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

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

Telecommunications II TEL 202 Spring, 2004

TIME SCHEDULE. 2 Physical Layer 15. Course General Outcomes: Sl. G.O On completion of this course the student will be able :

LOGIC AND DISCRETE MATHEMATICS

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. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Time : 03 Hours Maximum Marks : 75

Object Oriented Programming

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

UNIT - IV Ques.4 Ques.5

Data and Computer Communications Chapter 1 Data Communications, Data Networks, and the Internet

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

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

Objectives. Learn how computers are connected. Become familiar with different types of transmission media

COURSE OUTLINE. School of Engineering Technology and Applied Science. Computer Systems & Network Technology / Technician

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

DATA COMMUNICATIONS AND DISTRIBUTED NETWORKS

Syllabus Under Autonomy Mathematics

Electrical and Computer Engineering Technology

Week. Lecture Topic day (including assignment/test) 1 st 1 st Introduction to Module 1 st. Practical

COURSE SPECIFICATION


KENDRIYA VIDYALAYA SANGATHAN

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

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

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

School of Distance Education University of Kerala M.Sc Computer Science Assignment Topics

COURSE OUTCOMES OF M.Sc(IT)

Design and implement a program to solve a real-world problem using the language idioms, data structures,, and standard library.

HIGHER SECONDARY EDUCATION CATEGORY NO. 111/2010 & 69/2010 (NCA- LC)

OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS

Sri Satya Sai University of Technology & Medical Sciences, Sehore (M.P.)

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 business? 2) Define computer? Explain the Block Diagram of computer with a neat diagram?

CS/IT DIGITAL LOGIC DESIGN

Module 1. Introduction. Version 2, CSE IIT, Kharagpur

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

DCN Questions CHAPTER 1:- NETWORKING FUNDAMENTALS

Telecommunications Engineering Course Descriptions

Rizvi College of Arts, Science & Commerce Bandra (W), Mumbai Teaching Plan Academic Year

First Semester First August to 31 st January. Second Semester First February to 31 st July. COURSE STRUCTURE

5. Give any three parts of the structure of business letter.

Duration: 2 hours Max. Marks: 60

Big Java Late Objects

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

Network Technology and Data Communications

Program Title: Telecommunication Engineering Technology Postsecondary Number: (AS) (AAS

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

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

Communications and Networking 1


University of Southern California EE450: Introduction to Computer Networks

DE 6456 DISTANCE EDUCATION. M.Sc. (Software Engineering) (5 Years Integrated) DEGREE EXAMINATION, MAY DIGITAL COMPUTER FUNDAMENTALS

Summary of Course Coverage

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

LIST OF EXPERIMENTS. (1) (Office Automation)

B.Sc. Computer Science (Ancillary)

Previous Year Questions

Lesson Plan (Odd Semester) Name of the Faculty: Rakesh Gupta

CGS 2405 Advanced Programming with C++ Course Justification

Time : 3 hours. Full Marks : 75. Own words as far as practicable. The questions are of equal value. Answer any five questions.

Syllabus for Third Semester OPERATING SYSTEM

Data Communications and Networks Spring Syllabus and Reading Assignments

Gòej ØeosMe jepeef<e& šc[ve cegòeâ efjemjeefjeåeeueùe, Fueeneyeeo

Preface... 1 The Boost C++ Libraries Overview... 5 Math Toolkit: Special Functions Math Toolkit: Orthogonal Functions... 29

CONTENTS Equivalence Classes Partition Intersection of Equivalence Relations Example Example Isomorphis

(3 Hours) N.B. (1) Question No. 1 is compulsory. (2) Attempt any four from the remaining six questions. (3) Figures to the right indicate full marks.

JAIPUR NATIONAL UNIVERSITY, JAIPUR

Problem solving using standard programming techniques and Turbo C compiler.

B.Sc II Year Computer Science (Optional)

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

r=1 The Binomial Theorem. 4 MA095/98G Revision

About the Author. Dependency Chart. Chapter 1: Logic and Sets 1. Chapter 2: Relations and Functions, Boolean Algebra, and Circuit Design

Madhya Pradesh Bhoj (Open) University, Bhopal

Transcription:

NOTICE DATED: 02.02.2017 The syllabus for conducting Written Test [Multiple Choice Questions (MCQs)] in Information Technology for the posts of Lecturer (10+2) in School Education Department is notified for the information of the concerned candidates as under: Database System SUBJECT: INFORMATION TECHNOLOGY Database System Applications, Purpose of Database Systems, View of data, Database Languages, Relational Databases, database Architecture, Database Models and comparison, relation Algebra, ER Model, CODDS Rules, Normalisation. Introduction to SQL, Data types, Data Definition Language, Data Manipulation Language, Transaction Control language, Integrity Constraints, SQL Functions, Set Operators and Joins, View, Synonym and Index, Sub Queries and Database Objects, Locks and SQL Formatting Commands. Introduction to PLSQL, Architecture, Data Types, Control Structure, Concept of Error Handling, Cursors and Database Triggers, Subprogram and Packages. Data Storage and Querying using various storage structures, Indexing and Hashing, Query Processing and Optimization, Transaction Management Concepts, Concurrency Control and Recovery. Programming with C/C++ Arrays: Declarations; initialisation; 2-dimensional and 3-dimensional array, passing array to function, strings and string functions and character arrays. Pointers: variables, swapping data, swapping address v/s data, misuse of address operators, pointers and arrays, pointers to pointers, strings, pointer arithmetic, additional operators, portability, pointers to functions, using pointers with arrays, void pointers. Structures and unions: Syntax and use, members, structures as function arguments, structure pointers, array of structures as arguments, passing array of structure members, call by reference.

Functions, prototype, passing parameters, storage classes, identifier visibility. Recursive functions, Command line arguments. Scope rules, Multi-file programming, Introduction to macros. File processing in C and C++, Introduction to graphics, graphic initialisation, graphic modes, drivers, basic drawing functions. Animations concept and implementation, Building graphical user interface. Introduction to classes and objects; Constructor; destructor; operator overloading; Function overloading; function overriding; friend function; copy constructor; Inheritance; Single, Static binding; Virtual functions; Pure virtual function; concrete implementation of virtual functions; Dynamic binding call mechanism; Implementation of polymorphism; virtual destructors. Templates: Function Templates, Class Templates, Class Templates, Member Function Template and Template Arguments, Exception Handling, Standard Template Library. Operating System: Overview of an Operating System, Resource Management, Operating System Interface, Process Management Concepts, Inter-Process Communication, Process Scheduling, Synchronisation, Deadlocks. Memory Management, Linking, Loading, Memory Allocation, design Issues and Problems, Virtual Memory, Fragmentation, implementing Virtual Memory, paging, Segmentation, Virtual Memory Design Techniques, Buffering Techniques, Spooling. File Management: File Systems and I/O, Device Drivers, Access Strategies, File Systems, File System Organisation, Design techniques, Multiprocessor System, Types of Multiprocessor Operating Systems, Design and Implementation Issues. Unix/Linux Operating Systems, Users View, Design Principles, Implementation, Process Management, Memory Management, File System, I/O System. Pervasive Computing: Technologies: Past, Present, Future, Pervasive Computing, The Pervasive Computing Market, m-business, Conclusion and Challenges, Future, Application Examples, Device Technology: Hardware, Human-machine interfaces, Biometrics, Operating Systems, Java for Pervasive devices, Device connectivity: Protocols, Security, Device Management, Web Application Concepts: History of World Wide Web, World Wide Web Architecture, Protocols, Transcoding, Client Authentication via the Internet.

WAP: Introduction, Components of the WAP architecture, WAP infrastructure, WAP Security issues, Wireless Markup Language, WAP Push, Products, i-mode, Voice Technology: Basic of Speech recognition, Voice standards, Speech Applications, Speech and pervasive computing, security, personal Digital Assistants: history, device Categories, PDA operating systems, Device characteristics, Software Components, Standards, Mobile Applications, PDA browsers. Architecture: Server Side Programming in Java, J2EE and overview, Servlets, Enterprise Java Beans, Java server pages, Extensible Markup Language, Web Services, Model-View- Controller Pattern, Pervasive web application architecture,: Background, scalability and availability, Development of pervasive computing web application, Pervasive application architecture. Example Application: Introduction, User Interface overview, Architecture, Implementation, Access from PCs, Smart card based authentication via the Internet, Ordering goods, Access via WAP: WAP functionality, implementation, Access from Personal Digital Assistants: Extending the example application to personal digital assistants, Implementation for synchronised devices for intermittently connected devices, for concerned devices, Access via voice: Extending the example application to voice access, Implementation. Data Communication: Bandwidth and Channel Capacity, Quantifying Channel Capacity for noiseless channel (Nyquist Law) and noisy channel (Shannon s Law), Example of a digital telephone system to explain basic concepts of analog signals, digital signals, sampling, Data Rate versus Baud rate, Nyquist Criterion for Sampling, data transmission concepts, Characteristics of signals (amplitude, frequency, period, wavelength, Signal to Noise ratio), Key components in data communication systems, Simplified model, Local Area Network (LAN) concepts and characteristics. Wide Area Network (WANs), WAN technologies (traditional packet and circuit switching, Frame Relay, ATM), ISD (narrowband) concepts and services. Overview of the OSI model, Transmission media-factors affecting distance and data rate. Guided transmission media, Twisted pair, Co-axial cable, Principles and advantages of optical networks, Types of optical fibers and lasers. Unguided transmission media: Terrestrial Microwave and Satellite Microwave systems and applications, Data encoding, Difference between modulation and encoding, NRZ-L, NRZ-I encoding, Multilevel Binary and biphase Coding techniques and their implementations, ASK, FSK, PSK AND QPSK, PCM concepts: Sampling, quantization, Delta Modulation, Amplitude Modulation.

Reliable transmission of data: Asynchronous and Synchronous transmission, error detection: Parity based, CRC-based, FCS computation, Error control and recovery techniques, Concept of ARQ standard and its versions, Concept of Multiplexing, FDM, synchronous and Statistical TDM. Discrete Mathematics Proposition, Logic, Truth tables, Proportional Equivalence, Predicates and quantifiers, Sets: operations on sets, Computer representation of sets, Functions: Domain, Range, One to One, Onto, Inverses and Composition, cardinality of a set. Sequences and summations. The growth of functions, Methods of Proof: Different methods of proof, Direct proof, Indirect Proof, mathematical Induction for Proving algorithms. Counting: Basic Counting principle, The Pigeon-Hole Principle, Permutation Combinations, repetitions, discrete probability, Advanced Counting Techniques: Inclusion-Exclusion, Applications of Inclusion-exclusion principle, recurrence relations, solving recurrence relation, Relations: Relations and their properties, Binary Relations, Equivalence relations, Diagraphs, matrix representation of relations and diagraph, Computer representation of relations and diagraphs, Transitive Closures, Warshall s Algorithm. Partially Ordered Sets (Posets), External elements of partially ordered sets, Hasse diagram of Partially ordered set, isomorphic ordered set, Lattices: properties of Lattices, Complemented Lattices, Graph Theory: Introduction to Graphs, Graph Terminology Weighted graphs, representing Graphs, Connectivity of Graphs: Paths and Circuits, Eularian and Hamiltonian Paths, Matrix representation of graphs, Graph coloring. Trees: Rooted trees, Application of trees: Binary Search Trees, Decision Trees, Prefix Codes, Tree traversal, trees and sorting, spanning trees, minimal spanning trees, Finite Boolean algebra, Function on Boolean algebra, Boolean functions as Boolean polynomials, Groups and applications: Subgroups, Semigroups, Monoids, Product and quotients of algebraic structures, Isomorphism, Homomorphism. Fundamentals of Grid and Cloud Computing FUNDAMENTAL OF GRID COMPUTING: The Grid Past, Present and Future Applications of Grid Computing Organisation and their Roles. GRID COMPUTING ARCHITECTURE: Grid Computing Anatomy next Generation of Grid Computing Initiatives Merging the Grid Services Architecture with Web Services Architecture.

Unit-II GRID COMPUTING TECHNOLOGIES OGSA Sample Use cases that drive OGSA Platform Components OGSI and WSRF OGSA Basic Services Security Standards for Grid Computing High Level Grid Services. FUNDAMENTALS OF CLOUD COMPUTING Fundamentals Short history of Cloud computing Cloud Architecture Cloud Storage Cloud Service Pros and Cons of cloud computing Benefits from cloud computing. CLOUD SERVICES Need for Web Based Application The cloud service development Cloud Service, Development Types Cloud Service development tools. Sd/- (Shakeel Ul Rehman) Secretary & Controller of Examinations No: PSC/DR/Syllabus/2016/ Dated: 02.02.2017 Copy to the: - 1. Director General, Information, J&K Government, Jammu for favour of getting the notice published in atleast two local leading English dailies of Jammu/Srinagar. 2. General Manager, Government Press, Jammu for publication of the notice in the next issue of the Government Gazette. 3. Deputy Secretary/Under Secretary, J&K Public Service Commission. 4. Private Secretary to Chairman, for information of the Hon ble Chairman. 5. Private Secretary to Member, for information of the Hon ble Member. 6. I/C Website for uploading the notice on website; 7. I/C Camp Office, Srinagar for pasting the notice on the Notice Board. 8. Main file/programme file.