Worth A Look
  • We are using Antivirus??But do u know how does it work??? Here we are talking about the core of antivirus program i.e. it’s engine. The basic building blocks of an antivirus program are : Engine Core File System Interface Memory Scanner Emulators Update mechanism The Engine core is the framework that keeps the entire software together. In essence it acts as the ‘glue’ and calls the external module  when required. Usually scan engine frameworks already are there in place such as the Exchange antivirus Protection, that use various scan engines from various vendors, which directly called out to the framework....0February 20, 2013

    How Does an Antivirus engine work? | Antivirus Engine

    We are using Antivirus??But do u know how does it work??? Here we are talking about the core of antivirus program i.e. it’s engine. The basic building blocks of an antivirus program are : Engine Core File System Interface Memory Scanner Emulators Update mechanism The Engine core is the framework that keeps the entire software together. In essence it acts as the ‘glue’ and calls the external module  when required. Usually scan engine frameworks already are there in place such as the Exchange antivirus Protection, that use various scan engines from various vendors, which directly called out to the framework….

    AIMAOL MailDeliciousBlogger PostFacebookBox.netDiggDailyMeGoogle BuzzGoogle BookmarksGoogle GmailHotmailMySpacePingSquidooOrkutNowPublicNetvouzTwitterYahoo MailYahoo BuzzWordPressYahoo MessengerShare
  • The Merge Sort algorithm closely follows the Divide and Conquer paradigm (pattern) so before moving on merge sort let us see Divide and Conquer Approach. “The Divide and Conquer Approach” We have wide range of algorithm. For insertion sort, we used an incremental approach and one can use “Divide and Conquer” approach to design an algorithm to sort  whose running time in worst case is much less than the worst case of  insertion sort. The Advantage of divide and conquer algorithm is that you can decide running time easily. There are many algorithms which are recursive in structure  to solve...0February 20, 2013

    Merge Sort | Pseudo Code of Merge Sort | Merge Sort in Data Structure | Divide and Conquer Approach

    The Merge Sort algorithm closely follows the Divide and Conquer paradigm (pattern) so before moving on merge sort let us see Divide and Conquer Approach. “The Divide and Conquer Approach” We have wide range of algorithm. For insertion sort, we used an incremental approach and one can use “Divide and Conquer” approach to design an algorithm to sort  whose running time in worst case is much less than the worst case of  insertion sort. The Advantage of divide and conquer algorithm is that you can decide running time easily. There are many algorithms which are recursive in structure  to solve…

    AIMAOL MailDeliciousBlogger PostFacebookBox.netDiggDailyMeGoogle BuzzGoogle BookmarksGoogle GmailHotmailMySpacePingSquidooOrkutNowPublicNetvouzTwitterYahoo MailYahoo BuzzWordPressYahoo MessengerShare
  • Asymptotic Notation Asymptotic notation is a way of expressing the cost of an algorithm. Goal of Asymptotic notation is to simplify Analysis by getting rid of unneeded information Following are the asymptotic notation: Big–Oh Notation (O) : >> O(g(n)) = { f(n) : there exist positive constants c and n0 such that 0 < f(n) < c*g(n) for all n > n0 }. >> It is asymptotic upper bound. >>The function f(n) = O(g(n)) iff there exist positive constants c and n0 such that f(n) ≤ c * g(n) for all n, n ≥ n0. >> The statement f(n) =...0February 17, 2013

    Asymptotic Notation | Asymptotic Notation in Data Structure

    Asymptotic Notation Asymptotic notation is a way of expressing the cost of an algorithm. Goal of Asymptotic notation is to simplify Analysis by getting rid of unneeded information Following are the asymptotic notation: Big–Oh Notation (O) : >> O(g(n)) = { f(n) : there exist positive constants c and n0 such that 0 < f(n) < c*g(n) for all n > n0 }. >> It is asymptotic upper bound. >>The function f(n) = O(g(n)) iff there exist positive constants c and n0 such that f(n) ≤ c * g(n) for all n, n ≥ n0. >> The statement f(n) =…

    AIMAOL MailDeliciousBlogger PostFacebookBox.netDiggDailyMeGoogle BuzzGoogle BookmarksGoogle GmailHotmailMySpacePingSquidooOrkutNowPublicNetvouzTwitterYahoo MailYahoo BuzzWordPressYahoo MessengerShare
  • Selection Sort follows very simple idea. Let us see  what is the idea of Selection Sort : First it finds the smallest element in the array. Exchange that smallest element with the element at the first position. Then find the second smallest element and exchange that element with the element at the second position. This process continues until the complete array is sorted. Let us see how selection sort works : Pseudocode of Selection Sort SELECTION-SORT(A) 1.     for j ← 1 to n-1 2.          smallest ← j 3.           for i ← j...0February 17, 2013

    Selection Sort | Pseudo Code of Selection Sort | Selection Sort in Data Structure

    Selection Sort follows very simple idea. Let us see  what is the idea of Selection Sort : First it finds the smallest element in the array. Exchange that smallest element with the element at the first position. Then find the second smallest element and exchange that element with the element at the second position. This process continues until the complete array is sorted. Let us see how selection sort works : Pseudocode of Selection Sort SELECTION-SORT(A) 1.     for j ← 1 to n-1 2.          smallest ← j 3.           for i ← j…

    AIMAOL MailDeliciousBlogger PostFacebookBox.netDiggDailyMeGoogle BuzzGoogle BookmarksGoogle GmailHotmailMySpacePingSquidooOrkutNowPublicNetvouzTwitterYahoo MailYahoo BuzzWordPressYahoo MessengerShare
