Real Computer Science begins where we almost stop reading ...

The blog provides study material for Computer Science(CS) aspirants. Mostly says "material nahi milta, padhun kahan se.", I think If you can not find content on the Internet, then you are not a CS student. Dedicated to (Prof. Rakesh Kumar, DCSA, K.U.Kurukshetra, HARYANA, INDIA)- "Ek teacher ka bahut jyada padhna, bahut jyada jaroori hota hai."

Thursday, 13 June 2013

Reference Books on Fundamentals of Algorithms

  • Book-1 14.0 MB
  • Book-2 4.5 MB
  • Book-3 1MB
  • The Art of Computer Programming by D E Knuth  Volume I
  • The Art of Computer Programming by D E Knuth  Volume II
  • The Art of Computer Programming by D E Knuth  Volume III
  • The Art of Computer Programming by D E Knuth  Volume I-IV
Posted by Dr Girdhar Gopal at 6/13/2013 09:33:00 am
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: Complexity Analysis, Complexity Theory, Data Structure and Algorithms Design

No comments:

Post a Comment

Newer Post Older Post Home
View mobile version
Subscribe to: Post Comments (Atom)

Followers

Kitchen Ware

Shop Now

Books

Shop Now

Laptops

Shop Now

Mobiles

Shop Now

Popular Posts

  • Software Design Coupling/Cohesion in Software Engineering
    Software Design Software design is a creative process, just like designing anything else To see a wrong design, we can...
  • Operating System GATE Questions
    1. Which of the following is NOT a valid deadlock prevention scheme? (GATE CS 2000) (a) Release all resources before requesting a new reso...
  • Bit Stuffing and Byte Stuffing
    BYTE and BIT Stuffing While sending data over network, the data link layer divide into frames. Framing have several advantages than send...
  • GATE Questions for Data Structures and Algorithms
    Following questions have been asked in GATE CS exam 1. Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, ...
  • Brilliant Tutorials GATE Study Materials
    Following are four sets of study materials: http://www.ziddu.com/download/10763952/GATEMETIRAL2010CSESET-1.pdf.html http://www.ziddu...
  • Image Processing
    1. The process of extracting information from the image is called as a) Image enhancement b) Image restoration c) Image Analysis d)Imag...
  • Notes for UGC NET Computer Science
    Hello Friends/CS Aspirants, Here I will be Posting study material for Computer Science , So If u need them, Feel Free to Ask , Simply Pos...
  • UGC NET DEC 2012 PAPER-III
    1. Eco s ystem is a Frame work for (A) Building a Comput er S ystem (B) Building Internet Market (C) Building Offline Market (D)...
  • Compiler Design Gate Questions
    1. Which of the following derivations does a top-down parser use while parsing an input string? The input is assumed to be scanned in lef...
  • Database Management Systems GATE Questions
    1. Given the relations employee (name, salary, deptno) and department (deptno, deptname, address) Which of the following queries cann...

Search This Blog

Links

  • Home
  • My Archives
  • KUK Ph.D Form

URL to visit

  • My Google Scholar Profile
  • IIT Lectures
  • UGC-NET
  • Kurukshetra University
  • My Phone Number on Google

Translate

Myself

Dr Girdhar Gopal
View my complete profile

ORCID

ORCID iD iconorcid.org/0000-0002-7699-3403

Total Pageviews

Inspiring Quotes

An inspiring quote may be just what you need to turn your day around. Here are some of the most inspiring quotes ever spoken or written.

I hated every minute of training, but I said, “Don’t quit. Suffer now and live the rest of your life as a champion.”

–Muhammad Ali

“You can have anything you want if you are willing to give up the belief that you can’t have it.”
–Robert Anthony

“There is no man living that can not do more than he thinks he can.”

–Henry Ford

“The best way to predict the future is to create it.”

–Dr. Forrest C. Shaklee

“It’s not about time, it’s about choices. How are you spending your choices?”

–Beverly Adamo

“Success…seems to be connected with action. Successful people keep moving. They make mistakes, but they don’t quit.”
–Conrad Hilton

“Destiny is not a matter of chance; it’s a matter of choice.”

–Anonymous

“The future belongs to those who believe in the beauty of their dreams.”
–Eleanor Roosevelt

“The quality of a person’s life is in direct proportion to their commitment to excellence, regardless of their chosen field of endeavor.”
–Vince Lombardi

