C-TECH

A KTU Tution Channel for Computer Engineering Students

CCW- Comprehensive Course Work| PYQ Discussion |April 2025 |KTU S6 CSE| CST 308| Part 2| #ktu #2019
CCW- Comprehensive Course Work| PYQ Discussion |April 2025 |KTU S6 CSE| CST 308| Part 2| #ktu #2019
CCW- Comprehensive Course Work| PYQ Discussion |April 2025 |KTU S6 CSE| CST 308| Part 1| #ktu #2019
CCW- Comprehensive Course Work| PYQ Discussion |April 2025 |KTU S6 CSE| CST 308| Part 1| #ktu #2019
CCW Comprehensive Course Work|KTU S6 CSE|CST 308|Computer Organisation and Architecture|#ktu #2019
CCW Comprehensive Course Work|KTU S6 CSE|CST 308|Computer Organisation and Architecture|#ktu #2019
CCW Comprehensive Course Work|KTU S6 CSE|CST 308|Database Management System|#ktu #2019 scheme
CCW Comprehensive Course Work|KTU S6 CSE|CST 308|Database Management System|#ktu #2019 scheme
CCW Comprehensive Course Work|KTU S6 CSE|CST 308|Data Structure|#ktu #2019 scheme
CCW Comprehensive Course Work|KTU S6 CSE|CST 308|Data Structure|#ktu #2019 scheme
CCW Comprehensive Course Work|KTU S6 CSE|CST 308|Data Structure|Part 2|#ktu #2019 scheme|#cse
CCW Comprehensive Course Work|KTU S6 CSE|CST 308|Data Structure|Part 2|#ktu #2019 scheme|#cse
CCW Comprehensive Course Work|KTU S6 CSE|CST 308|Operating System| Part 1|#ktu #2019 Scheme #cse
CCW Comprehensive Course Work|KTU S6 CSE|CST 308|Operating System| Part 1|#ktu #2019 Scheme #cse
IEFT- Industrial Economics And Foreign Trade|HUT 300|KTU S5/S6 | Important Topics|#ktu #2019 scheme
IEFT- Industrial Economics And Foreign Trade|HUT 300|KTU S5/S6 | Important Topics|#ktu #2019 scheme
Programming In Python|CST 363|KTU S6 CSE|Important Questions|Part 5|#ktu #2019 scheme #python #cse
Programming In Python|CST 363|KTU S6 CSE|Important Questions|Part 5|#ktu #2019 scheme #python #cse
Programming In Python|CST 363|KTU S6 CSE|Important Questions|Part 4|#ktu #2019 scheme #python #cse
Programming In Python|CST 363|KTU S6 CSE|Important Questions|Part 4|#ktu #2019 scheme #python #cse
Programming In Python|CST 362|KTU S6 CSEImportant Questions|Part 3#python #ktu #2019 scheme #cse
Programming In Python|CST 362|KTU S6 CSEImportant Questions|Part 3#python #ktu #2019 scheme #cse
Programming In Python|CST 362|KTU S6 CSE|Important Questions|Part 2#python #ktu #2019 scheme #cse
Programming In Python|CST 362|KTU S6 CSE|Important Questions|Part 2#python #ktu #2019 scheme #cse
Programming In Python|CST 362|KTU S6 CSE|Important Questions|Part 1#python #ktu #2019 scheme #cse
Programming In Python|CST 362|KTU S6 CSE|Important Questions|Part 1#python #ktu #2019 scheme #cse
IMPORTANT TOPICS|AAD|Algorithms Analysis and Design|CST 306 | Part 19 #ktü #2019 scheme #important
IMPORTANT TOPICS|AAD|Algorithms Analysis and Design|CST 306 | Part 19 #ktü #2019 scheme #important
Graph Colouring|Module 5|AAD|KTU S6 CSE|CST 306|Part 18|#ktu #2019 scheme
Graph Colouring|Module 5|AAD|KTU S6 CSE|CST 306|Part 18|#ktu #2019 scheme
Bin Packing-Approximation Algorithm|Module 5|AAD|KTU S6 CSE|CST 306|Part 17|#ktu #2019 scheme
Bin Packing-Approximation Algorithm|Module 5|AAD|KTU S6 CSE|CST 306|Part 17|#ktu #2019 scheme
The N Queen's Problem|Module 4|AAD|KTU S6 CSE|CST 306|Part 16|#ktu #2019 scheme
The N Queen's Problem|Module 4|AAD|KTU S6 CSE|CST 306|Part 16|#ktu #2019 scheme
Matrix Chain Multiplication|Module 4|AAD|KTU S6 CSE|CST 306|Part 15|#ktu #2019 scheme
Matrix Chain Multiplication|Module 4|AAD|KTU S6 CSE|CST 306|Part 15|#ktu #2019 scheme
Floyd Warshall Algorithm|Module 4|AAD|KTU S6 CSE|CST 306|Part 14|#ktu #2019 scheme
Floyd Warshall Algorithm|Module 4|AAD|KTU S6 CSE|CST 306|Part 14|#ktu #2019 scheme
Strassen's Algorithm For Matrix Multiplication|Module 3|KTU S6 CSE|CST 306|Part 13|#ktu #2019 scheme
Strassen's Algorithm For Matrix Multiplication|Module 3|KTU S6 CSE|CST 306|Part 13|#ktu #2019 scheme
Dijkstra's Algorithm|Module 3|AAD|KTU S6 CSE|CST 306|Part 12|#ktu #2019 scheme
Dijkstra's Algorithm|Module 3|AAD|KTU S6 CSE|CST 306|Part 12|#ktu #2019 scheme
Kruskal's Algorithm|Module 3|AAD|KTU S6 CSE|CST 306|Part 11|#ktu #2019 scheme
Kruskal's Algorithm|Module 3|AAD|KTU S6 CSE|CST 306|Part 11|#ktu #2019 scheme
Fractional Knapsack Problem|Greedy Strategy|Module 3|AAD|KTU S6 CSE|CST 306|Part 10|#ktu #2019scheme
Fractional Knapsack Problem|Greedy Strategy|Module 3|AAD|KTU S6 CSE|CST 306|Part 10|#ktu #2019scheme
DFS Algorithm|Depth First Search |Module 2|AAD|KTU S6 CSE|CST 306|Part 9|#ktu #2019 scheme#cse
DFS Algorithm|Depth First Search |Module 2|AAD|KTU S6 CSE|CST 306|Part 9|#ktu #2019 scheme#cse
BFS Algorithm|Breadth First Search|Module 2|AAD|KTU S6 CSE|CST 306|Part 8|#ktu #2019 scheme#cse
BFS Algorithm|Breadth First Search|Module 2|AAD|KTU S6 CSE|CST 306|Part 8|#ktu #2019 scheme#cse
AVL Tree Rotation|Module2|AAD|Algorithm Analysis And Design|KTU S6 CSE|CST306|Part7|#ktu#2019 scheme
AVL Tree Rotation|Module2|AAD|Algorithm Analysis And Design|KTU S6 CSE|CST306|Part7|#ktu#2019 scheme
AVL Tree|Module 2|AAD|Algorithm Analysis And Design|KTU S6 CSE|CST 306|Part 6|#ktu #2019 scheme#cse
AVL Tree|Module 2|AAD|Algorithm Analysis And Design|KTU S6 CSE|CST 306|Part 6|#ktu #2019 scheme#cse
Master's Theorem|Recurrence Relations||Module 1|AAD|KTU S6 CSE|CST 306|Part 5|#ktu #2019 scheme#cse
Master's Theorem|Recurrence Relations||Module 1|AAD|KTU S6 CSE|CST 306|Part 5|#ktu #2019 scheme#cse
Recursion Tree Method|Recurrence Relations||Module 1|AAD|KTU S6 CSE|CST 306|Part4|#ktu #2019scheme
Recursion Tree Method|Recurrence Relations||Module 1|AAD|KTU S6 CSE|CST 306|Part4|#ktu #2019scheme
Recurrence Relation|Iteration Method|AAD|KTU S6 CSE|Module 1|Part 3|CST 306 #ktu #cse #2019 scheme
Recurrence Relation|Iteration Method|AAD|KTU S6 CSE|Module 1|Part 3|CST 306 #ktu #cse #2019 scheme