COMSCIGUIDE

Menu

Skip to content
  • Home
  • C,C++,Algorithms,Data Structures
    • C,C++
    • Algorithms
    • Data Structures
    • Programs
  • Java
    • Java Concepts
    • Quiz
    • Interview Questions
    • Programs
  • Computer Tricks
  • My YouTube Channel
    • 24 Standard Interview Puzzles
    • Puzzles videos page
    • Aptitude Training

C, C++


  1. What is Polymorphism
  2. Programs those work in C but not in C++
  3. Difference between malloc(),calloc(),realloc() 
  4. Dynamic memory allocation (Stack vs Heap)
  5. 3 ways to solve recurrence relations
  6. Difference between Balanced,Ordered,Full,Strict,Complete,Perfect Binary tree
  7. Graph Terminology 
  8. How analysis of algorithms is done?
  9. EXTERN - wherever u define variables, it will get access to them
  10. TYPEDEF - create variables by name
  11. Comma - the lowest priority operator
  12. Precedence of operators in function parameters
  13. Associativity of operators
  14. ENUM - make your names as data types
  15. CONST - once initialized, no one can change it
  16. Keywords and reserved words
  17. Four Pillars of OOPS concepts
  18. "using namespace std" what does it represents??
  19. Global and local variables
  20. General Structure of a C++ program
  21. How a setw() funtion works??
  22. Parameters and Arguments , Are they represent same ??
  23. How a .exe file is created?

Home

Labels

  • C
  • C++
  • coding
  • compile time constant
  • data structures
  • interview.
  • Java
  • java constants
  • lookupswitch
  • run time constant
  • sort algorithms
  • tableswitch

Popular Posts

  • Differences between Complete, Balanced, Ordered, Full, Perfect Binary tree
    Binary Tree: A Tree in which each node has a degree of atmost 2. i.e. it can have either 0,1 or 2 children. Here, leaves a...
  • Sinking sort - Better than quick sort (in some cases)
    BUBBLE SORT :                                                          Bubble sort is a simple sorting algorithm ...
  • Graph Terminology
    Adjacent vertices :         An adjacent vertex of a vertex v in a graph G is a vertex that is connected to v by an edge.        ...

Blog Archive

  • March 2017 (1)
  • March 2016 (1)
  • October 2015 (1)
  • September 2015 (1)
  • August 2015 (5)
  • July 2015 (2)
  • June 2015 (4)
  • January 2015 (4)
  • December 2014 (5)
  • November 2014 (1)
  • October 2014 (1)
  • September 2014 (3)
Powered by Blogger.
Copyright © COMSCIGUIDE | Powered by Blogger
Design by Srini G | Blogger Theme by NewBloggerThemes.com

Adblock is enabled

We have detected that you are using adblock on your web browser. Please disable ADBLOCK on this domain ( ""Don't run on pages of this domain "") and reload this page to hide this.
Thanks.

No popup. We promise!

Install Detector