Competence in Software Technology – CST Syllabus for I & D Level 2013
CST Syllabus for I & D Level 2013 : : CST Exam Date 2013  CST Eligibility 2013  CST Important Dates 2013  CST Syllabus for E Level 2013  CST Syllabus for G Level 2013
I. CST Syllabus for I Level Examination 2013
1. General Aptitude ( GA ) : Same as that for E Level
2. Computer Concepts ( CC ) : Same as that for E Level
3. Computer Programming in C ( CP ) :
Data Types, Expression Evaluation, Precedence Rules, Type Conversions, Sequential Structure, Selective Structure, Repetitive Structure, Functions ( including recursion ), Arrays, Pointers, Structures and Unions, Operations On Bits, File Processing, Pre – Processor.
The syntax assumed will be that of ANSI C. Approximately 20% of the questions will test the candidate’s knowledge of the syntactical structure of ‘C’. The remaining questions will test the candidate’s working knowledge and understanding of the ‘C’.
II. CST Syllabus for D Level Examination 2013
1. General Aptitude ( GA ) : Same as that for E Level
2. Computer Programming in C ( CP ) : Same as that for I Level
3. Computer Organization and Operating Systems ( CO ) :
Basic concepts in Computer Organization : Boolean Algebra, Number Systems – Binary, Octal and Hexadecimal, Fixed Point and Floating Point Number Representations.
Computer Structure – Von Neumann Architecture, System Bus, CPU instruction cycle, programmed I / O, interrupts and DMA, CPU registers, instruction formats and addressing modes.
Memory Organisation – Types and Hierarchy, Model Level Organization, Cache Memory Performance and Design issues such as Mapping, Replacement and Write Policies.
CPU Performance Enhancement – Basic idea of RISC and Pipelined Architectures.
Fundamentals of Operating System – OS Services and Components, Multitasking, Multiprogramming, Time sharing, Buffering, Spooling.
Process and Thread Management – Concept of Process and Threads, Process States, Process Management, Context Switching, User and Kernel Mode Switching, Interaction Between Processes and OS, Multithreading, User and Kernel Level Threads.
Concurrency Control – Concurrency and Race Conditions, Mutual Exclusion Requirements, Software and Hardware Solutions, Semaphores, Monitors, Classical IPC Problems and Solutions, Deadlocks – Characterization, Detection, Recovery, Avoidance and Prevention.
Memory Management – Memory Partitioning, Swapping, Paging, Segmentation, Virtual Memory, Page Replacement Algorithms
I / O – Interrupt Handlers, Device Drivers, Device Independent Software Subsystem.
File Systems – File Storage, Access Methods and Free Space Management.
Distributed Systems – Basics of Parallel, Networked and Distributed Systems.
Security – Need and Strategies for Security in Standalone and Networked Systems, Concept of Access Control List and Capabilities, Password and Encryption Schemes.
Unix Operating System – Basic Design Principles, Concepts of Kernel and Shell, Fundamentals of File System, Process Models and IPC Mechanisms.
4. Data Structures and Algorithms ( DS )
This paper does not assume an in depth knowledge of any particular programming language. If and when code segments are required to be given in questions, we will use a pseudo – language based on C / Java.
Abstract Data Types : Notion of abstract data types and data structures, simple data structures including arrays, stacks, queues and linked lists ( linear, circular and doubly – linked ).
Trees : Different types of trees including binary trees, complete binary trees, almost complete binary trees, binary search trees, balanced binary trees including AVL trees, heaps, multi – way search trees and B – trees. Insertion and deletion of nodes and traversal in each of these types of trees.
Graphs : Representations, directed and undirected graphs, notion of path, path finding algorithms, Dijkstra’s shortest – path algorithm, traversals and spanning trees, minimum spanning tree ( algorithms of Kruskal and Prim ), applications of graphs such as network flow problem and topological sort.
Algorithms : Order notation; notions of P, NP and NP complete problems, basics of algorithms design, different classes of algorithms.
The following algorithms and their complexity measures :

Bubble sort, quick sort, selection sort, insertion sort, shell sort, heap sort and merge sort.

Searching algorithms including sequential search, ordered table search, binary search and binary tree search.

Hashing ( hash collision, primary and secondary clustering, open addressing and chaining techniques, hash functions ).