Scribd
Upload
74 views1 page

Syllabus For NIC Scientist Recruitment Test: Data Structures

This syllabus covers the following topics for the NIC Scientist Recruitment Test: 1) Data structures including abstract data types, stacks, queues, lists, sets, strings, trees, graphs, and binary search trees. 2) Programming concepts like C programming, control flow, functions, scope, binding, and object-oriented, functional, and logic programming. 3) Algorithms for problem solving including tree and graph traversals, sorting, searching, and design techniques like greedy algorithms, dynamic programming, and divide-and-conquer.

Uploaded by

Aditya Pratap Singh
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
74 views1 page

Syllabus For NIC Scientist Recruitment Test: Data Structures

This syllabus covers the following topics for the NIC Scientist Recruitment Test: 1) Data structures including abstract data types, stacks, queues, lists, sets, strings, trees, graphs, and binary search trees. 2) Programming concepts like C programming, control flow, functions, scope, binding, and object-oriented, functional, and logic programming. 3) Algorithms for problem solving including tree and graph traversals, sorting, searching, and design techniques like greedy algorithms, dynamic programming, and divide-and-conquer.

Uploaded by

Aditya Pratap Singh
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Syllabus for NIC Scientist Recruitment Test

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); 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 Interprocess communication, CPU scheduling, Memory management, File systems, I/Systems, Protection and security. Databases: Relational model (ER-model, relational algebra, tuplecalculus), Database design (integrity constraints, ormalforms), 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), TCPIUDP, IP, Basic concepts of switches, gateways, and routers COMPUTER HARDWARE Digital Logic: . Logic functions, Minimization, . Design and synthesis of Combinational and Sequential circuits; Number presentation . Computer Arithmetic (fixed and floating point); Computer Organization: . Machine instructions and addressing modes, ALU and Data-path,. Hardwired and microprogrammed control. Memory interface, I/O interface (Interrupt and DMA mode), Serial communication interface, Instruction pipelining, Cache, main and secondary storage.

You might also like