Scribd
Upload
81 views2 pages

CS Computer Science and Information Technology

This document outlines 10 sections that cover the key topics in computer science and information technology. These include engineering mathematics, digital logic, computer organization and architecture, programming and data structures, algorithms, theory of computation, compiler design, operating systems, databases, and computer networks. The sections cover topics such as discrete mathematics, linear algebra, calculus, probability, Boolean algebra, number representations, machine instructions, programming in C, data structures, algorithm analysis, regular expressions, processes, memory management, relational databases, layering, and networking protocols.

Uploaded by

profBalamurugan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
81 views2 pages

CS Computer Science and Information Technology

This document outlines 10 sections that cover the key topics in computer science and information technology. These include engineering mathematics, digital logic, computer organization and architecture, programming and data structures, algorithms, theory of computation, compiler design, operating systems, databases, and computer networks. The sections cover topics such as discrete mathematics, linear algebra, calculus, probability, Boolean algebra, number representations, machine instructions, programming in C, data structures, algorithm analysis, regular expressions, processes, memory management, relational databases, layering, and networking protocols.

Uploaded by

profBalamurugan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

CS Computer Science and Information Technology

Section1: Engineering Mathematics


Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, p artial
orders and lattices. Groups. Graphs: c onnectivity, m atching, c oloring. Com binatorics:
c ounting, recurrence relations, generating functions.

Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and


eigenvectors, LU dec om position.

Calculus: Limits, c ontinuity and differentiability. Maxim a and minim a. Mean value theorem.
Integration.

Probability: Random variables. Uniform, norm al, exponential, poisson and binomial
distributions. Mean, median, mode and stand ard deviation. Conditional probability and
Bayes theorem.

Computer Science and Information Technology

Section 2: Digital Logic


Boolean algebra. Co m binational and sequential circuits. Minimization. Num ber representations
and c om puter arithmetic (fixed and floating point).

Section 3: Computer Organization and Architecture


Ma chine instructions and a d dressing modes. ALU, d ata‐path and c ontrol unit. Instruction
pipelining. Memory hierarchy: c a che, m ain memory and sec ond ary stora ge; I / O
interfa ce (interrupt and DMA mode).

Section 4: Programming and Data Structures


Programming in C. Recursion. Arrays, sta cks, queues, linked lists, trees, binary search
trees, binary hea ps, graphs.

Section 5: Algorithms
Searching, sorting, hashing. Asym ptotic worst c ase time and spa ce c om plexity. Algorithm
design te chniques: gree dy, dynamic programming and divide‐and‐c onquer. Graph search,
minimum spanning trees, shortest paths.

Section 6: Theory of Computation


Regular expressions and finite autom ata. Context-free gramm ars and push-down
autom ata. Regular and c ontex-free languages, pum ping lemm a. Turing m a chines and
undecid ability.

Section 7: Compiler Design


Lexic al analysis, parsing, syntax-directed translation. Runtime environments. Intermediate
c ode generation.

Section 8: Operating System


Processes, threa ds, inter‐process c ommunic ation, c oncurrency and synchronization.
Dea dlock. CPU scheduling. Memory m anagem ent and virtual memory. File systems.

21 of 72
Section 9: Databases
ER‐model. Relational model: relational algebra, tuple c alculus, SQL. Integrity c onstraints,
norm al forms. File organization, indexing (e.g., B and B+ trees). Transa ctions and
c oncurrency c ontrol.

Section 10: Computer Networks


Concept of layering. LAN technologies (Ethernet). Flow and error c ontrol techniques,
switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP
and sockets, c ongestion c ontrol. Applic ation layer protoc ols (DNS, SMTP, POP, FTP, HTTP).
Basics of Wi-Fi. Network security: authentic ation, basics of public key and private key
cryptography, digital signatures and certific ates, firew alls.

22 of 72

You might also like