Professional Knowledge Syllabus for IBPS SO IT Officer 2018

Today, we are sharing the detailed Professional Knowledge Syllabus for IT-Officer Exam 2017-18 in this post. You can now go through the topic-wise details of the syllabus of IBPS SO I.T. Officer exam 2017-18. As per the changed pattern of IBPS SO 2017, the mains phase would comprise of just the questions from Professional Knowledge section. Hence, a clear idea of the IBPS SO IT-Officer Professional Knowledge Syllabus becomes imperative for the students preparing for this exam.

Going back to education /professional knowledge/degree books can help you to re-evaluate, revitalize and find your passion in what it is you are doing. Make yourself a career plan and work out where you’re heading — and what you will need to get yourself there. Seize opportunities and be proactive. 

IBPS SO IT Officer Professional Knowledge Syllabus

1. DATABASE MANAGEMENT SYSTEM ( Most Important and Max question)

Unit 1 – Basic Database concepts: 

♦ Database Management System

♦ File-Based Data Management – Disadvantages of file system

♦ Database systems – Need for Database, Advantages of using a database

♦ Characteristics of data in a database – Functions of DBMS, Components of a database, Comparison between Database and file-processing systems

♦ Data dictionary – Data abstraction, Data independence – Logical and Physical data independence

♦ Architecture: Overall Architecture of DBMS.

Three level architecture.

Data Models: Hierarchical, Networking, Relational Data Models – E-R Model – E-R Diagrams – EER Model – Advantages and Disadvantages of each model

♦ Advanced Concepts: Introduction to Data warehousing and Data mining – Different types

♦ Client/Server Technology: Client – Server – Distributed and Co-operative processing – Peer- to – Peer processing – Application components – Transaction management.

Unit – 2

♦ Relational Structure – Characteristics of Relational Database Model – CODD’s rules – Tables (Relations), Rows (Tuples), Domains, Attributes, Extension, Intention.

♦ Keys: Candidate Key, Primary Key, Foreign Key, Super Keys, Unique Keys.

♦ Data Constraints: Referential Integrity Constraints, Entity Integrity Constraints, Constraints like Primary key constraint, Unique, Check constraint strong Entity, Weak Entity.

♦ Normalization: Introduction – Purpose of Normalization – Definition of Functional Dependence ( FD) Relational database Design, – Normal forms: 1NF, 2NF, 3NF, BCNF, 4Nf and 5 NF.

♦ Database Administration: DBA Tasks – DBA Tools – User Privileges – Performance monitoring and tuning – Query tracing – Backup and Recovery

Unit – 3

♦ Introduction to SQL: Advantages of SQL – Invoking SQL*PLUS, The Oracle Data-types, Data Definition Language (DDL), Data Manipulation Language (DML), Data Control Language (DCL), Data Query Language ( DQL) and all related commands.

♦ Queries using Group by and Order by clause & Join: Querying a Single Table, Ordering results, Grouping the results, Joins, Types of Joins, Sub queries.

♦ Operators: Logical, Value, Syntax and Query expression operators – Set operators.

♦ Functions: Character, Arithmetic, Date and time, Group and Miscellaneous Functions, Commit, Rollback, Savepoint.

♦ Format models: Character, Numeric & Date Format models.

Unit – 4

♦ Views: Introduction – Advantages of views – The Create View Command, Updating Views, Views and Joins, Views and Sub queries – Dropping Views.

♦ Sequences: Creating Sequences, Altering Sequences, Dropping Sequences.

♦ Indexes: Index Types, Creating of an Index: Simple Unique and Composite Index, Dropping Indexes.

♦ Snapshots: Creating a Snapshot, Altering Snapshot, Dropping a Snapshot.

♦ Introduction to PL/SQL: The PL/SQL Syntax, The PL/SQL Block Structure, Fundamentals of PL/SQL, Advantages of PL/SQL data Types.

♦ Control Structure: Conditional Control, Iterative Control, Sequential Control.

Unit – 5

♦ Exception handling: Predefined Exception – User defined Exception.

♦ Cursors: Implicit and Explicit Cursors

♦ Procedures: Advantages – Creating – Executing and Deleting a Stored Procedure.

♦ Functions: Advantages – Creating – Executing and Deleting a Function.

♦ Database Triggers: Use of Database Triggers – How to apply database Triggers – Types of Triggers – Syntax for Creating Trigger – Deleting Trigger.

2. DATA COMMUNICATION AND NETWORKING (Most Important and Max question)

♦ Data Communication: Components of a data communication – Data flow: simplex – half duplex – full duplex; Networks – Definition – Network criteria – Types of Connections: Point to point – multipoint; Topologies: Star, Bus, Ring, Mesh, Hybrid – Advantages and Disadvantages of each topology.

♦ Types of Networks: LAN – MAN – WAN – CAN – HAN – Internet – Intranet –Extranet, Client-Server, Peer To Peer Networks.

♦ Transmission Media : Classification of transmission media – Guided – Twisted pair, Coaxial, Fiber optics; Unguided – Radio waves – Infrared – LOS – VSAT – cabling and standards

♦ Network devices: Features and concepts of Switches – Routers(Wired and Wireless) – Gateways.

♦ Network Models: Protocol definition – standards – OSI Model – layered architecture – functions of all layers..

♦ Data Link Layer: Framing & its methods, Flow Control, Error control. DLL Protocol, Piggybacking & Pipelining. MAC Sub layer, Media access control for LAN & WAN, collision, IEEE 802 standards for LAN & MAN & their comparison. Ethernet, Wireless LANs, Broadband Wireless, Bluetooth.

