KTU - CCW (cse) -IMPORTANT TOPICS

Added: 2026-05-12

[00:00:00]S6CS comprehensive course work in the important topics to discuss here. Within that five subjects are for all subjects 10 marks are the questions there.

[00:00:11]Over there first subject is data structures from that tree traversals.

[00:00:16]You will get a question on pre-order, in-order, or post-order. Learn how to construct a tree if given in-order plus one other traversal.

[00:00:24]Then binary search tree and AVL. Know how to insert elements and find the height of leaves. Know the rotations for AVL trees. Then heaps, understand time complexities insertion deletion of max or min is big of log n. Know how the array representation of a heap works.

[00:00:43]Then sorting complexities, memorize the best, average, and worst-case complexities of quick sort, merge sort, heap sort, and bubble sort. Then graph traversals, know that BFS uses a queue and DFS uses a stack. Know their time complexities. Then second subject, it is the operating system.

[00:01:04]In the CPU scheduling numericals for finding the average waiting time or turn-around time. Then memory management, paging. Learn the formulas to calculate the number of bits for page number and offset given virtual memory and page size. Then page replacement algorithms, practice finding the number of page faults using LRU and FIFO. Know that Belady's anomaly happens in FIFO.

[00:01:27]Then deadlock, memorize the four conditions for deadlock. Practice banker's algorithm. Then semaphores, simple numericals where a semaphore is initialized to X, then P and V operations occur. Then third subject, it is computer organization and architecture.

[00:01:45]Cache memory, you must know how to calculate tag, index, and offset bits for direct mapped and set associative caches. Then pipelining, learn how to calculate speed up. Know the difference between structural data and control hazards. Then instruction formats, questions like if instruction is 32 bits, opcode is 6 bits, how many registers? Just basic subtraction or addition of bits. Then addressing modes.

[00:02:10]Fourth subject is the database management systems, normalization.

[00:02:15]You will be given functional dependencies and asked to find the highest normal form. Learn to find the candidate key first. Then relational algebra and SQL. Know basic SQL commands. Understand what group by and having do. Then transaction and concurrency. Understand ACID properties.

[00:02:32]Know what a conflict serializable schedule is. Then indexing, B or B+ trees. Know how to find the maximum number of pointers or keys in a B+ tree node of order P. Then fifth subject, it is a formal languages and automata theory.

[00:02:48]Then from this, Chomsky hierarchy, then closure properties table, regular expressions, decidability, pumping lemma. Write down only formulas and tables. Time complexity stable for sorting or data structures. Then formulas for caching mapping and paging.

[00:03:05]Chomsky hierarchy and closure properties table, then normal form definitions.

[00:03:10]The ES subject number of PYQs will be equal to the number of but number of that are a question going to be similar right around questions going to be similar right around questions going to be similar right around questions going to be similar right around questions going to be similar right around questions going to be similar right around questions going to be similar right around questions going to be similar right around questions going to be similar right around questions going to be similar right around questions going to be similar right around questions going to be similar right around questions going to be similar right around questions going to be going to be going to be Okay, PYQs PYQs going to be additional right around questions going to be additional right around questions going to be additional right around questions going to