ºÝºÝߣshows by User: AshimLamichhane / http://www.slideshare.net/images/logo.gif ºÝºÝߣshows by User: AshimLamichhane / Wed, 17 Aug 2016 10:18:45 GMT ºÝºÝߣShare feed for ºÝºÝߣshows by User: AshimLamichhane Searching /slideshow/searching-65079305/65079305 searching-160817101845
Searching algorithm Data structure and algorithm, covers linear/sequential search, binary search similarly hashing git: https://github.com/ashim888/dataStructureAndAlgorithm personarl: ashimlamichhane.com.np]]>

Searching algorithm Data structure and algorithm, covers linear/sequential search, binary search similarly hashing git: https://github.com/ashim888/dataStructureAndAlgorithm personarl: ashimlamichhane.com.np]]>
Wed, 17 Aug 2016 10:18:45 GMT /slideshow/searching-65079305/65079305 AshimLamichhane@slideshare.net(AshimLamichhane) Searching AshimLamichhane Searching algorithm Data structure and algorithm, covers linear/sequential search, binary search similarly hashing git: https://github.com/ashim888/dataStructureAndAlgorithm personarl: ashimlamichhane.com.np <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/searching-160817101845-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Searching algorithm Data structure and algorithm, covers linear/sequential search, binary search similarly hashing git: https://github.com/ashim888/dataStructureAndAlgorithm personarl: ashimlamichhane.com.np
Searching from Ashim Lamichhane
]]>
19516 10 https://cdn.slidesharecdn.com/ss_thumbnails/searching-160817101845-thumbnail.jpg?width=120&height=120&fit=bounds presentation 000000 http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Sorting /AshimLamichhane/sorting-64885019 sorting-160810203705
Sorting: Introduction, O notation, efficiency of sorting, exchange sort: bubble sort, quick sort. Selection and Tree Sorting: Introduction, straight selection sort, binary tree sort, heapsort, insertion sort, merge and radix sort. Blog: http://www.ashimlamichhane.com.np/2016/08/unit-7-sorting/ Github: https://github.com/ashim888/dataStructureAndAlgorithm]]>

Sorting: Introduction, O notation, efficiency of sorting, exchange sort: bubble sort, quick sort. Selection and Tree Sorting: Introduction, straight selection sort, binary tree sort, heapsort, insertion sort, merge and radix sort. Blog: http://www.ashimlamichhane.com.np/2016/08/unit-7-sorting/ Github: https://github.com/ashim888/dataStructureAndAlgorithm]]>
Wed, 10 Aug 2016 20:37:04 GMT /AshimLamichhane/sorting-64885019 AshimLamichhane@slideshare.net(AshimLamichhane) Sorting AshimLamichhane Sorting: Introduction, O notation, efficiency of sorting, exchange sort: bubble sort, quick sort. Selection and Tree Sorting: Introduction, straight selection sort, binary tree sort, heapsort, insertion sort, merge and radix sort. Blog: http://www.ashimlamichhane.com.np/2016/08/unit-7-sorting/ Github: https://github.com/ashim888/dataStructureAndAlgorithm <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/sorting-160810203705-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Sorting: Introduction, O notation, efficiency of sorting, exchange sort: bubble sort, quick sort. Selection and Tree Sorting: Introduction, straight selection sort, binary tree sort, heapsort, insertion sort, merge and radix sort. Blog: http://www.ashimlamichhane.com.np/2016/08/unit-7-sorting/ Github: https://github.com/ashim888/dataStructureAndAlgorithm
Sorting from Ashim Lamichhane
]]>
46627 23 https://cdn.slidesharecdn.com/ss_thumbnails/sorting-160810203705-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Tree - Data Structure /slideshow/tree-data-structure-64560545/64560545 tree-160731205832
a. Concept and Definition b. Binary Tree c. Introduction and application d. Operation e. Types of Binary Tree • Complete • Strictly • Almost Complete f. Huffman algorithm g. Binary Search Tree • Insertion • Deletion • Searching h. Tree Traversal • Pre-order traversal • In-order traversal • Post-order traversal ºÝºÝߣs at myblog http://www.ashimlamichhane.com.np/2016/07/tree-slide-for-data-structure-and-algorithm/ Assignments at github https://github.com/ashim888/dataStructureAndAlgorithm/tree/dev/Assignments/assignment_7]]>

