Data Structure in C website content writer
₹600-1500 INR
Paid on delivery
I am developing a tutorial website for C,C++,Data Structures [login to view URL] can take idea from [login to view URL] the content writing style division must be easy to understand because I am making a website to help engineering students to pass in this subject easily and get a place to learn
Content must not be copy pasted although question examples theory can be consulted.
Work is like that you have to write your own book of data structure in [login to view URL] is a low budget website so please be reasonable because while writing this book you will learn a lot
Syllabus is like this :
Unit - I
Introduction: Basic Terminology, Elementary Data Organization, Algorithm, Efficiency of
an Algorithm, Time and Space Complexity, Asymptotic notations: Big-Oh, Time-Space
trade-off. Abstract Data Types (ADT)
Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row
Major Order, and Column Major Order, Application of arrays, Sparse Matrices and their
representations.
Linked lists: Array Implementation and Dynamic Implementation of Singly Linked Lists,
Doubly Linked List, Circularly Linked List, Operations on a Linked List. Insertion,
Deletion, Traversal, Polynomial Representation and Addition, Generalized Linked List
.
Unit – II
Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked
Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions,
Evaluation of postfix expression, Recursion, Tower of Hanoi Problem, Simulating
Recursion, Principles of recursion, Tail recursion, Removal of recursion
Queues, Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues,
Array and linked implementation of queues in C, Dequeue and Priority Queue.
Unit – III
Trees: Basic terminology, Binary Trees, Binary Tree Representation: Array
Representation and Dynamic Representation, Complete Binary Tree, Algebraic
Expressions, Extended Binary Trees, Array and Linked Representation of Binary trees,
Tree Traversal algorithms: Inorder, Preorder and Postorder, Threaded Binary trees,
Traversing Threaded Binary trees, Huffman algorithm.
Unit – IV
Graphs: Terminology, Sequential and linked Representations of Graphs: Adjacency
Matrices, Adjacency List, Adjacency Multi list, Graph Traversal : Depth First Search
and Breadth First Search, Connected Component, Spanning Trees, Minimum Cost
Spanning Trees: Prims and Kruskal algorithm. Transistive Closure and Shortest Path
algorithm: Warshal Algorithm and Dijikstra Algorithm, Introduction to Activity Networks
Unit – V
Searching : Sequential search, Binary Search, Comparison and Analysis
Internal Sorting: Insertion Sort, Selection, Bubble Sort, Quick Sort, Two Way Merge
Sort, Heap Sort, Radix Sort, Practical consideration for Internal Sorting.
Search Trees: Binary Search Trees(BST), Insertion and Deletion in BST, Complexity of
Search Algorithm, AVL trees, Introduction to m-way Search Trees, B Trees & B+ Trees
Hashing: Hash Function, Collision Resolution Strategies
Storage Management: Garbage Collection and Compaction
Content must pass copyscape test and if you know SEO it will be an advantage
Content must be around 250-700 pages (Please don't use stupid extra words just to increase words and since all the topics need to covered take all the words you need to explain concept nicely)
I will be needing an article first to check suitability of work
Happy Bidding
Project ID: #5235807
About the project
3 freelancers are bidding on average ₹3389 for this job
Dear Sir, I am highly interested to work with you as a content developer. I have following key skills: 1. I have 7 years of teaching experience of an engineering college. 2. I have written 2 books as a freelancer More