Lab3003
  • FacultyAlgorithmChallenge
  • README
  • Question Bank
  • Python Documentation
    • BetterMap
    • Board
    • Card
    • Circle
    • Deck
    • README.md
    • Guide For Bookmarklet
    • Hand
    • HashMap
    • Hist
    • Kangaroo
    • LinearMap
    • Markov
    • Point
    • PokerDeck
    • PokerHand
    • Rectangle
    • State
    • Test
    • ThinkPython
    • ThinkPython2
    • Time
    • Think Python
    • thinkpython
  • Files
  • Image Files
  • lab
    • InsertSortTDD
    • countingBits
    • cs3003mergeSortLectureGuideLine
    • index_min
    • insort
    • One-line factorial function in Python
  • Manual for Python Lab
    • COURSE OBJECTIVES
    • 1_timelines
    • FDPNotes
    • PC-2_Python
    • lab1-kgashok.py
    • Lab 10 :Matrix Multiplication
    • Lab 11: Programs that take command line arguments (word count)
    • Lab 11: Programs that take command line arguments
    • Lab 12: Compute the most frequently used words from the text file
    • Lab 12: Find the most frequent words in a text read from a file
    • Lab 12a: File content sorter
    • Lab 2: Find the square root of a number (Newton’s method)
    • Lab 3: Compute power of a number (Exponentiation)
    • Lab 3: Exponentiation (power of a number)
    • lab4-binaraysearch-anvar.py
    • Solution for Binary Search
    • lab4-joelanandraj-binarysearch.py
    • Lab 4: Linear and Binary Search
    • lab4-lin-anvar.py
    • Linear Searcher
    • Lab 5 : find n prime numbers
    • lab6-kgashok.py
    • lab7-kgashok.py
    • lab8-kgashok.py
    • Lab 8: Selection and Insertion sort using Python
    • Merge Sort
    • Quick Sort
    • labSheet
    • pc0
    • sortPythonic
    • Sorting
  • misc
    • Bookmarklets
    • Guide For Bookmarklet
    • pythonResources
    • FDP for Python
    • Agenda for Workshop
      • Agenda
  • notes
    • Problem Set
    • InsertSortTDD
    • MergeSort
    • cs3003-unit1-notes
    • cs3003-unit3
    • cs3003-unit4-examples
    • Unit 4 Lists, Tuples and Dictionaries
    • cs3003insertsortLectureGuide
    • cs3003mergeSortLectureGuideLine
    • Designing and Delivering Effective Lectures
    • histogram.py
    • selectSortLectureGuide
  • Sandbox to try ThinkPy2 code
    • Code from ThinkPython Github repository
  • Important Topics
    • 3003-syllabus
    • GE8161 PROBLEM SOLVING AND PYTHON PROGRAMMING LABORATORY L T P C
    • Unit II Version 2
    • Unit IV material
    • UNIT III CONTROL FLOW, FUNCTIONS
    • Unit 1 Algorithm Problem Solving
    • Unit_V_Notes
    • UpdatedSyllabus
    • glossary
    • glossaryGeneration.py
    • importantTopics-kgashok
    • memCSV
    • Tower of Hanoi
    • Notes for Unit 2 - Illustrative programs
    • unit5-updated_notes
    • unit_1_notes
    • Unit 3 Control Flow Version 1
    • unit 3
      • UNIT III CONTROL FLOW, FUNCTIONS
    • unit_i_img
Powered by GitBook
On this page
  • Links
  • FizzBuzz
  • 2nd maximum value in an array
  • Remove Duplicates
  • Reverse Dictionary
  • Tile Solver
  • Bracket Validator
  • Sorting
  • Efficient Fibonacci Series
  • Maximum Subarray sum (TDD)
  • Tree Traversal
  • Graph Traversal
  • Dynamic Programming
  1. notes

Problem Set

PreviousnotesNextInsertSortTDD

Last updated 3 years ago

What is an ideal problem set? Especially for someone who is learning Python as a first language? What set of problems will assess fundamental knowledge of computer science as well?

Links

  • http://j.mp/pc2PythonHTML and http://bit.ly/pc2doc

  • http://j.mp/bigIdeasInProgramming

  • http://bit.ly/pythonPathwaysKITE

FizzBuzz

2nd maximum value in an array

  • http://j.mp/getMaxCC

Remove Duplicates

Reverse Dictionary

http://j.mp/reverseDictionary

Tile Solver

  • http://j.mp/tileSolverCC

Bracket Validator

Sorting

  • Merging Lists

    • http://j.mp/unionListCC

  • SelectSort implementation

  • How to maintain a list of addresses in alphabetical order (best strategy)

Efficient Fibonacci Series

Maximum Subarray sum (TDD)

  • equivalent of Python for http://bit.ly/maxSubArraySumCC

Tree Traversal

  • breadth first, depth first - which is better, and when?

Graph Traversal

  • Travelling Salesman problem, etc

Dynamic Programming

http://j.mp/ladderCD

http://j.mp/programmingProblemSetForSoftwareEngineers