a. Concept and Definition b. Binary Tree c. Introduction and application d. Operation e. Types of Binary Tree • Complete • Strictly • Almost Complete f. Huffman algorithm g. Binary Search Tree • Insertion • Deletion • Searching h. Tree Traversal • Pre-order traversal • In-order traversal • Post-order traversal ºÝºÝߣs at myblog http://www.ashimlamichhane.com.np/2016/07/tree-slide-for-data-structure-and-algorithm/ Assignments at github https://github.com/ashim888/dataStructureAndAlgorithm/tree/dev/Assignments/assignment_7]]>
Sun, 31 Jul 2016 20:58:32 GMT /slideshow/tree-data-structure-64560545/64560545 AshimLamichhane@slideshare.net(AshimLamichhane) Tree - Data Structure AshimLamichhane a. Concept and Definition b. Binary Tree c. Introduction and application d. Operation e. Types of Binary Tree • Complete • Strictly • Almost Complete f. Huffman algorithm g. Binary Search Tree • Insertion • Deletion • Searching h. Tree Traversal • Pre-order traversal • In-order traversal • Post-order traversal ºÝºÝߣs at myblog http://www.ashimlamichhane.com.np/2016/07/tree-slide-for-data-structure-and-algorithm/ Assignments at github https://github.com/ashim888/dataStructureAndAlgorithm/tree/dev/Assignments/assignment_7 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/tree-160731205832-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> a. Concept and Definition b. Binary Tree c. Introduction and application d. Operation e. Types of Binary Tree • Complete • Strictly • Almost Complete f. Huffman algorithm g. Binary Search Tree • Insertion • Deletion • Searching h. Tree Traversal • Pre-order traversal • In-order traversal • Post-order traversal ºÝºÝߣs at myblog http://www.ashimlamichhane.com.np/2016/07/tree-slide-for-data-structure-and-algorithm/ Assignments at github https://github.com/ashim888/dataStructureAndAlgorithm/tree/dev/Assignments/assignment_7
Tree - Data Structure from Ashim Lamichhane
]]>
71530 15 https://cdn.slidesharecdn.com/ss_thumbnails/tree-160731205832-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Linked List /slideshow/linked-list-63790316/63790316 linkedlist-160706195911
a. Concept and Definition✓ b. Inserting and Deleting nodes ✓ c. Linked implementation of a stack (PUSH/POP) ✓ d. Linked implementation of a queue (Insert/Remove) ✓ e. Circular List • Stack as a circular list (PUSH/POP) ✓ • Queue as a circular list (Insert/Remove) ✓ f. Doubly Linked List (Insert/Remove) ✓ For more course related material: https://github.com/ashim888/dataStructureAndAlgorithm/ Personal blog www.ashimlamichhane.com.np ]]>

a. Concept and Definition✓ b. Inserting and Deleting nodes ✓ c. Linked implementation of a stack (PUSH/POP) ✓ d. Linked implementation of a queue (Insert/Remove) ✓ e. Circular List • Stack as a circular list (PUSH/POP) ✓ • Queue as a circular list (Insert/Remove) ✓ f. Doubly Linked List (Insert/Remove) ✓ For more course related material: https://github.com/ashim888/dataStructureAndAlgorithm/ Personal blog www.ashimlamichhane.com.np ]]>
Wed, 06 Jul 2016 19:59:11 GMT /slideshow/linked-list-63790316/63790316 AshimLamichhane@slideshare.net(AshimLamichhane) Linked List AshimLamichhane a. Concept and Definition✓ b. Inserting and Deleting nodes ✓ c. Linked implementation of a stack (PUSH/POP) ✓ d. Linked implementation of a queue (Insert/Remove) ✓ e. Circular List • Stack as a circular list (PUSH/POP) ✓ • Queue as a circular list (Insert/Remove) ✓ f. Doubly Linked List (Insert/Remove) ✓ For more course related material: https://github.com/ashim888/dataStructureAndAlgorithm/ Personal blog www.ashimlamichhane.com.np <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/linkedlist-160706195911-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> a. Concept and Definition✓ b. Inserting and Deleting nodes ✓ c. Linked implementation of a stack (PUSH/POP) ✓ d. Linked implementation of a queue (Insert/Remove) ✓ e. Circular List • Stack as a circular list (PUSH/POP) ✓ • Queue as a circular list (Insert/Remove) ✓ f. Doubly Linked List (Insert/Remove) ✓ For more course related material: https://github.com/ashim888/dataStructureAndAlgorithm/ Personal blog www.ashimlamichhane.com.np
Linked List from Ashim Lamichhane
]]>
15338 9 https://cdn.slidesharecdn.com/ss_thumbnails/linkedlist-160706195911-thumbnail.jpg?width=120&height=120&fit=bounds presentation 000000 http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Queues /slideshow/queues-63452401/63452401 queues-160626071916
Queues a. Concept and Definition b. Queue as an ADT c. Implementation of Insert and Delete operation of: • Linear Queue • Circular Queue For More: https://github.com/ashim888/dataStructureAndAlgorithm http://www.ashimlamichhane.com.np/ ]]>