Editors' Picks
  • Early Life of – Virginia Marie Rometty,Virginia Marie Rometty & IBM,Personal life of Virginia Marie Rometty ,Achievements of Virginia Marie Rometty,& More

    Life of Virginia Marie Rometty | Biography of Virginia Marie Rometty

    Posted on January 19, 2013 | No Comments
    Early Life of – Virginia Marie Rometty,Virginia Marie Rometty & IBM,Personal life of Virginia Marie Rometty ,Achievements of Virginia Marie Rometty,& More

    Continue Reading...

  • Grace Hopper >> Grace Brewster Murray Hopper >> She is well known as Pioneer in the Computer technology who invented not only COBOL : a programming Language but also developed the first compiler for a computer programming language and was one of the first programmers of the computer named Harvard Mark I. >> She is the pioneer of the COBOL : Common Business-Oriented Language and  one of them who led  first user friendly computer software. >>  She coined the word “bug”  which describe malfunction of computer. >> Sometimes she also referred to as “Amazing Grace“. Ada Lovelace >> Ada was...

    Famous IT Personalities | Women Empowering IT Industry

    Posted on December 31, 2012 | No Comments
    Grace Hopper >> Grace Brewster Murray Hopper >> She is well known as Pioneer in the Computer technology who invented not only COBOL : a programming Language but also developed the first compiler for a computer programming language and was one of the first programmers of the computer named Harvard Mark I. >> She is the pioneer of the COBOL : Common Business-Oriented Language and  one of them who led  first user friendly computer software. >>  She coined the word “bug”  which describe malfunction of computer. >> Sometimes she also referred to as “Amazing Grace“. Ada Lovelace >> Ada was...

    Continue Reading...

  • Tim Cook >> Timothy D. Cook >> He is the CEO of Apple Inc from Aug – 2012 till today. >> In 1998, Cook joined Apple. >> In 2007, He was promoted to Chief Operating Officer (COO). >> After Steve Jobs, cook became the CEO of Apple. >> Earlier, he has worked at IBM for 12 years. >> As in 2012, world’s highest paid CEO goes to him. >> According to Forbs, his ranking is 58th in most powerful people of world. >> Cook begins his day by sending mails at 4:30 am daily. Jeff Bezos >>  Jeffrey Preston Bezos...

    Famous IT Personalities | The Role Makers

    Posted on December 4, 2012 | No Comments
    Tim Cook >> Timothy D. Cook >> He is the CEO of Apple Inc from Aug – 2012 till today. >> In 1998, Cook joined Apple. >> In 2007, He was promoted to Chief Operating Officer (COO). >> After Steve Jobs, cook became the CEO of Apple. >> Earlier, he has worked at IBM for 12 years. >> As in 2012, world’s highest paid CEO goes to him. >> According to Forbs, his ranking is 58th in most powerful people of world. >> Cook begins his day by sending mails at 4:30 am daily. Jeff Bezos >>  Jeffrey Preston Bezos...

    Continue Reading...