MCS-011 Problem Solving and Programming Solved Assignment 2018-19

-
Question1: Write an algorithm, draw a flow chart and write its corresponding C program to convert a decimal number to its equivalent hexadecimal number. (10 Marks)
Question2: Write an algorithm and its corresponding C program to generate students’ Progress-Report for VIII standard (section of 20 students) of a CBSE school for all its 4 terms. Use Structures concept. Assumptions can be made wherever necessary. (10 Marks)
Question 3: Write a C program to generate the following pattern: (10 Marks)
 1
 1 2
 1 2 3
 1 2 3 4
 1 2 3 4 5
Question 4: Write a program to generate Fibonacci series using Recursion. (10 Marks)
Question 5: Write a C program to perform the following operation on matrices D = A + (B * C), where A, B and C are matrices of (3 X 3) size and D is the resultant matrix. (10 Marks)
Question 6: Write an interactive C program to calculate the string length of a given string, using pointers. (10 Marks)
Question 7: Write a C program to take a list of N numbers, separate even and odd numbers and put them in two appropriate files (evenfile and oddfile). Use File Handling concept. (10 Marks)
Question 8: Write an interactive C program for each to illustrate the following concepts: (10 Marks) (a)Enumerated data type
(b) Macros in C
(c) typedef
(d) Goto statement
(e) Break statement

👇Click Below to download👇

Comments

Post a Comment

Popular posts from this blog

Array

-
Image
  An array is a collection of similar data elements stored at contiguous memory locations. It is the simplest data structure where each data element can be accessed directly by only using its index number. For instance, if we want to store the marks scored by a student in 5 subjects, then there’s no need to define individual variables for each subject. Rather, we can define an array which will store the data elements at contiguous memory locations. · array  marks[5]  defines the marks scored by a student in 5 different subjects where each subject marks are located at a particular location in the array i.e.  marks[0]  denotes the marks scored in first subject,  marks[1]  denotes the marks scored in 2nd subject and so on.
Read more
-
  STACKS in Data Structure A stack is  an abstract data type that holds an ordered, linear sequence of items . In contrast to a queue, a stack is a last in, first out (LIFO) structure. A real-life example is a stack of plates: you can only take a plate from the top of the stack, and you can only add a plate to the top of the stack... Click here to Know more
Read more

Asymptotic notations

-
  Data Structure The main idea of asymptotic analysis is to have a measure of efficiency of algorithms that doesn’t depend on machine specific constants,  and doesn’t require algorithms to be implemented and time taken by programs to be compared. Asymptotic notations are mathematical tools to represent time complexity of algorithms for asymptotic analysis.  The following 3 asymptotic notations are mostly used to represent time complexity of algorithms. 1) Θ Notation, 2) Big O Notation, 3) Ω Notation. Click here to learn more
Read more