Queues a. Concept and Definition b. Queue as an ADT c. Implementation of Insert and Delete operation of: • Linear Queue • Circular Queue For More: https://github.com/ashim888/dataStructureAndAlgorithm http://www.ashimlamichhane.com.np/ ]]>
Sun, 26 Jun 2016 07:19:16 GMT /slideshow/queues-63452401/63452401 AshimLamichhane@slideshare.net(AshimLamichhane) Queues AshimLamichhane Queues a. Concept and Definition b. Queue as an ADT c. Implementation of Insert and Delete operation of: • Linear Queue • Circular Queue For More: https://github.com/ashim888/dataStructureAndAlgorithm http://www.ashimlamichhane.com.np/ <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/queues-160626071916-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Queues a. Concept and Definition b. Queue as an ADT c. Implementation of Insert and Delete operation of: • Linear Queue • Circular Queue For More: https://github.com/ashim888/dataStructureAndAlgorithm http://www.ashimlamichhane.com.np/
Queues from Ashim Lamichhane
]]>
4307 6 https://cdn.slidesharecdn.com/ss_thumbnails/queues-160626071916-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
The Stack And Recursion /slideshow/the-stack-and-recursion/63236132 thestack-160620061743
https://github.com/ashim888/dataStructureAndAlgorithm Stack Concept and Definition • Primitive Operations • Stack as an ADT • Implementing PUSH and POP operation • Testing for overflow and underflow conditions Recursion • Concept and Definition • Implementation of: ¬ Multiplication of Natural Numbers ¬ Factorial ¬ Fibonacci Sequences The Tower of Hanoi]]>

https://github.com/ashim888/dataStructureAndAlgorithm Stack Concept and Definition • Primitive Operations • Stack as an ADT • Implementing PUSH and POP operation • Testing for overflow and underflow conditions Recursion • Concept and Definition • Implementation of: ¬ Multiplication of Natural Numbers ¬ Factorial ¬ Fibonacci Sequences The Tower of Hanoi]]>
Mon, 20 Jun 2016 06:17:43 GMT /slideshow/the-stack-and-recursion/63236132 AshimLamichhane@slideshare.net(AshimLamichhane) The Stack And Recursion AshimLamichhane https://github.com/ashim888/dataStructureAndAlgorithm Stack Concept and Definition • Primitive Operations • Stack as an ADT • Implementing PUSH and POP operation • Testing for overflow and underflow conditions Recursion • Concept and Definition • Implementation of: ¬ Multiplication of Natural Numbers ¬ Factorial ¬ Fibonacci Sequences The Tower of Hanoi <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/thestack-160620061743-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> https://github.com/ashim888/dataStructureAndAlgorithm Stack Concept and Definition • Primitive Operations • Stack as an ADT • Implementing PUSH and POP operation • Testing for overflow and underflow conditions Recursion • Concept and Definition • Implementation of: ¬ Multiplication of Natural Numbers ¬ Factorial ¬ Fibonacci Sequences The Tower of Hanoi
The Stack And Recursion from Ashim Lamichhane
]]>
3554 5 https://cdn.slidesharecdn.com/ss_thumbnails/thestack-160620061743-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Algorithm big o /slideshow/algorithm-big-o/62971056 algorithmbigo-160612050627
Big O notation is used in Computer Science to describe the performance or complexity of an algorithm. Big O specifically describes the worst-case scenario, and can be used to describe the execution time required or the space used (e.g. in memory or on disk) by an algorithm. For further information https://github.com/ashim888/dataStructureAndAlgorithm References: https://www.khanacademy.org/computing/computer-science/algorithms/asymptotic-notation/a/asymptotic-notation http://web.mit.edu/16.070/www/lecture/big_o.pdf https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/ https://justin.abrah.ms/computer-science/big-o-notation-explained.html]]>

