Skip to content
/ FAST-KHI-Semester-3 Public

FAST NUCES Karachi - BSCS Third Semester Repository | Access notes, assignments, past papers, & more. For queries or suggestions, contact k232001@nu.edu.pk.

35 stars 6 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

MuxammilSidd/FAST-KHI-Semester-3

BranchesTags

Repository files navigation

FAST-KHI-Semester-3

Welcome FASTians! Here you can find relevant material for your third semester (BSCS) at FAST NUCES Karachi. A little effort by my side to boost your academic journey. ✨ Don't forget to star this repo if you find it useful! ⭐

For any queries/improvement feel free to contact me on k232001@nu.edu.pk
For contributions kindly look here.

🔗 Links to other semester repositories

🔗 Guide to get you started

🔗 How to crack your third semester at FAST NUCES!

# Course Code Short Name Type Credit Hours
1 CS2004 DS Data Structures & Algorithms Core 3+1
2 CS2005 COAL COAL Core 3+1
3 MT2003 DISC Discrete Structures Core 3
4 MT2004 LA Linear Algebra Core 3
5 SS2010 POE Principles of Economics Elective 3
SS2012 FOA Fundamentals of Accounting Elective 3
SS2011 FOM Fundamentals of Management Elective 3
Total Credit Hours: 17

🔗 Useful Websites you should know!

  • Theresanaiforthat There's an AI for That - Discover the newest & best AI tools with free alternaatives!
  • TinyWow Favicon TinyWow Text - Hundreds of free online tools to get you going on that assignment!
  • Quizlet - Expert textbook solutions to tally from!
  • GradeSaver - Literally a grade-saver after Quizlet turned paid!
  • PDFdrive - Thousands of eBooks available to download for free!
  • Buildspace.so Buildspace.so - Find ideas and inspiration for your next project!
  • Keybr Keybr - Improve your typing speed and take it to the next level!
  • learncpp.com LearnCpp.com - A free website devoted to teaching you how to program in modern C++!

🔗 Useful tools you should know!

  • SolidPoint Solidpoint.ai - An online free YouTube Summarizer that automatically generates concise summaries of any video, saving you valuable time and energy!
  • Chatpdf Chatpdf.com - Chat with your PDF documents — Extract information or answer questions from large PDF files like manuals, essays, books.!

🔗 Useful repositories you should know!

🔗 Time Management

pata chale toh mujhe bhi bata dena pls

🔗 Course wise guide

📌 Data Structures & Algorithms:

Mids are tricky, Final is difficult. Majority of students often tend to solve a question beyond the requirements mainly because they didn't read it carefully which results in losing marks. An example would be, creating a stack using linkedlist when it was required to be made with an array. Before the final exams, all teachers provide conflicting syllabus and there is a lot of confusion on which topics to cover, so it's best to prioritize the latest syllabus, and have a good grip on complex topics such as trees, graphs, hashing. You can get 'A' in DSA Lab easily, having good practice and being able to explain your code effectively will help. Some lab instructors are pretty chill too. This was only an overview on the 'examination' perspective. DSA is the beginning of your actual coding journey, where you will learn the effectiveness and optimization of your code. Unfortunately, you'll have to clear any misconception that 'the university will teach you DSA'. It will be entirely your own effort - and Youtube. DSA determines the caliber of a programmer, if someone's DSA is weak they'll struggle to develop effective code. The best start would be Striver's DSA Playlist, practice along with it. Start your Leetcode journey, the question sets there enhance your approach to solve problems. By the start of the semester, you should have Arrays, Linkedlists, Stacks, Queues, & Basic Sorting Algos on your fingertips, these topics make up Mid01 and most of Mid02.

🔗 Useful Youtube Playlists:

