• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar

Pro Programming

Professional way of Programming: Learn C, C++, Java, Python, Dot Net, Android the professional way

  • Home
  • C MCQs
  • C/C++ Programs
  • Java Programs
  • C#
  • Python
  • MySQL
  • Topics
    • Arrays
    • Strings
    • Link Lists
    • Trees
    • Shapes
  • Projects
  • Articles
  • Games
You are here: Home / Archives for Qualcomm

Qualcomm

Qualcomm Interview Experience ( On-Campus Drive)

Leave a Comment


Summary-

Round1: Test consists of 3 parts with 60 questions 90min. Marking scheme is +4 & -1.

Round2: Technical interview1 (30 min)

Round3: Technical interview2 (30 min)

Round4: HR (15 min)

Detailed-

Round1(Online Test) – There is a different qualifying cut for each section.

The test consist of 3 sections: All need to attempt in order, we are allowed to switch between questions of the same section but cannot switch between sections.

Section1: This section consists of basic aptitude questions like train, permutation & combination, probability, boat, work, etc.

Section2: This section contains the questions of code snippet(given a code what is the output)

Section3: This section contains basic Gate level questions mainly focused on DS, Algo, OS, CO, Networks.

Round2(Tech interview1) – It was a one to one interview. He asked me to write pen-paper codes, questions from C, OS, CO, etc.

Questions:

  1. Reverse a stack without using extra space.

  2. Construct a tree from pre-order and in-order traversal.

  3. Given an array which has numbers from 1 to n. There are 2 numbers replaced with 0. Find both numbers in O(n) time and O(1) space.

  4. What is priority inversion?

  5. Let us suppose there are multiple .c files and you want a function from a particular file can only be accessed in that c file only. (Ans- Use static keyword)

  6. What is Volatile keyword?

  7. A lot of questions from IPC, Cache, Paging.

Round3(Tech interview2) – It was also a one to one interview. I was the last person left for round 2 and it was around 9 pm, so everyone was drained.

Interviewer: Do you know how to construct a balanced tree.

Me: I only know that we can use a red-black tree or AVL tree, but I don’t know how they work.

Interviewer: Ok, then what do you know in Algorithms.

Me: Sorting, Graphs.

I want him to ask from graphs but he started with Linked list.

Questions:

  1. He asked all the possible questions from the linked list starting from construction of SLL to finding loops etc.

  2. Then he asked me questions from C programming, OS, CO.

Round4(HR) – This was more of one-sided. HR told me about the company asked me about locations preferences etc.

Both round 2 and 3 last up to around 30min. All the questions were basic level instead of 2-3 fancy terms that I ended up answering “I don’t know”.

Suggestions- They asked a lot of questions from oops, data structure, C programming, os, co, etc. One panel was also asking questions from ML like PCA, LDA, SVM, etc.

They also asked riddle-like(google them for details)-

  1. King and 100 poison bottle

  2. Bridge crossing (person with different time and one torch)

  3. Measure time from the rope, sand clock, etc.

Note: There were other questions that I don’t remember.


If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to [email protected]. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the “Improve Article” button below.

Article Tags :


thumb_up
Be the First to upvote.

Please write to us at [email protected] to report any issue with the above content.


Post navigation


Previous

first_page Citrix Interview Experience (On Campus 2019)




Source link

