Important Topics for Semester 3 Exam [CS/AI-DS/AI-ML/CSE]

Important Topics for Semester 3 Exam [CS/AI-DS/AI-ML/CSE]

MATHS-3

1. Laplace Transform (L) of standard functions
2. First Shifting Theorem and Second Shifting Theorem
3. Inverse Laplace transform using the Convolution theorem
4. Partial fractions method to find Inverse Laplace transform.
5. Fourier series and Parseval’s Identity
6. Half range Sine and Cosine Series.
7. Analytic function
8. Cauchy-Riemann equations in Cartesian coordinates
9. Karl Pearson’s coefficient of correlation (r)
10. Spearman’s rank correlation coefficient (R)
11. Total Probability theorem and Bayes’ theorem.
12. A discrete and continuous random variable with a probability distribution and probability density function.

DSGT

1. Propositional Logic and Predicate Logic
2. Warshall’s algorithm
3. Equivalence relations and Equivalence Classes
4. Hasse Diagram
5. Types of Lattice and Poset
6. Inclusion-Exclusion Principle and Pigeonhole Principle
7. Abelian Group and Isomorphism
8. Binary information and error detection I Decoding and error correction
9. Cut Set and Cut Vertex
10. Euler and Hamiltonian Graphs

DTS

1. Types of Data Structures – Linear and Nonlinear
2. Infix to Postfix Conversion and Postfix Evaluation
3. Double Ended Queue, Circular Queue and Priority Queue,
4. Singly Linked List, Circular Linked List and Doubly Linked List,
5. Polynomial Representation and Addition.
6. Binary Search Tree and its Operations.
7. Applications of Binary Tree
8. B Tree and B+ Tree.
9. Graph Traversals – Depth First Search (DFS) and Breadth-First Search (BFS)
10. Topological Sorting.
11. Collision resolution Techniques

CG

1. Aliasing and Antialiasing
2. Cohen-Sutherland Line Clipping Algorithm
3. Liang-Barsky Line Clipping
4. Inside-Outside Test
5. Fractals
6. Koch Curve
7. Bezier Curve Properties
8. Flood Fill
9. DDA Algorithm
10. Raster and Random Scan
11. Midpoint Circle Algorithm
12. Bresenham Line Drawing Algorithm
13. 2D Rotation About Arbitrary Point
14. Area Subdivision Algorithm for Hidden Surface Removal

DLCOA

1. Octal, Binary, Hexadecimal
2. 1’s and 2’s Complement (Subtraction)
3. Von Neumann Model
4. Logic Gates
5. Instruction Cycle State Diagram
6. Multiply Using Booth’s Algorithm
7. Multiplexer and Demultiplexer
8. Hardwired vs. Microprogrammed Control Unit
9. Flynn’s Classification of Computer Architecture