PCD Assignment-III

1. What are loop statements? List different types of loop statements supported by C language.

2. Discuss "while" loop with syntax, flowchart and two programming examples.

3. Write C programs for following using "while" loop.
     To display 1 to n natural numbers.
     To display Squares of 1 to n numbers.
     To display multiple table of 'n' in multiple table format.
     if n=2,
             2 x 1 = 2
            2 x 2 = 4
             ....
           2 x 10 = 20

     To find sum and average of 1 to n numbers.
     To find factorial of n number.
     To check, whether the entered number is Palindrome or Not Palindrome.
     To find GCD of two numbers using Euclid's algorithm.

4. Discuss "do ... while" loop with syntax, flowchart and two programming examples.


5. Discuss "for" loop with syntax, flowchart and two programming examples.

6. Write the differences between break and continue statements.

7. What is goto statement? Discuss with programming example.

8. Write C programs for the following
    To check, whether the number is PALINDROME or NOT PALINDROME.
    To check, whther the number 'n' is PRIME or NOT PRIME.
    To display first 'n' fibonacci numbers.

DAA Assignment-II

1. What is an algorithm? Explain the notion of algorithm with an example.
2. Explain in brief about ‘Algorithm design and analysis process’ with a neat flowchart.
3. Explain ‘Asymptotic Notations’ with definition and examples.
4. Discuss the ‘Algorithm Analysis Framework’ in brief.
5. Discuss basic efficiency classes.
6. Discuss the algorithms specifications.
7. Discuss General Plan for Analyzing Time Efficiency of Recursive Algorithms.
8. Discuss General Plan for Analyzing Time Efficiency of Nonrecursive Algorithms.
9. Write an algorithm to check whether all the elements in a given array are distinct and find its time complexity.
10. Write an algorithm to find the product of two matrices A and B and find its time complexity.
11. Write recursive algorithm to compute factorial of n and find its time complexity.
12. Discuss and find the time complexity of “Tower of Hanoi” puzzle.
13. Discuss divide-and-conquer algorithm design technique with example.
14. Write recursive algorithm to find maximum and minimum of given list of array elements using divide and conquer technique.
15. Write recursive and non-recursive algorithms for binary search.
16. Write Merge Sort algorithm to find its worst case time efficiency.
17. Write Quick Sort algorithm to find its best case time efficiency.
18. Apply Quick Sort on the given list and draw recursive call tree:  5  3 1  9  8 2 4  7

PCD Assignment-III

1. What are formatted I/O functions? Explain with syntax and examples.

2. What are unformatted I/O functions? Explain with syntax and examples.

3. Explain the following operators in brief with examples.
Arithmetic, Relational, Logical, Increment / Decrement  operators and Bitwise operators.

4. What is conditional operator? Explain with syntax and example.

5. What are special operators? list and explain.

6. What is precedence and associativity of operator? Explain with example.

7. Solve the following mathematical expressions using precedence and associativity rules.

    a)  8&&7+100/5==1%10-5<10+(10/2)
    b) 5 && 10<<5+10

8. What is type conversion? List and explain different types with examples.

9. Convert the any ten mathematical expressions(as discussed in class) into C expressions.

10. What are decision making statements? Explain the following with syntax and programming examples.
simple if, if ... else statement and nested if statement.

11. What is cascaded if statement? Explain with syntax and example.

12. Discuss "switch" statement with syntax, flowchart and programming example.

13. Write C programs for following

1). To check for leap year.

2). To find largest of three numbers.

3). To check, whether the machine is 16 bits machine or not.

4). If the user entered name is your's name and password is your roll number, then permit the user to find area and perimeter of rectangle.

5). To display the Grades like "Honour" (Avg>=70), "First Division" (Avg>=60 and Avg<70), "Second Division" (Avg>=50 and Avg<60), "Passed" (Avg>=35 and Avg<50), "Fail" (Avg<35) by using else if ladder statement.

6). To provide menu options to find "Area of Circle", "Area of Rectangle" and "Area of Triangle" to work accordingly using switch statement.

7). To simulate "Simple Calculator" using switch statement.

8) To find roots of a quadratic equation for three non-zero coefficients a, b and c. (Lab Program)

9) SOLVE QUESTION PAPERS.



 
   

Achievers of the week

1. Seminar on "String Processing" by Mr. Mahesh Gajakosh (2BL15CS045)

2. Seminar on "Graph Problems" by Miss. Nafisa Mujawar (2BL16CS407)

    
1. Mr. Manjunath Angadi IV Sem CSE A div.
    Design and Analysis of Algorithms:

2. Mr. Muragesh M II  Sem E Div. 2BL16CV049
    Programming in C and Data Structures