Tractable and Untractable Problems: P, NP, NP complete and NP hard problems, examples of these problems like satisfy ability problems, vertex cover problem, Hamiltonian path problem, traveling sales man problem, Partition problem etc.
Short Notes on Data Communication, Operating System, DBMS, Computer Graphics & Multimedia, Theory of Computation, Micro Processor & Interfacing, Principles of Programming Languages, Software Engineering & Project Management, Computer Network, Advance Computer Architecture, Compiler Design, Distributed System, Cloud Computing, Information Storage & Management, Network & Web Security, Soft Computing, Web Engineering, Data mining & Knowledge Discovery and Wireless Network.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment