Skip to content

GitLab

  • Menu
Projects Groups Snippets
  • Help
    • Help
    • Support
    • Community forum
    • Submit feedback
    • Contribute to GitLab
  • Sign in
  • CS-210 Functional programming 2021 CS-210 Functional programming 2021
  • Project information
    • Project information
    • Activity
    • Labels
    • Members
  • Repository
    • Repository
    • Files
    • Commits
    • Branches
    • Tags
    • Contributors
    • Graph
    • Compare
  • Issues 9
    • Issues 9
    • List
    • Boards
    • Service Desk
    • Milestones
  • Merge requests 1
    • Merge requests 1
  • Deployments
    • Deployments
    • Releases
  • Monitor
    • Monitor
    • Metrics
    • Incidents
  • Packages & Registries
    • Packages & Registries
    • Package Registry
    • Infrastructure Registry
  • Analytics
    • Analytics
    • Value stream
    • Repository
  • Activity
  • Graph
  • Create a new issue
  • Commits
  • Issue Boards
Collapse sidebar
  • lamp
  • CS-210 Functional programming 2021CS-210 Functional programming 2021
  • Issues
  • #97

Closed
Open
Created Dec 18, 2021 by Zied Masmoudi@zmasmoud

Final Exam 2019

Hello, In exercise 1 of final exam of 2019, we don't need to reverse the obtained list at the end no? because with the cons we already get right order. x1 :: rec(xs, seen) gives x1 :: x2 :: rec(xxs, seen) for example right? and it will be in the correct orderimage

Assignee
Assign to
Time tracking