Big O notation is used in Computer Science to describe the performance or complexity of an algorithm. Big O specifically describes the worst-case scenario, and can be used to describe the execution time required or the space used (e.g. in memory or on disk) by an algorithm. For further information https://github.com/ashim888/dataStructureAndAlgorithm References: https://www.khanacademy.org/computing/computer-science/algorithms/asymptotic-notation/a/asymptotic-notation http://web.mit.edu/16.070/www/lecture/big_o.pdf https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/ https://justin.abrah.ms/computer-science/big-o-notation-explained.html]]>
Sun, 12 Jun 2016 05:06:26 GMT /slideshow/algorithm-big-o/62971056 AshimLamichhane@slideshare.net(AshimLamichhane) Algorithm big o AshimLamichhane Big O notation is used in Computer Science to describe the performance or complexity of an algorithm. Big O specifically describes the worst-case scenario, and can be used to describe the execution time required or the space used (e.g. in memory or on disk) by an algorithm. For further information https://github.com/ashim888/dataStructureAndAlgorithm References: https://www.khanacademy.org/computing/computer-science/algorithms/asymptotic-notation/a/asymptotic-notation http://web.mit.edu/16.070/www/lecture/big_o.pdf https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/ https://justin.abrah.ms/computer-science/big-o-notation-explained.html <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/algorithmbigo-160612050627-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Big O notation is used in Computer Science to describe the performance or complexity of an algorithm. Big O specifically describes the worst-case scenario, and can be used to describe the execution time required or the space used (e.g. in memory or on disk) by an algorithm. For further information https://github.com/ashim888/dataStructureAndAlgorithm References: https://www.khanacademy.org/computing/computer-science/algorithms/asymptotic-notation/a/asymptotic-notation http://web.mit.edu/16.070/www/lecture/big_o.pdf https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/ https://justin.abrah.ms/computer-science/big-o-notation-explained.html
Algorithm big o from Ashim Lamichhane
]]>
2551 7 https://cdn.slidesharecdn.com/ss_thumbnails/algorithmbigo-160612050627-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Algorithm Introduction /slideshow/algorithm-introduction/62840871 algorithmintro-160608065422
Algorithm a. Concept and Definition b. Design of algorithm c. Characteristic of algorithm Big O notation]]>

Algorithm a. Concept and Definition b. Design of algorithm c. Characteristic of algorithm Big O notation]]>
Wed, 08 Jun 2016 06:54:22 GMT /slideshow/algorithm-introduction/62840871 AshimLamichhane@slideshare.net(AshimLamichhane) Algorithm Introduction AshimLamichhane Algorithm a. Concept and Definition b. Design of algorithm c. Characteristic of algorithm Big O notation <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/algorithmintro-160608065422-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Algorithm a. Concept and Definition b. Design of algorithm c. Characteristic of algorithm Big O notation
Algorithm Introduction from Ashim Lamichhane
]]>
11357 13 https://cdn.slidesharecdn.com/ss_thumbnails/algorithmintro-160608065422-thumbnail.jpg?width=120&height=120&fit=bounds presentation 000000 http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Introduction to data_structure /slideshow/introduction-to-datastructure/62745462 introductiontodatastructure-160605184758
Concept and Definition of Data Structures Introduction to Data Structures: Information and its meaning, Array in C++: The array as an ADT, Using one dimensional array, Two dimensional array, Multi dimensional array, Structure , Union, Classes in C++. https://github.com/ashim888/dataStructureAndAlgorithm]]>

Concept and Definition of Data Structures Introduction to Data Structures: Information and its meaning, Array in C++: The array as an ADT, Using one dimensional array, Two dimensional array, Multi dimensional array, Structure , Union, Classes in C++. https://github.com/ashim888/dataStructureAndAlgorithm]]>
Sun, 05 Jun 2016 18:47:58 GMT /slideshow/introduction-to-datastructure/62745462 AshimLamichhane@slideshare.net(AshimLamichhane) Introduction to data_structure AshimLamichhane Concept and Definition of Data Structures Introduction to Data Structures: Information and its meaning, Array in C++: The array as an ADT, Using one dimensional array, Two dimensional array, Multi dimensional array, Structure , Union, Classes in C++. https://github.com/ashim888/dataStructureAndAlgorithm <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/introductiontodatastructure-160605184758-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Concept and Definition of Data Structures Introduction to Data Structures: Information and its meaning, Array in C++: The array as an ADT, Using one dimensional array, Two dimensional array, Multi dimensional array, Structure , Union, Classes in C++. https://github.com/ashim888/dataStructureAndAlgorithm
Introduction to data_structure from Ashim Lamichhane
]]>
2049 7 https://cdn.slidesharecdn.com/ss_thumbnails/introductiontodatastructure-160605184758-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Unit 11. Graphics /slideshow/unit-11-graphics/60302603 graphics-160331210312
For all who wish to learn c graphics programming, no knowledge of graphics concepts is required. C Graphics programming is very easy and interesting. You can use graphics programming for developing your own games, in making projects, for animation etc. It's not like traditional C programming in which you have to apply complex logic in your program and then you end up with a lot of errors and warnings in your program. In C graphics programming you have to use standard library functions ( need not worry if you don't know functions ) to get your task done. Just you pass arguments to the functions and it's done. On this website you will find almost all functions with detailed explanation and a sample program showing the usage of a function. To make things easy you are provided with executable files which you can download and execute. Firstly you should know the function initgraph which is used to initialize the graphics mode . To initialize graphics mode we use initgraph function in our program. initgraph function is present in "graphics.h" header file, so your every graphics program should include "graphics.h" header file. We will discuss initgraph withe help of following sample program:- ]]>

