Wikitechy
  • TUTORIALS
  • TECHNOLOGY
    • ARTICLES
  • FULL FORMS
  • ERRORS & FIXES
  • INTERVIEW
  • PROJECTS
  • VIDEOS
    • QUANTITATIVE APTITUDE
    • NON VERBAL
    • GROUP DISCUSSION
    • COUNTRY WISE INTERVIEW QUESTIONS
    • ENGINEERING
  • CAREERS
    • HR INTERVIEW QUESTIONS & ANSWERS
    • GD INTERVIEW
    • RESUME SAMPLES
    • LETTERS
    • ENGINEERING
    • APTITUDE
    • REASONING
    • COMPANY QUESTIONS
    • COUNTRY WISE VISA
    • VISA DRESS CODE
  • BUSINESS
    • TOP WEB HOSTING
    • TOP CAR ACCIDENT LAWYERS
    • TOP CAR INSURANCE
    • TOP SOFTWARE TOOLS
    • TOP 10
    • LUNG CANCER
Wikitechy

Wikitechy are a great place to talk about technology, science, and culture.

  • TUTORIALS
  • TECHNOLOGY
    • ARTICLES
  • FULL FORMS
  • ERRORS & FIXES
  • INTERVIEW
  • PROJECTS
  • VIDEOS
    • QUANTITATIVE APTITUDE
    • NON VERBAL
    • GROUP DISCUSSION
    • COUNTRY WISE INTERVIEW QUESTIONS
    • ENGINEERING
  • CAREERS
    • HR INTERVIEW QUESTIONS & ANSWERS
    • GD INTERVIEW
    • RESUME SAMPLES
    • LETTERS
    • ENGINEERING
    • APTITUDE
    • REASONING
    • COMPANY QUESTIONS
    • COUNTRY WISE VISA
    • VISA DRESS CODE
  • BUSINESS
    • TOP WEB HOSTING
    • TOP CAR ACCIDENT LAWYERS
    • TOP CAR INSURANCE
    • TOP SOFTWARE TOOLS
    • TOP 10
    • LUNG CANCER

Browsing Category

c programming

30 posts

C Algorithm – Reverse a String using Stack

  • Venkatesan Prabu
  • December 26, 2017
  • 1 share
    1
    0
    0
C Algorithm – Evaluation of Postfix Expression – Data Structure -Given a string, reverse it using stack. For example “GeeksQuiz” should be converted
View Post

C Algorithm – Introduction to Stack

  • Venkatesan Prabu
  • December 24, 2017
C Algorithm -Introduction to Stack – Data Structure -Stack is a linear data structure which follows a particular order in which the operations
View Post

C Programming-Swap all odd and even bits

  • Venkatesan Prabu
  • December 21, 2017
  • 11 shares
    11
    0
    0
Given an unsigned integer, swap all odd bits with even bits. For example, if the given number is 23 (00010111), it should be converted to 43 (00101011).
View Post

C Programming-Binary representation of a given number

  • Venkatesan Prabu
  • December 20, 2017
  • 16 shares
    16
    0
    0
C Programming – Binary representation of a given number – Bit Algorithm – Write a program to print Binary representation of a given number.
View Post

C Program to find whether a no is power of two

  • Venkatesan Prabu
  • October 26, 2017
  • 1 share
    1
    0
    0
C Program to find whether a no is power of two – Bit Algorithm – Given a positive integer, write a function to find if it is a power of two or not.
View Post

C Programming – Find if there is a path between two vertices in a directed graph

  • Venkatesan Prabu
  • October 26, 2017
  • 5 shares
    5
    0
    0
C Programming – Find if there is a path between two vertices in a directed graph – check whether there is a path from the first given vertex to second.
View Post

C Programming – Matrix Chain Multiplication

  • Venkatesan Prabu
  • October 26, 2017
C Programming – Matrix Chain Multiplication – Dynamic Programming MCM is an optimization problem that can be solved using dynamic programming.
View Post

C Programming-Backtracking Set 1 (The Knight’s tour problem)

  • Venkatesan Prabu
  • October 15, 2017
C Programming-Backtracking Set 1 (The Knight’s tour problem) – Backtracking – Backtracking is an algorithmic paradigm that tries different solutions until finds a solution that “works”. Problems which are typically solved using backtracking technique have following property in common.
View Post

C Programming-Print all possible strings that can be made by placing spaces

  • Venkatesan Prabu
  • October 15, 2017
C Programming-Print all possible strings that can be made by placing spaces – Searching and Sorting – The idea is to use recursion and create a buffer.
View Post

C Program Count 1’s in a sorted binary array

  • Venkatesan Prabu
  • October 15, 2017
C Program Count 1’s in a sorted binary array – Searching and Sorting – A simple solution is to linearly traverse the array. The time complexity of the simple solution is O(n). We can use Binary Search to find count in O(Logn) time.
View Post

Posts navigation

1 2 3 Next

  • INTERVIEW TIPS
  • Final Year Projects
  • GD Interview
  • Resume Samples
  • Engineering
  • Aptitude
  • Reasoning
  • Company Questions
  • Country wise visa
  • Interview Dress Code
  • CAREER GUIDANCE
  • Entrance Exam
  • Colleges
  • Admission Alerts
  • ScholarShip
  • Bitcoin Mixer
  • Education Loans
  • Letters
  • Learn Languages

World's No 1 Animated self learning Website with Informative tutorials explaining the code and the choices behind it all.

WIKITECHY
  • About Us
  • Terms Of Use
  • Privacy Policy
  • Contact Us
WORKSHOP
  • Bug Bounty
  • Webinar
JOIN OUR COMMUNITY
  • Advertise
OTHER LANGUAGES
  • English
  • Chinese
  • Deutsch
  • Russian
Wikitechy
Designed & Developed by Code Supply Co.