Binary Search Function (Presorted Array)

Function to Search for an element from ARR[10] by Binary Search Method. Binary search method can be applied on array only if it is sorted. This function assumes that array is arranged in ascending (increasing) order.

Algorithm for converting INFIX Exp. To POSTFIX Exp.

Dear Students, I am posting Algorithm for converting INFIX Expression to POSTFIX Expression as some students requested for the same. It is important from Exam point of view.

File Handling Answer 13

Problem Solving Session Schedule

• Students can come to school if they have any Problem.
• Students can communicate through email or they can contact through Phone
  
• Students should be in their SCHOOL UNIFORM when they come to school.
• Reporting Time : 8:00 am

Practice Assignments/Questions

I am posting some Practice questions which have been classified according to topic. Try out and get back if you find some difficulty.

(These Practice Questions are in PDF format and will require Acrobat Reader.)

1. Theoretical Questions (2 Marks)
2. Error Finding (2 Marks)
3. Finding Output (2/3 Marks)
4. Finding Output ANSWERS
   
5. Classes and Constructor (4 Marks)
6. SQL (8 Marks)
7. File Handling
8. Stacks and Queues
9. Inheritance

Sample Question for viva

These are some sample questions which can be asked in viva.
http://www.keepandshare.com/doc/view.php?id=365605&da=y

Computer Science Board Pr. Schedule

An Inspiring Story for all the students.........

• This simple story illustrates profound meaning in life.
  
• It teaches us to see life situation in different perspectives, angles.
  
• It motivates and inspires us to be a better person ourselves. :)

| View | Upload your own

MERRY CHRISTMAS AND HAPPY NEW YEAR

SAMPLE PRACTICAL QUESTION PAPER

NOTE :