For all who wish to learn c graphics programming, no knowledge of graphics concepts is required. C Graphics programming is very easy and interesting. You can use graphics programming for developing your own games, in making projects, for animation etc. It's not like traditional C programming in which you have to apply complex logic in your program and then you end up with a lot of errors and warnings in your program. In C graphics programming you have to use standard library functions ( need not worry if you don't know functions ) to get your task done. Just you pass arguments to the functions and it's done. On this website you will find almost all functions with detailed explanation and a sample program showing the usage of a function. To make things easy you are provided with executable files which you can download and execute. Firstly you should know the function initgraph which is used to initialize the graphics mode . To initialize graphics mode we use initgraph function in our program. initgraph function is present in "graphics.h" header file, so your every graphics program should include "graphics.h" header file. We will discuss initgraph withe help of following sample program:- ]]>
Thu, 31 Mar 2016 21:03:12 GMT /slideshow/unit-11-graphics/60302603 AshimLamichhane@slideshare.net(AshimLamichhane) Unit 11. Graphics AshimLamichhane For all who wish to learn c graphics programming, no knowledge of graphics concepts is required. C Graphics programming is very easy and interesting. You can use graphics programming for developing your own games, in making projects, for animation etc. It's not like traditional C programming in which you have to apply complex logic in your program and then you end up with a lot of errors and warnings in your program. In C graphics programming you have to use standard library functions ( need not worry if you don't know functions ) to get your task done. Just you pass arguments to the functions and it's done. On this website you will find almost all functions with detailed explanation and a sample program showing the usage of a function. To make things easy you are provided with executable files which you can download and execute. Firstly you should know the function initgraph which is used to initialize the graphics mode . To initialize graphics mode we use initgraph function in our program. initgraph function is present in "graphics.h" header file, so your every graphics program should include "graphics.h" header file. We will discuss initgraph withe help of following sample program:- <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/graphics-160331210312-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> For all who wish to learn c graphics programming, no knowledge of graphics concepts is required. C Graphics programming is very easy and interesting. You can use graphics programming for developing your own games, in making projects, for animation etc. It&#39;s not like traditional C programming in which you have to apply complex logic in your program and then you end up with a lot of errors and warnings in your program. In C graphics programming you have to use standard library functions ( need not worry if you don&#39;t know functions ) to get your task done. Just you pass arguments to the functions and it&#39;s done. On this website you will find almost all functions with detailed explanation and a sample program showing the usage of a function. To make things easy you are provided with executable files which you can download and execute. Firstly you should know the function initgraph which is used to initialize the graphics mode . To initialize graphics mode we use initgraph function in our program. initgraph function is present in &quot;graphics.h&quot; header file, so your every graphics program should include &quot;graphics.h&quot; header file. We will discuss initgraph withe help of following sample program:-
Unit 11. Graphics from Ashim Lamichhane
]]>
2456 6 https://cdn.slidesharecdn.com/ss_thumbnails/graphics-160331210312-thumbnail.jpg?width=120&height=120&fit=bounds presentation 000000 http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
UNIT 10. Files and file handling in C /slideshow/unit-10-files-and-file-handling-in-c/60239991 filesandfilehandlinginc-160330191730
Concept of file, Opening and closing of file, Modes, Input/ output function, Random access in file, Printing a file A file represents a sequence of bytes on the disk where a group of related data is stored. File is created for permanent storage of data. It is a ready made structure. In C language, we use a structure pointer of file type to declare a file.....]]>

