CSE/DS-I
CSE/DS-II
AIML-I
AIML-II
CSE-III
CSE-IV
CSE-V
CSE-VI
AIML-VI
CSE-VII
CSE-VIII
LNCT University CSE Scheme For All Semester
Subscribe to:
Post Comments (Atom)
Popular Posts
-
Multistage Graph Problem This problem is solve by using dynamic programming method. Multistage Graph is a directed weighted graph. All ve... -
Here I am going to explain about 0/1 Knapsack problem using dynamic programming . We already know about what is knapsack problem ? in greed... -
⧭ Today we will discuss about the technique to find sequence of redundant bit in any message. Cyclic Redundancy Checker technique is us... -
Minimization of Finite Automata means minimize the number of states. Merge those states which are equivalent. When we say two states are equ... -
Dynamic Programming Let we discuss about dynamic programming.Dynamic programming is an optimisation technique and we know Greedy method is... -
Theory of Computation - TOC « Previous Next » 1. That finite automata which does not contain any amb...
-
Finite Automata with output is always deterministic. They are of two type: 1. Moore Machine 2. Mealy Machine Moore Machine : Moo...
-
CONTENTS DESCRIPTION SELECT DATA RETRIEVAL INSERT UPDATE DELETE DATA M...
-
INDEX ANALYSIS DESIGN OF ALGORITHM SNO TOPICS 1 Analysis Design of Algorithm (ADA) | Introduction 9 ...
Spiritual World
No comments:
Post a Comment