cognitionis

OR: Lecture #40 on solving a problem having no feasible solution
OR: Lecture #40 on solving a problem having no feasible solution
OR: Lecture #39 on formulating a linear programming model for the given problem
OR: Lecture #39 on formulating a linear programming model for the given problem
OR: Lecture #38 on solving the given transportation problem
OR: Lecture #38 on solving the given transportation problem
SE: Lecture #23 on Basic, Intermediate & Complete COCOMO Model, Computer Aided Software Engineering
SE: Lecture #23 on Basic, Intermediate & Complete COCOMO Model, Computer Aided Software Engineering
SE: Lecture #22 on Heuristic Techniques, Halstead's Software Science, Basic COCOMO Model
SE: Lecture #22 on Heuristic Techniques, Halstead's Software Science, Basic COCOMO Model
OR: Lecture #37 on solving the given linear programming problem graphically to find the minimum cost
OR: Lecture #37 on solving the given linear programming problem graphically to find the minimum cost
OR: Lecture #36 on finding all the basic and basic feasible solutions of the given system
OR: Lecture #36 on finding all the basic and basic feasible solutions of the given system
SE: Lecture #21 on Line of Code, Function Point, Empirical Estimation, Expert Judgement and Delphi..
SE: Lecture #21 on Line of Code, Function Point, Empirical Estimation, Expert Judgement and Delphi..
OR: Lecture #35 on solving the given questions: how many types of lamps manufactured for best return
OR: Lecture #35 on solving the given questions: how many types of lamps manufactured for best return
OR: Lecture #34 on determining the event of deliveries from each of the factories from each factory
OR: Lecture #34 on determining the event of deliveries from each of the factories from each factory
SE: Lecture #20 on Debugging, Guidelines, Analysis Tools, Integration Testing
SE: Lecture #20 on Debugging, Guidelines, Analysis Tools, Integration Testing
OR: Lecture #33 on Primal and Dual, solving LPP by using its Dual
OR: Lecture #33 on Primal and Dual, solving LPP by using its Dual
OR: Lecture #32 on solving the given transportation problem
OR: Lecture #32 on solving the given transportation problem
SE: Lecture #19 on Boundary Value Analysis, White-Box Testing, CFG, Cyclomatic Complexity, Debugging
SE: Lecture #19 on Boundary Value Analysis, White-Box Testing, CFG, Cyclomatic Complexity, Debugging
OR: Lecture #31 on determining the optional transportation plan from the given table, Big-M method
OR: Lecture #31 on determining the optional transportation plan from the given table, Big-M method
OR: Lecture #30 on Unbalanced Transportation Problem, Degeneracy in Transportation Problem
OR: Lecture #30 on Unbalanced Transportation Problem, Degeneracy in Transportation Problem
SE: Lecture #18 on Black-box testing, Unit Testing, Equivalence Class Partitioning
SE: Lecture #18 on Black-box testing, Unit Testing, Equivalence Class Partitioning
SE: Lecture #17 on Code Walk Through, Code Inspection, Software Documentation, Program Testing
SE: Lecture #17 on Code Walk Through, Code Inspection, Software Documentation, Program Testing
OR: Lecture #29 on determining the optimal transportation plan for the given data
OR: Lecture #29 on determining the optimal transportation plan for the given data
OR: Lecture #28 on Canonical and Standard Form of Linear Programming Problem
OR: Lecture #28 on Canonical and Standard Form of Linear Programming Problem
SE: Lecture #16 on Coding: Standards and Guidelines, Code Review and Inspection
SE: Lecture #16 on Coding: Standards and Guidelines, Code Review and Inspection
OR: Lecture #27 on Computational procedure of optimal test, Transportation Algorithm
OR: Lecture #27 on Computational procedure of optimal test, Transportation Algorithm
SE: Lecture #15 on Activity and State chart diagram & Coding
SE: Lecture #15 on Activity and State chart diagram & Coding
OR: Lecture #26 on solving the transformation problem by Vogels method
OR: Lecture #26 on solving the transformation problem by Vogels method
SE: Lecture #14 on Interaction Diagrams, Sequence Diagram and Collaboration Diagram
SE: Lecture #14 on Interaction Diagrams, Sequence Diagram and Collaboration Diagram
OR: Lecture #25 on finding the Initial B.F.S of the following T.P by North-West Corner rule
OR: Lecture #25 on finding the Initial B.F.S of the following T.P by North-West Corner rule
DCN: Lecture #19 on Taxonomy of protocols, Stop-and-Wait protocol, Stop-and-Wait ARN, Go-Back-N ARN
DCN: Lecture #19 on Taxonomy of protocols, Stop-and-Wait protocol, Stop-and-Wait ARN, Go-Back-N ARN
OR: Lecture #24 on Solving transportation problem by lowest cost entry method
OR: Lecture #24 on Solving transportation problem by lowest cost entry method
OR: Lecture #23 on Feasible solution, Methods for finding the initial feasible solution
OR: Lecture #23 on Feasible solution, Methods for finding the initial feasible solution
SE: Lecture #13 on Class Diagrams
SE: Lecture #13 on Class Diagrams