? Important Topic Data Structures Franklin's Lectures
The document outlines a curriculum covering various computer science topics including algorithms, data structures, and sorting techniques. It details modules on frequency count, search algorithms, linked lists, trees, graphs, and sorting methods, along with their complexities and applications. Additionally, it provides information on admission procedures and contact details for inquiries.
? Important Topic Data Structures Franklin's Lectures
The document outlines a curriculum covering various computer science topics including algorithms, data structures, and sorting techniques. It details modules on frequency count, search algorithms, linked lists, trees, graphs, and sorting methods, along with their complexities and applications. Additionally, it provides information on admission procedures and contact details for inquiries.
STATEMENT IN A GIVEN CODE ASYMPTOTIC NOTATIONS –BIG –O , BIG-OMEGA , BIG – THETA , LITTLE –O , LITTLE –OMEGA ,LITTLE – THETA DERIVE BIG-O NOTATION FOR THE FUNCTION F(N) =N2+3N+2 OR PROVE FUNCTION F(N) =N2+3N+2 IS O(N2) SYSTEM LIFE CYCLE
CRITERIONS THAT AN ALGORITHM SHOULD SATISFY
SPACE COMPLEXITY AND TIME COMPLEXITY
BEST CASE ,WORST CASE AND AVERAGE
CASE COMPLEXITY MODULE 2 LINEAR SEARCH & BINARY SEARCH
POLYNOMIAL REPRESENTATION & ADDITION USING ARRAY
STACK USING ARRAY AND OPERATIONS-
PUSH,POP,TRAVERSAL QUEUE USING ARRAY AND OPERATIONS – ENQUEUE/INSERT,DEQUEUE/DELETE ,TRAVERSAL
OF POLYNOMIALS USING LINKED LIST DYNAMIC MEMRY ALLOCATION (CAN EXPLAIN USNIG FUNCTIONS IN C MALLOC(),CALLOC(),REALLOC(),FREE()) SINGLY LINKED LIST 1. CREATION, 2. INSERTION - BEFORE HEAD NODE, AFTER TAIL NODE , BETWEEN 2 NODES AFTER A PARTICULAR NODE DELETION - OF HEAD NODE, OF TAIL NODE, BETWEEN 2 NODES AFTER A PARTICULAR NODE TRAVERSAL - PRINTING VALUES, PRINTING THE TOTAL COUNT OF NODES, MERGING 2 LISTS DOUBLY LINKED LIST - CREATION, INSERTION - BEFORE HEAD NODE AFTER TAIL NODE - BETWEEN 2 NODES AFTER A PARTICULAR NODE DELETION - OF HEAD NODE OF TAIL NODE, BETWEEN 2 NODES, AFTER A PARTICULAR NODE TRAVERSAL - PRINTING VALUES, PRINTING THE TOTAL COUNT OF NODES, MERGING 2 LISTS CIRCULAR LISTS - CREATION, INSERTION, DELETION, TRAVERSAL
MEMORY ALLOCATION SCHEMES - BEST FIT, FIRST FIT, WORST FIT
MODULE 4 TREE AND TREMINOLOGIESI - ROOT, HEIGHT, LEVEL CHILD, DEGREE, SIBLINGS ETC
TREE IMPLEMENTATION USING ARRAY AND LINKED LIST
COMPLETE BINARY TREE AND FULL BINARY TREE
TREE TRAVERSAL – BFS – LEVEL ORDER, DFS- INORDER
PREORDER, POSTORDER BINARY SEARCH TREE - INSERTION, DELETION SEARCHING, TRAVERSAL GRAPHS - REPRESENTATION – ADJACENCY MATRIX LINKED LIST
I. DIVISION METHOD, II. MULTIPLICATION METHOD III. MID-SQUARE METHOD, IV. FOLDING METHOD C. COLLISION RESOLUTION TECHNIQUES(MAY CONTAIN PROBLEMS) I. CHAINING, II. OPEN ADDRESSING 1. LINEAR PROBING, 2. QUADRATIC PROBING, 3. DOUBLE HASHING CRASH BATCH 1 SUBJECT 1500/ ADMISSION PROCEDURE PAY FEES AMOUNT USING UPI ID 8893226994.eazypay@icici THEN SEND SCREENSHOT TO 9074 745 741 NOW YOU WILL BE ADDED FOR ENQUIRIES & ADMISSIONS 9074 745 741 VISIT OUR WEBSITE www.franklinslectures.in