KTU CS361 Soft Computing (SC) Notes

-

 


Notes on KTU CS361 Soft Computing (SC) are available....




Module


Syllabus
Quick Revision Notes
Module 1 Introduction to Soft Computing Artificial neural networks - biological neurons, Basic models of artificial neural networks – Connections, Learning, Activation Functions, McCulloch and Pitts Neuron, Hebb network. Click Here
Module 2 Perceptron networks – Learning rule – Training and testing algorithm, Adaptive Linear Neuron, Back propagation Network – Architecture, Training algorithm Click Here
Module 3 Fuzzy logic - fuzzy sets - properties - operations on fuzzy sets, fuzzy relations - operations on fuzzy relations Click Here
Module 4 Fuzzy membership functions, fuzzification, Methods of membership value assignments – intuition – inference – rank ordering, Lambda – cuts for fuzzy sets, Defuzzification methods Click Here
Module 5 Truth values and Tables in Fuzzy Logic, Fuzzy propositions, Formation of fuzzy rules - Decomposition of rules – Aggregation of rules, Fuzzy Inference Systems - Mamdani and Sugeno types, Neuro-fuzzy hybrid systems – characteristics - classification Click Here
Module 6 Introduction to genetic algorithm, operators in genetic algorithm - coding - selection - cross over – mutation, Stopping condition for genetic algorithm flow, Genetic-neuro hybrid systems, Genetic Fuzzy rule based system Click Here

Comments

Post a Comment

Popular posts from this blog

KTU CS304 Compiler Design S6 CS/IT

-
Video Classes are available                                       Click Here   for the Playlist All Previous University Question Papers Notes Module Syllabus Notes 1 Introduction to compilers – Analysis of the source program, Phases of a compiler, Grouping of phases, compiler writing tools – bootstrapping Lexical Analysis: The role of Lexical Analyzer, Input Buffering, Specification of Tokens using Regular Expressions, Review of Finite Automata, Recognition of Tokens. Click 2 Syntax Analysis: Review of Context-Free Grammars – Derivation trees and Parse Trees, Ambiguity. Top-Down Parsing: Recursive Descent parsing, Predictive parsing, LL(1) Grammars. Click 3 Bottom-Up Parsing: Shift Reduce parsing – Operator precedence parsing (Concepts only) LR parsing – Constructing SLR parsing tables, Constructing, ...
Read more

KTU CS332 Network Programming Lab Experiments for S6 CS students

-
Video Classes are available                                       Click Here   for the Playlist List of experiments Experiment No Syllabus PDF 1 Familiarization of Network Configuration Files and Operating System Calls Click 2 Familiarize and understand the use and functioning of System Calls used for Operating system and network programming in Linux Click 3 Processes and Threads Click 4 First Readers Writers Problem Click 5 Second Readers Writers Problem Click 6 Inter process Communication Click    7 Client Server Communication with Socket Programming with TCP Click    8 Client Server Communication with Socket Programming with UDP Click    ...
Read more

CS428 Blockchain Technologies - S8 CSE - Elective

-
Syllabus Textbook Module Syllabus PPT 1 Introduction to Cryptography, Symmetric cryptography – AES. Asymmetric cryptography – RSA. Elliptic curve cryptography, Digital signatures – RSA digital signature algorithms. Secure Hash Algorithms – SHA-256. Applications of cryptographic hash functions – Merkle trees, Distributed hash tables. Click 2 Blockchain – Definition, architecture, elements of blockchain, benefits and limitations, types of blockchain. Consensus – definition, types, consensus in blockchain. Decentralization – Decentralization using blockchain, Methods of decentralization, Routes to decentralization, Blockchain and full ecosystem decentralization. Click 3 Consensus Algorithms, Crash fault-tolerance (CFT) algorithms – Paxos, Raft. Byzantine fault- tolerance (BFT) algorithms – Practical Byzantine Fault Tolerance (PBFT), Proof of work (PoW), Proof of stake (PoS), Types of PoS. Bitcoin – ...
Read more