Concept of file, Opening and closing of file, Modes, Input/ output function, Random access in file, Printing a file A file represents a sequence of bytes on the disk where a group of related data is stored. File is created for permanent storage of data. It is a ready made structure. In C language, we use a structure pointer of file type to declare a file.....]]>
Wed, 30 Mar 2016 19:17:29 GMT /slideshow/unit-10-files-and-file-handling-in-c/60239991 AshimLamichhane@slideshare.net(AshimLamichhane) UNIT 10. Files and file handling in C AshimLamichhane Concept of file, Opening and closing of file, Modes, Input/ output function, Random access in file, Printing a file A file represents a sequence of bytes on the disk where a group of related data is stored. File is created for permanent storage of data. It is a ready made structure. In C language, we use a structure pointer of file type to declare a file..... <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/filesandfilehandlinginc-160330191730-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Concept of file, Opening and closing of file, Modes, Input/ output function, Random access in file, Printing a file A file represents a sequence of bytes on the disk where a group of related data is stored. File is created for permanent storage of data. It is a ready made structure. In C language, we use a structure pointer of file type to declare a file.....
UNIT 10. Files and file handling in C from Ashim Lamichhane
]]>
9984 9 https://cdn.slidesharecdn.com/ss_thumbnails/filesandfilehandlinginc-160330191730-thumbnail.jpg?width=120&height=120&fit=bounds presentation 000000 http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Unit 9. Structure and Unions /slideshow/structure-and-unions/60099965 structureandunions-160328042531
Introduction, Array of structure, Passing structure to function, Passing array of structure to function, Structure within structure ( Nested Structure), Union, Pointer to structure]]>

Introduction, Array of structure, Passing structure to function, Passing array of structure to function, Structure within structure ( Nested Structure), Union, Pointer to structure]]>
Mon, 28 Mar 2016 04:25:31 GMT /slideshow/structure-and-unions/60099965 AshimLamichhane@slideshare.net(AshimLamichhane) Unit 9. Structure and Unions AshimLamichhane Introduction, Array of structure, Passing structure to function, Passing array of structure to function, Structure within structure ( Nested Structure), Union, Pointer to structure <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/structureandunions-160328042531-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Introduction, Array of structure, Passing structure to function, Passing array of structure to function, Structure within structure ( Nested Structure), Union, Pointer to structure
Unit 9. Structure and Unions from Ashim Lamichhane
]]>
5648 7 https://cdn.slidesharecdn.com/ss_thumbnails/structureandunions-160328042531-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Unit 8. Pointers /slideshow/pointers-59955174/59955174 pointer-160323210326
Introduction, The & and * operator, Declaration of pointer, Pointer to pointer, Pointer arithmetic, Pointer and array, Pointer with multidimensional array, Pointer and strings, Array of pointer with string, Dynamic memory allocation.]]>

Introduction, The & and * operator, Declaration of pointer, Pointer to pointer, Pointer arithmetic, Pointer and array, Pointer with multidimensional array, Pointer and strings, Array of pointer with string, Dynamic memory allocation.]]>
Wed, 23 Mar 2016 21:03:26 GMT /slideshow/pointers-59955174/59955174 AshimLamichhane@slideshare.net(AshimLamichhane) Unit 8. Pointers AshimLamichhane Introduction, The & and * operator, Declaration of pointer, Pointer to pointer, Pointer arithmetic, Pointer and array, Pointer with multidimensional array, Pointer and strings, Array of pointer with string, Dynamic memory allocation. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/pointer-160323210326-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Introduction, The &amp; and * operator, Declaration of pointer, Pointer to pointer, Pointer arithmetic, Pointer and array, Pointer with multidimensional array, Pointer and strings, Array of pointer with string, Dynamic memory allocation.
Unit 8. Pointers from Ashim Lamichhane
]]>
2418 10 https://cdn.slidesharecdn.com/ss_thumbnails/pointer-160323210326-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Unit 7. Functions /slideshow/unit-7-functions/58846034 functions-160229095817
Library Functions, User defined functions, Recursion, Function declaration, Local and global variables, Use of array in function, Passing by Value, Passing by Address https://github.com/ashim888/csit-c]]>

