An Overview

All the necessary study material for b-tech students.

What we have to offer you.

Codes,Syllabus,Study material,Lab manuals,Assignments and many more . . .

Surfing becomes easy.

You can have any material from our website and post your valuable comments for further improvement.

Get the latest techno news

Get yourself updated with this fast changing dynamic world and all the changes in b-tech pattern.

All the best resources for you.

We have done our level best to provide you with the best of the degree and thus this site is devoted to b-tech exclusively.

Showing posts with label 6th semester. Show all posts
Showing posts with label 6th semester. Show all posts

20 May 2013

Water jug problem with online simulator


Water jug problem solved with online simulator.

 1) Fill up Jug A with 5 litres and Fill jug B from A – there are 2 litres left in Jug A.
2) Empty Jug B and then tip the remaining 2 litres from Jug A into Jug B.
3) Re-Fill Jug A with 5 litres and then fill Jug B again from it. As Jug B already has 2 litres in it, only 1 litre is taken out of Jug A. i.e. Jug A now has 4 litres left in it.
To get 2 litres….

Fill Jug A and Fill Jug B from Jug A. You have 2 litres in Jug A left.
To get 1 litre….

Fill Jug A and Fill Jug B from it. Now empty Jug B and pour remaining 2 litres from A into B.
Fill Up Jug A again and tip the rest into Jug B, we now have 4 litres in Jug A.
Empty Jug B and Fill again from Jug A, A has 4 litres, 3 litres of which will fill up Jug B, you now have 1 litre remaining in Jug A.
Simple really!!
For a live try visit here

17 May 2013

Online 8 queen puzzle simulator

Did you find a solution? There are 92 solutions to the 8 x 8  queen puzzle problem. Many of these are reflections and rotations of some of the others, and if we de-duplicate against this, purists state that there are only 12 distinct solutions (92 does not divide equally by 12 because many of the reflections and rotations of a pure solutions are not unique).


Algorithm to solve eight/8 queen puzzle problem

There are many possible algorithms that can be used to find solutions to the eight queen’s problem, and a smaller subset of algorithms that can be used to enumerate all possible solutions.
The first possible mechanism is pure brute force; blindly trying the eight queens in every possible location. This is a really dumb idea, but would calculate all possible solutions (We’d have to examine 64!/56! = 178,462,987,637,760 possible placements, ouch!)
A more efficient algorithm (which can be implemented recursively or not) is to start in the first column in the top left, then it then places a queen in the second column and moves it until it finds a place where it cannot be hit by the queen in the first column.
If you’re only interested in one solution there are plenty of interesting iterative algorithms to select from. Many are not particularly efficient, but they are fun to code and experiment with. However you can try your luck to find the solution here with 8 queen puzzle simulator

14 May 2013

Multimedia Practical File HPU Shimla free download



You are here because you have searched a lot to find a multimedia practical file at the final moment of the viva. Don't panic here is the give-away for you. Multimedia Practical File HPU Shimla. You are at the right place to get a copy of practical file in Multimedia Technology.  Download a free copy of Multimedia Technology Practical.  It covers all the basic practical that are told at the various colleges.  It is complete in all respect; the only thing is to change your name and had a hard copy in your hands. It contains 9 practical with full explanation.

Download free Practical file of Multimedia Technology

9 May 2013

Multimedia Technology Practical File Free Download

You are at the right place to get a copy of practical file in Multimedia Technology.  Download a free copy of Multimedia Technology Practical.  It covers all the basic practical that are told at the various colleges.  It is complete in all respect; the only thing is to change your name and had a hard copy in your hands. It contains 9 practical with full explanation.


Download free Practical file of Multimedia Technology

Artificial Intelligence Practical file Download for free (HPU)


You are at the right place to get a copy of practical file in Artificial Intelligence.  Download a free copy of Artificial Intelligence Practical.  It covers all the basic practical that are told at the various colleges.  It is complete in all respect; the only thing is to change your name and had a hard copy in your hands.


23 March 2012

HPU question paper for CSE/IT

HPU question paper for CSE/IT



ADVANCED MICROPROCESSOR 8086

HPU question paper for CSE/IT



5667
B.Tech 6th Semester Examination
Advanced microprocessor & microcontroller (ECE)
Paper-EC-6003
Time Allowed: 3 Hours Maximum Marks: 100
Note: Attempt 5 questions in all, by selecting at least 1 question from each of section A, B, C, D and entire section-E.
Section-A

1. Draw the block diagram of internal architecture of 8086. Explained the function of each.
[20]
2. What is addressing modes? Explain the various addressing modes available in 8086 with suitable example.
[20]
Section-B

3. Discuss the format & function of various jump & loop instruction with example.
[20]
4. Write an assembly language program for keyboard detect, debounce encode procedure
[20]
Section-C

5. Draw the pin diagram of 80286. Explain his function of each pin in brief?
[20]
6. Discuss the operating mode of 80386 & 80486. Compare the important feature?
[20]
Section-D
7. Discribe the function of each block of internal architecture of 8051. [20]
8. Discuss:
a) Development system for micro controller.
b) Serial data I/O. [20]
Section-E
6. Explain:
a) What information appears on the address/data bus of the 8088 while ALE is active?
b) Purpose of interrupt flag.
c) Name the four general purpose data register of 8086.
d) Which register r called base register?
e) Explain the purpose of CAP pin in 80286.
f) Two difference between 80286 & 8086.
g) Two similarities between 80386 & 80486.
h) Purpose of end directives.
i) Difference between an intersegment & intrasegment jump.
j) How is the procedure identified as near or far? [20]