NIC Scientific Officer/ Engineer-SB (Programmer) SYLLABUS for 2009
Advertisement Details from NIC Official Website
National Informatics Centre (NIC), a premier IT Organization of Government of India invites young IT professionals to join its ranks for the post of Scientific Officer/Engineer-SB (Programmer) to take up challenging assignment in the domain of e-Governance.
No. of Vacancies: 265
NIC recruitment of Programmers - Important Dates
LAST DATE FOR RECEIPT OF APPLICATIONS: 21 days from the date of publication (03/01/2009) of this advertisement.
Written Exam: Feb 22, 2009
Personal Interview: Starting from Apr 9, 2009
Online Registration for the post of the Scientific Officer / Engineer-SB (Programmer), advertised vide Employment News dated 03/01/2009, was closed at 24:00 hrs on 23/01/2009
NOTE: THIS SYLLABUS IS BASED ON PERSONAL EXPERIENCE IN EXAM FOR SCIENTIFIC OFFICERS/PROGRAMMER-SB.
I am not guaranteeing that everything is correct as a lot of these Contents were collected from a variety of Sources. I’ve added some of my own to fill in some gaps.
SYLLABUS DETAILS
Data structures:
Notion of abstract data types, Stack, Queue, List, Set, String, Tree, Binary search tree, Heap, Graph;
Programming Methodology:
C programming, Program control (iteration, recursion, Functions), Scope, Binding, Parameter passing, Elementary concepts of Object oriented, Functional and Logic Programming;
Algorithms for problem solving:
Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching; Design techniques (Greedy, Dynamic Programming, Divide-and-conquer);
IMP: Analysis, design and algorithm CONCEPT:
concept of algorithm, component of algorithms, numerical algorithms, review of searching algorithm, review of sorting algorithm, recursion v/s iteration, introduction to graph theory, matrix representation, trees, divide & conquer : binary search, max – min search & merge sort, integer multiplication, cassete filling, knapsack problem, job schedoling, backtracking, branch & bound, shortest path, minimal spanning trees, technique for graphs.
Compiler Design:
Lexical analysis, Parsing, Syntax directed translation
Runtime environment, Code generation, Linking (static and dynamic);
Operating Systems: Classical concepts (concurrency, synchronization, deadlock), Processes, threads and Inter-process communication, CPU scheduling, Memory management, File systems, I/O systems, Protection and security.
Databases:
Database management system concepts, database system concept and architecture, Entity relationship and enhaned e-r relational data model and relational algebra, relational database design, query language-sql, normalization.
IMP: Relational model (ER-model, relational algebra, tuple calculus), Database design
(integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B+ trees), Transactions and concurrency control
Computer Networks:
ISO/OSI stack, sliding window protocol, LAN Technologies (Ethernet, Token ring), T C P/U D P, I P, Basic concepts of switches, gateways, and routers
IMP: Network Types and topologies: Network types, ethernet, Intranet and extranet, star ring and bus topology, SUBNET, network hardware, N. I. C, hubs, routers, swithes
Network APPLICATION: telnet, s m t p, p o p 3, f t p, p i ng, network services: D N S, W I N S Distributed comuting on networks (Distributed computing).
COMPUTER HARDWARE:
Digital Logic:
Logic functions, Minimization, Design and synthesis of Combinational and Sequential circuits; Number representation and Computer Arithmetic (fixed and floating point);
Computer Organization:
Machine instructions and addressing MODES, ALU and Data-PATH, hardwired and micro-programmed CONTROL, Memory interface, I/O interface (Interrupt and DMA mode), Serial communication interface, Instruction pipelining, Cache, main and secondary storage.
Posts
