Skip to content
Top Menu
June 20, 2025
  • Home
  • Privacy Policy
  • Disclaimer
  • Terms and conditions
  • Contact
  • Facebook
  • twitter
  • Youtube
  • Pinterest
  • Instagram
Technotaught

Technotaught

  • Home
    • Contact
    • About
    • Privacy Policy
    • Terms and conditions
  • Tips/Tricks
  • How to
  • Blogs
    • WordPress
    • Linux
    • Internet
    • Mobile Phones
    • Business
  • Languages
    • Programming
    • JAVA
    • DSA
    • PYTHON
  • Advertise With Us
Main Menu

DSA practical

infix to postfix
DSA practical

Implementation of Infix to Postfix expression

November 10, 2018October 16, 2020 - by Ashishkumar Vishwakarma - 1 Comment

In this article we will see Implementation of Infix to Postfix expression Implementation of Infix to Postfix expression Also, you can use the C compiler to compile a program. Read more: – Double …

Implementation of Infix to Postfix expression Read More
DSA practical

8: Implementation of Quick Sort| Merge Sort| Heap Sort Algorithm.

November 10, 2018August 1, 2019 - by Ashishkumar Vishwakarma - 1 Comment

8: Implementation of Quick Sort| Merge Sort| Heap Sort Algorithm. Q. Sorting Techniques? ANS.: Quick Sort: Partitioning the array to be sorted and each partition is, in turn, sorted recursively. …

8: Implementation of Quick Sort| Merge Sort| Heap Sort Algorithm. Read More
DSA practical

#12 : Binary Search Algorithm.

November 10, 2018November 10, 2018 - by Ashishkumar Vishwakarma - Leave a Comment

Binary Search Algorithm Q. Explain binary search? ANS.: Search elements in sorted array efficiently by using first, mid and last . Programming for Binary Search Algorithm. Source Code. #include<stdio.h> #include<conio.h> …

#12 : Binary Search Algorithm. Read More
DSA practical

Double Ended Queue or Deque

November 10, 2018December 29, 2019 - by Ashishkumar Vishwakarma - Leave a Comment

A Deque or deck is a Double Ended Queue. Allows elements to be added or removed on either the ends. Deque is a generalized version of a Queue data structure …

Double Ended Queue or Deque Read More
DSA practical

Implementation of Linked List

November 10, 2018August 3, 2019 - by Ashishkumar Vishwakarma - 1 Comment

Before the implementation of Linked List, we first learn what is LL, Operation, and Types. Implementation of Linked List Q. What is a linked list? ANS.: Collection of a node …

Implementation of Linked List Read More
DSA practical

Stack using Linked List.

November 10, 2018November 22, 2020 - by Ashishkumar Vishwakarma - 1 Comment

This article explains to you how to implement Stack using Linked List.  1. What is a Stack? ANS.: An Ordered collection of elements using LIFO(Last in First Out) mechanism. 2. Operations …

Stack using Linked List. Read More
DSA practical

Queue using linked list.

November 10, 2018November 10, 2018 - by Ashishkumar Vishwakarma - Leave a Comment

Queue. •Define queue.ANS.: Collection of elements using FIFO (First in First Out) mechanism. •Operations performed on queue?ANS.: enqueue (insertion), dequeue (deletion) & display. •. Applications of queue?ANS.: Round Robin technique …

Queue using linked list. Read More
DSA practical

Implementation of Stack Using Array in C

November 9, 2018November 29, 2020 - by Ashishkumar Vishwakarma - 1 Comment

In this we will learn the Implementation of Stack Using Array in C Stack. 1. What is a stack? ANS.: An ordered collection of elements using the LIFO(Last in First …

Implementation of Stack Using Array in C Read More

Categories

  • Business
  • Cloud
  • DSA practical
  • How to
  • Internet
  • Java Practical
  • Linux
  • Mobile Phones
  • News
  • Programming
  • Python
  • Stocks
  • Tips and Tricks
  • WordPress

Recent Comments

  • reviewunbox on Best wireless earphones under 2000
  • Ashishkumar Vishwakarma on Adobe Photoshop Free Download CS6 Portable
  • Ashishkumar Vishwakarma on Adobe Photoshop Free Download CS6 Portable

Menu

  • Home
  • Privacy Policy
  • Disclaimer
  • Terms and conditions
  • Contact
Copyright © 2025 Technotaught.
Powered by WordPress and HitMag.