“It is never too late to be what you might have been.”
–George Eliot

“Do not let what you can not do; interfere with what you can do.”
–John Wooden

“One man with courage makes a majority.”
–Andrew Jackson

“Failure is the opportunity to begin again more intelligently.”
–Henry Ford

“Try not to become a man of success but rather try to become a man of value.”
–Albert Einstein

“The mind is its own place, and in itself can make a heaven of Hell, a hell of Heaven.”

–John Milton

"If u are student, working and preparing give a little extra effort after regular work. A small sacrifice of TV time, fun time, or facebook time can bring a lot of better things to life than you ever imagined."

-- Naam likhna jaroori nai samajhta.

Thank you for reading, be sure to pass this along!

SQL joins

SQL joins

Success

Success

TEACHER

TEACHER

Story

Story

Nothing feeling

Nothing feeling

All Posts

  • ►  2018 (1)
    • ►  July (1)
  • ►  2017 (5)
    • ►  November (2)
    • ►  January (3)
  • ►  2016 (4)
    • ►  October (2)
    • ►  July (2)
  • ►  2015 (11)
    • ►  December (4)
    • ►  September (1)
    • ►  August (1)
    • ►  June (4)
    • ►  January (1)
  • ►  2014 (72)
    • ►  December (1)
    • ►  November (1)
    • ►  July (1)
    • ►  June (1)
    • ►  May (5)
    • ►  April (12)
    • ►  March (20)
    • ►  February (11)
    • ►  January (20)
  • ▼  2013 (687)
    • ►  December (29)
    • ►  November (16)
    • ►  October (96)
    • ►  September (48)
    • ►  August (22)
    • ►  July (33)
    • ▼  June (188)
      • UGC JRF+NET JUNE 2013 Paper-III
      • FD and Normal Form Calculation
      • Big-O Notation Part-2
      • Big-O Notation a small and simple explanation
      • Complexities an birds eye
      • Sorting Algorithms
      • Trees and their Complexities
      • The Halting Problem
      • CFL closure properties
      • Pumping Lemma for Context Free Languages
      • CYK algorithm for CFG's
      • Turing Machine Model
      • Push Down Automata, PDA, NPDA
      • Inherently ambiguous CFL's
      • BNF Backus-Naur Form
      • Greibach Normal Form
      • Chomsky Normal Form
      • Context Free Grammars, CFG
      • Myhill-Nerode Minimization
      • Decision algorithms and review
      • Intersection and other closures
      • Pumping Lemma for Regular Languages
      • Convert NFA to regular expression
      • Construction: machine from regular expression
      • NFA with epsilon moves
      • Nondeterministic Finite Automata, NFA
      • DFA and regular expressions
      • NPDA to CFG/CFL
      • CFG/CFL to NPDA
      • Grammar Definitions
      • Definitions of computable
      • Automata Definitions
      • Formal Language Definitions
      • Complexity Class Brief Definitions
      • Mutex vs. Semaphore, what is the difference?
      • Anatomy of a Program in Memory
      • I/O types and performance
      • Virtual Memory
      • Cache Memory
      • Pipeline Hazard and Stalls
      • Pipelining
      • Arithmetic
      • CPU Operation
      • Processor Performance
      • Architecture Benchmarks
      • Programming Languages
      • Three O(n2 ) Sorting Algorithms
      • Constructor
      • AVL Trees
      • Binary Search Trees
      • Rooted Trees
      • C++ : Inheritence
      • Splay Trees
      • Selecting a page size
      • Regular Expression and Finite Automata
      • Pumping Lemma for Regular Languages
      • Minimum Spanning Tree - True or False
      • Automata Theorems
      • Turing Machine ( True or False )
      • Recurrence relations
      • Round robin scheduling questions
      • Memory management questions
      • NP completeness
      • Find Two Numbers in an Array that Sum to a Particu...
      • Sorting Revisited
      • Linking, Loading, Virtual Memory
      • Relational Algebra, Functional Dependency, Normali...
      • Probability a short Note
      • Network Routing
      • Heap Datastructure
      • Dynamic Programming - LCS, Matrix Chain, Optimal B...
      • Process Synchronization
      • Process Scheduling
      • B tree, B+ tree
      • Concurrency Control in Database
      • Database Concurrency Protocols
      • Cache memory - Direct mapped, Set Associative, Ass...
      • Graph Theory
      • Number representations - IEEE floating point, 2's ...
      • Multilevel index - Blocking factor
      • Paging, Swaping, Partitioning
      • Regular, CFG, Recursive languages
      • Instruction Pipeline and CPU Performance
      • Bottom-Up Parsing
      • Building Top-Down Parsers
      • Top-down Parsing and LL(1) Languages
      • Recursive Descent Parsing
      • Minimizing Finite Automata
      • General Branch and Bound Method
      • Intelligent Solution Space Enumeration
      • Upper Bounds on Integer Programs
      • Cutting Plane Techniques
      • Transition to Integer Solutions
      • Linear Programming
      • Shortest Path Problem
      • Bounds for Heuristics
      • General Techniques in Local Search
      • Local Improvement
      • Divide and Conquer
      • Greedy Method
    • ►  May (18)
    • ►  April (17)
    • ►  March (60)
    • ►  February (48)
    • ►  January (112)
  • ►  2012 (26)
    • ►  December (26)

