Downloads

                                            Notes

 SE Computer                     TE Computer                     BE Computer
           🔻                                                           🔻                                                              🔻
   1. Microprocessor           1.DSPA
      Unit 1                             Unit 1
      Unit 2                             Unit 2
      Unit 3                             Unit 3
      Unit 4                             Unit 4
      Unit 5                             Unit 5
      Unit 6                             Unit 6
 
       Imp MCQ's 


                                                    Previous Year Question Papers
          SE                                           TE                                         BE
                  🔻                                                     🔻                                                             🔻
    SE_2015    Download               TE_2013 Download                               BE_2013  Download 










Comments

Post a Comment

Popular posts from this blog

Engineering MCQ's Online Test Series

Image
Engineering MCQ's Online Test Series   DOWNLOAD Features:- All Engineering Subjects. Followed by SPPU Pune Syllabus. Covers All Branches Like Computer, Mechanical, Civil, E&TC, IT, Electrical. Includes more than 10,000 MCQ's. Semister wise Subjects & Questions Added.
Read more

Quine-McCluskey Method

Image
Quine-McCluskey Method Introduction Using K-maps to find the minimised two-level form of a function is difficult for functions of more than 4 variables and nearly impossible for functions of more than 6 variables because it's hard to visualize and spot patterns in multidimensional space. An alternative to using K-maps is the Quine-McCluskey algorithm. The Quine-McCluskey algorithm provides a systematic approach for finding the prime implicants and selecting a minimum cover. Because the algorithm is tedious it is better suited to machine implementation. Quine-McCluskey Algorithm With both the K-map method and Quine-McCluskey algorithm you are trying to find a minimum number of terms that cover all of the minterms in the function. For example, the two minterms AB'CD' and ABCD' are covered by the term ACD' Both the K-map method and Quine-McCluskey algorithm go through the following 3 phases: Step 1: find prime implicants. Step 2: find essential prime...
Read more

MHT CET APP

Image
MHT CET 20120 (e-Learning) Best android App for Preparation of MHT-CET Examination 2020 Download the App from play store  DOWNLOAD Features: -- More than 10,000 Questions added. -- Covered All 12th science subjects. -- Study materials provided. -- Multiple choice questions test. -- Generate result after Test. DOWNLOAD 
Read more