Pinned Repositories
Anandanaruvi's Repositories
Anandanaruvi/Implementation-of-CNN
Anandanaruvi/COLOR_CONVERSIONS_OF-IMAGE
Anandanaruvi/basic-nn-model
Anandanaruvi/Ex-3--AAI
Anandanaruvi/Ex2---AAI
Anandanaruvi/Ex1-AAI
Implementation of Bayesian Networks
Anandanaruvi/Implementation-of-SVM-For-Spam-Mail-Detection
Anandanaruvi/Implementation-of-Simple-Linear-Regression-Model-for-Predicting-the-Marks-Scored
Anandanaruvi/Windows-basic-commands-batchscript
Ex08-Windows-basic-commands-batchscript
Anandanaruvi/Linux-File-IO-Systems-locking
Ex07-Linux File-IO Systems-locking
Anandanaruvi/Implementation-of-Logistic-Regression-Model-to-Predict-the-Placement-Status-of-Student
Anandanaruvi/Ex-12-IMPLEMENTATION-OF-HEAP-STORAGE-ALLOCATION-STRATEGY
IMPLEMENTATION OF HEAP STORAGE ALLOCATION STRATEGY
Anandanaruvi/Ex-11-IMPLEMENTATION-OF-CALCULATOR-USING-LEX-AND-YACC-
IMPLEMENTATION OF CALCULATOR USING LEX AND YACC
Anandanaruvi/Ex-10-IMPLEMENTATION-OF-SIMPLE-CODE-OPTIMIZATION-TECHNIQUES
IMPLEMENTATION OF SIMPLE CODE OPTIMIZATION TECHNIQUES
Anandanaruvi/Ex-9-IMPLEMENTATION-OF-THE-BACK-END-OF-THE-COMPILER-
IMPLEMENTATION OF THE BACK END OF THE COMPILER
Anandanaruvi/Ex-8-RECOGNITION-OF-THE-GRAMMAR-anb-where-n-10-USING-YACC
RECOGNITION OF THE GRAMMAR(anb where n>=10) USING YACC
Anandanaruvi/Ex-7-GENERATION-OF-ABSTRACT-SYNTAX-TREE
CONVERSION OF THE BNF RULES INTO YACC FORM AND GENERATION OF ABSTRACT SYNTAX TREE
Anandanaruvi/Implementation-of-K-Means-Clustering-for-Customer-Segmentation
Anandanaruvi/-Implementation-of-Logistic-Regression-Using-Gradient-Descent
Anandanaruvi/19AI405ExpNo10
Anandanaruvi/19AI405ExpNo8
Anandanaruvi/19AI405ExpNo9
Anandanaruvi/Ex-6-LETTER-FOLLOWED-BY-ANY-NUMBER-OF-LETTERS-OR-DIGITS-USING-YACC-USING-YACC
RECOGNITION OF A VALID VARIABLE WHICH STARTS WITH A LETTER FOLLOWED BY ANY NUMBER OF LETTERS OR DIGITS USING YACC
Anandanaruvi/Ex-5-RECOGNITION-OF-A-VALID-ARITHMETIC-EXPRESSION-THAT-USES-OPERATOR---AND-USING-YACC
Anandanaruvi/Ex-4---GENERATION-OF-LEXICAL-TOKENS-LEX-FLEX-TOOL
Anandanaruvi/Ex-3-GENERATION-OF-LEXICAL-TOKENS-
Anandanaruvi/IMPLEMENTATION-OF-SYMBOL-TABLE-
Anandanaruvi/Ex-1-NFA-to-DFA
Exercise 1 - Conversion of Non-Deterministic Finite Automaton (NFA) To Deterministic Finite Automaton (DFA)
Anandanaruvi/19AI405ExpNo3
Anandanaruvi/19AI405ExpNo7