December-2018 Term End Result

-


๐Ÿ‘‰Hello Everyone, Ignou has published the update of DEC 2018 term end examination result on its official website. Also the assignment marks are updated. To check your result Click on Below links:-


 1. December-2018 Term End Result ๐Ÿ‘‰Click Here to check ๐Ÿ‘ˆ

 2. For BCA/MCA Grade Card ๐Ÿ‘‰ Click here to check

3.  BDP/BA/B.COM/B.Sc./ASSO Programmes ๐Ÿ‘‰ Click here to Check

4. For Other Programs ๐Ÿ‘‰ Click Here to check

Comments

  1. ojasAugust 20, 2019 at 4:24 AM

    thanks

    ReplyDelete
  2. ojasAugust 20, 2019 at 4:25 AM

    Hello, Student If You Are Waiting For IGNOU Result 2019 For June Exam Then Don't West Your Golden Time And CLICK HERE For Latest Result Link

    ReplyDelete

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