Filed Under: c programming Tagged With: •   Dynamic Programming, 2019), About Us, Adobe Interview Experience | Set 35 (Off-Campus Drive), Adobe Interview Experience | Set 36 (Off-Campus Drive), Advanced Data Structure, Advanced Topics, Algo ▼, Algorithm Paradigms ►, Algorithms, All Algorithms, All Data Structures, Amazon Internship Interview Experience, Amazon Interview -SDE 1 Interview Experience, Amazon Interview | SDE-1 (On Campus), Amazon Interview experience (Off-Campus 2019), Amazon Interview Experience (On Campus for SDE-1), Amazon Interview Experience (On-Campus for SDE-1) 2019, Amazon Interview Experience (On-Campus), Amazon Interview Experience (Pool campus-2019), Amazon Interview Experience (SDE-1)| Off-Campus | Recruitment Drive, Amazon Interview Experience | Set 190 (Delhi Drive), Amazon Interview Experience SDE 1 (2.5 Years Experienced), Amazon Interview Experience SDE1, Amazon Interview Experiences for Internship (on campus), Amazon off campus ( All India campus hiring ) SDE 1, Amazon Pune Pool Campus Interview, Amazon SDE 1 Interview Experience, Amazon SDE Interview experience (July20, Amazon SDE-2 Experience (6.5 Years Exp), Analysis of Algorithms, Aptitude, Array, Backtracking, Binary Search Tree, Binary Tree, Bit Algorithms, Branch & Bound, C, Campus Ambassador Program, Campus Geek of the Month, Careers, Citrix Interview Experience (On Campus 2019), Company Prep, Company-wise, Competitive Programming, Compiler Design, Computer Graphics, Computer Networks, Computer Organization, Computer Organization & Architecture, Contact Us, contribute.geeksforgeeks.org, Core Subjects ►, Courses, CS Subjects, CS Subjects ▼, CS Subjectwise ►, CSS, Data Structures, DBMS, Dell EMC Drive Interview Experience, Design Patterns, Deutsche Bank Interview Experience, Digital Electronics, Divide and Conquer, DS ▼, Engg. Mathematics, Engineer role ), Enquero Interview Experience | Set 1 (Campus Drive), Experienced Interviews, Flipkart Interview Experience for SDE-1, Game Theory, GATE ▼, GATE 2020, GATE CS Corner, GATE Notes, GATE Official Papers, GBlog, Geek of the Month, Geek on the Top, Genpact Interview Experience | Set 1 (On-Campus Drive), Geometric Algorithms, Goldman Sachs Interview Experience, Goldman Sachs Interview Experience | For 1.5+ Years Experienced, Goldman Sachs Interview Experience 2019, Google Interview Experience (Off-Campus), Google Interview Questions, Graph, Graph Algorithms, Greedy Algorithms, Hashing, Heap, Hire with Us , How to begin?, HTML, HTML & XML, ide.geeksforgeeks.org, InfyTQ 2019, Internship, Internship Interviews, Internships, Interview ▼, Interview Experiences, ISRO CS Exam, Java, JavaScript, JP Morgan Chase & Co. (JPMC) Interview Experience | (Full time Software Engineer), jQuery, Languages, Languages ►, Languages ▼, Last Minute Notes, LinkedList, Machine Learning, Mathematical Algorithms, Matrix, Microprocessor, Microsoft Internship (On-Campus), Microsoft Interview Experience (For Summer 2019 Internship), Microsoft Interview Experience (SDE Intern-2020-On Campus ), Microsoft Interview Experience | (On-Campus for Internship), Microsoft Interview Experience for Azure Team Hyderabad, Multiple Choice Quizzes, NXP Interview Experience | (Pool Campus Drive), On-Campus, Operating Systems, Oracle Interview Experience | Set 53 (Placement Drive), Pattern Searching, Paytm Interview Experience | Set 4 (Walk-in Drive), Paytm Interview Experience | Set 5 (Recruitment Drive), Paytm Interview Experience | Set 6 (Recruitment Drive), Perl, PHP, Placement Course, Practice, Practice Company Questions, Privacy Policy, Program Output, Project, Puzzles, Python, Qualcomm, QualComm Campus Interview Experience, Qualcomm Interview Experience, Qualcomm Interview Experience | (Pool Campus Drive), Queue, Quizzes ▼, Randomized Algorithms, Samsung Interview Experience (SRI-Noida On-campus 2018, Samsung Interview Experience through Co-cubes (2019), Samsung R & D Noida Interview Experience (On-Campus), SAP Labs Interview Experience | Set 22 (Pool Drive), Scala, School Programming, Searching Algorithms, Skip to content, Software Engineering, Some rights reserved, Sorting Algorithms, SQL, Stack, Strings, Students ▼, Suggest an Article, TCS Interview experience - Off campus drive via NQT, TCS NQT Coding Questions & How Coding Task Evaluated in TCS NQT, Testimonials, Theory of Computation, Top Topics, Topic-wise, Topicwise ►, Tree based DS ►, Uber Interview Experience (SDE 3.5 Years), UGC NET CS Paper II, UGC NET CS Paper III, UGC NET Papers, Video Tutorials, Videos, Web Technology, What’s Difference?, Write an Article, Write Interview Experience, Write your Interview Experience, Zoho Interview Experience | Set 42(Off-Campus)

TCS NQT 2018 (Recruitment Exam)

Leave a Comment


I am from “Institute of Engineering and Management, Kolkata”.

Round 1: TCS conducted a National Qualifier Test (NQT) as the first round of recruitment process this year. There was no concept of Campus Recruitment had happened this year. They fixed two specific dates for this NQT exam that was 2nd September 2018 and 3rd September 2018. There were 3 slots for each day. Question sets were the same for all for the same slot but different for either slot.

There were four sections in that online exam with sectional cut offs. four sections are 1. English test 2. Aptitude test 3. Computer proficiency test 4. Coding test.

My slot timing was in the 3rd slot on 2nd. English section was pretty much normal basically fill in the blanks type. In the aptitude section, there are two subsections one is normal and another is advanced. Computer proficiency section was also the same type and many questions were asked from ds and c-programming code snippet. And the last section was the Coding section.

Results were declared via mail on 8th September and I was luckily qualified in the first round. From our college, almost 650 students appeared for that exam and 413 students are qualified for the F2F interview.

Round 2: On the very next day of the first round result declaration I got another mail from TCS for the Interview date and place which was conducted on TCS Gitanjali Park office, Kolkata.

I had my interview on 11th September from 12 p.m and onwards. I arrived at the TCS office at 11.30 a.m. After waiting for a long I got my call around 4.15 p.m.

Now here I am going to share my interview experience. I will write interviewer 1 as I1, interviewer 2 as I2 and myself as M :

.

.

M: May I come in?

I1: Yes.

M: Good afternoon sir, good afternoon ma’am.

<< without giving any reply back >>

I1: Mainak, tell me the basic difference between the Ipv4 and Ipv6?

<<I have not mentioned “networking” in my resume >>

M: …. somehow manage to answer very basic.

I1: Seems not so happy. ” you are giving an answer, like a class 5 child”. Then again asked a question from networking.

I1: what is your final semester subsects?

M: After a big pause… Sorry, sir! I don’t know as currently, I am in 7th sem.

I1: So what is your 7th sem subjects and 6th sem subjects?

M: Ans with confidence.

<<As I was not prepared for this kind of questions. I lose my confidence took permission for having some water in between the interview process>>

I1: Final year project related questions

M: Ans with confidence.

I1: DBMS related questions

M: Answer

I1: Questions related to Extracurricular activities and some questions related to marketing.

M: Manage to answer every question.

<In between this I2 was only observing me and my answers…. Not a single question was asked by her>

After the Interview, I was asked to wait outside. Again after waiting a long I was asked to leave for the day.

.

.

A few days later, results out and as expected my name was not there in the list.

From the 413 qualified students, only 192 students got the offer letter.

I can say Luck really matters a lot in case of every interview. If you get a good panel you will be hired easily.

Best Of Luck!!!!!!!!!!!!!

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to [email protected]. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the “Improve Article” button below.

Article Tags :


thumb_up
1

Please write to us at [email protected] to report any issue with the above content.


Post navigation


Previous

first_page Oyo Interview Experience

Next

last_page Goldman Sachs Interview Experience (On-campus for Summer Internship)







Source link

Filed Under: c programming Tagged With: •   Dynamic Programming, 0 - 1 Knapsack Problem, 1s and 2s, About Us, Add two numbers represented by linked lists, Adobe, Adobe Practice Problems, Advanced Data Structure, Advanced Topics, Algo ▼, Algorithm Paradigms ►, Algorithms, All Algorithms, All Data Structures, Amazon, Amazon Practice Problems, Analysis of Algorithms, Aptitude, Array, Arrays, Backtracking, BFS, BFS Traversal, Binary Search, Binary Search Tree, Binary Tree, Bit Algorithms, Bit Magic, Branch & Bound, C, C++ Quiz, Campus Ambassador Program, Careers, Check for Balanced Tree, Check if a number is Bleak, Check if a number is power of another number, Company Prep, Company-wise, Competitive Programming, Compiler Design, Computer Graphics, Computer Networks, Computer Organization, Computer Organization & Architecture, Connect Nodes at Same Level, Consecutive 1's not allowed, Contact Us, Contests, contribute.geeksforgeeks.org, Core Subjects ►, Courses, CPP Functions, CS Subjects, CS Subjects ▼, CS Subjectwise ►, D E Shaw, Data Structures, DBMS, Design Patterns, Detect a negative cycle., DFS, Dictionary, Digital Electronics, Directi, Directi Practce Problems, Divide and Conquer, DS ▼, Egg Dropping Puzzle, Engg. Mathematics, Experienced Interviews, Find Nth root of M, Find the number of islands, Finding middle element in a linked list, Flattening a Linked List, Flipkart, Flipkart Practice Problems, Game Theory, GATE ▼, GATE 2019, GATE CS Corner, GATE CS Notes, GATE Notes, GATE Official Papers, GBlog, Geek of the Month, Geek on the Top, Geeks Classes, General Electric (GE) | Campus selections for EEDP program, Geometric, Geometric Algorithms, Goldman Sachs, Goldman Sachs Interview Experience, Goldman Sachs Interview Experience (On-campus for Summer Internship), Goldman Sachs Interview Experience | (On campus Internship for Operations profile), Graph, Graph Algorithms, Greedy Algorithms, Hash, Hashing, Heap, HeapSort, How to begin with Competitive Programming?, How to prepare for ACM-ICPC?, HTML & XML, ide.geeksforgeeks.org, Implement a stack with push(), Implement Queue using Linked List, Implement Stack using Queues, Insertion Sort, Internship, Internship Interviews, Internships, Interview ▼, Interview Experiences, Inversion of array, Is Binary Number Multiple of 3, ISRO, ISRO CS Exam, Java, Java Collections, Java-Functions, Java.lang package, Java.util Package, JavaScript, Jumping Numebrs, K distance from root, k largest elements, Kadane's Algorithm, Key Pair, Languages, Languages ►, Languages ▼, Last Minute Notes, Left View of Binary Tree, Level Order traversal, Linked List, Linkedin Internship Interview Experience, LinkedList, Longest Increasing Subsequence, Longest Palindromic Subsequence, Longest Repeated Subsequence, Machine Learning, Mathematical, Mathematical Algorithms, Matrix, Max Sum without Adjacents, Maximum of all subarrays of size k, Maximum Width of Tree, MergeSort, Microprocessor, Microsoft, Microsoft IDC Interview Experience, Microsoft Practice Problems, Mirror Tree, More Company Interview Experiences, More Company-wise Practice Problems, Multiple Choice Quizzes, Must Do Coding Questions Company-wise, Must Do Coding Questions Topic-wise, Next greater number set digits, Non Repeating Character, Number Theory, Nutanix Interview Experience 2018, Ola Cabs, Ola Cabs Practice Problems, On-Campus, Operating Systems, Oracle, Oracle Practice Problems, Oyo Interview Experience, Pattern Searching, Paytm, Paytm Practice Problems, Permutations of a given string, PHP, PHP-function, Placement Course, pop() and min() in O(1) time, Possible words from Phone digits, Practice Company Questions, Privacy Policy, Program Output, Project, Puzzles, Python, Python List, QA - Placement Quizzes, Qualcomm, Queue, QuickSort, Quizzes ▼, Randomized Algorithms, Remove duplicate element from sorted Linked List, Remove every k'th node, Remove Spaces from string, Reverse a Linked List in groups of given size, Reverse Level Order Traversal, Reverse words in a given string, Right View of Binary Tree, Root to leaf path sum, Samsung, Samsung 6 month Internship Interview, Samsung Practice Problems, SAP Labs, SAP Labs Interview (Off Campus for Associate Developer), SAP Labs Practice Problems, Sapient | campus selections for Associate Software Development Engineer I, School Programming, Search in a matrix, Search in a Rotated Array, Searching, Searching Algorithms, Second Largest, series, Set, Set to Array in Java, Skip to content, Software Engineering, Solve the Sudoku, Some rights reserved, Sort an array of 0s, Sorting, Sorting Algorithms, SQL, Stack, Step by Step Guide for Placement Preparation, STL, Strings, Students ▼, Subjective Questions, Subset Sum Problem, Suggest a Topic, TCS, TCS CodeVita 2018 Interview Experience, TCS Ninja Interview Experience and Interview Questions, TCS-interview-experience, Technical Scripter, Testimonials, Theory of Computation, Top 10 algorithms in Interview Questions, Top Topics, Topic-wise, Topicwise ►, Tree, Tree based DS ►, Tuple, UGC NET CS Paper II, UGC NET CS Paper III, UGC NET Papers, UGC-NET, Video Tutorials, Videos, VMware Interview Experience | Set 13 (On-Campus): Rnd_developer, Web Technologies, Web Technology, What’s Difference?, Word Boggle, Write an Article, Write Interview Experience, Write your Interview Experience, Zomato Interview Experience, ZS Associates for Software Engineer

Cohesity internship interview

Leave a Comment


Round 1:
The first round was an online round held on Hackerearth. It had 2 questions of easy-medium level.
Easliy solvable with decent coding skills.

Round 2:
This was a Zoom online interview round lasting for about 45 mins. The interviewer went through my resume and asked me to describe my projects.
Tip : Know about each word in your resume and each word you speak in detail.

He then gave me 2 algorithmic problems:

1st problem : Find the longest palindromic substring in the given string. I gave him the standard DP approach of O(n^2) time and space complexity. He asked me to improve my space complexity. I told him the idea, but was asked to write the code the O(n2) solution itself.
Simple approach
Optimized approach
2nd problem : Given x and y, find the numbers between x and y which do not have repetitive digits in them.
https://www.geeksforgeeks.org/total-numbers-no-repeated-digits-range/

Round 3:
This also was a Zoom online interview round lasting for about 30 mins with a different person. I introduced myself and was asked the following question –
Consider all 3 letter words in a dictionary. Given a source and destination word, and that the cost of changing a letter in a word at a time is 1, find the minimum cost to reach destination from source by changing only one letter at a time.
https://www.geeksforgeeks.org/word-ladder-length-of-shortest-chain-to-reach-a-target-word/
He then asked me questions about my projects, past internship, DBMS and OS.

Got the offer 🙂


If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to [email protected]. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Article Tags :

Please write to us at [email protected] to report any issue with the above content.


Post navigation









Source link

Filed Under: c programming Tagged With: •   Dynamic Programming, 0 - 1 Knapsack Problem, 1s and 2s, About Us, Add two numbers represented by linked lists, Adobe, Adobe Practice Problems, Advanced Data Structure, Advanced Topics, Algo ▼, Algorithm Paradigms ►, Algorithms, All Algorithms, All Data Structures, Amazon, Amazon Practice Problems, Analysis of Algorithms, Aptitude, Arcesium Interview Experience 2018 ( Intern, Arista Networks Internship (On campus), Array, Arrays, Backtracking, BFS, BFS Traversal, Binary Search, Binary Search Tree, Binary Tree, Bit Algorithms, Bit Magic, Branch & Bound, BuyHatke interview experience (On-campus for 6 months internship), C, C++ Quiz, Campus Ambassador Program, Careers, Check for Balanced Tree, Check if a number is Bleak, Check if a number is power of another number, Cohesity, Company Prep, Company-wise, Competitive Programming, Compiler Design, Computer Graphics, Computer Networks, Computer Organization, Computer Organization & Architecture, Connect Nodes at Same Level, Consecutive 1's not allowed, Contact Us, Contests, contribute.geeksforgeeks.org, Core Subjects ►, Courses, CPP Functions, CS Subjects, CS Subjects ▼, CS Subjectwise ►, D E Shaw, Data Structures, DBMS, Design Patterns, Detect a negative cycle., DFS, Dictionary, Digital Electronics, Directi, Directi Practce Problems, Divide and Conquer, DS ▼, Egg Dropping Puzzle, Engg. Mathematics, Experienced Interviews, Find Nth root of M, Find the number of islands, Finding middle element in a linked list, Flattening a Linked List, Flipkart, Flipkart Practice Problems, Game Theory, GATE ▼, GATE 2019, GATE CS Corner, GATE CS Notes, GATE Notes, GATE Official Papers, GBlog, Geek of the Month, Geek on the Top, Geeks Classes, Geometric Algorithms, Goldman Sachs, Graph, Graph Algorithms, Greedy Algorithms, Hash, Hashing, Heap, HeapSort, How to begin with Competitive Programming?, How to prepare for ACM-ICPC?, HTML & XML, https://www.geeksforgeeks.org/total-numbers-no-repeated-digits-range/, https://www.geeksforgeeks.org/word-ladder-length-of-shortest-chain-to-reach-a-target-word/, ide.geeksforgeeks.org, Implement a stack with push(), Implement Queue using Linked List, Implement Stack using Queues, Insertion Sort, Internship, Internship Interview Experiences Company-Wise, Internship Interviews, Internships, Interview ▼, Interview Experiences, Inversion of array, Is Binary Number Multiple of 3, ISRO, ISRO CS Exam, Java, Java Collections, Java-Functions, Java.lang package, Java.util Package, JavaScript, Jumping Numebrs, K distance from root, k largest elements, Kadane's Algorithm, Key Pair, Languages, Languages ►, Languages ▼, Last Minute Notes, Left View of Binary Tree, Level Order traversal, Linked List, LinkedList, Login, Longest Increasing Subsequence, Longest Palindromic Subsequence, Longest Repeated Subsequence, Machine Learning, Mathematical, Mathematical Algorithms, Matrix, Max Sum without Adjacents, Maximum of all subarrays of size k, Maximum Width of Tree, MergeSort, Microland interview experience (on-campus internship + FTE), Microprocessor, Microsoft, Microsoft Interview Experience (For Internship), Microsoft Interview Experience (Internship 2018), Microsoft Practice Problems, Mirror Tree, More Company Interview Experiences, More Company-wise Practice Problems, Multiple Choice Quizzes, Must Do Coding Questions Company-wise, Must Do Coding Questions Topic-wise, Next greater number set digits, Non Repeating Character, Number Theory, Ola Cabs, Ola Cabs Practice Problems, On-Campus, Operating Systems, Optimized approach, Oracle, Oracle Practice Problems, Pattern Searching, Paytm, Paytm Practice Problems, Permutations of a given string, PHP, PHP-function, Placement Course, pop() and min() in O(1) time, Possible words from Phone digits, Practice Company Questions, Privacy Policy, Program Output, Project, Puzzles, Python, Python List, QA - Placement Quizzes, Qualcomm, Queue, QuickSort, Quizzes ▼, Randomized Algorithms, Remove duplicate element from sorted Linked List, Remove every k'th node, Remove Spaces from string, Reverse a Linked List in groups of given size, Reverse Level Order Traversal, Reverse words in a given string, Right View of Binary Tree, Root to leaf path sum, Samsung, Samsung Practice Problems, SAP Labs, SAP Labs Practice Problems, School Programming, Search in a matrix, Search in a Rotated Array, Searching, Searching Algorithms, Second Largest, series, Set, Set to Array in Java, Simple approach, Skip to content, Software Engineering, Solve the Sudoku, Some rights reserved, Sort an array of 0s, Sorting, Sorting Algorithms, SQL, Stack, Step by Step Guide for Placement Preparation, STL, Strings, Students ▼, Subjective Questions, Subset Sum Problem, Sudo Placement 2, Suggest a Topic, Technical Scripter, Testimonials, Theory of Computation, Top 10 Algorithms and Data Structures for Competitive Programming, Top 10 algorithms in Interview Questions, Top Topics, Topic-wise, Topicwise ►, Tree, Tree based DS ►, Tuple, Uber Interview Experience (On Campus for Internship 2018-19), UGC NET CS Paper II, UGC NET CS Paper III, UGC NET Papers, UGC-NET, UnitedHealth group Optum Internship Experience, Video Tutorials, Videos, VMware On-Campus for Internship, Web Technologies, Web Technology, What’s Difference?, Word Boggle, Write an Article, Write Interview Experience, Write your Interview Experience

Primary Sidebar

Recent Posts

  • Surveying Questions and Answers – Topographic Survey
  • 5 Women Programmers Who Changed The World!
  • Wwe network subscribers reached 2.1 million
  • Surveying Questions and Answers – City and Township Surveying
  • Qualcomm Interview Experience ( On-Campus Drive)
  • Privacy Policy
  • About
  • Contact US

© 2019 ProProgramming
 Privacy Policy About Contact Us