Recurrence relation

Prob. Find the generating function for the following numeric function

ar = 7.3r , r 0.

Prob. Find a*b where
ar = 3r , r ≥ 0.

br = 2r, r ≥ 0.

Prob. Determine the generating function of the numerical function ar, where
Prob. Determine the generating function of the numerical function ar, where
Prob. Solve the recurrence relation ar – 6ar-1 + 8ar-2 = o given a0 = 3 and a1 = 2.


Prob. Solve the recurrence relation an – 6an-1 + 9an-2 ,
With initial condition a0 = 1 and a1 = 6.
Prob. Solve the recurrence relation ar – 7ar-1 + 10ar-2 = o given that a0 = 0 and a1 = 3.
Prob. Solve the difference equation ar – 4ar-1 + 4ar-2 = o and find the particular solution, given that a0 = 1 and a1 = 6.
Prob. Solve the difference equation ar – 6ar-1 + 9ar-2 = 3, given that a0 = 0 and a1 = 1.
Prob. Determine the particular solution and general solution that satisfies the given initial condition xn – 2xn-1 = 6n; x1 = 2.
Prob. Determine the particular solution for the difference equation – ar – 2ar-1 = f(r), where f(r) = 7r.
Prob. Obtain particular ar + 5ar-1 +  6ar-2 = 3r2 – 2r +1.
Prob. Solve the recurrence relation –
ar + 4ar-1 +  4ar-2 = (r+1)2 , r ≥ 2.

Discrete Structure

EasyExamNotes.com covered following topics in these notes.
A list of Video lectures


Python Programming ↓ 👆
Java Programming ↓ 👆
JAVA EasyExamNotes.com covered following topics in these notes.
JAVA Programs
Principles of Programming Languages ↓ 👆
Principles of Programming Languages
EasyExamNotes.com covered following topics in these notes.

Practicals:
Previous years solved papers:
A list of Video lectures References:
  1. Sebesta,”Concept of programming Language”, Pearson Edu 
  2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning 
  3. Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill. 
  4. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

    Computer Organization and Architecture ↓ 👆

    Computer Organization and Architecture 

    EasyExamNotes.com covered following topics in these notes.

    1. Structure of desktop computers
    2. Logic gates
    3. Register organization
    4. Bus structure
    5. Addressing modes
    6. Register transfer language
    7. Direct mapping numericals
    8. Register in Assembly Language Programming
    9. Arrays in Assembly Language Programming

    References:

    1. William stalling ,“Computer Architecture and Organization” PHI
    2. Morris Mano , “Computer System Organization ”PHI

    Computer Network ↓ 👆
    Computer Network

    EasyExamNotes.com covered following topics in these notes.
    1. Data Link Layer
    2. Framing
    3. Byte count framing method
    4. Flag bytes with byte stuffing framing method
    5. Flag bits with bit stuffing framing method
    6. Physical layer coding violations framing method
    7. Error control in data link layer
    8. Stop and Wait scheme
    9. Sliding Window Protocol
    10. One bit sliding window protocol
    11. A protocol Using Go-Back-N
    12. Selective repeat protocol
    13. Application layer
    References:
    1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.
    2. Douglas E Comer, “Internetworking with TCP/IP Principles, Protocols, And Architecture",Pearson Education
    3. KavehPahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.
    4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.