🔗 Projects:

  • Race Car Game Project - Console Based Data Structures Project in C++ (Fall'23) by Mohammad Shuja Uddin.

🔗 Resources:

🔗 Google Drives:

🔗 Full courses:

📌 Computer Organization & Assembly Language:

Remember PF? COAL is the same course, but now it's in Assembly language. You'll be taught the syntax, data types, loops, arrays, functions, recursion, etc. COAL exams are somewhat lengthy, and there is a lot of ambiguity in questions. You'll ace them by explaining your code (in comments) and mentioning the assumptions you take to solve the question. Studying COAL with Youtube is a little problematic because our curriculum conflicts with the videos on Youtube. The best advice I can give, as you'll be familiar with C and C++, picture in your mind how you would solve a problem using them. Then extract that logic and apply it using Assembly, the thing to be aware of is that in Assembly language you can only achieve one instruction in one line. This would mean you have to break that logic (that you'd implement using C++) step-wise. During exams, stay focused and recall this advice. I managed to get 44/50 in the final by this approach Alhamdullilah, so yes - 4 GPA in COAL is POSSIBLE. I have noticed a lot of students struggling with the lab, simply because they hadn't been completing their lab assignments on their own, and would begin their preparation one day prior to the exam. It is really hectic to debug the code, and due to the shortage of time it becomes frustrating as it won't run. You just have to make sure to fulfil the maximum requirements, and attempt everything - at your best. This doesn't mean a good grade in the lab is a myth, you can get 3.67 and also 4 gpa with effort and practice!

🔗 Useful Youtube Playlists:

🔗 Projects:

🔗 Resources:

🔗 Google Drives:

📌 Discrete Structures:

An interesting course with a great potential, but a dry and non-interactive faculty. Concepts are a little tricky to acquire, but once you get the hang of them, you have to retain them with adequate practice. Some topics will also mix up with DSA, such as graphs, trees, hashing, etc. Exams are not that difficult. but they are lengthy. We even had to complete assignments of 40,50, & 60 questions. TOA and Discrete are one of those courses that ChatGpt can't answer correctly most of the time. Fortunately there is a legendary playlist by Kimberly Brehm that helped me a lot and the concepts provided became crystal clear. Discrete Math I & Discrete Math II. Make sure to cover this according to the course outline. Some topics might have been left out by the channel.

🔗 Useful Youtube Playlists:

🔗 Resources:

📌 Linear Algebra:

The entire course revolves around matrices. The major drawback in attempting questions is that one minor mistake in an element of the matrix can cause the entire result to be wrong, and working of 1-2 pages can become useless if not carefully examined. This course depends more on the leniency of the teacher, as some teachers tend to mark based on the correctness of the final answers and do not care about the process being correct, or cases of 'error-carried-forward'. Hopefully, you will get an instructor that marks based on the efforts and correctness of the process In Sha Allah. Practice requires a lot of time and patience, don't be demotivated by getting the wrong answers - the mistakes you make during practice will help you to be mindful during the exam and improve your speed + efficiency to solve within a limited timeframe. 'Gaussian Elimination' is the foundational topic that is used throughout the course, having a strong base will benefit you. There aren't a lot of adequate resources on Youtube, so you have to rely more on the book for concepts and practice.

🔗 Useful Youtube Playlists:

🔗 Resources:

🔗 Google Drives:

📌 Principles of Economics:

POE is considered the most demanding among the three electives. It combines theories with numericals, but unlike FOA, each numerical comes with its own formula and procedure, making the subject more time-consuming and challenging. Many students find the need to memorize both formulas and theories tedious, especially since the application differs from one problem to another. The checking is generally lenient, and the assignment workload is manageable, but the overall subject still required a greater investment of time and effort compared to FOM and FOA. For this reason, POE is not usually recommended as an elective unless you are particularly interested in Economics or are willing to commit to a heavier workload.

🔗 Useful Youtube Playlists:

🔗 Resources:

📌 Fundamentals of Accounting:

FOA on the other hand, is more technical in nature. It revolves around fixed formulas and structured problem-solving methods, where answers must strictly follow the procedures taught in class. The checking in FOA is comparatively stricter, as accuracy in applying the correct tables and methods is emphasized. Students are also given assignments that involve the use of Excel, adding a practical element to the coursework. Those who have prior exposure to accounting concepts generally perform much better, finding the subject easier to grasp. FOA is a solid choice if you cannot manage to enroll in FOM, especially if you already have some background in accounting.

📌 Fundamentals of Management:

FOM can be widely considered the easiest and most manageable elective. The course is largely theoretical, relying on slide-reading, class presentations, interactive discussions, and in-class activities rather than heavy assignments or complex problem-solving. The workload is light, and students often find it easy to balance with other courses. Faculty is lenient and understanding toward students, which makes the experience even smoother. Overall, this course is the best elective option if you are looking for minimal workload and a straightforward academic experience.

Can't find a course?

Check out other semester's repositories here!

🔗 Additional Resources

Feeling this repository isn't enough? 😩 Here are all links to repositories and drives I found: ⬇️

📌 Github Repositories:

📌 Google Drives:

Note: All relevant material to FAST NU KHI Campus has been added already from these archives.

🔗 Mistakes I made in my 3rd-Semester!

Here is a bunch of blunders I wish I hadn't made in my third semester at FAST KHI. (Hopefully not again)(that's what I said since two semesters)

About

FAST NUCES Karachi - BSCS Third Semester Repository | Access notes, assignments, past papers, & more. For queries or suggestions, contact k232001@nu.edu.pk.

Topics

data-structures discrete-structures nuces semester-3 computer-organization-and-assembly-language

Resources

Readme

Contributing

Contributing
Activity

Stars

35 stars

Watchers

2 watching

Forks

6 forks
Report repository

Releases

No releases published

Packages

No packages published

Contributors 4

  •  
  •  
  •  
  •  

Languages