Competence in Software Technology Examination (CST) 2008 Syllabus


[intlink id=”competence-in-software-technology-examination-cst-2008-3″ type=”post”]Date & Time of CST 2008[/intlink] |
[intlink id=”competence-in-software-technology-examination-cst-2008-3″ type=”post”]CST 2008 Important Dates & Levels of Examination[/intlink] |
[intlink id=”competence-in-software-technology-examination-cst-2008-syllabus-3″ type=”post”]CST 2008 Eligibility Details [/intlink]|
[intlink id=”competence-in-software-technology-examination-cst-2008-syllabus-2″ type=”post”]CST 2008 Syllabus for E Level Exam[/intlink] |
[intlink id=”competence-in-software-technology-examination-cst-2008-syllabus” type=”post”]CST 2008 Syllabus for I & D Level Exam[/intlink] |
[intlink id=”competence-in-software-technology-examination-cst-2008-2″ type=”post”]Sales Centres for CST 2008 Brouchre[/intlink]

Competence in Software Technology Examination (CST) 2008 Syllabus

CST 2008 Syllabus for E Level Examination

General Aptitude (GA)

The main objective of this paper is to assess the general aptitude of the candidate to pursue a technical profession.

The questions in this paper will cover: logical reasoning, quantitative reasoning, visuo-spatial reasoning, high school mathematics, vocabulary, English comprehension and verbal ability. The test looks for a sound understanding of concepts and their applications rather than for rote memory and routine arithmetic skills. A good grasp of the following topics of high school mathematics (up to the 12th standard) will be useful:

Arithmetic: ratios and proportions, problems on time-work, distance-speed, percentage, etc.

Basic Set Theory and Functions: Set, relations and mappings.

Algebra: fundamental operations in algebra, expansion, factorization, simultaneous linear/quadratic equations, indices, logarithms, permutations and combinations.

Geometry: angles at a point and parallel lines, triangles, polygons, circles, geometric transformations (particularly similarity, rotation and reflection), areas.

Trigonometry: trigonometric ratios, problems on heights and distances.

Coordinate Geometry: rectangular Cartesian coordinates, equations of a line, mid-point, intersections etc., equations of a circle, distance formulae, simple geometric transformations such as translation, rotation, scaling.

Mensuration: areas, triangles and quadrilaterals, area and circumference of circles, volumes and surface areas of simple solids such as cubes, spheres, cylinders and cones.


Computer Concepts (CC)

Computer Basics: Organization of a computer, characteristics of a computer, Central Processing Unit (CPU), types of instructions in CPU, input/output devices, computer memory, primary memory and secondary memory, memory organization, backup devices.

Data Representation: Representation of characters, integers and fractions, binary and hexadecimal representations.

Binary Srithmetic: Addition, subtraction, division, multiplication, signed arithmetic and two’s complement arithmetic, floating point representation of numbers, normalized floating point representations.

Foundations: Boolean algebra, truth tables and Venn diagrams.

Computer Architecture: Block structure of computers, communication between processor and memory, communication between processor and I/O devices, interrupts, multiprogramming, and virtual memory.

Computer Languages: Assembly language and characteristics of high-level languages.

Operating System Basics: Multiprogramming and timesharing operating systems.

Programming using a subset of C: The candidate will not be required to write programs and there will not be any questions on syntax. But candidates should be able to read and understand programs involving the following: the assignment statement, blocks, the input-output statements (scanf and printf), relational and arithmetic operators, conditional statements and iterations.