Labels

Advanced Computer Architectures (26) Animation (5) Apache (1) Artificial Intelligence (3) Automata (3) Big Data (1) Binary Search Trees (1) Books and Notes (36) C Language (35) C Programming (38) C++ (11) CBSE NET (18) Compiler Design (9) Complexity Analysis (65) Complexity Theory (111) Computer Architecture (48) Computer Fundamentals (20) Computer Graphics (29) Computer Networks (24) Computer Organization (55) Cryptography (1) Data Mining (3) Data Structure and Algorithms Design (58) Database (16) Database Management Systems (17) DBMS (12) Dependable Systems (8) Digital Hardware Systems (1) Digital Image Processing (4) Digital Signal Processing (2) Discrete Mathmetics (13) Evolutionary Algorithms (1) Family of Circuits (1) Fortran (1) Fuzzy Sets (3) GATE (6) Google (4) Graph (3) HTML (1) Humor (6) Images and Compression (5) Information and Network Security (1) Information Theory and Coding (12) Inspiration (2) Interview Questions (4) JAVA (3) Logic Functions and Switches (1) MATLAB (20) MATrix LABoratory (20) MCQ (12) Microprocessor (6) Mobile Computing (1) Multimedia (1) MySQL (1) Network Programming Lab (1) Networking (7) Neural Networks (1) NoSQL Databases (2) Object Oriented Modeling and Design (4) Operating Systems (56) Operations Research (9) Optimization Problems (1) Ph.D. (1) PHP (1) Programming Language Paradigms (14) Programming the Web (2) Quality Assurance and Reliability (1) Research papers (1) Semaphores (1) Soft Skills (1) Software Architectures (3) Software Engineering (17) Software Testing (7) Storage Structures (1) System Software (1) Theory Of Computation (76) Theory of Computer Science (76) TOC (35) TOC By Kamala Krithivasan IITM (19) Traveling Salesman Problem (1) Tree (2) TSP (1) Ubuntu (1) UGC-NET JRF (44) UML (2) Unix and Shell Programming (2) Use Case Diagrams (1) Visual Programming (2) WEB Engineering Topics (18)

Contact Form

Name

Email *

Message *

जो यह प़ढै हनुमान चालीसा । होय सिद्धि साखी गौरीसा ॥
तुलसी दास सदा हरि चेरा । कीजै नाथ ह्रदय महँ डेरा ॥
बिस्व भरन पोषन कर जोई। ताकर नाम भरत अस होई।।
जाके सुमिरन तें रिपु नासा। नाम सत्रुहन बेद प्रकासा।।
बंदऊँ गुरु पद पदुम परागा । सुरुचि सुबास सरस अनुरागा ॥
श्रीगुरु पद नख मनि गन जोती । सुमिरत दिब्य दृष्टि हियँ होती ॥
- मोरारी बापु, मानस मोक्ष

(Suggestion and feedback regarding blog please mail me on girdhar.gopal@gmail.com/+919896482704)

नारायण! नारायण!! नारायण!!! नारायण!!! नारायण!!!
हे नाथ ! हे मेरे नाथ !! मैं आपको भूलूँ नहीं ! −श्रद्धेय श्रीस्वामीजी महाराज. Simple theme. Theme images by konradlew. Powered by Blogger.