♦ Network Layer: Routing, Congestion Control Algorithms, IP protocol, IP Addresses, Comparative study of IPv4 & IPv6, Mobile IP.

♦ Transmission Control Protocol (TCP) – User Datagram Protocol, Data Traffic, Congestion Control and Quality of Service

♦ Network Security: Cryptography, Message Security, Digital Signature, User Authentication, Key Management, Security Protocols Internet,DNS,SMTP, FTP, HTTP, WWW, Virtual Terminal Protocol.

3. OPERATING SYSTEM

♦ Introduction to System Programs & Operating Systems, Buffering & Spooling, Types of Operating System.

♦ File concepts, access methods, free space managements, allocation methods, directory systems, protection, organization ,sharing & implementation issues, etc.

♦ Process: Concept, Process Control Blocks (PCB), Scheduling criteria Preemptive & non Preemptive process scheduling, Scheduling algorithms, algorithm evaluation, multiple processor scheduling, real time scheduling, threads, critical section problem, semaphores, and classical problems of synchronization, etc.

♦ Memory Hierarchy, logical and physical address space, swapping, contiguous and non-contiguous allocation, paging, segmentation, Concepts of virtual memory, Cache Memory Organization, demand paging, page replacement algorithms, allocation of frames, thrashing, demand segmentation.

♦ Distributed operating system:-Types, Design issues, File system, Remote file access, RPC, RMI, Distributed Shared Memory(DSM), Basic Concept of Parallel Processing & Concurrent Programming

♦ Security & threats protection: Security violation through Parameter, Computer Worms & Virus, Security Design Principle, Authentications, Protection Mechanisms.

4. SOFTWARE ENGINEERING

♦ The Software Product and Software Process Models, Software Process customization and improvement.

♦ Requirement Elicitation, Analysis, and Specification Functional and Non-functional requirements, Validation, Trace ability.

♦ Software Design, Architectural Design, User Interface Design, Function-oriented Design, SA/SD Component Based Design, Design Metrics.

♦ Software Analysis and Testing, Software Test Process, Testing Levels, Test Criteria, Test Case Design, Test Oracles, Test Techniques, Black-Box Testing, etc.

♦ Software Maintenance & Software Project Measurement: Software Configuration Management (SCM), Re-engineering, Reverse Engineering. Project Management Concepts, Feasilibility Analysis, Project and Process Planning, Resources Project Scheduling and Tracking, etc.

5. DATA STRUCTURE

♦ Introduction: Basic Terminology, Data types and its classification, Array Definition, Representation and Analysis of Arrays, Single and Multidimensional Arrays, etc.

♦ Stack, Array Implementation of stack, Linked Representation of Stack, Queue, Array and linked implementation of queues, Circular queues, D-queues and Priority Queues. Linked list, Generalized linked list.

♦ Trees: Basic terminology, Binary Trees, Complete Binary Tree, Extended Binary Trees, Array and Linked Representation of Binary trees, etc.

♦ Internal and External sorting ,Insertion Sort, Bubble Sort, selection sort Quick Sort, Merge Sort, Heap Sort, Radix sort, Searching & Hashing: Sequential search, binary search, Hash Table, Hash Functions, etc.

♦ Graphs: Introduction, Sequential Representations of Graphs, Adjacency Matrices, Traversal, Connected Component and Spanning Trees, Minimum Cost Spanning Trees.

6. COMPILER DESIGN

♦ Introduction to Compiler, Phases and passes, Bootstrapping, Implementation of lexical analyzers, LEX: lexical analyzer generator, Input buffering, Recognition of tokens, Error handling.

♦ Basic Parsing Techniques: Parsers, Shift reduce parsing, operator precedence parsing, top down parsing, predictive parsers, LR parsers , an automatic parser generator

♦ Syntax directed definitions, L-attributed definitions, Syntax directed Translators, Intermediate code, etc.

♦ Symbol Tables, Run-Time Administration, simple stack allocation scheme, storage allocation in block structured language, Code Optimization and Code Generation

♦ Parsing control statements, syntax diagrams, Error Recovery, Interpreting control statements, parsing programs, procedures and Functions.

7. COMPUTER ORGANIZATION AND MICROPROCESSOR

♦Computer System: Basic Computer Operation, Machine Instructions, Addressing Modes, DLX Architecture,

♦ Computer Configuration, Memory organization, Memory Architecture and Interface, DMA, Synchronization, etc.

♦ Microprocessor As A CPU– types of Microprocessor, Microcomputers, Computer Languages, Flags, Program Counter(PC), Stack Pointer, OPCode Format, etc.

♦ Input-output System.

8. OBJECT ORIENTED PROGRAMMING(OOPS)

♦General concept OOPS– Object, Classes, Data Abstraction, Encapsulation, Inheritance, Polymorphism, Methods and Messages, Dynamic Binding.

♦ Features, Advantages and Applications of OOPS

♦ Aggregation and Association, Generalization, Multiple Inheritance

♦ General concept OOPS– Object, Classes, Data Abstraction, Encapsulation, Inheritance, Polymorphism, Methods and Messages, Dynamic Binding.

♦ Features, Advantages and Applications of OOPS

♦ Aggregation and Association, Generalization, Multiple Inheritance

NOTE:- This Professional Knowledge syllabus is elongated with a purpose to make you all aware of the entire syllabus. It doesn’t mean to discourage you with such a tiresome syllabus.

 

Prep Smart, Score Better, Go Gradeup