Library Functions, User defined functions, Recursion, Function declaration, Local and global variables, Use of array in function, Passing by Value, Passing by Address https://github.com/ashim888/csit-c]]>
Mon, 29 Feb 2016 09:58:16 GMT /slideshow/unit-7-functions/58846034 AshimLamichhane@slideshare.net(AshimLamichhane) Unit 7. Functions AshimLamichhane Library Functions, User defined functions, Recursion, Function declaration, Local and global variables, Use of array in function, Passing by Value, Passing by Address https://github.com/ashim888/csit-c <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/functions-160229095817-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Library Functions, User defined functions, Recursion, Function declaration, Local and global variables, Use of array in function, Passing by Value, Passing by Address https://github.com/ashim888/csit-c
Unit 7. Functions from Ashim Lamichhane
]]>
2146 5 https://cdn.slidesharecdn.com/ss_thumbnails/functions-160229095817-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Unit 6. Arrays /slideshow/unit-6-arrays/58845975 unit6arrays-160229095654
Introduction of arrays, Declaration of array, Initialization of array, Sorting, Multidimensional array. Some code examples that will make you clear about the concept of arrays. https://github.com/ashim888/csit-c]]>

Introduction of arrays, Declaration of array, Initialization of array, Sorting, Multidimensional array. Some code examples that will make you clear about the concept of arrays. https://github.com/ashim888/csit-c]]>
Mon, 29 Feb 2016 09:56:54 GMT /slideshow/unit-6-arrays/58845975 AshimLamichhane@slideshare.net(AshimLamichhane) Unit 6. Arrays AshimLamichhane Introduction of arrays, Declaration of array, Initialization of array, Sorting, Multidimensional array. Some code examples that will make you clear about the concept of arrays. https://github.com/ashim888/csit-c <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/unit6arrays-160229095654-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Introduction of arrays, Declaration of array, Initialization of array, Sorting, Multidimensional array. Some code examples that will make you clear about the concept of arrays. https://github.com/ashim888/csit-c
Unit 6. Arrays from Ashim Lamichhane
]]>
2238 6 https://cdn.slidesharecdn.com/ss_thumbnails/unit6arrays-160229095654-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Unit 5. Control Statement /slideshow/unit-5-control-statement/58845921 unit5-160229095534
Branching, Looping, Conditional Statement, Exit function, Difference between break and exit. Some of the codes and some of the branching techniques are covered in this unit. Check conditional statement looping and exit functions too https://github.com/ashim888/csit-c]]>

Branching, Looping, Conditional Statement, Exit function, Difference between break and exit. Some of the codes and some of the branching techniques are covered in this unit. Check conditional statement looping and exit functions too https://github.com/ashim888/csit-c]]>
Mon, 29 Feb 2016 09:55:34 GMT /slideshow/unit-5-control-statement/58845921 AshimLamichhane@slideshare.net(AshimLamichhane) Unit 5. Control Statement AshimLamichhane Branching, Looping, Conditional Statement, Exit function, Difference between break and exit. Some of the codes and some of the branching techniques are covered in this unit. Check conditional statement looping and exit functions too https://github.com/ashim888/csit-c <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/unit5-160229095534-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Branching, Looping, Conditional Statement, Exit function, Difference between break and exit. Some of the codes and some of the branching techniques are covered in this unit. Check conditional statement looping and exit functions too https://github.com/ashim888/csit-c
Unit 5. Control Statement from Ashim Lamichhane
]]>
3380 10 https://cdn.slidesharecdn.com/ss_thumbnails/unit5-160229095534-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Unit 4. Operators and Expression /slideshow/unit-4-operators-and-expression/58845877 operators-160229095423
Arithmetic operator, Relational operator, Logical or Boolean operator, Assignment, Operator, Ternary operator, Bitwise operator, Increment or Decrement operator, Comma operator. https://github.com/ashim888/csit-c]]>

Arithmetic operator, Relational operator, Logical or Boolean operator, Assignment, Operator, Ternary operator, Bitwise operator, Increment or Decrement operator, Comma operator. https://github.com/ashim888/csit-c]]>
Mon, 29 Feb 2016 09:54:23 GMT /slideshow/unit-4-operators-and-expression/58845877 AshimLamichhane@slideshare.net(AshimLamichhane) Unit 4. Operators and Expression AshimLamichhane Arithmetic operator, Relational operator, Logical or Boolean operator, Assignment, Operator, Ternary operator, Bitwise operator, Increment or Decrement operator, Comma operator. https://github.com/ashim888/csit-c <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/operators-160229095423-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Arithmetic operator, Relational operator, Logical or Boolean operator, Assignment, Operator, Ternary operator, Bitwise operator, Increment or Decrement operator, Comma operator. https://github.com/ashim888/csit-c
Unit 4. Operators and Expression from Ashim Lamichhane
]]>
1695 7 https://cdn.slidesharecdn.com/ss_thumbnails/operators-160229095423-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Unit 3. Input and Output /slideshow/unit-3-input-and-output/58845822 inputoutput-160229095310
Conversion specification, I/O operation, Formatted I/O https://github.com/ashim888/csit-c]]>