1. Take the above Question paper just as a guideline for your Board Pr Exam.
2. The Programming questions can be from any topic in your syllabus( Check the CBSE Syllabus given in previous post as it is taken straight from CBSE site http://www.cbse.nic.in/curric~1/xii06/compscie.pdf
3. Students are supposed to submit program SOURCE CODE and OUTPUT Printouts
   

Computer Science (Code 083) (Practicals)

Computer Science (Code 083)
Class XII (Practicals)

Duration: 3 hours Total Marks: 30
(As per CBSE Syllabus)

1. Programming in C++ (10 Marks)

One programming problem in C++ to be developed and tested in
Computer during the examination. Marks are allotted on the
basis of following:

Logic
Documentation/Indentation
Output presentation

Notes: The types of problems to be given will be of application type from
the following topics

• Arrays (One dimensional and two dimensional)
• Array of structure
• Stack using arrays and linked implementation
• Queue using arrays (circular) and linked implementation
• Binary File operations (Creation, Displaying, Searching and modification)
• Text File operations (Creation, Displaying and modification)

2. SQL Commands (05 Marks)
Five Query questions based on a particular Table/Relation to be tested
practically on Computer during the examination. The command along
with the result must be written in the answer sheet.

3. Project Work (05 Marks)
The project has to be developed in C++ language with Object Oriented
Technology and also should have use of Data files.
• Presentation on the computer
• Project report (Listing, Sample, Outputs, Documentation
• Viva
4. Practical File (05 Marks)
Must have minimum 20 programs from the following topics
5. Viva (05 Marks)
Based on C++ ,Project, SQL

Computer Science Project Report (C++)

The Computer Science (C++) Project Report must contain following and in the same order as mentioned below :

• Certificate
• Acknowledgment
• Overview of C++
• Need for the Project/Synopses/Summary
• Requirements(hardware & Software) along with instructions regarding how to install the project and use it are to be given. It should be a sort of USER MANUAL
  
• Header Files (used in the Project along with the functions each file is supporting in the project.)
• Classes & Objects( Description of user defined classes and their purpose)
• Functions ( Description of user defined functions and their purpose)
• Source Code(listing of all the programs prepared as part of project. )
• Output (Dumps of all the output screens)
• Shortcomings
• Bibliography

Note :

1. Index to be placed after Acknowledgment in the report but NOT to be mentioned in the index.
2. Running project Source Code to be submitted in a CD along with relevant data files
3. Project CD should be properly LABELED with
   
1. Class : XII
   
2. Section : A/B/E
   
3. Year : 2007-08
   
4. Class Roll No. :
   
5. BOARD ROLL No. ( To be mentioned later)
6. Project TITLE : Tutorial - Water Cycle (Example)
   
7. Main Program name : (.CPP File name)

Mindmap : K-Map method of Minimization of Boolean Exp

I am uploading the mind map which will help th students in revising the K-Map method of Minimizing the boolean Expressions.

Inspirational Presentation for my Students

| View | Upload your own

ASSIGNMENT (Boolean Algebra)

Q1.		Design NAND-to-NAND circuit for the following expressions
	a.	XYZ’ + X’Y’Z
	b.	A’B.(A’B’C’ + B’C)
	c.	A’B’C’ + A’B’C + A’BC + ABC’ + ABC
	d.	(X + Y’).Z
	e.	Y’ Z + Z X’
	f.	(A+B) (B+D)
	g.	3 input AND gate
	h.	3 input OR gate
Q2.		Design NOR-to-NOR circuit for the following expressions
	a.	X(Y’ + Z’) + XY’
	b.	A’B.(A’B’C’ + B’C)
	c.	X.Y’ + Z
	d.	(X + Y) (Y + Z) (X+Z)
	e.	F(A,B,C) = (A+B’) (B+C)
	f.	F(X,Y,Z) = (X’+Y) (Y’+Z)
	g.	(A’+B’+C’) (A+B’+C’) (A+B+C’)
Q3.		Obtain a simplified form of a Boolean Expression using Karnaugh Map
	a.	F(W,X,Y,Z)=S(2,3,6,10,11,14)
	b.	F(A,B,C,D)=S(0,1,3,45,6,7,9,10,11,13,15)
	c.	F(A,B,C,D)=P(0,1,3,45,6,7,9,10,11,13,15)
	d.	F(X,Y,Z)=P(3,4,5,6,7)
	e.	F(A,B,C,D)=S(0,1,2,5,6,8,9,10,13,15)
	f.	F(W,X,Y,Z)=S(2,3,6,10,11,14) Find expression in POS form
	g.	F(X,Y,Z)=S (3,4,5,6,7)
	h.	F(U,V,W,X)=S(7,9,10,11,12,13,14,15)
	i.	F(U,V,W,X)=P(0,2,3,7,8,10,11)
	j.	F(U,V,W,X)=P(3,4,5,6,7,9,11,12,13,14,15) Draw circuit diagrams for the simplified Boolean Expression

Q4. Find the minimal SOP expressions for F1 and F2 using K-Map for the given truth table for a function F(X,Y,Z), X Y Z F1 F2 0 0 0 0 1 0 0 1 1 0 0 1 0 0 0 0 1 1 1 1 1 0 0 0 1 1 0 1 1 0 1 1 0 0 1 1 1 1 1 1 Q5. A combination circuit has 4 inputs and single output. Output is 1 if All inputs are 1 Even number of inputs are 1 All inputs are 0 Make the truth table · Write Canonical SOP and POS forms of expressions ·Simplify using K-Map (Both SOP and POS expressions) ·Draw logic circuit diagram for simplified expression Q6. A truth table having 4 input variables ( A, B, C, D) has an output 1 when ABCD=0001 ABCD=0110 ABCD=1110 Express in SOP and POS Q7. Evaluate logic circuit diagram For i) a=1, b=1, c=0 ii) a=0, b=0, c=0 iii) a=1, b=1, c=1 Q8. Evaluate Boolean expression (w.x.y’ + (x’. y)’) for w=1, x=1, y=0, z=1 Q9. Simplify using algebric method AC+A’BC XZ’ + X’Y’Z + X’YZ’ + Y’Z (A+B)(A+B’) abc+a’bc+ab’c+abc’+ab’c’+a’bc’a’b’c’ AB+AB’+A’C+(AC)’ XY ( X’YZ’+XY’Z’) Q10. Verify the following : A + A’B = A+B (A+B)’ . (A’ + B’) = 0 AB + AB’ = A X’Y+Z = (X’+Y’+Z).(X’+Y+ Z).(X+Y+Z) (X+Y)(X+Z) = X+YZ x’y’z’+x’y’z+x’yz+x’yz’+xy’z’+xy’z = x’+y’ a.(a+b)=a (a’+b’).(a’+b).(a+b’) = a’b’ Q11. Write dual of following: 1. (x+y’) 3. a+1.bc 2. xy+xy’+x’y 4. a.a’=0 Q12. Write complement of following: 1. x’yz’ + x’y’z 3. xy(y+z) 2. ab’ +c’d’ 4. x(y’z+yz) Q13. State and verify Absorption Law using truth table. Q14. State and verify Involution Law using truth table. Q15. State and verify Idempotent Law using truth table. Q16. State and verify Distributive Law using truth table. Q17. State and verify DeMorgan’s Law using truth table.

Karnaugh Map Minimizer (Free Download)

Karnaugh Map Minimizer is free (GPL) software for minimizing boolean functions using the graphic method of Karnaugh maps. I am giving its link for downlods for educational purposes so double check the output if you intend to use it for any "real" work. I hope it helps you with the topic….

For K-Map Minimizer Download

http://k-map.sourceforge.net /

Minimization of Boolean Expresssions using Karnaugh Maps

I am uploading a presentation which will help you in going through the topic and revising it as well.

| View | Upload your own

For All Human Beings......

| View | Upload your own

Boolean Algebra (Basic Concepts)

Dear Students

• I have created another Mind Map On Boolean Algebra (Basic Concepts) as I am finding this tool very interesting, easy to work with and very useful in developing the topic. This tool is allowing me to discuss all the relevant points in depth and still maintaining the connectivity with the main topic. I would like to know your views about this tool.

• Click Here........... 'Boolean Algebra Mind Map'

SQL(Structured Query Language)

• I have created Mind Map on the topic 'SQL' Using Open Source Software FreeMind. I think my students will find it beneficial while preparing and revising this topic.
• To access the Mind Map Click Here.......