Here you will get the material for computer IT and design and analysis related courses and tutorials . The materials for which you will get the PDF, DOC, PPT, RAR and ZIP files are UML, Merise, programming analysis, architecture design, database design and many others. As these tutorials are included in many of the academic schedules, you will need to get detailed information on them. As it will not possible for you to browse the web for every small topic, you can go for downloading the PDF files for having easy access to the information. Also tutorials, corrected exercises and practical work will make it easy for you to have a clear understanding of every topic.

Beginner Courses:

Aims and Learning Objectives

By the end of this document, you will be able to:

  • explain the three types of logical relationship that can be identified in database design and point out the only relationship that should be used in logical design;
  • explain how to resolve many-to-many relationships;
  • explain where primary and foreign keys must be located in any logical design;
  • capture data requirements from paper forms or spreadsheets;
  • draw simple data structure models with correctly-placed primary and foreign keys.



  • Code patterns
    • A short introduction to the CPU
    • The simplest Function, Hello, world!
    • Function prologue and epilogue
    • Stack, printf() with several arguments, scanf()
    • Accessing passed arguments, More about results returning
    • GOTO operator, Conditional jumps
    • switch()/case/default , Loops
    • Simple C-strings processing
    • Replacing arithmetic instructions to other ones , Arrays
    • Manipulating specific bit(s) , Linear congruential generator
    • Structures,,64-bit values in 32-bit environment
  • Important fundamentals
    • Signed number representations, Memory
  • Finding important/interesting stuff in the code
    • Communication with the outer world (win32)
    • Strings, Calls to assert() , Constants
    • Finding the right instructions
    • Suspicious code patterns
    • Using magic numbers while tracing


  • Preliminaries
    • Data Structures and Algorithms
    • Mathematical Preliminaries
    • Algorithm Analysis
  • Fundamental Data Structures
    • Lists, Stacks, and Queues
    • Binary Trees
    • Non-Binary Trees
  • Sorting and Searching
    • Internal Sorting
    • File Processing and External Sorting
    • Searching
    • Indexing
    • Advanced Data Structures
    • Graphs
    • Lists and Arrays Revisited
  • Advanced Tree Structures
  • Theory of Algorithms
    • Analysis Techniques
    • Lower Bounds
    • Patterns of Algorithms
    • Limits to Computation


………..webpage is under construction



Leave a comment

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s