HSST Computer Science
HSST Computer Science
(Cat.No. : 417/2022)
(Total Marks- 100)
Marks distribution
Sl. No Topic/Module
1 Module I : MATHEMATICS for CSE (16 Marks)
Linear Algebra: Matrices, Rank, system of linear equations, consistency, eigen values, eigen vec-
tors, Cayley Hamilton theorem, diagonalisation, linear dependence and independence of vectors.
Basics of mathematical logic: Basic connectives and truth table, statements, logical connec-
tives, tautology, contradiction. logical equivalence, principle of duality, implication,
contrapositive, converse, inverse.
Counting Theory: Rule of sum, rule of product, permutations. combinations, binomial theo-
rem, combination with repetition, Pigeon hole principle, principle of inclusion and
exclusion.
Sets, Relations and Functions: Sets, relations, different types of relations, functions, different
types of functions.
Algebraic Structures: Homomorphism, isomorphism, semi groups, monoids, groups, commutative
groups, sub groups, Lengrange’s theorem, rings, fields.
Graph Theory: Graphs, subgraph, connectivity, independence sets, cliques, bipartite graphs, vertex
cover, vertex colouring, planar graphs, graph representations.
Digital Logic: Number representations and computer arithmetic (fixed and floating point), logic
functions, minimization, design and synthesis of combinational and sequential circuits.
Computer Organization: Machine instructions and addressing modes, control design, memory in-
terface, I/O interface, DMA, interrupts, pipelining, memory hierarchy - cache memory.
Programming in C: Data types, operators, type conversions, control statements, user defined func-
tions, arrays, pointers, structure and union, file operations.
Object Oriented Programming Concepts: classes and objects, data abstraction, data hiding, data
encapsulation, inheritance, polymorphism, abstract classes, interfaces, packages.
Databases: ER model, relational algebra, tuple calculus, database design, integrity constraints, nor-
malization, SQL, transactions and concurrency control.
Data Structures and Algorithms: Arrays, stacks, queues, linked lists, trees, binary search trees, bi-
nary heaps, graphs, searching and sorting algorithms.
Analysis and Design of Algorithms: Analysis - space and time complexity, Asymptotic Notations,
Design strategies - divide-and-conquer, greedy, dynamic programming, branch and bound, com-
plexity classes - P, NP, NP-hard, NP-complete.
Computer Networks: ISO/OSI reference model, TCP/IP model, flow control, error control, IPV4
header format, IPV4 addressing, IPV6 header format, routing algorithms, congestion control, con-
nection oriented and connectionless protocols in the transport layer, application layer protocols, net-
work devices,
Markup and Scripting Languages : HTML, Cascading Style Sheets, XML, Document
Object Model, JavaScript, JSON, AJAX.
Web Servers : Sockets and ports, HTTP transactions, Web server, Proxy server, Domain
Name Service, Client-side scripting versus server-side scripting, Multitier architecture.
Security – Basic Concepts : Risks and threats, Confidentiality, Integrity, Availability, Non-
repudiation, Passive and active attacks.
Cryptography : Symmetric key cryptography, 3DES, Public key cryptography, RSA, Se-
cure Hash Algorithms.
Tools for security : Multi-factor authentication, Digital certificate, Digital signature, Fire-
wall, Intrusion Detection System, Virtual Private Network, Kerberos.