Conversion specification, I/O operation, Formatted I/O https://github.com/ashim888/csit-c]]>
Mon, 29 Feb 2016 09:53:09 GMT /slideshow/unit-3-input-and-output/58845822 AshimLamichhane@slideshare.net(AshimLamichhane) Unit 3. Input and Output AshimLamichhane Conversion specification, I/O operation, Formatted I/O https://github.com/ashim888/csit-c <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/inputoutput-160229095310-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Conversion specification, I/O operation, Formatted I/O https://github.com/ashim888/csit-c
Unit 3. Input and Output from Ashim Lamichhane
]]>
13317 4 https://cdn.slidesharecdn.com/ss_thumbnails/inputoutput-160229095310-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Unit 2. Elements of C /slideshow/unit-2-elements-of-c/58845727 elementsofc-160229095039
C Tokens, Escape sequence, Delimiters, Variables, Data types, Constants/ Literals, Expressions, Statements and Comments https://github.com/ashim888/csit-c]]>

C Tokens, Escape sequence, Delimiters, Variables, Data types, Constants/ Literals, Expressions, Statements and Comments https://github.com/ashim888/csit-c]]>
Mon, 29 Feb 2016 09:50:39 GMT /slideshow/unit-2-elements-of-c/58845727 AshimLamichhane@slideshare.net(AshimLamichhane) Unit 2. Elements of C AshimLamichhane C Tokens, Escape sequence, Delimiters, Variables, Data types, Constants/ Literals, Expressions, Statements and Comments https://github.com/ashim888/csit-c <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/elementsofc-160229095039-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> C Tokens, Escape sequence, Delimiters, Variables, Data types, Constants/ Literals, Expressions, Statements and Comments https://github.com/ashim888/csit-c
Unit 2. Elements of C from Ashim Lamichhane
]]>
7236 5 https://cdn.slidesharecdn.com/ss_thumbnails/elementsofc-160229095039-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
Unit 1. Problem Solving with Computer /slideshow/unit-1-problem-solving-with-computer/58845564 chapter1copy-160229094610
Problem analysis, Algorithms and Flowchart, Coding, Compilation and Execution, History of C, Structure of C program, Debugging, Testing and Documentation https://github.com/ashim888/csit-c]]>

Problem analysis, Algorithms and Flowchart, Coding, Compilation and Execution, History of C, Structure of C program, Debugging, Testing and Documentation https://github.com/ashim888/csit-c]]>
Mon, 29 Feb 2016 09:46:10 GMT /slideshow/unit-1-problem-solving-with-computer/58845564 AshimLamichhane@slideshare.net(AshimLamichhane) Unit 1. Problem Solving with Computer AshimLamichhane Problem analysis, Algorithms and Flowchart, Coding, Compilation and Execution, History of C, Structure of C program, Debugging, Testing and Documentation https://github.com/ashim888/csit-c <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/chapter1copy-160229094610-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Problem analysis, Algorithms and Flowchart, Coding, Compilation and Execution, History of C, Structure of C program, Debugging, Testing and Documentation https://github.com/ashim888/csit-c
Unit 1. Problem Solving with Computer from Ashim Lamichhane
]]>
37426 18 https://cdn.slidesharecdn.com/ss_thumbnails/chapter1copy-160229094610-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0
https://cdn.slidesharecdn.com/profile-photo-AshimLamichhane-48x48.jpg?cb=1676974103 I believe learning backed by experience is crucial to build up a strong career in any field; Information technology is no exception to the rule. ashimlamichhane.com.np/ https://cdn.slidesharecdn.com/ss_thumbnails/searching-160817101845-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/searching-65079305/65079305 Searching https://cdn.slidesharecdn.com/ss_thumbnails/sorting-160810203705-thumbnail.jpg?width=320&height=320&fit=bounds AshimLamichhane/sorting-64885019 Sorting https://cdn.slidesharecdn.com/ss_thumbnails/tree-160731205832-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/tree-data-structure-64560545/64560545 Tree - Data Structure